Related papers: Structure vs. Randomness for Bilinear Maps

Let F : W --> V be a dominant rational map between quasi-projective varieties of the same dimension. We give two proofs that h_V(F(P)) >> h_W(P) for all points P in a nonempty Zariski open subset of W. For dominant rational maps F : P^n -->…

In 2003, Cohn and Umans described a framework for proving upper bounds on the exponent $\omega$ of matrix multiplication by reducing matrix multiplication to group algebra multiplication, and in 2005 Cohn, Kleinberg, Szegedy, and Umans…

An ordinary plane of a finite set of points in real 3-space with no three collinear is a plane intersecting the set in exactly three points. We prove a structure theorem for sets of points spanning few ordinary planes. Our proof relies on…

Tensor type data are becoming important recently in various application fields. We determine a rank of a tensor T so that A+T is diagonalizable for a given 3-tensor A with 2 slices over the complex and real number field.

In Grochow and Qiao (SIAM J. Comput., 2021), the complexity class Tensor Isomorphism (TI) was introduced and isomorphism problems for groups, algebras, and polynomials were shown to be TI-complete. In this paper, we study average-case…

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…

Topological drawings are natural representations of graphs in the plane, where vertices are represented by points, and edges by curves connecting the points. Topological drawings of complete graphs and of complete bipartite graphs have been…

A novel regularizer of the PARAFAC decomposition factors capturing the tensor's rank is proposed in this paper, as the key enabler for completion of three-way data arrays with missing entries. Set in a Bayesian framework, the tensor…

In this note, given a pair $(\mathfrak{g}, \lambda)$, where $\mathfrak{g}$ is a complex semisimple Lie algebra and $\lambda \in \mathfrak{h}^*$ is a dominant integral weight of $\mathfrak{g}$, where $\mathfrak{h} \subset \mathfrak{g}$ is…

Twin-width is a graph parameter introduced in the context of first-order model checking, and has since become a central parameter in algorithmic graph theory. While many algorithmic problems become easier on arbitrary classes of bounded…

Chevyrev and Galbraith recently devised an algorithm which inputs a maximal order of the quaternion algebra ramified at one prime and infinity and constructs a supersingular elliptic curve whose endomorphism ring is precisely this maximal…

String diagrams turn algebraic equations into topological moves that have recurring shapes, involving the sliding of one diagram past another. We individuate, at the root of this fact, the dual nature of polygraphs as presentations of…

We take the first steps to develop Conley-Zehnder Theory, as conjectured by Arnold, in the world of probability. As far as we know, this paper provides the first probabilistic theorems about the density of fixed points of symplectic twist…

To every poset P, Stanley (1986) associated two polytopes, the order polytope and the chain polytope, whose geometric properties reflect the combinatorial qualities of P. This construction allows for deep insights into combinatorics by way…

We present unified bijections for maps on the torus with control on the face-degrees and essential girth (girth of the periodic planar representation). A first step is to show that for d>=3 every toroidal d-angulation of essential girth d…

We prove a complexity dichotomy theorem for a class of Holant problems on planar 3-regular bipartite graphs. The complexity dichotomy states that for every weighted constraint function $f$ defining the problem (the weights can even be…

Hurwitz numbers count branched covers of the sphere and have been of interest in various fields of mathematics. Motivated by the Matching-Jack conjecture of Goulden and Jackson, Chapuy and Do\l\k{e}ga recently introduced a notion of…

The cut polytope of a graph arises in many fields. Although much is known about facets of the cut polytope of the complete graph, very little is known for general graphs. The study of Bell inequalities in quantum information science…

We observe that a recent theorem of Sato, Toms-White-Winter and Kirchberg-Rordam also holds for certain nonunital C*-algebras. Namely, we show that an algebraically simple, separable, nuclear, nonelementary C*-algebra with strict…

The pentagram map was introduced by R. Schwartz in 1992 for convex planar polygons. Recently, V. Ovsienko, R. Schwartz, and S. Tabachnikov proved Liouville integrability of the pentagram map for generic monodromies by providing a Poisson…