相关论文: On the Chow-rank of the permanent

Motivated by the question of whether Chow polynomials of matroids have only real roots, this article revisits the known relationship between Eulerian polynomials and the Hilbert series of Chow rings of permutohedral varieties. This is done…

Evaluating the permanent of a matrix is a fundamental computation that emerges in many domains, including traditional fields like computational complexity theory, graph theory, many-body quantum theory and emerging disciplines like machine…

We show that the permanent of a matrix can be written as the expectation value of a function of random variables each with zero mean and unit variance. This result is used to show that Glynn's theorem and a simplified MacMahon theorem…

We propose a linear-time algorithm to compute low-rank Chow decompositions. Our algorithm can decompose concise symmetric 3-tensors in n variables of Chow rank n/3. The algorithm is pencil based, hence it relies on generalized eigenvalue…

We present an effective method for computing parametric primary decomposition via comprehensive Gr\"obner systems. In general, it is very difficult to compute a parametric primary decomposition of a given ideal in the polynomial ring with…

We study a graded algebra D=D(L,G) defined by a finite lattice L and a subset G in L, a so-called building set. This algebra is a generalization of the cohomology algebras of hyperplane arrangement compactifications found in work of De…

We introduce and develop the theory of UMEL-shellable posets. These are posets equipped with an edge-lexicographical labeling satisfying certain uniformity and monotonicity properties. This framework encompasses classical families of…

We propose a method to unify various stability results about symmetric ideals in polynomial rings by stratifying related derived categories. We execute this idea for chains of $GL_n$-equivariant modules over an infinite field $k$ of…

Given a sheaf on a projective space P^n we define a sequence of canonical and easily computable Chow complexes on the Grassmannians of planes in P^n, generalizing the Beilinson monad on P^n. If the sheaf has dimension k, then the Chow form…

We introduce a new concept of rank - relative rank associated to a filtered collection of polynomials. When the filtration is trivial our relative rank coincides with Schmidt rank (also called strength). We also introduce the notion of…

In what follows, we pose two general conjectures about decompositions of homogeneous polynomials as sums of powers. The first one (suggested by G. Ottaviani) deals with the generic k-rank of complex-valued forms of any degree divisible by k…

A foundational result in the theory of Lyndon words (words that are strictly earlier in lexicographic order than their cyclic permutations) is the Chen-Fox-Lyndon theorem which states that every word has a unique non-increasing…

We provide explicit combinatorial formulas for the Chow polynomial and for the augmented Chow polynomial of uniform matroids, thereby proving a conjecture by Ferroni. These formulas refine existing formulas by Hampe and by Eur, Huh, and…

The Chow variety of polynomials that decompose as a product of linear forms has been studied for more than 100 years. Brill, Gordon and others obtained set-theoretical equations for the Chow variety. In this article, I compute Brill's…

The permanent vs. determinant problem is one of the most important problems in theoretical computer science, and is the main target of geometric complexity theory proposed by Mulmuley and Sohoni. The current best lower bound for the…

We construct an explicit minimal strong Groebner basis of the ideal of vanishing polynomials in the polynomial ring over Z/m for m>=2. The proof is done in a purely combinatorial way. It is a remarkable fact that the constructed Groebner…

Following the methods used by Derksen-Weyman in \cite{DW11} and Chindris in \cite{Chi08}, we use quiver theory to represent the generalized Littlewood-Richardson coefficients for the branching rule for the diagonal embedding of $\gl(n)$ as…

We prove an analogue of James-Donkin row removal theorems for arbitrary diagrammatic Cherednik algebras. This is one of the first results concerning the (graded) decomposition numbers of these algebras over fields of arbitrary…

We provide physics-inspired derivations of a number of algorithms for computing the permanent of a matrix. In particular we formulate the computation of the permanent as a Grassmann integral that may be viewed as an interacting many-fermion…

Combinatorial formulas expressing cyclic rook polynomials and cyclic permanents of rectangular matrices in terms of expansions along rows are presented