Related papers: Binomial fibers and indispensable binomials
In this note we define fibrations of topological stacks and establish their main properties. We prove various standard results about fibrations (fiber homotopy exact sequence, Leray-Serre and Eilenberg-Moore spectral sequences, etc.). We…
We display a new family of prime ideals with unbounded minimal number of generators in a three-dimensional power series ring over a field of characteristic zero. These primes are obtained as the kernel of a quasi-monomial algebra…
We give a complete characterization of graphs whose binomial edge ideal is licci. An important tool is a new general upper bound for the regularity of binomial edge ideals.
The number of ad-nilpotent ideals of the Borel subalgebra of the classical Lie algebra of type B_n is determined using combinatorial arguments involving a generalization of Dyck-paths. We also solve a similar problem for the untwisted…
We provide explicit formulas for key invariants of special fiber rings of ladder determinantal modules, that is, modules that are direct sums of ideals of maximal minors of a ladder matrix. Our results are given in terms of the…
We define a monodromy homomorphism for irreducible families of regular elliptic fibrations which takes values in the mapping class group of a punctured sphere. We compute the monodromy for elliptic fibrations only which contain no singular…
In this paper, we investigate the arithmetical rank of a binomial ideal $J$. We provide lower bounds for the binomial arithmetical rank and the $J$-complete arithmetical rank of $J$. Special attention is paid to the case where $J$ is the…
Generating trees are a useful technique in the enumeration of various combinatorial objects, particularly restricted permutations. Quite often the generating tree for the set of permutations avoiding a set of patterns requires infinitely…
Given a $d \times n$ integer matrix $A$, the main result is an elementary, simple-to-state algorithm that finds the largest $A$-graded ideal contained in any ideal $I$ in a polynomial ring $\Bbbk[x_1,\ldots,x_n]$. The special case where $A$…
We introduce a new class of algebras arising from graphs, called binomial edge rings. Given a graph $G$ on $d$ vertices with $n$ edges, the binomial edge ring of $G$ is defined to be the subalgebra of the polynomial ring with $2d$ variables…
Let $G$ be a finite connected simple graph and $I_{G}$ the toric ideal of the edge ring $K[G]$ of $G$. In the present paper, we study finite graphs $G$ with the property that $I_{G}$ is generated by quadratic binomials and $I_{G}$ possesses…
Let $E$ denote a general complex binary form of order $d$ (seen as a point in $\P^d$), and let $\Omega_E \subseteq \P^d$ denote the closure of its $SL_2$-orbit. In this note, we calculate the equivariant minimal generators of its defining…
We consider ideals generated by general sets of $m$-minors of an $m\times n$-matrix of indeterminates. The generators are identified with the facets of an $(m-1)$-dimensional pure simplicial complex. The ideal generated by the minors…
It is known that for a monomial ideal $I$, the number of minimal generators, $\mu(I^n)$, eventually follows a polynomial pattern for increasing $n$. In general, little is known about the power at which this pattern emerges. Even less is…
In this paper, we provide a complete description of the minimal primes of ideals generated by adjacent $2$-minors, in terms of the so-called admissible sets and associated lattice ideals. We prove that for these ideals, the properties of…
In this paper we study primality and primary decomposition of certain ideals which are generated by homogeneous degree $2$ polynomials and occur naturally from determinantal conditions. Normality is derived from these results.
We give an algorithm for computing the Teichm\"uller polynomial for a certain class of fibered alternating links associated to trees. Furthermore, we exhibit a mutant pair of such links distinguished by the Teichm\"uller polynomial.
The cut sets of a graph are special sets of vertices whose removal disconnects the graph. They are fundamental in the study of binomial edge ideals, since they encode their minimal primary decomposition. We introduce the class of accessible…
We generalize the classical lifting and recombination scheme for rational and absolute factorization of bivariate polynomials to the case of a critical fiber. We explore different strategies for recombinations of the analytic factors,…
Multiple binomial sums form a large class of multi-indexed sequences, closed under partial summation, which contains most of the sequences obtained by multiple summation of products of binomial coefficients and also all the sequences with…