Related papers: A combinatorial proof of the trace Cayley-Hamilton…
Starting from the characteristic polynomial for ordinary matrices we give a combinatorial deduction of the Mandelstam identities and viceversa, thus showing that the two sets of relations are equivalent. We are able to extend this…
A characterization is given for directed graphs that yield graph $C^*$-algebras with continuous trace. This is established for row-finite graphs with no sources first using a groupoid approach, and extended to the general case via the…
Let $G$ be a finite abelian group, let $E$ be a subset of $G$, and form the Cayley (directed) graph of $G$ with connecting set $E$. We explain how, for various matrices associated to this graph, the spectrum can be used to give information…
A proof of Sharkovsky's Theorem is given. It is shown how this proof naturally generalizes to looking at maps on graphs and to Sharkovsky-type theorems for these maps. The paper is written at an elementary level and is meant as an…
We investigate a class of combinatory algebras, called ribbon combinatory algebras, in which we can interpret both the braided untyped linear lambda calculus and framed oriented tangles. Any reflexive object in a ribbon category gives rise…
We define a trace map for every cohomological correspondence in the motivic stable homotopy category over a general base scheme, which takes values in the twisted bivariant groups. Local contributions to the trace map give rise to quadratic…
For families of orthogonal and symplectic types quantum matrix (QM-) algebras, we derive corresponding versions of the Cayley-Hamilton theorem. For a wider family of Birman-Murakami-Wenzl type QM-algebras, we investigate a structure of its…
For each commutative, graded algebra with finite dimension in each degree, we construct a graded cohomology theory for graphs whose graded Euler characteristic is the chromatic polynomial of the graph. This extends our previous work which…
Trace diagrams are structured graphs with edges labeled by matrices. Each diagram has an interpretation as a particular multilinear function. We provide a rigorous combinatorial definition of these diagrams using a notion of signed graph…
The paper contains a combinatorial theorem (the sequence of Newton polygons of a reccurent sequence of polynomials is quasi-linear) and two applications of it in classical and quantum topology, namely in the behavior of the $A$-polynomial…
Let $\Gamma$ be a finite graph and let $A(\Gamma)$ be the corresponding right-angled Artin group. We characterize the Hamiltonicity of $\Gamma$ via the structure of the cohomology algebra of $A(\Gamma)$. In doing so, we define and develop a…
We apply some basic notions from combinatorial topology to establish various algebraic properties of edge ideals of graphs and more general Stanley-Reisner rings. In this way we provide new short proofs of some theorems from the literature…
We present a method for associating labeled directed graphs to finite-dimensional Lie algebras, thereby enabling rapid identification of key structural algebraic features. To formalize this approach, we introduce the concept of…
The classic Cayley identity states that \det(\partial) (\det X)^s = s(s+1)...(s+n-1) (\det X)^{s-1} where X=(x_{ij}) is an n-by-n matrix of indeterminates and \partial=(\partial/\partial x_{ij}) is the corresponding matrix of partial…
We explicate the combinatorial/geometric ingredients of Arthur's proof of the convergence and polynomiality, in a truncation parameter, of his non-invariant trace formula. Starting with a fan in a real, finite dimensional, vector space and…
We develop a theory of semialgebra Grassmann triples via Hasse-Schmidt derivations, which formally generalizes results such as the Cayley-Hamilton theorem in linear algebra, thereby providing a unified approach to classical linear algebra…
We provide a new construction of the topological cyclic homology $TC(C)$ of any spectrally-enriched $\infty$-category $C$, which affords a precise algebro-geometric interpretation of the cyclotomic trace map $K(X) \to TC(X)$ from algebraic…
We prove a general duality theorem for tangle-like dense objects in combinatorial structures such as graphs and matroids. This paper continues, and assumes familiarity with, the theory developed in [6]
Graph polynomials are deemed useful if they give rise to algebraic characterizations of various graph properties, and their evaluations encode many other graph invariants. Algebraic: The complete graphs $K_n$ and the complete bipartite…
For Hamiltonian circle actions on compact, connected, four-dimensional manifolds, we give a generators and relations description for the even part of the equivariant cohomology, as an algebra over the equivariant cohomology of a point. This…