Related papers: Some criteria for circle packing types and combina…

Generalized circle packings were introduced in \cite{Ba-Hu-Sun} as a generalization of tangential circle packings in hyperbolic background geometry. In this paper, we introduce the combinatorial Calabi flow, fractional combinatorial Calabi…

In a previous paper, we defined a version of the percolation triangle condition that is suitable for the analysis of bond percolation on a finite connected transitive graph, and showed that this triangle condition implies that the…

Let $G$ and $H$ be graphs. We say that $P$ is an $H$-packing of $G$ if $P$ is a set of edge-disjoint copies of $H$ in $G$. An $H$-packing $P$ is maximal if there is no other $H$-packing of $G$ that properly contains $P$. Packings of maximum…

We study oriented percolation on random causal triangulations, those are random planar graphs obtained roughly speaking by adding horizontal connections between vertices of an infinite tree. When the underlying tree is a geometric…

In this paper, we introduce the generic circular triangle-free graph $\mathbb C_3$ and propose a finite axiomatization of its first order theory. In particular, our main results show that a countable graph $G$ embeds into $\mathbb C_3$ if…

We give error bounds which demonstrate optimal rates of convergence in the CLT for the total covered volume and the number of isolated shapes, for germ-grain models with fixed grain radius over a binomial point process of $n$ points in a…

In a graph $G$, a subset of vertices $S \subseteq V(G)$ is said to be cyclable if there is a cycle containing the vertices in some order. $G$ is said to be $k$-cyclable if any subset of $k \geq 2$ vertices is cyclable. If any $k$…

We initiate the study of combinatorial algorithms for Triangle Detection in $H$-free graphs. The goal is to decide if a graph that forbids a fixed pattern $H$ as a subgraph contains a triangle, using only "combinatorial" methods that…

Thurston's triangulation conjecture asserts that every hyperbolic 3-manifold admits a geometric triangulation into hyper-ideal hyperbolic tetrahedra. So far, this conjecture had only been proven for a few special 3-manifolds. In this…

Let $(G_n)_{n \geq 1} = ((V_n,E_n))_{n \geq 1}$ be a sequence of finite, connected, vertex-transitive graphs with volume tending to infinity. We say that a sequence of parameters $(p_n)_{n \geq 1}$ in $[0,1]$ is supercritical with respect…

There is a long standing conjecture that there are at least $n$ closed characteristics for any compact convex hypersurface $\Sigma$ in $\mathbb{R}^{2n}$, and the symmetric case, i.e. $\Sigma=-\Sigma$, has already been proved by C. Liu, Y.…

We construct combinatorial analogs of 2d higher topological quantum field theories. We consider triangulations as vertices of a certain CW complex $\Xi$. In the "flip theory," cells of $\Xi_\mathrm{flip}$ correspond to polygonal…

In this article, we study hypersurfaces $\Sigma\subset \mathbb{R}^{n+1}$ with constant weighted mean curvature. Recently, Wei-Peng proved a rigidity theorem for CWMC hypersurfaces that generalizes Le-Sesum classification theorem for…

The main purpose of this article is to demonstrate three techniques for proving algebraicity statements about circle packings. We give proofs of three related theorems: (1) that every finite simple planar graph is the contact graph of a…

A simplicial complex $X$ is said to be tight with respect to a field $\mathbb{F}$ if $X$ is connected and, for every induced subcomplex $Y$ of $X$, the linear map $H_\ast (Y; \mathbb{F}) \rightarrow H_\ast (X; \mathbb{F})$ (induced by the…

We develop a renormalization theory of non-perturbative dissipative H\'enon-like maps with combinatorics of bounded type. The main novelty of our approach is the incorporation of Pesin theoretic ideas to the renormalization method, which…

A graph $G=(V,E)$ is called $d$-rigid if, for a generic embedding of its vertices in $\mathbb{R}^d$, every edge-length preserving continuous motion of the vertices preserves the distances between all pairs of non-adjacent vertices as well.…

Several results are presented for site percolation on quasi-transitive, planar graphs $G$ with one end, when properly embedded in either the Euclidean or hyperbolic plane. If $(G_1,G_2)$ is a matching pair derived from some quasi-transitive…

We answer a question of Benjamini and Schramm by proving that under reasonable conditions, quotienting a graph strictly increases the value of its percolation critical parameter $p_c$. More precisely, let $\mathcal{G}=(V,E)$ be a…

We consider the hard-core model in $\mathbb{R}^2$, in which a random set of non-intersecting unit disks is sampled with an intensity parameter $\lambda$. Given $\varepsilon>0$ we consider the graph in which two disks are adjacent if they…