相关论文: A categorification for the characteristic polynomi…
For each graph, we construct a bigraded chain complex whose graded Euler characteristic is a version of the Tutte polynomial. This work is motivated by earlier work of Khovanov, Helme-Guizon and Rong, and others.
We show that the cohomology ring of a quiver Grassmannian asssociated with a rigid quiver representation has property (S): there is no odd cohomology and the cycle map is an isomorphism; moreover, its Chow ring admits explicit generators…
The Stanley chromatic symmetric function $X_G$ of a graph $G$ is a symmetric function generalization of the chromatic polynomial, and has interesting combinatorial properties. We apply the ideas of Khovanov homology to construct a homology…
A multiplication on the 2D cohomological Hall algebra (CoHA) of the variety of commuting matrices was described by Schiffman and Vasserot. This construction can be generalised to other varieties that exist as the zero-locus of a function on…
We give an interpretation of the cohomology of an arithmetically defined group as a set of equivalence classes of lattices. We use this interpretation to give a simpler proof of the connection established by J. Rohlfs between genus and…
We introduce an affinization of the quantum Kac-Moody algebra associated to a symmetric generalized Cartan matrix. Based on the affinization, we construct a representation of the quantum Kac-Moody algebra by vertex operators from bosonic…
We generalize Baker-Bowler's theory of matroids over tracts to orthogonal matroids, define orthogonal matroids with coefficients in tracts in terms of Wick functions, orthogonal signatures, circuit sets, and orthogonal vector sets, and…
We introduce the minor-closed, dual-closed class of multi-path matroids. We give a polynomial-time algorithm for computing the Tutte polynomial of a multi-path matroid, we describe their basis activities, and we prove some basic structural…
This paper deals with lattice congruences of the weak order on the symmetric group, and initiates the investigation of the cover graphs of the corresponding lattice quotients. These graphs also arise as the skeleta of the so-called…
We prove that there is no polynomial $p(\cdot)$ with the property that a matroid $M$ can be determined to be either a lifted-graphic or frame matroid using at most $p(|M|)$ rank evaluations. This resolves two conjectures of Geelen, Gerards…
In this article we describe a new inductive approach to compute the chromatic polynomial of simple graphs and the characteristic polynomial of central hyperplane arrangements.
Khovanov homology of a link and chromatic graph homology are known to be isomorphic in a range of homological gradings that depend on the girth of a graph. We discuss patterns shared by these two homology theories. In particular, we improve…
Given an isolated, quasi-homogeneous singularity $X$ we prove that there is a group isomorphism between the group of rank one reflexive sheaves on $X$ and the free abelian group generated by $\mathbb{C}^*$-divisors, modulo linear…
We provide a short proof of the theorem that every real multivariate polynomial has a symmetric determinantal representation, which was first proved in J. W. Helton, S. A. McCullough, and V. Vinnikov, Noncommutative convexity arises from…
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…
In this article, we give a characterisation of crossed homomorphisms on Lie superalgebras as a Maurer-Cartan element of a graded Lie algebra. Using this characterisation we study cohomology of these crossed homomorphisms. As an application…
We introduce in this paper a hypercohomology version of the resonance varieties and obtain some relations to the characteristic varieties of rank one local systems on a smooth quasi-projective complex variety $M$, see Theorem (3.1) and…
We investigate the concept of definable, or inner, automorphism in the logical setting of partial Horn theories. The central technical result extends a syntactical characterization of the group of such automorphisms (called the covariant…
The Assmus-Mattson theorem gives a way to identify block designs arising from codes. This result was broadened to matroids and weighted designs. In this work we present a further two-fold generalisation: first from matroids to polymatroids…
We give a general multiplication-convolution identity for the multivariate and bivariate rank generating polynomial of a matroid. The bivariate rank generating polynomial is transformable to and from the Tutte polynomial by simple algebraic…