Search arXivSearch

arXiv · 2608.07611

Two-Cut Coherence of Quintic Forms: Lifting Separations and Second-Derivative Completeness

Abstract

For a homogeneous polynomial f of degree d, the degree-k restricted strength C_k(f) is the least number of products needed to write f with factor degrees k and d-k. We introduce a two-cut coherence parameter C_{k,l}(f): the least r such that f = sum_{i,j=1}^{r} p_i m_{ij} q_j with deg p_i = k, deg m_{ij} = l-k, and deg q_j = d-l. This requires two degree interfaces to be realized by a single common factorization. We show it equals the minimum common endpoint width of a three-block compressed transfer network, and equivalently the minimum, over all tensor lifts of f through commutative multiplication, of the larger of the two tensor-train endpoint ranks. In particular it lower-bounds homogeneous ABP width. Our main result is an extraction-completeness theorem for quintics at cuts (1,3). Let D(f) be the largest polynomial slice rank C_1 of a second directional derivative of f, and let t = C_3(f). Over an algebraically closed field of characteristic zero, ceil(D(f)/3) <= Cbar_{1,3}(f) <= C_{1,3}(f) <= t*D(f) + 2t^2, where Cbar denotes border complexity. Hence when C_3 is bounded, ordinary and border two-cut coherence are equivalent up to constants to a one-cut obstruction exposed by a second derivative. We also prove a border-stable lifting separation. For coprime nonzero cubics A and B, the quintic L = abA + cdB has ordinary and border local values C_1 = C_3 = 2, while ceil(max{C_1(A), C_1(B)}/3) <= Cbar_{1,3}(L) <= C_1(A) + C_1(B). Taking A to be a Fermat cubic in n variables, for which we show C_1 = ceil(n/2), gives an unbounded gap between separately optimal local interfaces and a common interface, even in border complexity. This refutes any universal bound of the form C_{k,l} <= C_k + C_l.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Karthik Sheshadri. 2026-08-06. Two-Cut Coherence of Quintic Forms: Lifting Separations and Second-Derivative Completeness. https://arxiv.org/abs/2608.07611

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Counting Small Induced Subgraphs: Hardness of Symmetry-Based Properties

Jerrum and Meeks (TOCT, JCSS 2015) introduced the counting problems $\text{IndSub}(Φ)$ for fixed graph properties $Φ$: Given an input graph $G$ and $k\in\mathbb N$, count the $k$-vertex subsets $S \subseteq V(G)$ such that the induced subgraph $G[S]$ satisfies $Φ$. For recursively enumerable $Φ$, it is known that $\text{IndSub}(Φ)$ is either #W[1]-hard or fixed-parameter tractable. A direct classification depending on $Φ$ however still remains open. In particular, the status was open for the property of graphs without nontrivial automorphisms, also mentioned in a very recent survey on parameterized counting by Roth (Comput.~Sci.~Rev.~2026). This is a natural property that evades all currently known techniques for proving #W[1]-hardness, including a general toolkit based on Fourier analysis that was very recently introduced by Curticapean and Neuen (SODA~2025). In this paper, we show that counting induced $k$-vertex graphs without nontrivial automorphisms is #W[1]-hard by constructing ``clique scaffolds'', i.e., problem-specific restrictions of the property that enable a reduction from the $k$-clique problem. More generally, we show that for every finite group $Q$, counting $k$-vertex induced subgraphs with automorphism group $Q$ is #W[1]-hard.

cs.CC

Improved Algorithms for the Remote Point Problem

The Remote Point Problem (RPP) is an algorithmic problem that asks, given a linear subspace $L \subseteq \mathbb{F}^n$ of dimension $k$, to deterministically find a vector $v \in \mathbb{F}^n$ far in Hamming distance from $L$. This problem was introduced by Alon, Panigrahy and Yekhanin [APY09], motivated in part by the matrix rigidity approach for proving circuit lower bounds. An algorithm is said to achieve remoteness $d$ if it finds a vector $v$ whose Hamming distance from $L$ is at least $d$. We observe that over the rational numbers, the problem admits a deterministic polynomial-time algorithm that achieves optimal remoteness $n-k$. Over finite fields, we obtain a (modest) improvement of a result of Alon, Panigrahy and Yekhanin [APY09], and give an algorithm that achieves remoteness $Ω\left(\frac{n}{\max\{k, \log n\}} \log n\right)$.

cs.CC

Strong Selective and List-Decoding Direct Product Theorems for Quantum Query Complexity

Quantum strong direct-product theorems for specific functions have been known for nearly two decades. These have been extended to general results for function computation and state generation. The proofs of these results use a version of the multiplicative adversary method that does not naturally extend to relations. Standard strong direct-product theorems apply when algorithms must correctly answer every given question. Prior work extended them to equivalent threshold direct-product theorems, which require answers to all questions but only require that most answers are correct. We focus on two further generalizations. Strong selective direct-products apply to algorithms that adaptively choose, based on what they learn from queries, which questions from a large list to answer. This generalization is relational and useful for proving time-space tradeoffs. We prove a quantum strong selective direct-product theorem for all functions using a new multiplicative adversary formulation for relations that satisfies a strong selective direct product property while being strong enough to capture any query lower bound for functions proven by negative-weights adversaries. This was not previously known even without selectivity. The second generalization is list-decoding direct product problems introduced by Ben-David and Blais for classical randomized query complexity. These allow an algorithm to produce a large list of possible output vectors such that one of them is fully correct. They proved that such theorems hold for classical randomized complexity of all Boolean functions. We prove a quantum analogue of this theorem for all partial Boolean functions. We show that strong list-decoding direct-product theorems are implied by a special case of multiplicative adversaries which we show, via a new reduction, can be obtained from negative-weights adversaries for any Boolean-valued function.

cs.CC