Related papers: Structure vs. Randomness for Bilinear Maps
We investigate the algebra of a Hausdorff ample groupoid, introduced by Steinberg, over a commutative semiring S. In particular, we obtain a complete characterization of congruence-simpleness for such Steinberg algebras, extending the…
We introduce a subclass of recursive subhomogeneous algebras, in which each of the pullback maps is diagonal in a suitable sense. We define the notion of a diagonal map between two such algebras and show that every simple inductive limit of…
We prove that every infinite sequence of skew-symmetric or symmetric matrices M_1, M_2, ... over a fixed finite field must have a pair M_i, M_j (i<j) such that M_i is isomorphic to a principal submatrix of the Schur complement of a…
We give a necessary and sufficient condition on the cost function so that the map solution of Monge's optimal transportation problem is continuous for arbitrary smooth positive data. This condition was first introduced by Ma, Trudinger and…
A solution to the existence problem of G-designs with given subdesigns is known when G is a triangle with p=0,1, or 2 disjoint pendent edges: for p=0, it is due to Doyen and Wilson, the first to pose such a problem for Steiner triple…
We provide a new foundation for combinatorial commutative algebra and Stanley-Reisner theory using the partition complex introduced in [Adi18]. One of the main advantages is that it is entirely self-contained, using only a minimal knowledge…
Random planar maps are considered in the physics literature as the discrete counterpart of random surfaces. It is conjectured that properly rescaled random planar maps, when conditioned to have a large number of faces, should converge to a…
Connection matrices were introduced by Freedman, Lovasz and Schrijver [1], who used them to characterize graph homomorphism functions. The goal of this note is to determine the exact rank of these matrices. The result can be rephrased in…
We introduce two classes of algebras coming from partial triangulations of marked surfaces. The first one, called frozen algebra of a partial triangulation, is generally of infinite rank and contains frozen Jacobian algebras of…
Tensor rank and low-rank tensor decompositions have many applications in learning and complexity theory. Most known algorithms use unfoldings of tensors and can only handle rank up to $n^{\lfloor p/2 \rfloor}$ for a $p$-th order tensor in…
Many interesting classes of maps from homotopical algebra can be characterised as those maps with the right lifting property against certain sets of maps (such classes are sometimes referred to as cofibrantly generated). In a more…
We generalize the definition of topological entropy given by Adler, Konheim, and McAndrew (AKM) for piecewise continuous self-maps defined on a compact interval (pc-maps). For this notion of entropy, we prove that the properties of the…
We give a uniform explicit construction of finite two-generator presentations for the special linear groups over the integers in all ranks at least three. The construction builds on the generating-pair work of Conder--Liversidge--Vsemirnov…
A continuous map $\mathbb{C}^n\to Gr(\tau, N)$ is $k$-regular if the $\tau$-dimensional subspaces corresponding to images of any $k$ distinct points span a $\tau k$-dimensional space. For $\tau = 1$ this essentially recovers the classical…
The goal is to study the geometry of the Bilinear scheme $\mathrm{Bilin}_{d_1,d_2,d_3}^{r_1, r_2}(\mathbb{A}^n)$ introduced by Joachim Jelisiejew. This functor can be viewed as a generalization of the Quot scheme, giving the moduli space of…
We prove new barrier results in arithmetic complexity theory, showing severe limitations of natural lifting (aka escalation) techniques. For example, we prove that even optimal rank lower bounds on $k$-tensors cannot yield non-trivial lower…
This habilitation thesis summarizes the research that I have carried out from 2005 to 2019. It is organized in four chapters. The first three deal with random planar maps. Chapter 1 is about their metric properties: from a general…
The dual of a map is a fundamental construction on combinatorial maps, but many other combinatorial objects also possess their notion of duality. For instance, the Tamari lattice is isomorphic to its order dual, which induces an involution…
The notion of directed treewidth was introduced by Johnson, Robertson, Seymour and Thomas [Journal of Combinatorial Theory, Series B, Vol 82, 2001] as a first step towards an algorithmic metatheory for digraphs. They showed that some…
Guided by the connections between hypergraphs and exterior algebras, we study Tur\'an and Ramsey type problems for alternating multilinear maps. This study lies at the intersection of combinatorics, group theory, and algebraic geometry, and…