Related papers: Weak Separation and Plabic Graphs
We study the notion of weak amalgamation in the context of diagonal conjugacy classes. Generalizing results of Kechris and Rosendal, we prove that for every countable structure $M$, Polish group $G$ of permutations of $M$, and $n \geq 1$,…
A basic fact in spectral graph theory is that the number of connected components in an undirected graph is equal to the multiplicity of the eigenvalue zero in the Laplacian matrix of the graph. In particular, the graph is disconnected if…
For the ordered set $[n]$ of $n$ elements, we consider the class $\Bscr_n$ of bases $B$ of tropical Pl\"ucker functions on $2^{[n]}$ such that $B$ can be obtained by a series of mutations (flips) from the basis formed by the intervals in…
We study entanglement properties of mixed density matrices obtained from combinatorial Laplacians. This is done by introducing the notion of the density matrix of a graph. We characterize the graphs with pure density matrices and show that…
A prominent tool in many problems involving metric spaces is a notion of randomized low-diameter decomposition. Loosely speaking, $\beta$-decomposition refers to a probability distribution over partitions of the metric into sets of low…
We study a special class of weakly associative algebras: the symmetric Leibniz algebras. We describe the structure of the commutative and skew symmetric algebras associated with the polarization-depolarization principle. We also give a…
In this paper, we introduce the classes of weakly surjunctive and linearly surjunctive groups which include all sofic groups and more generally all surjunctive groups. We investigate various properties of such groups and establish in…
This paper is devoted to the study of the separability problem in the field of Quantum information theory. We deal mainly with the bipartite finite dimensional case and with two types of matrices, one of them being the PPT matrices. We…
We prove a version of the Weak Gravity Conjecture for 6d F-theory or heterotic string compactifications with 8 supercharges. This sharpens our previous analysis by including massless scalar fields. The latter are known to modify the Weak…
We consider a family of periodic tight-binding models (combinatorial graphs) that have the minimal number of links between copies of the fundamental domain. For this family we establish a local condition of second derivative type under…
This paper deals with lattice congruences of the weak order on the symmetric group, and initiates the investigation of the cover graphs of the corresponding lattice quotients. These graphs also arise as the skeleta of the so-called…
In this article we define a minor relation, which is stronger than the classical one, but too strong to become a well-quasi-order on the class of finite graphs. Nevertheless, with this terminology we are able to introduce a conjecture,…
It is shown that the complex field equipped with the "approximate exponential map", defined up to ambiguity from a small group, is quasiminimal: every automorphism-invariant subset of the field is countable or co-countable. If the ambiguity…
Using ideas from Shelah's recent proof that a completely separable maximal almost disjoint family exists when $\c < {\aleph}_{\omega}$, we construct a weakly tight family under the hypothesis $\s \leq \b < {\aleph}_{\omega}$. The case when…
Thomassen showed that planar graphs are 5-list-colourable, and that planar graphs of girth at least five are 3-list-colourable. An easy degeneracy argument shows that planar graphs of girth at least four are 4-list-colourable. In 2022,…
In this paper we construct an explicit map from planar bicolored (plabic) trivalent graphs representing a given irreducible positroid cell $S$ in the totally non-negative Grassmannian $Gr^{\mbox{TNN}}(k,n)$ to the spectral data for the…
A weak deletion sequence is a sequence $(G_1,\ldots,G_n)$ of graphs so that for each $i\in[n-1]$ either $G_i$ is isomorphic to a subgraph of $G_{i+1}$, or vice versa: $G_{i+1}$ is isomorphic to a subgraph of $G_i$. We prove that determining…
We look at a graph property called reducibility which is closely related to a condition developed by Brown to evaluate Feynman integrals. We show for graphs with a fixed number of external momenta, that reducibility with respect to both…
Let C be an integral fusion category. We study some graphs, called the prime graph and the common divisor graph, related to the Frobenius-Perron dimensions of simple objects in the category C, that extend the corresponding graphs associated…
One deals with r-regular bipartite graphs with 2n vertices. In a previous paper Butera, Pernici, and the author have introduced a quantity d(i), a function of the number of i-matchings, and conjectured that as n goes to infinity the…