Related papers: Some criteria for circle packing types and combina…
Several conditions are given when a packing of equal disks in a torus is locally maximally dense, where the torus is defined as the quotient of the plane by a two-dimensional lattice. Conjectures are presented that claim that the density of…
We study the problem of deterministic approximate counting of matchings and independent sets in graphs of bounded connective constant. More generally, we consider the problem of evaluating the partition functions of the monomer-dimer model…
We introduce a combinatorial curvature flow for PL metrics on compact triangulated 3-manifolds with boundary consisting of surfaces of negative Euler characteristic. The flow tends to find the complete hyperbolic metric with totally…
Given a graph $G$, we define ${\bf bcg}(G)$ as the minimum $k$ for which $G$ can be contracted to the uniformly triangulated grid $\Gamma_{k}$. A graph class ${\cal G}$ has the SQG${\bf C}$ property if every graph $G\in{\cal G}$ has…
Density matrices of graphs are combinatorial laplacians normalized to have trace one (Braunstein \emph{et al.} \emph{Phys. Rev. A,} \textbf{73}:1, 012320 (2006)). If the vertices of a graph are arranged as an array, then its density matrix…
A convex geometric graph $G$ is said to be packable if there exist edge-disjoint copies of $G$ in the complete convex geometric graph $K_n$ covering all but $o(n^2)$ edges. We prove that every convex geometric graph with cyclic chromatic…
We extend Thurston's combinatorial criterion for postcritically finite rational maps to a class of rational maps with bounded type Siegel disks. The combinatorial characterization of this class of Siegel rational maps plays a special role…
In this note we study the geometry of the largest component C_1 of critical percolation on a finite graph G which satisfies the finite triangle condition, defined by Borgs et al. There it is shown that this component is of size n^{2/3}, and…
For every $r\in\mathbb{N}_{\geq 2}\cup\{\infty\}$, we prove a $C^r$-orbit connecting lemma for dynamically coherent and plaque expansive partially hyperbolic diffeomorphisms with 1-dimensional orientation preserving center bundle. To be…
We prove that any vector field on a three-dimensional compact manifold can be approximated in the C1-topology by one which is singular hyperbolic or by one which exhibits a homoclinic tangency associated to a regular hyperbolic periodic…
The maximum principle for hyperbolic inversive distance circle packings on polyhedral surfaces is established,which unifies and generalizes existing maximum principles for various types of circle packings in the literature.As an application…
Round-based models are very common message-passing models; combinatorial topology applied to distributed computing provides sweeping results like general lower bounds. We combine both to study the computability of k-set agreement. Among all…
A set of geometric graphs is {\em geometric-packable} if it can be asymptotically packed into every sequence of drawings of the complete graph $K_n$. For example, the set of geometric triangles is geometric-packable due to the existence of…
Let $X_H$ be the number of copies of a fixed graph $H$ in $G(n,p)$. In 2016, Gilmer and Kopparty conjectured that a local central limit theorem should hold for $X_H$ as long as $H$ is connected, $p\gg n^{-1/m(H)}$ and $n^2(1-p)\gg 1$, where…
Let $G$ be a Cameron--Walker graph on $n$ vertices and $J_G$ the binomial edge ideal of $G$. Let $S$ denote the polynomial ring in $2n$ variables over a field. It is shown that the following conditions are equivalent: (i) $S/J_G$ is…
We present new combinatorial objects, which we call grid-labelled graphs, and show how these can be used to represent the quantum states arising in a scenario which we refer to as the faulty emitter scenario: we have a machine designed to…
An outstanding challenge for models of non-perturbative quantum gravity is the consistent formulation and quantitative evaluation of physical phenomena in a regime where geometry and matter are strongly coupled. After developing appropriate…
We study the Teichm\"uller space $\mathcal{T}(S,\underline{p})$ of hyperbolic cone-surfaces of fixed topological type with marked cone singularities. Fix a combinatorial triangulation $G$, and let $\mathcal{T}(G)\subset…
Given a finite simple triangulation, we estimate the sizes of circles in its circle packing in terms of Cannon's vertex extremal length. Our estimates provide control over the size of the largest circle in the packing. We use them, combined…
We show that there exist efficient algorithms for the triangle packing problem in colored permutation graphs, complete multipartite graphs, distance-hereditary graphs, k-modular permutation graphs and complements of k-partite graphs (when k…