Related papers: Weak Separation and Plabic Graphs
We explore the combination theorem for a group G splitting as a graph of relatively hyperbolic groups. Using the fine graph approach to relative hyperbolicity, we find short proofs of the relative hyperbolicity of G under certain…
We confirm a conjecture of Gartland and Lokshtanov [arXiv:2007.08761]: if for a hereditary graph class $\mathcal{G}$ there exists a constant $k$ such that no member of $\mathcal{G}$ contains a $k$-creature as an induced subgraph or a…
The Leibler weak segregation theory in molten diblock copolymers is generalized with due regard for the 2nd shell harmonics contributions defined in the paper and the phase diagrams are built for the linear and miktoarm ternary ABC triblock…
In this work, we study the problem of computing a maximum common contraction of two vertex-labeled graphs, i.e. how to make them identical by contracting as little edges as possible in the two graphs. We study the problem from a…
Local versions of measurability have been around for a long time. Roughly, one splits the notion of $\mu $-completeness into pieces, and asks for a uniform ultrafilter over $\mu $ satisfying just some piece of $\mu $-completeness. Analogue…
We introduce and study the notions of translation bounded tempered distributions, and autocorrelation for a tempered distrubution. We further introduce the spaces of weakly, strongly and null weakly almost periodic tempered distributions…
The recent two proofs for the (weak) factorization theorem for birational maps, one by W{\l}odarczyk and the other by Abramovich-Karu-Matsuki-W{\l}odarczyk rely on the results of Morelli. The former uses the process for…
The generating graph encodes how generating pairs are spread among the elements of a group. For more than ten years it has been conjectured that this graph is connected for every finite group. In this paper, we give evidence supporting this…
We study necessary and sufficient conditions for contraction and incremental stability of dynamical systems with respect to non-Euclidean norms. First, we introduce weak pairings as a framework to study contractivity with respect to…
Roussel and Rubio proved a lemma which is essential in the proof of the Strong Perfect Graph Theorem. We give a new short proof of the main case of this lemma. In this note, we also give a short proof of Hayward's decomposition theorem for…
Let $G$ be a locally compact abelian group with Pontraygin dual $\widehat{G}$. Suppose $P$ is a closed subsemigroup of $G$ containing the identity element $0$. We assume that $P$ has dense interior and $P$ generates $G$. Let…
If a locally cartesian closed category carries a weak factorisation system, then the left maps are stable under pullback along right maps if and only if the right maps are closed under pushforward along right maps. We refer to this…
Recently, Braunstein et al. [1] introduced normalized Laplacian matrices of graphs as density matrices in quantum mechanics and studied the relationships between quantum physical properties and graph theoretical properties of the underlying…
In this paper, we study the quasisymmetric embeddability of weak tangents of metric spaces. We first show that quasisymmetric embeddability is hereditary, i.e., if $X$ can be quasisymmetrically embedded into $Y$, then every weak tangent of…
We examine weak-coupling theory for unconventional superconducting states of cubic or tetrahedral symmetry for arbitrary order parameters and Fermi surfaces and identify the stable states in zero applied field. We further examine the…
Inspired by the BCFW recurrence for tilings of the amplituhedron, we introduce the general framework of `plabic tangles' that utilizes plabic graphs to define rational maps between products of Grassmannians called `promotions'. The central…
Positroids are certain representable matroids originally studied by Postnikov in connection with the totally nonnegative Grassmannian and now used widely in algebraic combinatorics. The positroids give rise to determinantal equations…
In a recent work, Keusch proved the so-called 1-2-3 Conjecture, raised by Karo\'nski, {\L}uczak, and Thomason in 2004: for every connected graph different from $K_2$, we can assign labels~$1,2,3$ to the edges so that no two adjacent…
The Perfect Graph Theorems are important results in graph theory describing the relationship between clique number $\omega(G) $ and chromatic number $\chi(G) $ of a graph $G$. A graph $G$ is called \emph{perfect} if $\chi(H)=\omega(H)$ for…
We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…