Related papers: Quantum state systems that count perfect matchings
Motivated by the definition of linear coloring on simplicial complexes, recently introduced in the context of algebraic topology \cite{Civan}, and the framework through which it was studied, we introduce the linear coloring on graphs. We…
A graph embedded in a surface with all faces of size 4 is known as a quadrangulation. We extend the definition of quadrangulation to higher dimensions, and prove that any graph G which embeds as a quadrangulation in the real projective…
We show a surprising link between experimental setups to realize high-dimensional multipartite quantum states and Graph Theory. In these setups, the paths of photons are identified such that the photon-source information is never created.…
Coloured Alexander polynomials form a sequence of non-semisimple quantum invariants coming from the representation theory of the quantum group $U_q(sl(2))$ at roots of unity. This sequence recovers the original Alexander polynomial as the…
We study a family of closed quantum graphs described by one singular vertex of order n=4. By suitable choice of the parameters specifying the singular vertex, we can construct a closed sequence of paths in the parameter space that…
We study the class of edge-coloured graphs arising from the graph-theoretic representation of quantum photonic experiments that generate multipartite W-states. Abstracting away physical amplitudes and phases, we introduce W-state graphs:…
A qualgebra $G$ is a set having two binary operations that satisfy compatibility conditions which are modeled upon a group under conjugation and multiplication. We develop a homology theory for qualgebras and describe a classifying space…
A coloured graph is k-ultrahomogeneous if every isomorphism between two induced subgraphs of order at most k extends to an automorphism. A coloured graph is t-tuple regular if the number of vertices adjacent to every vertex in a set S of…
The colored Jones polynomial of links has two natural normalizations: one in which the n-colored unknot evaluates to [n+1], the quantum dimension of the (n+1)-dimensional irreducible representation of quantum sl(2), and the other in which…
A b-coloring is a coloring of the vertices of a graph such that each color class contains a vertex that has a neighbor in all other color classes, and the b-chromatic number of a graph $G$ is the largest integer $k$ such that $G$ admits a…
A perfect matching M in an edge-colored complete bipartite graph K_{n,n} is rainbow if no pair of edges in M have the same color. We obtain asymptotic enumeration results for the number of rainbow matchings in terms of the maximum number of…
A coloring of vertices of a graph is called perfect if, for every vertex, the collection of colors of its neighbors depends only on its own color. The correspondent color partition of vertices is called equitable. We note that a number of…
A perfect $k$-coloring of the Boolean hypercube $Q_n$ is a function from the set of binary words of length $n$ onto a $k$-set of colors such that for any colors $i$ and $j$ every word of color $i$ has exactly $S(i,j)$ neighbors (at Hamming…
We discuss representations and colorings of orthogonality hypergraphs in terms of their two-valued states interpretable as classical truth assignments. Such hypergraphs, if they allow for a faithful orthogonal representation, have quantum…
In this paper, we study the problem of partitioning a graph into connected and colored components called blocks. Using bivariate generating functions and combinatorial techniques, we determine the expected number of blocks when the vertices…
In this paper we make a systematic use of the quantum measurement theory to describe perceived colors and analyze some of their fundamental properties. After motivating the naturalness of the quantum measurement approach in the mathematical…
Multi-qubit quantum states corresponding to bipartite graphs $G(U,V,E)$ are examined. These states are constructed by applying $CNOT$ gates to an arbitrary separable multi-qubit quantum state. The entanglement distance of the resulting…
A system of $N_a$ atoms of $n$-levels interacting dipolarly with $\ell$ modes of electromagnetic field is considered. The energy surface of the system is constructed from the direct product of the coherent states of U$(n)$ in the totally…
The inclusion relation between simple objects in the plane may be used to define geometric set systems, or hypergraphs. Properties of various types of colorings of these hypergraphs have been the subject of recent investigations, with…
An acyclic coloring of a digraph as defined by Neumann-Lara is a vertex-coloring such that no monochromatic directed cycles occur. Counting the number of such colorings with $k$ colors can be done by counting so-called Neumann-Lara-coflows…