Related papers: The full Ward-Takahashi Identity for colored tenso…
Hoffman's bound is a well-known eigenvalue bound on the chromatic number of a graph. By interpreting this bound as a parameter, we show multiple applications of colorings attaining the bound (Hoffman colorings) for several notions of graph…
Binary relations derived from labeled rooted trees play an import role in mathematical biology as formal models of evolutionary relationships. The (symmetrized) Fitch relation formalizes xenology as the pairs of genes separated by at least…
We present a graph model for a background independent, relational approach to spacetime emergence. The general idea and the graph main features, detailed in [1], are discussed. This is a combinatorial (dynamical) metric graph, colored on…
Suppose that a hypergraph ${\mathcal H}$ and an arbitrary nonempty (finite or infinite) set of available colors are given. Each color $x$ is associated with a frequency $\tau (x)$, where the set of all such frequencies is bounded. We define…
The coming quantum computation is forcing us to reexamine the cryptosystems people use. We are applying graph colorings of topological coding to modern information security and future cryptography against supercomputer and quantum computer…
We undertake a study of the notion of a quantum graph over arbitrary finite-dimensional $C^*$-algebras $B$ equipped with arbitrary faithful states. Quantum graphs are realised principally as either certain operators on $L^2(B)$, the quantum…
We develop a quantum effective action for scalar-tensor theories of gravity which is both spacetime diffeomorphism invariant and field reparameterisation (frame) invariant beyond the classical approximation. We achieve this by extending the…
An infinite graph is highly connected if the complement of any subgraph of smaller size is connected. We consider weaker versions of Ramsey's Theorem asserting that in any coloring of the edges of a complete graph there exist large highly…
An independent transversal (IT) in a graph with a given vertex partition is an independent set consisting of one vertex in each partition class. Several sufficient conditions are known for the existence of an IT in a given graph with a…
For a graph $G$ and a not necessarily proper $k$-edge coloring $c:E(G)\to \{ 1,\ldots,k\}$, let $m_i(G)$ be the number of edges of $G$ of color $i$, and call $G$ {\it color-balanced} if $m_i(G)=m_j(G)$ for every two colors $i$ and $j$.…
The standard argument why gravity is not renormalisable relies on direct powercounting of Feynman graphs to estimate the degree of UV divergence. This analysis has in several (highly) supersymmetric examples be shown to overestimate…
The graph topology $\tau_{\Gamma}$ is the topology on the space $C(X)$ of all continuous functions defined on a Tychonoff space $X$ inherited from the Vietoris topology on $X\times \mathbb R$ after identifying continuous functions with…
Call a colouring of a graph distinguishing if the only automorphism which preserves it is the identity. We investigate the role of the Axiom of Choice in the existence of certain proper or distinguishing colourings in both vertex and edge…
This article gives a comprehensive description of the fractal geometry of conformally-invariant (CI) scaling curves, in the plane or half-plane. It focuses on deriving critical exponents associated with interacting random paths, by…
The CFI-graphs, named after Cai, F\"urer, and Immerman, are central to the study of the graph isomorphism testing and of first-order logic with counting. They are colored graphs, and the coloring plays a role in many of their applications.…
Choiceless Polynomial Time (CPT) is currently the only candidate logic for capturing PTIME (that is, it is contained in PTIME and has not been separated from it). A prominent example of a decision problem in PTIME that is not known to be…
Framed combinatorial topology is a recent approach to tame geometry which expresses higher-dimensional stratified spaces via tractable combinatorial data. The resulting theory of spaces is well-behaved and computable. In this paper we…
In this paper we construct a methodology for separating the divergencies due to different topological manifolds dual to Feynman graphs in colored group field theory. After having introduced the amplitude bounds using propagator cuts, we…
The notions of bounded expansion and nowhere denseness not only offer robust and general definitions of uniform sparseness of graphs, they also describe the tractability boundary for several important algorithmic questions. In this paper we…
We introduce the category $\mathsf{NCP}$, whose objects are pairs of W$^\ast$-algebras and normal states and whose morphisms are state-preserving unital completely positive (CPU) maps, as a common stage for classical and quantum information…