Related papers: A Combinatorial Algorithm to Find the Minimal Free…
Strongly stable monomial ideals are important in algebraic geometry, commutative algebra, and combinatorics. Prompted, for example, by combinatorial approaches for studying Hilbert schemes and the existence of maximal total Betti numbers…
Algebraic and combinatorial properties of a monomial ideal and its radical are compared.
In this thesis we investigate certain types of monomial ideals of polynomial rings over fields. We are interested in minimal free resolutions of these ideals (or equivalently the quotients of the polynomial ring by the ideals) considered as…
Let $K$ be a field, and $A=K[a_1,\ldots ,a_n]$ a solvable polynomial algebra in the sense of [K-RW, {\it J. Symbolic Comput.}, 9(1990), 1--26]. Based on the Gr\"obner basis theory for $A$ and for free modules over $A$, an elimination theory…
We study the minimal bigraded free resolution of an ideal with three generators of the same bidegree, contained in the bihomogeneous maximal ideal $ \langle s,t\rangle \cap \langle u,v \rangle$ of the bigraded ring K[s,t;u,v]. Our analysis…
We construct minimal cellular resolutions of squarefree monomial ideals arising from hyperplane arrangements, matroids and oriented matroids. These are Stanley-Reisner ideals of complexes of independent sets, and of triangulations of…
Numerical invariants of a minimal free resolution of a module $M$ over a regular local ring $(R,\n)$ can be studied by taking advantage of the rich literature on the graded case. The key is to fix suitable $\n$-stable filtrations ${\mathbb…
The goal of this work is to study the ideals of the Goldman Lie algebra $S$. To do so, we construct an algebra homomorphism from $S$ to a simpler algebraic structure, and focus on finding ideals of this new structure instead. The structure…
Working in a polynomial ring $S=\mathbf{k}[x_1,\ldots,x_n]$ where $\mathbf{k}$ is an arbitrary commutative ring with $1$, we consider the $d^{th}$ Veronese subalgebras $R=S^{(d)}$, as well as natural $R$-submodules $M=S^{(\geq r, d)}$…
Let $k$ be a field with characteristic zero, $R$ be the ring $k[x_1, \cdots, x_n]$ and $I$ be a monomial ideal of $R$. We study the Artinian local algebra $R/I$ when considered as an $R$-module $M$. We show that the largest reduced…
Combinatorial samplers are algorithmic schemes devised for the approximate- and exact-size generation of large random combinatorial structures, such as context-free words, various tree-like data structures, maps, tilings, RNA molecules.…
Let $R$ be a finite ring and let $M, N$ be two finite left $R$-modules. We present two distinct deterministic algorithms that decide in polynomial time whether or not $M$ and $N$ are isomorphic, and if they are, exhibit an isomorphism. As…
In this paper we extend one direction of Fr\"oberg's theorem on a combinatorial classification of quadratic monomial ideals with linear resolutions. We do this by generalizing the notion of a chordal graph to higher dimensions with the…
Let $K$ be a field of characteristic zero, let $I \subset S = K[x_1,\dots,x_n]$ be a homogeneous ideal, and let $\partial(I)$ be its gradient ideal. We study the relationship between $\mathrm{reg}\,I$ and $\mathrm{reg}\,\partial(I)$. While…
Let $S={\Bbb K}[x_1,\dots,x_n]$ denote a polynomial ring over a field $\Bbb K$. Given a monomial ideal $I$ and a finitely generated multigraded $M$ over $S$, we follow Herzog's method to construct a multigraded free $S$-resolution of $M/IM$…
The aim of this work is to reduce the complexity of the available algorithms for computing the generator sets of a semigroup ideal by using the Hermite normal form. In order to achieve it we introduce the concept of decomposable semigroup.…
We present a novel algebraic combinatorial view on low-rank matrix completion based on studying relations between a few entries with tools from algebraic geometry and matroid theory. The intrinsic locality of the approach allows for the…
Let $I,J$ be componentwise linear ideals in a polynomial ring $S$. We study necessary and sufficient conditions for $I+J$ to be componentwise linear. We provide a complete characterization when $\dim S=2$. As a consequence, any…
Recent results of Kahle and Miller give a method of constructing primary decompositions of binomial ideals by first constructing "mesoprimary decompositions" determined by their underlying monoid congruences. Monoid congruences (and…
We consider anti-unification for simply typed lambda terms in associative, commutative, and associative-commutative theories and develop a sound and complete algorithm which takes two lambda terms and computes their generalizations in the…