Results 91 to 100 of about 237,348 (199)

An algorithm to compute the Stanley depth of monomial ideals

Le Matematiche, 2008
In this article we describe an algorithm to compute the Stanley depth of I=J where I and J are monomial ideals. We describe also an implementation in CoCoA.
Giancarlo Rinaldo
doaj  

POLYMATROIDAL IDEALS AND LINEAR RESOLUTION [PDF]

Journal of Algebraic Systems
Let $S=K[x_1,\ldots,x_n]$ be a polynomial ring over a field $K$ and$I\subset S$ be a monomial ideal with a linearresolution. Let$\frak{m}=(x_1,\ldots,x_n)$ be the unique homogeneous maximal ideal and $I\frak{m}$ be apolymatroidal ideal.
Somayeh Bandari
doaj   +1 more source

Cartwright–Sturmfels Hilbert schemes

Journal of the London Mathematical Society, Volume 114, Issue 3, September 2026.
Abstract Let S$S$ be the Cox ring of a product of r$r$ projective spaces. In this paper, we study the Cartwright–Sturmfels Hilbert schemes of S$S$, which are multigraded Hilbert schemes that parameterize only radical ideals. Our main result shows that these Hilbert schemes are always smooth and irreducible if the Picard rank r$r$ is at most 2.
Ritvik Ramkumar, Alessio Sammartano
wiley   +1 more source

h$h$‐Function, Hilbert–Kunz density function and Frobenius–Poincaré function

Journal of the London Mathematical Society, Volume 114, Issue 3, September 2026.
Abstract Given ideals I,J$I,J$ of a noetherian local ring (R,m)$(R, \mathfrak {m})$ such that I+J$I+J$ is m$\mathfrak {m}$‐primary and a finitely generated R$R$‐module M$M$, we associate an invariant of (M,R,I,J)$(M,R,I,J)$ called the h$h$‐function.
Cheng Meng, Alapan Mukhopadhyay
wiley   +1 more source

Self‐Similar Blowup for the Cubic Schrödinger Equation

Communications on Pure and Applied Mathematics, Volume 79, Issue 8, Page 1831-1918, August 2026.
ABSTRACT We give a rigorous proof for the existence of a finite‐energy, self‐similar solution to the focusing cubic Schrödinger equation in three spatial dimensions. The proof is computer‐assisted and relies on a fixed point argument that shows the existence of a solution in the vicinity of a numerically constructed approximation.
Roland Donninger, Birgit Schörkhuber
wiley   +1 more source

Generalizing Fröberg's Theorem on Ideals with Linear Resolutions

, 2013
In 1990, Fröberg presented a combinatorial classification of the quadratic square-free monomial ideals with linear resolutions. He showed that the edge ideal of a graph has a linear resolution if and only if the complement of the graph is chordal ...
Connon, Emma
core  

Bounds for the regularity of monomial ideals

Le Matematiche, 1998
See directly the article.
Anne Frühbis-Krüger, Naoki Terai
doaj  

New methods for constructing shellable simplicial complexes

پژوهش‌های ریاضی, 2022
A clutter $mathcal{C}$ with vertex set $[n]$ is an antichain of subsets of $[n]$, called circuits, covering all vertices. The clutter is $d$-uniform if all of its circuits have the same cardinality $d$.
Mohammad Farrokhi D. G., Ali Akbar Yazdan Pour   +1 more
doaj  

Regularity of Squarefree Monomial Ideals [PDF]

, 2014
We survey a number of recent studies of the Castelnuovo-Mumford regularity of squarefree monomial ideals. Our focus is on bounds and exact values for the regularity in terms of combinatorial data from associated simplicial complexes and/or hypergraphs.
openaire   +2 more sources

ON THE STANLEY DEPTH OF EDGE IDEALS OF LINE AND CYCLIC GRAPHS

Romanian Journal of Mathematics and Computer Science, 2015
We prove that the edge ideals of line and cyclic graphs and their quotient rings satisfy the Stanley conjecture. We compute the Stanley depth for the quotient ring of the edge ideal associated to a cycle graph of length n, given a precise formula for n ≡
MIRCEA CIMPOEAS
doaj