Related papers: How to compute the Stanley depth of a module

The aim of this paper is to study the Stanley depth of symbolic powers of a squarefree monomial ideal. We prove that for every squarefree monomial ideal $I$ and every pair of integers $k, s\geq 1$, the inequalities ${\rm sdepth}…

Let $\mathbb{K}$ be a field and $S=\mathbb{K}[x_1,\dots,x_n]$ be the polynomial ring in $n$ variables over $\mathbb{K}$. Let $G$ be a graph with $n$ vertices. Assume that $I=I(G)$ is the edge ideal of $G$ and $p$ is the number of its…

In this paper we prove parts of a conjecture of Herzog giving lower bounds on the rank of the free modules appearing in the linear strand of a graded $k$-th syzygy module over the polynomial ring. If in addition the module is…

We prove strengthened lower bounds for constant-depth set-multilinear formulas. More precisely, we show that over any field, there is an explicit polynomial $f$ in VNP defined over $n^2$ variables, and of degree $n$, such that any…

We introduce a natural notion of depth that applies to individual cutting planes as well as entire families. This depth has nice properties that make it easy to work with theoretically, and we argue that it is a good proxy for the practical…

We define "sliding functors", which are exact endofunctors of the category of multi-graded modules over a polynomial ring. They preserve several invariants of modules, especially the (usual) depth and Stanley depth. In a similar way, we can…

Let $I_{n,m}:=(x_1x_2\cdots x_m,\; x_2x_3\cdots x_{m+1},\; \ldots,\; x_{n-m+1}\cdots x_n)$ be the $m$-path ideal of the path graph of length $n$, in the ring $S=K[x_1,\ldots,x_n]$. We prove that: $$\mathtt{depth}(S/I_{n,m}^t)=\begin{cases}…

We consider the computation of syzygies of multivariate polynomials in a finite-dimensional setting: for a $\mathbb{K}[X_1,\dots,X_r]$-module $\mathcal{M}$ of finite dimension $D$ as a $\mathbb{K}$-vector space, and given elements…

We prove that if $I$ is a monomial ideal with linear quotients in a ring of polynomials $S$ in $n$ indeterminates and $\operatorname{depth}(S/I)=n-2$, then $\operatorname{sdepth}(S/I)=n-2$ and, if $I$ is squarefree,…

In lattice QCD the calculation of disconnected quark loops from the trace of the inverse quark matrix has large noise variance. A multilevel Monte Carlo method is proposed for this problem that uses different degree polynomials on a…

For a monomial ideal $I\subset S=K[x_1,...,x_n]$, we show that $\sdepth(S/I)\geq n-g(I)$, where $g(I)$ is the number of the minimal monomial generators of $I$. If $I=vI'$, where $v\in S$ is a monomial, then we see that…

Let $S$ be a polynomial algebra over a field. We study classes of monomial ideals (as for example lexsegment ideals) of $S$ having minimal depth. In particular, Stanley's conjecture holds for these ideals. Also we show that if Stanley's…

This paper is concerned with lifting modules along a surjective map of noetherian local rings, say $\varphi \colon R \twoheadrightarrow S$. A finitely generated $R$-module $L$ is a naive lift of an $S$-module $M$ if $L \otimes_R S \cong M$.…

Given a lattice polygon $P$ with $g$ interior lattice points, we associate to it the moduli space of tropical curves of genus $g$ with Newton polygon $P$. We completely classify the possible dimensions such a moduli space can have. For…

A procedure for the construction and the classification of multilattices in arbitrary dimension is proposed. The algorithm allows to determine explicitly the location of the points of a multilattice given its space group, and to determine…

The first half of this paper is largely expository, wherein we present a systematic combinatorial approach to the theory of polynomial (semi)invariants and multilinear invariants of several vectors and covectors, for the classical groups.…

We show that any $n$-variate polynomial computable by a syntactically multilinear circuit of size $\operatorname{poly}(n)$ can be computed by a depth-$4$ syntactically multilinear ($\Sigma\Pi\Sigma\Pi$) circuit of size at most…

Let $\mathbb{K}$ be a field and $S=\mathbb{K}[x_1,\dots,x_n]$ be the polynomial ring in $n$ variables over the field $\mathbb{K}$. Suppose that $\mathcal{C}$ is a chordal clutter with $n$ vertices and assume that the minimum edge…

We prove that the Stanley's conjecture holds for monomial ideals $I\subset K[x_1,...,x_n]$ generated by at most $2n-1$ monomials, i.e. $sdepth(I)\geq depth(I)$.

Let $\mathbf m=(x_1,\ldots,x_n)$ be the maximal graded ideal of $S:=K[x_1,\ldots,x_n]$. We present a new method for computing the Hilbert depth of powers of $\mathbf m$.