Sphericity, cubicity, and edge clique covers of graphs

AbstractThe sphericity sph(G) of a graph G is the minimum dimension d for which G is the intersection graph of a family of congruent spheres in Rd. The edge clique cover number θ(G) is the minimum cardinality of a set of cliques (complete subgraphs) that covers all edges of G. We prove that if G has at least one edge, then sph(G)⩽θ(G). Our upper bound remains valid for intersection graphs defined by balls in the Lp-norm for 1⩽p⩽∞

A weighted cellular matrix-tree theorem, with applications to complete colorful and cubical complexes

We present a version of the weighted cellular matrix-tree theorem that is suitable for calculating explicit generating functions for spanning trees of highly structured families of simplicial and cell complexes. We apply the result to give weighted generalizations of the tree enumeration formulas of Adin for complete colorful complexes, and of Duval, Klivans and Martin for skeleta of hypercubes. We investigate the latter further via a logarithmic generating function for weighted tree enumeration, and derive another tree-counting formula using the unsigned Euler characteristics of skeleta of a hypercube and the Crapo $\beta$-invariant of uniform matroids.Comment: 22 pages, 2 figures. Sections 6 and 7 of previous version simplified and condensed. Final version to appear in J. Combin. Theory Ser.

On a conjecture of Wilf

Let n and k be natural numbers and let S(n,k) denote the Stirling numbers of the second kind. It is a conjecture of Wilf that the alternating sum \sum_{j=0}^{n} (-1)^{j} S(n,j) is nonzero for all n>2. We prove this conjecture for all n not congruent to 2 and not congruent to 2944838 modulo 3145728 and discuss applications of this result to graph theory, multiplicative partition functions, and the irrationality of p-adic series.Comment: 18 pages, final version, accepted for publication in the Journal of Combinatorial Theory, Series

Pauli graphs when the Hilbert space dimension contains a square: why the Dedekind psi function ?

We study the commutation relations within the Pauli groups built on all decompositions of a given Hilbert space dimension $q$, containing a square, into its factors. Illustrative low dimensional examples are the quartit ($q=4$) and two-qubit ($q=2^2$) systems, the octit ($q=8$), qubit/quartit ($q=2\times 4$) and three-qubit ($q=2^3$) systems, and so on. In the single qudit case, e.g. $q=4,8,12,...$, one defines a bijection between the $\sigma (q)$ maximal commuting sets [with $\sigma[q)$ the sum of divisors of $q$] of Pauli observables and the maximal submodules of the modular ring $\mathbb{Z}_q^2$, that arrange into the projective line $P_1(\mathbb{Z}_q)$ and a independent set of size $\sigma (q)-\psi(q)$ [with $\psi(q)$ the Dedekind psi function]. In the multiple qudit case, e.g. $q=2^2, 2^3, 3^2,...$, the Pauli graphs rely on symplectic polar spaces such as the generalized quadrangles GQ(2,2) (if $q=2^2$) and GQ(3,3) (if $q=3^2$). More precisely, in dimension $p^n$ ($p$ a prime) of the Hilbert space, the observables of the Pauli group (modulo the center) are seen as the elements of the $2n$-dimensional vector space over the field $\mathbb{F}_p$. In this space, one makes use of the commutator to define a symplectic polar space $W_{2n-1}(p)$ of cardinality $\sigma(p^{2n-1})$, that encodes the maximal commuting sets of the Pauli group by its totally isotropic subspaces. Building blocks of $W_{2n-1}(p)$ are punctured polar spaces (i.e. a observable and all maximum cliques passing to it are removed) of size given by the Dedekind psi function $\psi(p^{2n-1})$. For multiple qudit mixtures (e.g. qubit/quartit, qubit/octit and so on), one finds multiple copies of polar spaces, ponctured polar spaces, hypercube geometries and other intricate structures. Such structures play a role in the science of quantum information.Comment: 18 pages, version submiited to J. Phys. A: Math. Theo

A weighted cellular matrix-tree theorem, with applications to complete colorful and cubical complexes

We present a version of the weighted cellular matrix-tree theorem that is suitable for calculating explicit generating functions for spanning trees of highly structured families of simplicial and cell complexes. We apply the result to give weighted generalizations of the tree enumeration formulas of Adin for complete colorful complexes, and of Duval, Klivans and Martin for skeleta of hypercubes. We investigate the latter further via a logarithmic generating function for weighted tree enumeration, and derive another tree-counting formula using the unsigned Euler characteristics of skeleta of a hypercube

Long path and cycle decompositions of even hypercubes

We consider edge decompositions of the $n$-dimensional hypercube $Q_n$ into isomorphic copies of a given graph $H$. While a number of results are known about decomposing $Q_n$ into graphs from various classes, the simplest cases of paths and cycles of a given length are far from being understood. A conjecture of Erde asserts that if $n$ is even, $\ell < 2^n$ and $\ell$ divides the number of edges of $Q_n$, then the path of length $\ell$ decomposes $Q_n$. Tapadia et al.\ proved that any path of length $2^mn$, where $2^m<n$, satisfying these conditions decomposes $Q_n$. Here, we make progress toward resolving Erde's conjecture by showing that cycles of certain lengths up to $2^{n+1}/n$ decompose $Q_n$. As a consequence, we show that $Q_n$ can be decomposed into copies of any path of length at most $2^{n}/n$ dividing the number of edges of $Q_n$, thereby settling Erde's conjecture up to a linear factor

Tree Graphs and Orthogonal Spanning Tree Decompositions

Given a graph G, we construct T(G), called the tree graph of G. The vertices of T(G) are the spanning trees of G, with edges between vertices when their respective spanning trees differ only by a single edge. In this paper we detail many new results concerning tree graphs, involving topics such as clique decomposition, planarity, and automorphism groups. We also investigate and present a number of new results on orthogonal tree decompositions of complete graphs