Related papers: A combinatorial approach to the algebra of hyperma…
Starting from the expression for the superdeterminant of (xI-M), where M is an arbitrary supermatrix, we propose a definition for the corresponding characteristic polynomial and we prove that each supermatrix satisfies its characteristic…
We introduce a Whitney polynomial for hypermaps and use it to generalize the results connecting the circuit partition polynomial to the Martin polynomial and the results on several graph invariants.
This version is similar to math.CO/0210113. We've changed Conjectures 1.1 and 1.2 so that they cover arbitrary graphs(digraphs). Let G be an arbitrary graph(digraph). Then - in polynomial time - either an algorithm obtains a hamilton…
Because of the significant increase in size and complexity of the networks, the distributed computation of eigenvalues and eigenvectors of graph matrices has become very challenging and yet it remains as important as before. In this paper…
An invariant for cospectral graphs is a property shared by all cospectral graphs. In this paper, we establish three novel arithmetic invariants for cospectral graphs, revealing deep connections between spectral properties and combinatorial…
Graph invariants provide a powerful analytical tool for investigation of abstract structures of graphs. They, combined in convenient relations, carry global and general information about a graph and its various substructures such as cycle…
We describe and compare algorithms for computing supersingular isogeny graphs. Along the way, we obtain a formula for the trace of the adjacency matrix of a general supersingular isogeny graph, and we prove a conjecture recently posed by…
We discuss algebraic and combinatorial aspects of the Hamiltonian normal form theory. The main objective is to describe the normal form near a singular point purely in terms of the original Hamiltonian, avoiding the normalization procedure.…
We give a formula for computing the characteristic polynomial for certain hyperplane arrangements in terms of the number of bipartite graphs of given rank and cardinality.
This paper extends the Bakry-\'{E}mery theorem connecting the Ricci curvature and log-Sobolev inequalities to the matrix-valued setting. Using tools from noncommuative geometry, it is shown that for a right invariant second order…
We present recent advances in harmonic analysis on infinite graphs. Our approach combines combinatorial tools with new results from the theory of unbounded Hermitian operators in Hilbert space, geometry, boundary constructions, and spectral…
We note implications of the Cayley-Sylvester theory of invariants and covariants for the Hamilton equations generated by cubic and quartic Hamiltonian functions.
In this paper we will prove that there exists a covariant functor from the category of schemes to the category of graphs. This functor provides a combination between algebraic varieties and combinatorial graphs so that the invariants…
Starting from a mistake done by a student, we discover an unexpected method of finding both eigenvectors for a $2\times2$ matrix with distinct eigenvalues in a single computation. We discuss a connection with the Cayley-Hamilton theorem,…
We present a few combinatorial identities which were encountered in our work on the spectral theory of quantum graphs. They establish a new connection between the theory of random matrix ensembles and combinatorics.
In this paper, we will show dichotomy theorems for the computation of polynomials corresponding to evaluation of graph homomorphisms in Valiant's model. We are given a fixed graph $H$ and want to find all graphs, from some graph class,…
We use the homological perturbation lemma to produce explicit formulas computing the class in the twisted de Rham complex represented by an arbitrary polynomial. This is a non-asymptotic version of the method of Feynman diagrams. In…
This article discusses invariant theories in some exterior algebras, which are closely related to Amitsur-Levitzki type theorems. First we consider the exterior algebra on the vector space of square matrices of size $n$, and look at the…
In this paper we propose a graph superalgebra which is the supersymmetric analogue of Leavitt path algebras. We find a basis for these superalgebras and characterize when they have polynomial growth.
We define a special matrix multiplication among a special subset of $2N\x 2N$ matrices, and study the resulting (non-associative) algebras and their subalgebras. We derive the conditions under which these algebras become alternative…