Related papers: An alternative algorithm for computing the Betti t…
We describe an algorithm for finding sharp upper bounds for the total Betti numbers of a saturated ideal given certain constraints on its Hilbert function. This algorithm is implemented in the Macaulay2 package, MaxBettiNumbers, along with…
Let $\R$ be a real closed field, $ {\mathcal Q} \subset \R[Y_1,...,Y_\ell,X_1,...,X_k], $ with $ \deg_{Y}(Q) \leq 2, \deg_{X}(Q) \leq d, Q \in {\mathcal Q}, #({\mathcal Q})=m$, and $ {\mathcal P} \subset \R[X_1,...,X_k] $ with $\deg_{X}(P)…
Let M in k[x,y] be a monomial ideal M=(m_1,m_2,...,m_r), where the m_i are a minimal generating set of M. We construct an explicit free resolution of k over S=k[x,y]/M for all monomial ideals M, and provide recursive formulas for the Betti…
This paper presents some useful mathematical results involved in football table prediction. In addition, some empirical results indicate that an alternative methodology for football table prediction may produce high quality forecasts with…
We introduce a construction, called linearization, that associates to any monomial ideal $I$ an ideal $\mathrm{Lin}(I)$ in a larger polynomial ring. The main feature of this construction is that the new ideal $\mathrm{Lin}(I)$ has linear…
The purpose of this note is to introduce a multiplication on the set of homogeneous polynomials of fixed degree d, in a way to provide a duality theory between monomial ideals of K[x_1,\ldots,x_d] generated in degrees \leq n and block…
Topological data analysis has emerged as a powerful tool for analyzing large-scale data. An abstract simplicial complex, in principle, can be built from data points, and by using tools from homology, topological features could be…
Let $\Gamma$ be a rooted tree and let $t$ be a positive integer. We study algebraic invariants and properties of the path ideal generated by monomial corresponding to paths of length $(t-1)$ in $\Gamma$. In particular, we give a recursive…
We introduce the notion of a Betti-linear monomial ideal, which generalizes the notion of lattice-linear monomial ideal introduced by Clark. We provide a characterization of Betti-linearity in terms of Tchernev's poset construction. As an…
We investigate resolutions of letterplace ideals of posets. We develop topological results to compute their multigraded Betti numbers, and to give structural results on these Betti numbers. If the poset is a union of no more than $c$…
In this note we calculate the multiplier ideal associated to an arbitrary monomial ideal in C^n. We discuss applications to the calculation of log canonical thresholds.
Cut ideals, introduced by Sturmfels and Sullivant, are used in phylogenetics and algebraic statistics. We study the minimal free resolutions of cut ideals of tree graphs. By employing basic methods from topological combinatorics, we obtain…
Recently, a classical algorithm for estimating the normalized Betti number of an arbitrary simplicial complex was proposed. Motivated by a quantum algorithm with a similar Monte Carlo structure and improved sample complexity, we give a more…
In this paper we describe an efficient involutive algorithm for constructing Groebner bases of polynomial ideals. The algorithm is based on the concept of involutive monomial division which restricts the conventional division in a certain…
In this paper we study the normality of monomial ideals using linear programming and graph theory. We give normality criteria for monomial ideals, for ideals generated by monomials of degree two, and for edge ideals of graphs and clutters…
A monomial ideal $I$ admits a Betti splitting $I=J+K$ if the Betti numbers of $I$ can be determined in terms of the Betti numbers of the ideals $J,K$ and $J \cap K$. Given a monomial ideal $I$, we prove that $I=J+K$ is a Betti splitting of…
We compute a minimal bigraded resolution of the Rees Algebra associated to a proper rational parametrization of a monomial plane curve. We describe explicitly both the bigraded Betti numbers and the maps of the resolution in terms of a…
We determine, in a polynomial ring over a field, the arithmetical rank of certain ideals generated by a set of monomials and one binomial.
A simple formula computing the multiplier ideal of a monomial ideal on an arbitrary affine toric variety is given. Variants for the multiplier module and test ideals are also treated.
There is a natural infinite graph whose vertices are the monomial ideals in a polynomial ring. The definition involves Gr\"obner bases or the action of an algebraic torus. We present algorithms for computing the (affine schemes…