Related papers: Depth and Stanley depth of multigraded modules

In that paper, we recall the notion of the multidegree for $D$-modules, as exposed in a previous paper, with a slight simplification. A particular emphasis is given on hypergeometric systems, used to provide interesting and computable…

We investigate analytically the motion of underdamped particles subject to a deterministic periodic potential and a periodic temperature. Despite the fact that an underamped particle experiences the temperature oscillation many times in its…

Let $\mathbb{K}$ be a field, and let $S=\mathbb{K}[X_1, ..., X_n]$ be the polynomial ring. Let $I$ be a monomial ideal of $S$ with up to 5 generators. In this paper, we present a computational experiment which allows us to prove that…

We show that $\depth(S/I)=0$ if and only if $\sdepth(S/I)=0$, where $I\subset S=K[x_1,...,x_n]$ is a monomial ideal. We give an algorithm to compute the Stanley depth of $S/I$, where $I\subset S=K[x_1,x_2,x_3]$ is a monomial ideal. Also, we…

We explore very fine scales of scalar dissipation in turbulent mixing, below Kolmogorov and around Batchelor scales, by performing direct numerical simulations at much finer grid resolution than is usually adopted in the past. We consider…

The scaling behaviour of the diffraction intensity near the origin is investigated for (partially) ordered systems, with an emphasis on illustrative, rigorous results. This is an established method to detect and quantify the fluctuation…

Let $J\varsubsetneq I$ be two monomial ideals of the polynomial ring $S=\mathbb{K}[x_1,\ldots,x_n]$. In this paper, we provide two lower bounds for the Stanley depth of $I/J$. On the one hand, we introduce the notion of lcm number of $I/J$,…

In this review we try to capture some of the recent excitement induced by experimental developments, but also by a large volume of theoretical and computational studies addressing multi-component nonlinear Schrodinger models and the…

The Discrete Dislocation (DD) analysis and its computional modeling have been advanced significantly over the past decade. This progress has been further magnified by the idea to couple DD with continuum mechanics analysis in association…

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 $J_{n,m}:=(x_1x_2\cdots x_m,\; x_2x_3\cdots x_{m+1},\; \ldots,\; x_{n-m+1}\cdots x_n,\; x_{n-m+2}\cdots x_nx_1, \ldots, x_nx_1\cdots x_{m-1})$ be the $m$-path ideal of the cycle graph of length $n$, in the ring of polynomials…

We study the size and regularity properties of level sets of continuous functions with bounded upper-scaled and lower-scaled oscillation.

The Lyubeznik size of a monomial ideal $I$ of a polynomial ring $S$ is a lower bound for the Stanley depth of $I$ decreased by $1$. A proof given by Herzog-Popescu-Vladoiu had a gap which is solved here.

Let F. be a any free resolution of a Z^n-graded submodule of a free module over the polynomial ring K[x_1, ..., x_n]. We show that for a suitable term order on F., the initial module of the p'th syzygy module Z_p is generated by terms…

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}…

Let $J_{n,m}:=(x_1x_2\cdots x_m,\; x_2x_3\cdots x_{m+1},\; \ldots,\; x_{n-m+1}\cdots x_n,\; x_{n-m+2}\cdots x_nx_1, \ldots, x_nx_1\cdots x_{m-1})$ be the $m$-path ideal of the cycle graph of length $n$, in the ring $S=K[x_1,\ldots,x_n]$.…

We describe a computational investigation of tunneling at finite energy in a weakly coupled quantum mechanical system with two degrees of freedom. We compare a full quantum mechanical analysis to the results obtained by making use of a…

The purpose of this paper is to explain about the depth sensitivity of the Hilbert coefficients defined for finitely generated graded modules over graded rings. The main result generalize the well known fact that the Cohen-Macaulayness of…

We study doubly-periodic monopoles, also called monopole walls, determining their spectral data and computing the dimensions of their moduli spaces. Using spectral data we identify the moduli, and compare our results with a perturbative…

Submodularity is a key property in discrete optimization. Submodularity has been widely used for analyzing the greedy algorithm to give performance bounds and providing insight into the construction of valid inequalities for mixed-integer…