Related papers: Minimal set of binomial generators for certain Ver…

In 1980, White conjectured that the toric ideal of a matroid is generated by quadratic binomials corresponding to a symmetric exchange. In this paper, we compute Gr\"obner bases of toric ideals associated with matroids and show that, for…

Let $P_k$ be the graded polynomial algebra $\mathbb F_2[x_1,x_2,\ldots ,x_k]$ over the prime field with two elements, $\mathbb F_2$, with the degree of each $x_i$ being 1. We study the hit problem, set up by Frank Peterson, of finding a…

Many polytopes arising in polyhedral combinatorics are linear projections of higher-dimensional polytopes with significantly fewer facets. Such lifts may yield compressed representations of polytopes, which are typically used to construct…

Let $n\geq 3$ and $r_n$ be a $3$-polytopal graph such that for every $3\leq i\leq n$, $r_n$ has at least one vertex of degree $i$. We find the minimal vertex count for $r_n$. We then describe an algorithm to construct the graphs $r_n$. A…

Given a relatively projective birational morphism $f\colon X\to Y$ of smooth algebraic spaces with dimension of fibers bounded by 1, we construct tilting relative (over $Y$) generators $T_{X,f}$ and $S_{X,f}$ in $\mathcal{D}^b(X)$. We…

We provide a multidimensional extension of previous results on the existence of polynomial progressions in dense subsets of the primes. Let $A$ be a subset of the prime lattice - the d-fold direct product of the primes - of positive…

In this paper, we study toric ideals generated by circuits. For toric ideals which have squarefree quadratic initial ideals, a sufficient condition to be generated by circuits is given. In particular, squarefree Veronese subrings, the…

We compute the minimal and the maximal bound on the number of generators of a minimal smooth monomial Togliatti system of forms of degree $d$ in $n+1$ variables, for any $d\ge 2$ and $n\geq 2$. We classify the Togliatti systems with number…

We use the lcm-lattice of a monomial ideal to study its minimal free resolutions. A new concept called a Taylor basis of a minimal free resolution is introduced and then used throughout the paper. We give a method of constructing minimal…

We study the regularity and the algebraic properties of certain lattice ideals. We establish a map I --> I\~ between the family of graded lattice ideals in an N-graded polynomial ring over a field K and the family of graded lattice ideals…

We show that the toric ideal of a lattice path polymatroid is generated by quadrics corresponding to symmetric exchanges, and give a monomial order under which these quadrics form a Gr\"obner basis. We then obtain an analogous result for…

A gain graph is a graph whose edges are orientably labelled from a group. A weighted gain graph is a gain graph with vertex weights from an abelian semigroup, where the gain group is lattice ordered and acts on the weight semigroup. For…

A minimal monomial ideal is the combinatorially simplest monomial ideal whose lcm-lattice equals a given finite atomic lattice $\hat{L}$. The minimal ideal inherits many nice properties of any ideal $I$ whose lcm-lattice also equals…

To any toric ideal $I_A$, encoded by an integer matrix $A$, we associate a matroid structure called {\em the bouquet graph} of $A$ and introduce another toric ideal called {\em the bouquet ideal} of $A$. We show how these objects capture…

In this article we determine a generating set of rational invariants of minimal cardinality for the action of the orthogonal group $\mathrm{O}_3$ on the space $\mathbb{R}[x,y,z]_{2d}$ of ternary forms of even degree $2d$. The construction…

We introduce the class of principal symmetric ideals, which are ideals generated by the orbit of a single polynomial under the action of the symmetric group. Fixing the degree of the generating polynomial, this class of ideals is…

In this paper, we determine minimal generating sets for several well-known monoids of matrices over semirings. In particular, we find minimal generating sets for the monoids consisting of: all $n\times n$ boolean matrices when $n\leq 8$;…

Let $P_k:= \mathbb F_2[x_1,x_2,\ldots,x_k]$ be the polynomial algebra over the prime field of two elements, $\mathbb F_2$, in $k$ variables $x_1, x_2, \ldots, x_k$, each of degree 1. We are interested in the Peterson hit problem of finding…

Minimal Markov bases of configurations of integer vectors correspond to minimal binomial generating sets of the assocciated lattice ideal. We give necessary and sufficient conditions for the elements of a minimal Markov basis to be (a)…

The Bratteli diagram is an infinite graph which reflects the structure of projections in a C*-algebra. We prove that every strictly ergodic unimodular Bratteli diagram of rank 2g+m-1 gives rise to a minimal geodesic lamination with the…