Related papers: Tutte Invariants for Alternating Dimaps
This is a survey recent works on topological extensions of the Tutte polynomial.
The multivariate arithmetic Tutte polynomial of arithmetic matroids is a generalization of the multivariate Tutte polynomial of matroids. In this note, we give the convolution formulas for the multivariate arithmetic Tutte polynomial of the…
On complete non-compact manifolds with bounded sectional curvature, we consider a class of self-adjoint Dirac-type operators called Dirac-Schr\"odinger operators. Assuming two Dirac-Schr\"odinger operators coincide at infinity, by previous…
To every directed graph $E$ one can associate a \emph{graph inverse semigroup} $G(E)$, where elements roughly correspond to possible paths in $E$. These semigroups generalize polycylic monoids, and they arise in the study of Leavitt path…
The first part deals with piecewise fractional linear maps with three branches. Given a map $T$ a map $S$ is called a related map if some branches of $T$ are replaced by a 'flipped' branch, namely a branch of $1-T$. The main question is if…
We numerically verify and analytically prove a winding number invariant that correctly predicts the number of edge states in one-dimensional, nearest-neighbor (between unit cells), two-band models with any complex couplings and open…
We determine the mod p cohomological invariants for several affine group schemes G in chararacteristic p. These are invariants of G-torsors with values in etale motivic cohomology, or equivalently in Kato's version of Galois cohomology…
We make some remarks on the $\mathbb{Z}/p$ Dijkgraaf-Witten invariants of 3D mapping tori and determine the asymptotic behavior of their sum over all diffeomorphism classes of genus one mapping tori.
An oriented graph is a directed graph without any cycle of length at most 2. To push a vertex of a directed graph is to reverse the orientation of the arcs incident to that vertex. Klostermeyer and MacGillivray defined push graphs which are…
A permutation graph is a graph whose edges are given by inversions of a permutation. We study the Abelian sandpile model (ASM) on such graphs. We exhibit a bijection between recurrent configurations of the ASM on permutation graphs and the…
Although structural maps such as subductions and inductions appear naturally in diffeology, one of the challenges is providing suitable analogous for submersions, immersions, and \'{e}tale maps (i.e., local diffeomorphisms) consistent with…
We introduce two graph polynomials and discuss their properties. One is a polynomial of two variables whose investigation is motivated by the performance analysis of the Bethe approximation of the Ising partition function. The other is a…
The Tutte polynomial of a graph G is a two-variable polynomial T(G;x,y) that encodes many interesting properties of the graph. We study the complexity of the following problem, for rationals x and y: take as input a graph G, and output a…
Modular operads are a special type of operad: in fact, they bear the same relationship to operads that graphs do to trees (i.e. simply connected graphs). One of the basic examples of a modular operad is the collection of…
The present work is concerned with characterizing some algebraic invariants of edge ideals of hypergraphs. To this aim, firstly, we introduce some kinds of combinatorial invariants similar to matching numbers for hypergraphs. Then we…
Line graphs are an alternative representation of graphs where each vertex of the original (root) graph becomes an edge. However not all graphs have a corresponding root graph, hence the transformation from graphs to line graphs is not…
This paper studies etale twists of derived categories of schemes and associative algebras. A general method, based on a new construction called the twisted Brauer space, is given for classifying etale twists, and a complete classification…
We study affine invariant 2D triangulation methods. That is, methods that produce the same triangulation for a point set $S$ for any (unknown) affine transformation of $S$. Our work is based on a method by Nielson [A characterization of an…
The Tutte polynomial of a graph G is a two-variable polynomial T(G;x,y) that encodes many interesting properties of the graph. We study the complexity of the following problem, for rationals x and y: given as input a planar graph G,…
In this paper, we give a new proof on a Theorem of Tutte which says that the determinants of the adjacency matrices of two hypomorphic graphs are the same. We also study the lowest eigenvectors.