Related papers: The full Ward-Takahashi Identity for colored tenso…
The typical problem in (generalized) Ramsey theory is to find the order of the largest monochromatic member of a family F (for example matchings, paths, cycles, connected subgraphs) that must be present in any edge coloring of a complete…
In this paper we introduce the concept of characteristic number that are proven to be useful in the study of the combinatorics of graph cohomology. We claim that it is a good combinatorial counterpart for geometric Betti numbers. We then…
The topological Tverberg theorem has been generalized in several directions by setting extra restrictions on the Tverberg partitions. Restricted Tverberg partitions, defined by the idea that certain points cannot be in the same part, are…
Independently posed by Behzad and Vizing, the Total Coloring Conjecture asserts that the total chromatic number of a simple connected graph $G$ is either $\Delta(G)+1$ or $\Delta(G)+2$, where $\Delta(G)$ is the largest degree of any vertex…
Proper vertex colorings of a graph are related to its boundary map, also called its signed vertex-edge incidence matrix. The vertex Laplacian of a graph, a natural extension of the boundary map, leads us to introduce nowhere-harmonic…
In this paper, we provide two different resolutions of structural sheaves of projectivized tangent bundles of smooth complete intersections. These resolutions allow in particular to obtain convenient (and completely explicit) descriptions…
We provide a first principle definition of cosmological correlation functions for a large class of scalar toy models in arbitrary FRW cosmologies, in terms of novel geometries we name {\it weighted cosmological polytopes}. Each of these…
We present the Chromatic Persistence Algorithm (CPA), an event-driven method for computing persistent cohomological features of weighted graphs via graphic arrangements, a classical object in computational geometry. We establish rigorous…
This paper is an introduction to the language of Feynman Diagrams. We use Reshetikhin-Turaev graphical calculus to define Feynman diagrams and prove that asymptotic expansions of Gaussian integrals can be written as a sum over a suitable…
Let $X$ be a connected, locally finite graph with symmetric growth. We prove that there is a vertex coloring $\phi\colon X\to\{0,1\}$ and some $R\in\mathbb{N}$ such that every automorphism $f$ preserving $\phi$ is $R$-close to the identity…
We introduce a generalization of the well known graph (vertex) coloring problem, which we call the problem of \emph{component coloring of graphs}. Given a graph, the problem is to color the vertices using minimum number of colors so that…
In this paper, we explore the interplay between symmetry and fracton order, motivated by the analogous close relationship for topologically ordered systems. Specifically, we consider models with 3D planar subsystem symmetry, and show that…
The theory of geometric quantum mechanics describes a quantum system as a Hamiltonian dynamical system with a complex projective Hilbert space as its phase space, thus equipped with a Riemannian metric in addition to a symplectic structure.…
We determine the optimum topology of quasi-one dimensional nonlinear optical structures using generalized quantum graph models. Quantum graphs are relational graphs endowed with a metric and a multiparticle Hamiltonian acting on the edges,…
Graph coloring is one of the most famous computational problems with applications in a wide range of areas such as planning and scheduling, resource allocation, and pattern matching. So far coloring problems are mostly studied on static…
Inhomogeneous quantum critical systems in one spatial dimension have been studied by using conformal field theory in static curved backgrounds. Two interesting examples are the free fermion gas in the harmonic trap and the inhomogeneous XX…
We define vertex-colourings for edge-partitioned digraphs, which unify the theory of P-partitions and proper vertex-colourings of graphs. We use our vertex-colourings to define generalized chromatic functions, which merge the chromatic…
Graph states are multi-particle entangled states that correspond to mathematical graphs, where the vertices of the graph take the role of quantum spin systems and edges represent Ising interactions. They are many-body spin states of…
To each colored graph, one can associate its closure in the universal space of isomorphism classes of pointed colored graphs, and this subspace can be regarded as a generalized subshift. Based on this correspondence, we extend the notion of…
Our purpose is to show that complements of line graphs enjoy nice coloring properties. We show that for all graphs in this class the local and usual chromatic numbers are equal. We also prove a sufficient condition for the chromatic number…