Search

We prove that seminormality of cut polytopes is equivalent to normality. This settles two conjectures regarding seminormality of cut polytopes.

A toric variety is constructed from a lattice polytope. It is common in algebraic combinatorics to carry this way a notion of an algebraic property from the variety to the polytope. From the combinatorial point of view, one of the most interesting constructions of toric varieties comes from the base polytope of a matroid. Matroid base polytopes and independence polytopes are Cohen--Macaulay. We study two natural stronger algebraic properties -- Gorenstein and smooth. We provide a full classifications of matroids whose independence polytope or base polytope is smooth or Gorenstein. The latter answers to a question raised by Herzog and Hibi.

The toric variety of a matroid is projectively normal, and therefore it is Cohen-Macaulay. We provide a complete graph-theoretic classification when the toric variety of a graphic matroid is Gorenstein.

Using recent work by Erman-Sam-Snowden, we show that finitely generated ideals in the ring of bounded-degree formal power series in infinitely many variables have finitely generated Gr\"obner bases relative to the graded reverse lexicographic order. We then combine this result with the first author's work on topological Noetherianity of polynomial functors to give an algorithmic proof of the following statement: ideals in polynomial rings generated by a fixed number of homogeneous polynomials of fixed degrees only have a finite number of possible generic initial ideals, independently of the number of variables that they involve and independently of the characteristic of the ground field. Our algorithm outputs not only a finite list of possible generic initial ideals, but also finite descriptions of the corresponding strata in the space of coefficients., Comment: Several minor edits

In $1980$ White conjectured that every element of the toric ideal of a matroid is generated by quadratic binomials corresponding to symmetric exchanges. We prove White's conjecture for high degrees with respect to the rank. This extends our result arXiv:1302.5236 confirming White's conjecture `up to saturation'. Furthermore, we study degrees of Gr\"{o}bner bases and Betti tables of the toric ideals of matroids of a fixed rank., Comment: final version, 16 pages

This thesis is basically devoted to matroids -- fundamental structure of combinatorial optimization -- though some of our results concern simplicial complexes, or Euclidean spaces. We study old and new problems for these structures, with combinatorial, algebraic, and topological flavor., Comment: PhD thesis in computer science, Jagiellonian University, defended 24 Jan 2014 (updated references)

In this note we prove the relation between Betti numbers of an Arf semigroup $S$ and its blowup $S'$ in the case when they have the same multiplicity $n$. The relation is then $\beta_{i,s}(S')=\beta_{i,{s+(i+1)n}}(S)$., Comment: final version, 4 pages

We give a necessary and sufficient condition for a simplicial complex to be approximately Cohen-Macaulay. Namely it is approximately Cohen-Macaulay if and only if the ideal associated to its Alexander dual is componentwise linear and generated in two consecutive degrees. This completes the result of Herzog and Hibi who proved that a simplicial complex is sequentially Cohen-Macaulay if and only if the ideal associated to its Alexander dual is componentwise linear., Comment: final version, 3 pages

We present a method of constructing non-normal very ample polytopes as a segmental fibration of unimodular graph polytopes. In many cases we explicitly compute their invariants - Hilbert function, Ehrhart polynomial, gap vector. In particular, we answer several questions posed by Beck, Cox, Delgado, Gubeladze, Haase, Hibi, Higashitani and Maclagan.

Describing minimal generating set of a toric ideal is a well-studied and difficult problem. In 1980 White conjectured that the toric ideal associated to a matroid is equal to the ideal generated by quadratic binomials corresponding to symmetric exchanges. We prove White's conjecture up to saturation, that is that the saturations of both ideals are equal. In the language of algebraic geometry this means that both ideals define the same projective scheme. Additionally we prove the full conjecture for strongly base orderable matroids., Comment: final version, 10 pages

We prove that if a pure simplicial complex of dimension d with n facets has the least possible number of (d-1)-dimensional faces among all complexes with n faces of dimension d, then it is vertex decomposable. This answers a question of J. Herzog and T. Hibi. In fact we prove a generalization of their theorem using combinatorial methods.