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

We extend the classical notion of the spherical depth in \mathbb{R}^k, to the important setup of data on a Riemannian manifold. We show that this notion of depth satisfies a set of desirable properties. For the empirical version of this…

Tukey's depth offers a powerful tool for nonparametric inference and estimation, but also encounters serious computational and methodological difficulties in modern statistical data analysis. This paper studies how to generalize and compute…

We give upper bounds on the minimal degree of a model in $\mathbb{P}^2$ and the minimal bidegree of a model in $\mathbb{P}^1 \times \mathbb{P}^1$ of the curve defined by a given Laurent polynomial, in terms of the combinatorics of the…

We study the complexity of computing the mixed-integer hull $\operatorname{conv}(P\cap\mathbb{Z}^n\times\mathbb{R}^d)$ of a polyhedron $P$. Given an inequality description, with one integer variable, the mixed-integer hull can have…

In this paper, we study the algebraic formula complexity of multiplying $d$ many $2\times 2$ matrices, denoted $\mathrm{IMM}_{d}$, and show that the well-known divide-and-conquer algorithm cannot be significantly improved at any depth, as…

Let $K$ be a field and $S=K[x_1,\ldots,x_n]$, the ring of polynomials in $n$ variables, over $K$. Using the fact that the Hilbert depth is an upper bound for the Stanley depth of a quotient of squarefree monomial ideals $0\subset…

Let $R=\Bbbk[x_1,...,x_m]$ be the polynomial ring over a field $\Bbbk$ with the standard $\mathbb Z^m$-grading (multigrading), let $L$ be a Noetherian multigraded $R$-module, let $\beta_{i,\alpha}(L)$ the $i$th (multigraded) Betti number of…

We study the problem of maximum likelihood (ML) estimation for statistical models defined by reflexive polytopes. Our focus is on the maximum likelihood degree of these models as an algebraic measure of complexity of the corresponding…

In this paper we introduce a new technique to study associated graded modules. Let $(A,\m)$ be a Noetherian local ring with $\depth A \geq 2$. Our techniques gives a necessary and sufficient condition for $\depth G_{\m^n}(A) \geq 2$ for all…

We show that Stanley's conjecture holds for a polynomial ring over a field in four variables. In the case of polynomial ring in five variables, we prove that the monomial ideals with all associated primes of height two, are Stanley ideals.

The main objective of this thesis is a classification project for integral lattices. Using Kneser's neighbour method we have developed the computer program tn to classify complete genera of integral lattices. Main results are detailed…

This paper is a continuation of the papers J. Pure Appl. Algebra, 210 (2007), 437--445 and J. Algebra Appl., 8 (2009), 219--227. Namely, we introduce and study a doubly filtered set of classes of modules of finite Gorenstein projective…

We develop a polynomial reduction procedure that transforms any gauge fixed CHY amplitude integrand for $n$ scattering particles into a $\sigma$-moduli multivariate polynomial of what we call the $\textit{standard form}$. We show that a…

Constructive methods for matrices of multihomogeneous (or multigraded) resultants for unmixed systems have been studied by Weyman, Zelevinsky, Sturmfels, Dickenstein and Emiris. We generalize these constructions to mixed systems, whose…

We present an algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of equations whose degree depends only on the degree of the…

Let $\R$ be a real closed field, $ {\mathcal Q} \subset \R[Y_1,...,Y_\ell,X_1,...,X_k], $ with $ \deg_{Y}(Q) \leq 2, \deg_{X}(Q) \leq d, Q \in {\mathcal Q}, #({\mathcal Q})=m$, and $ {\mathcal P} \subset \R[X_1,...,X_k] $ with $\deg_{X}(P)…

We propose a novel measure of statistical depth, the metric spatial depth, for data residing in an arbitrary metric space. The measure assigns high (low) values for points located near (far away from) the bulk of the data distribution,…

Let a polyhedron $P$ be defined by one of the following ways: (i) $P = \{x \in R^n \colon A x \leq b\}$, where $A \in Z^{(n+k) \times n}$, $b \in Z^{(n+k)}$ and $rank\, A = n$; (ii) $P = \{x \in R_+^n \colon A x = b\}$, where $A \in Z^{k…

We show that there is a defining equation of degree at most $\mathsf{poly}(n)$ for the (Zariski closure of the) set of the non-rigid matrices: that is, we show that for every large enough field $\mathbb{F}$, there is a non-zero…

Based on Minkowski's work on critical lattices of 3-dimensional convex bodies we present an efficient algorithm for computing the density of a densest lattice packing of an arbitrary 3-polytope. As an application we calculate densest…