相关论文: Slice rank and partition rank of the determinant

Following the breakthrough of Croot, Lev, and Pach, Tao introduced a symmetrized version of their argument, which is now known as the slice rank method. In this paper, we introduce a more general version of the slice rank of a tensor, which…

A slice decomposition is an expression of a homogeneous polynomial as a sum of forms with a linear factor. A strength decomposition is an expression of a homogeneous polynomial as a sum of reducible forms. The slice rank and strength of a…

This paper investigates defining equations for secant varieties of the variety of reducible polynomials, which geometrically encode the notions of strength and slice rank of homogeneous polynomials. We present three main results. First, we…

In this paper we study partitions whose successive ranks belong to a given set. We enumerate such partitions while keeping track of the number of parts, the largest part, the side of the Durfee square, and the height of the Durfee…

The orthogonal decomposition factorizes a tensor into a sum of an orthogonal list of rankone tensors. We present several properties of orthogonal rank. We find that a subtensor may have a larger orthogonal rank than the whole tensor and…

Andrews, Lewis and Lovejoy introduced the partition function $PD(n)$ as the number of partitions of $n$ with designated summands. In a recent work, Lin studied a partition function $PD_{t}(n)$ which counts the number of tagged parts over…

In this note, we present an elementary proof of the fact that the slice rank of a trilinear form over a finite field is bounded above by a linear expression in the analytic rank. The existing proofs by Adiprasito-Kazhdan-Ziegler and…

We introduce a universal approach for applying the partition rank method, an extension of Tao's slice rank polynomial method, to tensors that are not diagonal. This is accomplished by generalizing Naslund's distinctness indicator to what we…

An important conjecture in additive combinatorics, number theory, and algebraic geometry posits that the partition rank and analytic rank of tensors are equal up to a constant, over any finite field. We prove the conjecture up to a…

We prove an explicit formula to count the partitions of $n$ whose product of the summands is at most $n$. In the process, we also deduce a result to count the multiplicative partitions of $n$.

Kruskal's theorem states that a sum of product tensors constitutes a unique tensor rank decomposition if the so-called k-ranks of the product tensors are large. We prove a "splitting theorem" for sets of product tensors, in which the k-rank…

We prove that the partition rank and the analytic rank of tensors are equal up to a constant, over finite fields of any characteristic and any large enough cardinality depending on the analytic rank. Moreover, we show that a plausible…

We show that the shifted rank, or srank, of any partition $\lambda$ with distinct parts equals the lowest degree of the terms appearing in the expansion of Schur's $Q_{\lambda}$ function in terms of power sum symmetric functions. This gives…

The shrinking rank method is a variation of slice sampling that is efficient at sampling from multivariate distributions with highly correlated parameters. It requires that the gradient of the log-density be computable. At each individual…

Cayley's first hyperdeterminant is a straightforward generalization of determinants for tensors. We prove that nonzero hyperdeterminants imply lower bounds on some types of tensor ranks. This result applies to the slice rank introduced by…

We introduce an algebraic model, based on the determinantal expansion of the product of two matrices, to test combinatorial reductions of set functions. Each term of the determinantal expansion is deformed through a monomial factor in d…

The slice-rank method, introduced by Tao as a symmetrized version of the polynomial method of Croot, Lev and Pach and Ellenberg and Gijswijt, has proved to be a useful tool in a variety of combinatorial problems. Explicit tensors have been…

Let $\mathcal{R}$ be the Grothendieck ring of complex smooth finite-length representations of the sequence of p-adic groups $\{GL_n(F)\}_{n=0}^\infty$, with multiplication defined through parabolic induction. We study the problem of the…

There are many notions of rank in multilinear algebra: tensor rank, partition rank, slice rank, and strength (or Schmidt rank) are a few examples. Typically the rank $\le r$ locus is not Zariski closed, and understanding the closure (the…

Motivated by a question of Defant and Propp (2020) regarding the connection between the degrees of noninvertibility of functions and those of their iterates, we address the combinatorial optimization problem of minimizing the sum of squares…