English
Related papers

Related papers: Delocalization of uniform graph homomorphisms from…

200 papers

We first consider the class K of graphs on a zero-dimensional metrizable compact space with continuous chromatic number at least three. We provide a concrete basis of size continuum for K made up of countable graphs, comparing them with the…

Dynamical Systems · Mathematics 2023-07-04 Dominique Lecomte

Classical Hamming graphs are Cartesian products of complete graphs, and two vertices are adjacent if they differ in exactly one coordinate. Motivated by connections to unitary Cayley graphs, we consider a generalization where two vertices…

Combinatorics · Mathematics 2022-08-03 Briana Foster-Greenwood , Christine Uhl

We study the fractionalization of space group symmetries in two-dimensional topologically ordered phases. Specifically, we focus on Z2-fractionalized phases in two dimensions whose deconfined topological excitations transform trivially…

Strongly Correlated Electrons · Physics 2016-09-21 SungBin Lee , Michael Hermele , S. A. Parameswaran

We study the deformation complex of the standard morphism from the degree $d$ shifted Lie operad to its polydifferential version, and prove that it is quasi-isomorphic to the Kontsevich graph complex $\mathbf{GC}_d$. In particular, we show…

Quantum Algebra · Mathematics 2023-04-24 Vincent Wolff

The complexity of graph homomorphisms has been a subject of intense study [11, 12, 4, 42, 21, 17, 6, 20]. The partition function $Z_{\mathbf A}(\cdot)$ of graph homomorphism is defined by a symmetric matrix $\mathbf A$ over $\mathbb C$. We…

Computational Complexity · Computer Science 2020-04-15 Jin-Yi Cai , Artem Govorov

We focus on two specific generalizations of the chromatic symmetric function: one involving universal graphs and the other concerning vertex-weighted graphs. In this paper, we introduce a unified generalization that incorporates both…

Combinatorics · Mathematics 2025-04-01 Yosuke Sato

Box complex is a $\mathbb{Z}_2$-space associated to a graph, and it is known that a certain $\mathbb{Z}_2$-homotopy invariant of it, called the $\mathbb{Z}_2$-index, gives an effective lower bound for the chromatic number. On the other…

Combinatorics · Mathematics 2015-06-30 Takahiro Matsushita

We investigate the property of a spatial graph of having a leveled embedding and characterize the abstract graphs with this property. We show that all leveled embeddings are free and we compare leveled and paneled (also known as flat)…

Combinatorics · Mathematics 2025-09-22 Senja Barthel , Fabio Buccoliero

We describe an application of the linear $\de$-expansion to the calculation of correlation functions in SU(2)-Higgs lattice gauge theory. A significant advantage of the technique is that an infinite volume lattice may be used, allowing the…

High Energy Physics - Phenomenology · Physics 2007-05-23 T. S. Evans , H. F. Jones , A. Ritz

Two graphs are homomorphism indistinguishable over a graph class $\mathcal{F}$, denoted by $G \equiv_{\mathcal{F}} H$, if $\operatorname{hom}(F,G) = \operatorname{hom}(F,H)$ for all $F \in \mathcal{F}$ where $\operatorname{hom}(F,G)$…

Combinatorics · Mathematics 2023-07-11 Daniel Neuen

We consider embeddings of 3-regular graphs into 3-dimensional Cartesian coordinates, in such a way that two vertices are adjacent if and only if two of their three coordinates are equal (that is, if they lie on an axis-parallel line) and…

Computational Geometry · Computer Science 2015-07-16 David Eppstein

We study the dimer model on special subgraphs of the square hexagon lattice called "tower graphs" of size $N$. Using integrable probability techniques, we confirm that as $N \rightarrow \infty$, the local statistics are translation…

Mathematical Physics · Physics 2022-11-29 Matthew Nicoletti

For graphs $G$ and $H$, an $H$-coloring of $G$ is a function from the vertices of $G$ to the vertices of $H$ that preserves adjacency. $H$-colorings encode graph theory notions such as independent sets and proper colorings, and are a…

Combinatorics · Mathematics 2012-06-15 John Engbers , David Galvin

On the space of Ising configurations on the 2-d square lattice, we consider a family of non Gibbsian measures introduced by using a pair Hamiltonian, depending on an additional inertial parameter $q$. These measures are related to the usual…

The spectral approach to infinite disordered crystals is applied to an Anderson-type Hamiltonian to demonstrate the existence of extended states for nonzero disorder in 2D lattices of different geometries. The numerical simulations shown…

Disordered Systems and Neural Networks · Physics 2017-12-13 E G Kostadinova , K Busse , N Ellis , J Padgett , C D Liaw , L S Matthews , T W Hyde

The study of random graphs has become very popular for real-life network modeling such as social networks or financial networks. Inhomogeneous long-range percolation (or scale-free percolation) on the lattice $\mathbb Z^d$, $d\ge1$, is a…

Probability · Mathematics 2014-09-29 Philippe Deprez , Rajat Subhra Hazra , Mario V. Wüthrich

While it has been pointed out that the chiral symmetry, which is important for the Dirac fermions in graphene, can be generalized to tilted Dirac fermions as in organic metals, such a generalized symmetry was so far defined only for a…

Mesoscale and Nanoscale Physics · Physics 2017-01-04 T. Kawarabayashi , H. Aoki , Y. Hatsugai

We classify all the first-order vertices of gravity consistently coupled to a system of 2-form gauge fields by computing the local BRST cohomology H(s|d) in ghost number 0 and form degree n. The consistent deformations are at most linear in…

High Energy Physics - Theory · Physics 2009-10-31 Xavier Bekaert , Bernard Knaepen , Christiane Schomblond

We consider $N\times N$ Hermitian random band matrices $H=(H_{xy})$, whose entries are centered complex Gaussian random variables. The indices $x,y$ range over the $d$-dimensional discrete torus $(\mathbb Z/L\mathbb Z)^d$ with $d\in…

Probability · Mathematics 2025-06-25 Fan Yang , Jun Yin

We investigate novel random graph embeddings that can be computed in expected polynomial time and that are able to distinguish all non-isomorphic graphs in expectation. Previous graph embeddings have limited expressiveness and either cannot…

Machine Learning · Computer Science 2023-08-25 Pascal Welke , Maximilian Thiessen , Fabian Jogl , Thomas Gärtner