Related papers: Structure vs. Randomness for Bilinear Maps

Structural and computational understanding of tensors is the driving force behind faster matrix multiplication algorithms, the unraveling of quantum entanglement, and the breakthrough on the cap set problem. Strassen's asymptotic spectra…

The "topological Tverberg conjecture" by B\'ar\'any, Shlosman and Sz\H{u}cs (1981) states that any continuous map of a simplex of dimension $(r-1)(d+1)$ to $\mathbb{R}^d$ maps points from $r$ disjoint faces of the simplex to the same point…

We investigate the K-theory of twisted higher-rank-graph algebras by adapting parts of Elliott's computation of the K-theory of the rotation algebras. We show that each 2-cocycle on a higher-rank graph taking values in an abelian group…

The hypergraph regularity lemma -- the extension of Szemer\'edi's graph regularity lemma to the setting of $k$-uniform hypergraphs -- is one of the most celebrated combinatorial results obtained in the past decade. By now there are several…

We propose a new numerical algorithm for computing the tensor rank decomposition or canonical polyadic decomposition of higher-order tensors subject to a rank and genericity constraint. Reformulating this computational problem as a system…

Quivers (directed graphs) and species (a generalization of quivers) and their representations play a key role in many areas of mathematics including combinatorics, geometry, and algebra. Their importance is especially apparent in their…

We discuss conjectures on Hamiltonicity in cubic graphs (Tait, Barnette, Tutte), on the dichromatic number of planar oriented graphs (Neumann-Lara), and on even graphs in digraphs whose contraction is strongly connected (Hochst\"attler). We…

We extend the usual process-theoretic view on locality and causality in subsystems (based on the tensor product case) to general quantum systems (i.e.\ possibly non-factor, finite-dimensional von Neumann algebras). To do so, we introduce a…

This article contains a complete proof of Gabrielov's rank Theorem, a fundamental result in the study of analytic map germs. Inspired by the works of Gabrielov and Tougeron, we develop formal-geometric techniques which clarify the difficult…

Strassen's asymptotic rank conjecture [Progr. Math. 120 (1994)] claims a strong submultiplicative upper bound on the rank of a three-tensor obtained as an iterated Kronecker product of a constant-size base tensor. The conjecture, if true,…

Let $P$ denote the $3$-dimensional paraboloid over a finite field of odd characteristic in which $-1$ is not a square. We show that the Fourier extension operator associated with $P$ maps $L^2$ to $L^{r}$ for $r > \frac{32}{9} \approx…

We study border varieties of sums of powers ($\underline{\mathrm{VSP}}$'s for short), recently introduced by Buczy\'nska and Buczy\'nski, parameterizing border rank decompositions of a point (e.g. of a tensor or a homogeneous polynomial)…

Semigraphoids are combinatorial structures that arise in statistical learning theory. They are equivalent to convex rank tests and to polyhedral fans that coarsen the reflection arrangement of the symmetric group. We resolve two problems on…

There are close relations between tripartite tensors with bounded geometric ranks and linear determinantal varieties with bounded codimensions. We study linear determinantal varieties with bounded codimensions, and prove upper bounds of the…

Multilinear varieties, defined as the sets of rational points of varieties cut out by multilinear functions, were first introduced and studied by Gowers and Mili\'{c}evi\'{c}[Proc. Edinb. Math. Soc., 2021] for finite $\mathbb{K}$. In this…

Luo, Tian and Wu conjectured in 2022 that for any tree $T$ with bipartition $X$ and $Y$, every $k$-connected bipartite graph $G$ with $\delta(G) \geq k + t$, where $t = \max\{|X|,|Y |\}$, contains a subtree $T' \cong T$ such that $G-V(T')$…

This manuscript recounts some of the author's contributions to algebraic and enumerative combinatorics. We have focused on two types of generalizations of bipartite maps, which are bipartite graphs embedded on surfaces. Maps are known to…

In a nutshell, we show that polynomials and nested polytopes are topological, algebraic and algorithmically equivalent. Given two polytops $A\subseteq B$ and a number $k$, the Nested Polytope Problem (NPP) asks, if there exists a polytope…

We show that, if A is a separable simple unital C*-algebra which absorbs the Jiang-Su algebra Z tensorially and which has real rank zero and finite decomposition rank, then A is tracially AF in the sense of Lin, without any restriction on…

In recent work of Monthoux and Pines~[1] and also in Rice et {\sl al.}'s work~[2], quasi-averages like $\langle c_{k \uparrow} c_{- k \downarrow} \rangle$ were considered even in the case of a dimension less or equal two. But it is well…