Related papers: The critical group of a combinatorial map
We investigate the structure of conformally rigid graphs. Graphs are conformally rigid if introducing edge weights cannot increase (decrease) the second (last) eigenvalue of the Graph Laplacian. Edge-transitive graphs and distance-regular…
We study the accuracy and predictive power of conformal perturbation theory by a comparison with lattice results in the neighborhood of the finite-temperature deconfinement transition of SU(2) Yang-Mills theory, assuming that the infrared…
The classical matrix-tree theorem relates the determinant of the combinatorial Laplacian on a graph to the number of spanning trees. We generalize this result to Laplacians on one- and two-dimensional vector bundles, giving a combinatorial…
We show that the large $n$ limit of the $O(n)$ quantum rotor model defined on a general graph has the same critical behavior as the corresponding quantum spherical model and that the critical exponents depend solely on the spectral…
We compute critical properties of a general class of quantum spin chains which are quadratic in the Fermi operators and can be solved exactly under certain symmetry constraints related to the classical compact groups $U(N)$, $O(N)$ and…
We defined exponential maps with one parameter, associated with geodesics on the parameter surface. By group theory we proposed a formula of the critical points, which is a direct sum of the Lie subalgebras at the critical temperature. We…
We study the spectra of operators on periodic graphs using methods from combinatorial algebraic geometry. Our main result is a bound on the number of complex critical points of the Bloch variety, together with an effective criterion for…
We study the statistics of Hamiltonian cycles on various families of bicolored random planar maps (with the spherical topology). These families fall into two groups corresponding to two distinct universality classes with respective central…
In this article, we give a partial description of the sandpile group of the cone of the cartesian product of graphs in function of the sandpile group of the cone of their factors. Also, we introduce the concept of uniform homomorphism of…
This is a book on higher-categorical diagrams, including pasting diagrams. It aims to provide a thorough and modern reference on the subject, collecting, revisiting and expanding results scattered across the literature, informed by recent…
We provide a complete classification of the critical sets and their images for quadratic maps of the real plane. Critical sets are always conic sections, which provides a starting point for the classification. The generic cases, maps whose…
An orientation-preserving branched covering $f: S^2 \to S^2$ is a nearly Euclidean Thurston (NET) map if each critical point is simple and its postcritical set has exactly four points. Inspired by classical, non-dynamical notions such as…
The notion of $\textbf{Gray}$-category, a semi-strict $3$-category in which the middle four interchange is weakened to an isomorphism, is central in the study of three-dimensional category theory. In this context it is common practice to…
Algebraic structures such as monoids, groups, and categories can be formulated within a category using commutative diagrams. In many common categories these reduce to familiar cases. In particular, group objects in Grp are abelian groups,…
We describe the critical window for percolation in the universality class of sparse growing random graphs. In our models, vertices arrive sequentially and connect independently to each earlier vertex $v$ with probability proportional to a…
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 transcendental entire function is called criniferous if every point in its escaping set can eventually be connected to infinity by a curve of escaping points. Many transcendental entire functions with bounded singular set have this…
In this paper we generalize renormalization theory for analytic critical circle maps with a cubic critical point to the case of maps with an arbitrary odd critical exponent by proving a quasiconformal rigidity statement for renormalizations…
Inspired by notorious combinatorial optimization problems on graphs, in this paper we consider a series of related problems defined using a metric space and topology determined by a graph. Particularly, we present the Independent Set,…
A graph $G$ is said to be crossing-critical if $cr(G-e)< cr(G)$ for every edge $e$ of $G$, where $cr(G)$ is the crossing number of $G$. Richter and Thomassen [Journal of Combinatorial Theory, Series B 58 (1993), 217-224] constructed an…