Related papers: Stability of stretched root systems, root posets, …
One theorem of Nemhauser and Trotter ensures that, under certain conditions, a stable set of a graph G can be enlarged to a maximum stable set of this graph. For example, any stable set consisting of only simplicial vertices is contained in…
The intrinsic connection between lattice theory and topology is fairly well established, For instance, the collection of open subsets of a topological subspace always forms a distributive lattice. Persistent homology has been one of the…
We introduce a new parameter, called stretch-width, that we show sits strictly between clique-width and twin-width. Unlike the reduced parameters [BKW '22], planar graphs and polynomial subdivisions do not have bounded stretch-width. This…
We propose that cycle expansions be ordered with respect to stability rather than orbit length for many chaotic systems, particularly those exhibiting crises. This is illustrated with the strong field Lorentz gas, where we obtain…
Disordered systems like liquids, gels, glasses, or granular materials are not only ubiquitous in daily life and in industrial applications but they are also crucial for the mechanical stability of cells or the transport of chemical and…
A root system is splint if it is a decomposition into a union of two root systems. Examples of such root systems arise naturally in studying embeddings of reductive Lie subalgebras into simple Lie algebras. Given a splint root system, one…
Given a finite poset $\mathcal P$, we say that a family $\mathcal F$ of subsets of $[n]$ is $\mathcal P$-saturated if $\mathcal F$ does not contain an induced copy of $\mathcal P$, but adding any other set to $\mathcal F$ creates an induced…
Discrete stability extends the classical notion of stability to random elements in discrete spaces by defining a scaling operation in a randomised way: an integer is transformed into the corresponding binomial distribution. Similarly…
Phyllotactic patterns, i.e. regular arrangements of leaves or seeds around a plant stem, are fascinating examples of complex structures encountered in Nature. In botany, their symmetries develop when a new primordium periodically grows in…
In this note, we characterize affine and non-affine Coxeter systems among all Coxeter systems in terms of the structure of their reflection orders. For an infinite irreducible system $(W,S)$, we show that affineness can be characterized in…
Growth and folding in one-layered model tissue sheets are studied in a stochastic, lattice-free single cell model which considers the discrete cellular structure of the tissue, and a coarse grained analytical approach. The polarity of the…
We consider the problem of embedding a dynamic network, to obtain time-evolving vector representations of each node, which can then be used to describe changes in behaviour of individual nodes, communities, or the entire graph. Given this…
These lecture notes grew out of a series of lectures given by the second named author in short courses in Toulouse, Matsumoto, and Darmstadt. The main aim is to explain some aspects of the theory of "Regularity structures" developed…
We prove a scattering result near certain steady states for a Hartree equation for a random field. This equation describes the evolution of a system of infinitely many particles. It is an analogous formulation of the usual Hartree equation…
Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…
Coboundary expansion (with $\mathbb{F}_2$ coefficients), and variations on it, have been the focus of intensive research in the last two decades. It was used to study random complexes, property testing, and above all Gromov's topological…
We study Schreier dynamical systems associated with a vast family of groups that hosts many known examples of groups of intermediate growth. We are interested in the orbital graphs for the actions of these groups on $d-$regular rooted trees…
Imposing orthogonality on the layers of neural networks is known to facilitate the learning by limiting the exploding/vanishing of the gradient; decorrelate the features; improve the robustness. This paper studies the theoretical properties…
In this paper, we investigate various properties of strong and weak twisted Bruhat orders on a Coxeter group. In particular, we prove that any twisted strong Bruhat order on an affine Weyl group is locally finite, strengthening a result of…
We study the inference of network archaeology in growing random geometric graphs. We consider the root finding problem for a random nearest neighbor tree in dimension $d \in \mathbb{N}$, generated by sequentially embedding vertices…