Related papers: A combinatorial proof of the trace Cayley-Hamilton…
We show that if G is any nilpotent, finite group, and the commutator subgroup of G is cyclic, then every connected Cayley graph on G has a hamiltonian cycle.
The number of homomorphisms from a finite graph $F$ to the complete graph $K_n$ is the evaluation of the chromatic polynomial of $F$ at $n$. Suitably scaled, this is the Tutte polynomial evaluation $T(F;1-n,0)$ and an invariant of the cycle…
The Cayley-Hamilton theorem is used to implement an iterative process for the efficient numerical computation of matrix power series and their differentials. In addition to straight-forward applications in lattice gauge theory simulations…
In this short note, we give a new sufficient condition for a linear map from a product of copies of a field to endomorphisms of a finite dimensional vector space over the same field to be an algebra homomorphism. We expect that this result…
We give a combinatorial characterization of generic minimal rigidity for planar periodic frameworks. The characterization is a true analogue of the Maxwell-Laman Theorem from rigidity theory: it is stated in terms of a finite combinatorial…
A graph $X$ is said to be a pattern polynomial graph if its adjacency algebra is a coherent algebra. In this study we will find a necessary and sufficient condition for a graph to be a pattern polynomial graph. Some of the properties of the…
The reliability polynomial of a graph gives the probability that a graph remains operational when all its edges could fail independently with a certain fixed probability. In general, the problem of finding uniformly most reliable graphs…
In 1982, Durnberger proved that every connected Cayley graph of a finite group with a commutator subgroup of prime order contains a hamiltonian cycle. In this paper, we extend this result to the infinite case. Additionally, we generalize…
We prove that the tangent complex of K-theory, in terms of (abelian) deformation problems over a characteristic 0 field k, is cyclic homology (over k). This equivalence is compatible with the $\lambda$-operations. In particular, the…
Persistent homology is a popular tool in Topological Data Analysis. It provides numerical characteristics of data sets which reflect global geometric properties. In order to be useful in practice, for example for feature generation in…
We present a surprisingly new connection between two well-studied combinatorial classes: rooted connected chord diagrams on one hand, and rooted bridgeless combinatorial maps on the other hand. We describe a bijection between these two…
Incidence-based generalizations of cycle covers, called contributors, extend the Harary-Sachs coefficient theorem for characteristic polynomials of the adjacency matrix of graphs. All minors of the Laplacian resulting from an integer matrix…
The goal of this paper is to lay the foundations for a combinatorial study, via orthogonal functions and intertwining operators, of category O for the rational Cherednik algebra of type G(r,p,n). As a first application, we give a…
We prove a general large sieve statement in the context of random walks on subgraphs of a given graph. This can be seen as a generalization of previously known results where one performs a random walk on a group enjoying a strong spectral…
As a discretization of the Hodge Laplacian, the combinatorial Laplacian of simplicial complexes has garnered significant attention. In this paper, we study combinatorial Laplacians for complex pairs $(X, A)$, where $A$ is a subcomplex of a…
An oriented hypergraph is an oriented incidence structure that generalizes and unifies graph and hypergraph theoretic results by examining its locally signed graphic substructure. In this paper we obtain a combinatorial characterization of…
Results of Fowler and Sims show that every k-graph is completely determined by its k-coloured skeleton and collection of commuting squares. Here we give an explicit description of the k-graph associated to a given skeleton and collection of…
Using the natural notion of {\em Hasse--Schmidt derivations on an exterior algebra}, we relate two classical and seemingly unrelated subjects. The first is the celebrated Cayley--Hamilton theorem of linear algebra, "{\em each endomorphism…
This paper proves that the characteristic polynomial is a complete unitary invariant for pairs of projection matrices. Some special cases involving three or more projections are also considered.
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…