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

We give several bounds for $sdepth_S(I+J)$, $sdepth_S(I\cap J)$, $sdepth_S(S/(I+J))$, $sdepth_S(S/(I\cap J))$, $sdepth_S(I:J)$ and $sdepth_S(S/(I:J))$ where $I,J\subset S=K[x_1,...,x_n]$ are monomial ideals. Also, we give several equivalent…

We prove a formula for the multidegrees of a rational map defined by generalized monomials on a projective variety, in terms of integrals over an associated Newton region. This formula leads to an expression of the multidegrees as volumes…

A theorem of Scott gives an upper bound for the normalized volume of lattice polygons with exactly $i>0$ interior lattice points. We will show that the same bound is true for the normalized volume of lattice polytopes of degree 2 even in…

Let M be a finitely generated submodule of a free module over a multivariate polynomial ring with coefficients in a discrete coherent ring. We prove that its module MLT(M ) of leading terms is countably generated and provide an algorithm…

Motivated by finding analogues of elliptic curve point counting techniques, we introduce one deterministic and two new Monte Carlo randomized algorithms to compute the characteristic polynomial of a finite rank-two Drinfeld module. We…

We study how the complexity of modular circuits computing AND depends on the depth of the circuits and the prime factorization of the modulus they use. In particular our construction of subexponential circuits of depth 2 for AND helps us to…

Tukey depth function is one of the most famous multivariate tools serving robust purposes. It is also very well known for its computability problems in dimensions $p \ge 3$. In this paper, we address this computing issue by presenting two…

A finitely generated module over the ring L=Z[t, t^{-1}] of integer Laurent polynomials that has no Z-torsion is determined by a pair of sub-lattices of L^d. Their indices are the absolute values of the leading and trailing coefficients of…

Let $P$ be a set of $n$ points in $d$-dimensions. The simplicial depth, $\sigma_P(q)$ of a point $q$ is the number of $d$-simplices with vertices in $P$ that contain $q$ in their convex hulls. The simplicial depth is a notion of data depth…

Let $S$ be a multigraded polynomial ring such that the degree of each variable is a unit vector; so $S$ is the homogeneous coordinate ring of a product of projective spaces. In this setting, we characterize the formal Laurent series which…

We investigate the depth of the tensor product of finitely generated modules over local rings. One of the main ingredients of our approach is a lifting construction introduced by Huneke, Jorgensen, and Wiegand. We recover a result of…

Recently, I defined a squarefree module over a polynomial ring $S = k[x_1, >..., x_n]$ generalizing the Stanley-Reisner ring $k[\Delta] = S/I_\Delta$ of a simplicial complex $\Delta \subset 2^{1, ..., n}$. In this paper, from a squarefree…

In this paper we go on to discuss about Stanley's theorem in Integer partitions. We give two different versions for the proof of the generalization of Stanley's theorem illustrating different techniques that may be applied to profitably…

Cochran defined the nth-order integral Alexander module of a knot in the three sphere as the first homology group of the knot's (n+1)th-iterated abelian cover. The case n=0 gives the classical Alexander module (and polynomial). After a…

We apply an algorithm for measuring the volume of polytopes described by Jim Lawrence to polytropes. By using a tropical form of Cramer's rule, we found an efficient way to find all pseudovertices which are necessary for computing the…

We present an algorithm for computing approximate $\ell_p$ Lewis weights to high precision. Given a full-rank $\mathbf{A} \in \mathbb{R}^{m \times n}$ with $m \geq n$ and a scalar $p>2$, our algorithm computes $\epsilon$-approximate…

Let $K$ be a field, $A$ a standard graded $K$-algebra and $M$ a finitely generated graded $A$-module. Inspired by our previous works, we study the Hilbert depth of $h_M$, that is $$\operatorname{hdepth}(h_M)=\max\{d\;:\; \sum\limits_{j\leq…

We construct a class of lattices in three and higher dimensions for which the number of dimer coverings can be determined exactly using elementary arguments. These lattices are a generalization of the two-dimensional kagome lattice, and the…

We show that computing the interleaving distance between two multi-graded persistence modules is NP-hard. More precisely, we show that deciding whether two modules are $1$-interleaved is NP-complete, already for bigraded, interval…

The Ehrhart polynomial $ehr_P (n)$ of a lattice polytope $P$ gives the number of integer lattice points in the $n$-th dilate of $P$ for all integers $n\geq 0$. The degree of $P$ is defined as the degree of its $h^\ast$-polynomial, a…