Related papers: A combinatorial proof of the trace Cayley-Hamilton…
The mutually enriching relationship between graphs and matroids has motivated discoveries in both fields. In this paper, we exploit the similar relationship between embedded graphs and delta-matroids. There are well-known connections…
This paper introduces a new graph construction, the permutational power of a graph, whose adjacency matrix is obtained by the composition of a permutation matrix with the adjacency matrix of the graph. It is shown that this construction…
We introduce a new one-variable polynomial invariant of graphs, which we call the skew characteristic polynomial. For an oriented simple graph, this is just the characteristic polynomial of its anti-symmetric adjacency matrix. For…
Cauchy's interlace theorem states that the characteristic polynomial of a symmetric matrix is interlaced by the characteristic polynomial of any principle submatrix. We prove this in two sentences using only the linearity of the…
To a given nonsingular triangular matrix A with entries from a ring, we associate a weighted bipartite graph G(A) and give a combinatorial description of the inverse of A by employing paths in G(A). Under a certain condition, nonsingular…
In this note we investigate the multi-parameter Potential Theory on the weighted $d$-tree (Cartesian product of several copies of uniform dyadic tree), which is connected to the discrete models of weighted Dirichlet spaces on the polydisc.…
The Rayleigh monotonicity is a principle from the theory of electrical networks. Its combinatorial interpretation says for each two edges of a graph G, that the presence of one of them in a random spanning tree of G is negatively correlated…
We explore several generalizations of Whitney's theorem -- a classical formula for the chromatic polynomial of a graph. Following Stanley, we replace the chromatic polynomial by the chromatic symmetric function. Following Dohmen and Trinks,…
D. A. Kahzdan first put forth property (T) in relation to the study of discrete subgroups of Lie groups of finite co-volume. Through a combinatorial approach, we define an analogue of property (T) for regular graphs. We then prove the basic…
Here we consider the image of the principal minor map of symmetric matrices over an arbitrary unique factorization domain $R$. By exploiting a connection with symmetric determinantal representations, we characterize the image of the…
The behavior of objects associated with general extended affine Lie algebras is typically distinct from their counterparts in affine Lie algebras. Our research focuses on studying characters and Cartan automorphisms, which appear in the…
We present a simple combinatorial model for the characters of the irreducible integrable highest weight modules for complex symmetrizable Kac-Moody algebras. This model can be viewed as a discrete counterpart to the Littelmann path model.…
In this work we provide a novel approach for computing the coefficients of the characteristic polynomial of a square matrix. We demonstrate that each coefficient can be efficiently represented by a set of circle graphs. Thus, one can employ…
Even with the introduction of supercharacter theories, the representation theory of many unipotent groups remains mysterious. This paper constructs a family of supercharacter theories for normal pattern groups in a way that exhibit many of…
Presented approach in polynomial time calculates large number of invariants for each vertex, which won't change with graph isomorphism and should fully determine the graph. For example numbers of closed paths of length k for given starting…
If A is a homotopy cartesian square of ring spectra satisfying connectivity hypotheses, then the cube induced by Goodwillie's integral cyclotomic trace from K(A) to TC(A) is homotopy cartesian. In other words, the homotopy fiber of the…
It is known that isomorphisms of graph Jacobians induce cyclic bijections on the associated graphs. We characterize when such cyclic bijections can be strengthened to graph isomorphisms, in terms of an easily computed divisor. The result…
We consider quantum walks on a finite graphs to which infinite tails are attached. We explore how the propagating and bound states depend on the structure of the finite graph. The S-matrix for such graphs is defined. Its unitarity is proved…
In this paper, the concept of cyclic subsets in graph theory is introduced. An interesting theorem which relates to the collective Hamiltonicity of these cyclic subsets in graphs is also presented. This paper uses this theorem to construct…
We reconsider the theory of Lagrange interpolation polynomials with multiple interpolation points and apply it to linear algebra. For instance, $A$ be a linear operator satisfying a degree $n$ polynomial equation $P(A)=0$. One can see that…