Related papers: Gorenstein graphic matroids
A graph is chordal if every cycle of length at least four has a chord. In 1961, Dirac characterized chordal graphs as those graphs that can be built from complete graphs by repeated clique-sums. Generalizing this, we consider the class of…
In this paper, the principal tool to describe transversal polymatroids with Gorenstein base ring is polyhedral geometry, especially the $Danilov-Stanley$ theorem for the characterization of canonical module. Also, we compute the…
It is proved that the broken circuit complex of an ordered matroid is Gorenstein if and only if it is a complete intersection. Several characterizations for a matroid that admits such an order are then given, with particular interest in the…
Normal affine algebraic varieties in characteristic 0 are uniquely determined (up to isomorphism) by the Lie algebra of derivations of their coordinate ring. This is not true without the hypothesis of normality. But, we show that (in…
A transversal matroid whose dual is also transversal is called bi-transversal. Let $G$ be an undirected graph with vertex set $V$. In this paper, for every subset $W$ of $V$, we associate a bi-transversal matroid to the pair $(G,W)$. We…
Extending work of Bielawski-Dancer and Konno, we develop a theory of toric hyperkahler varieties, which involves toric geometry, matroid theory and convex polyhedra. The framework is a detailed study of semi-projective toric varieties,…
In 1961, Dirac showed that chordal graphs are exactly the graphs that can be constructed from complete graphs by a sequence of clique-sums. In an earlier paper, by analogy with Dirac's result, we introduced the class of $GF(q)$-chordal…
We characterize the shifted simple graphs and the $3$-uniform shifted hypergraphs whose inverse image under exterior shifting is the set of bases of a matroid: those are exactly the hypergraphs whose hyperedges form an initial lex-segment.…
We introduce delta-graphic matroids, which are matroids whose bases form graphic delta-matroids. The class of delta-graphic matroids contains graphic matroids as well as cographic matroids and is a proper subclass of the class of regular…
Each point $x$ in Gr$(r,n)$ corresponds to an $r \times n$ matrix $A_x$ which gives rise to a matroid $M_x$ on its columns. Gel'fand, Goresky, MacPherson, and Serganova showed that the sets $\{y \in \mathrm{Gr}(r,n) | M_y = M_x\}$ form a…
Graphings serve as limit objects for bounded-degree graphs. We define the ``cycle matroid'' of a graphing as a submodular setfunction, with values in [0,1], which generalizes (up to normalization) the cycle matroid of finite graphs. We…
Matroid theory is often thought of as a generalization of graph theory. In this paper we propose an analogous correspondence between embedded graphs and delta-matroids. We show that delta-matroids arise as the natural extension of graphic…
A well-known conjecture of Stanley is that the h-vector of a matroid is a pure O-sequence. There have been numerous papers with partial progress on this conjecture, but it is still wide open. In particular, for graphic matroids coming from…
Previous work of Chan--Church--Grochow and Baker--Wang shows that the set of spanning trees in a plane graph $G$ is naturally a torsor for the Jacobian group of $G$. Informally, this means that the set of spanning trees of $G$ naturally…
In the present paper, we consider the problem when the toric ring arising from an integral cyclic polytope is Cohen-Macaulay by discussing Serre's condition and we give a complete characterization when that is Gorenstein. Moreover, we study…
The geometric vertex decomposability property for polynomial ideals is an ideal-theoretic generalization of the vertex decomposability property for simplicial complexes. Indeed, a homogeneous geometrically vertex decomposable ideal is…
To any graph $G$ one can associate a toric variety $X(\mathcal{P}G)$, obtained as a blowup of projective space along coordinate subspaces corresponding to connected subgraphs of $G$. The polytope of this toric variety is the graph…
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…
The perfectly matchable subgraph polytope of a graph is a (0,1)-polytope associated with the vertex sets of matchings in the graph. In this paper, we study algebraic properties (compressedness, Gorensteinness) of the toric rings of…
Let $X$ be a normal projective variety and $f:X\to X$ a non-isomorphic polarized endomorphism. We give two characterizations for $X$ to be a toric variety. First we show that if $X$ is $\mathbb{Q}$-factorial and $G$-almost homogeneous for…