Related papers: A Torelli Theorem for Graph Isomorphisms
We define pure graphs, invertible graphs, and the notion of complementation of bicoloured graphs. The study of pure graphs is motivated by two conjectures about the transition systems of eulerian graphs and by the Cycle Double Cover…
We present in this short note a polynomial graph extension procedure that can be used to improve any graph isomorphism algorithm. This construction propagates new constraints from the isomorphism constraints of the input graphs (denoted by…
We study Jacobian varieties for tropical curves. These are real tori equipped with integral affine structure and symmetric bilinear form. We define tropical counterpart of the theta function and establish tropical versions of the…
We use assembly maps to study $\mathbf{TC}(\mathbb{A}[G];p)$, the topological cyclic homology at a prime $p$ of the group algebra of a discrete group $G$ with coefficients in a connective ring spectrum $\mathbb{A}$. For any finite group, we…
To a compact tropical variety of arbitrary dimension, we associate a collection of intermediate Jacobians defined in terms of tropical homology and tropical monodromy. We then develop an Abel-Jacobi theory in the tropical setting by…
In this paper we develop three characterizations for isomorphism of graphs. The first characterization is obtained by associating certain bitableaux with the graphs. We order these bitableaux by suitably defined lexicographic order and…
To every singular reduced projective curve X one can associate many fine compactified Jacobians, depending on the choice of a polarization on X, each of which yields a modular compactification of a disjoint union of the generalized Jacobian…
We will consider P-graph complexes, where P is a cyclic operad. P-graph complexes are natural generalizations of Kontsevich's graph complexes -- for P = the operad for associative algebras it is the complex of ribbon graphs, for P = the…
We expand on some invariants used for classifying nonselfadjoint operator algebras. Specifically to nonselfadjoint operator algebras which have a conditional expectation onto a commutative diagonal we construct an edge-colored directed…
We show that any graph polynomial from a wide class of graph polynomials yields a recurrence relation on an infinite class of families of graphs. The recurrence relations we obtain have coefficients which themselves satisfy linear…
It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…
We investigate Cayley graphs of graph products by showing that graph products with vertex groups that have isomorphic Cayley graphs yield isomorphic Cayley graphs.
We prove autoduality for curves of compact type and, more generally, treelike curves with planar singularities. More precisely, we produce an isomorphism between the generalized Jacobian of such a curve and the connected component of the…
The Picard group of an undirected graph is a finitely generated abelian group, and the Jacobian is the torsion subgroup of the Picard group. These groups can be computed by using the Smith normal form of the Laplacian matrix of the graph or…
We consider Abel maps for regular smoothing of nodal curves with values in the Esteves compactified Jacobian. In general, these maps are just rational, and an interesting question is to find an explicit resolution. We translate this problem…
Given a curve defined over an algebraically closed field which is complete with respect to a nontrivial valuation, we study its tropical Jacobian. This is done by first tropicalizing the curve, and then computing the Jacobian of the…
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…
We construct and study a class of algebras associated to generalized layered graphs, i.e. directed graphs with a ranking function on their vertices. Each finite directed acyclic graph admits countably many structures of a generalized…
This paper proves the reconstruction conjecture for graphs which are isomorphic to the cube of a tree. The proof uses the reconstructibility of trees from their peripheral vertex deleted subgraphs. The main result follows from (i)…
New criteria for which Cayley graphs of cyclic groups of any order can be completely determined--up to isomorphism--by the eigenvalues of their adjacency matrices is presented. Secondly, a new construction for pairs of nonisomorphic Cayley…