Related papers: Progress on the symmetric Strassen conjecture

Let $\mathfrak g$ be a simple Lie algebra with Cartan subalgebra $\mathfrak h$ and Weyl group $W$. We build up a graded map $(\mathcal H\otimes \bigwedge\mathfrak h\otimes \mathfrak h)^W\to (\bigwedge \mathfrak g\otimes \mathfrak…

A well-known conjecture of Vizing is that $\gamma(G \square H) \ge \gamma(G)\gamma(H)$ for any pair of graphs $G, H$, where $\gamma$ is the domination number and $G \square H$ is the Cartesian product of $G$ and $H$. Suen and Tarr,…

We fully describe the general form of a linear (or conjugate-linear) rank metric isometry on the Murray--von Neumann algebra associated with a II$_1$-factor. As an application, we establish Frobenius' theorem in the setting of…

Given a subfield $F$ of $\mathbb{C}$, we study the linear disjointess of the field $E$ generated by iterated exponentials of elements of $\overline{F}$, and the field $L$ generated by iterated logarithms, in the presence of Schanuel's…

We show the geometric syzygy conjecture in positive characteristic. Specifically, if C is a general smooth curve of genus g defined over an algebraically closed field of characteristic p, then all linear syzygy spaces are spanned by…

We study two conjectures in additive combinatorics. The first is the polynomial Freiman-Ruzsa conjecture, which relates to the structure of sets with small doubling. The second is the inverse Gowers conjecture for $U^3$, which relates to…

In this paper we announce a conjecture concerning enumeration of 2n x k n-times persymmetric matrices over F_2 by rank.

We prove that the Farrell-Jones isomorphism conjecture for non-connective algebraic K-theory for a discrete group G and a coefficient ring R holds true if G belongs to the class of groups acting on trees, under certain conditions on G (see…

The determinant of an anti-symmetric matrix $g$ is the square of its Pfaffian, which like the determinant is a polynomial in the entries of $g$. Studies of certain super conformal field theories (of class S) suggested a conjectural…

The paper reviews some axioms of additivity concerning ranking methods used for generalized tournaments with possible missing values and multiple comparisons. It is shown that one of the most natural properties, called consistency, has…

We investigate an extension of a lower bound on the Waring (cactus) rank of homogeneous forms due to Ranestad and Schreyer. We show that for particular classes of homogeneous forms, for which a generalization of this method applies, the…

In this paper we study the complex simultaneous Waring rank for collections of monomials. For general collections we provide a lower bound, whereas for special collections we provide a formula for the simultaneous Waring rank. Our approach…

We formulate a conjecture concerning spectral factorization of a class of trigonometric polynomials of two variables and prove it for special cases. Our method uses relations between the distribution of values of a polynomial of two…

Let $G_1, \dots, G_k$ be vector spaces over a finite field $\mathbb{F} = \mathbb{F}_q$ with a non-trivial additive character $\chi$. The analytic rank of a multilinear form $\alpha \colon G_1 \times \dots \times G_k \to \mathbb{F}$ is…

A Waring decomposition of a polynomial is an expression of the polynomial as a sum of powers of linear forms, where the number of summands is minimal possible. We prove that any Waring decomposition of a monomial is obtained from a complete…

An edge-weighted graph $G$, possibly with loops, is said to be antiferromagnetic if it has nonnegative weights and at most one positive eigenvalue, counting multiplicities. The number of graph homomorphisms from a graph $H$ to an…

The Heilmann-Lieb Theorem on (univariate) matching polynomials states that the polynomial $\sum_k m_k(G) y^k$ has only real nonpositive zeros, in which $m_k(G)$ is the number of $k$-edge matchings of a graph $G$. There is a stronger…

We give a uniform approximation of the characteristic function of the boundary of a centrally symmetric n-dimensional compact and convex set by homogeneous polynomials of even degree $d$ fulfilling $|g_d-1|\leq E/d^{1/2-\beta}$, for every…

The log-rank conjecture is one of the fundamental open problems in communication complexity. It speculates that the deterministic communication complexity of any two-party function is equal to the log of the rank of its associated matrix,…

In the paper we consider images of finite simple projective special linear and unitary groups under power words. In particular, we show that if $G\simeq \PSL_n^\varepsilon (q)$, then for every power words of type $x^M$ there exist constant…