Related papers: A Variant of the Stanley Depth for Multisets

Well-partial orders, and the ordinal invariants used to measure them, are relevant in set theory, program verification, proof theory and many other areas of computer science and mathematics. In this article we focus on one of the most…

Statistical data depth plays an important role in the analysis of multivariate data sets. The main outcome is a center-outward ordering of the observations that can be used both to highlight features of the underlying distribution of the…

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…

Statistical depths provide a fundamental generalization of quantiles and medians to data in higher dimensions. This paper proposes a new type of globally defined statistical depth, based upon control theory and eikonal equations, which…

The Dushnik--Miller dimension of a poset $P$ is the least $d$ for which $P$ can be embedded into a product of $d$ chains. Lewis and Souza showed that the dimension of the divisibility order on the interval of integers $[N/\kappa, N]$ is…

We introduce the depth parameters of a finite semigroup, which measure how hard it is to produce an element in the minimum ideal when we consider generating sets satisfying some minimality conditions. We estimate such parameters for some…

We study Schmidt rank for a vector (i.e., a pure state) and Schmidt number for a mixed state which are entanglement measures. We show that if a subspace of a certain bipartite system contains no vector of Schmidt rank $\leqslant k$, then…

The halfspace depth of a $d$-dimensional point $x$ with respect to a finite (or probability) Borel measure $\mu$ in $\mathbb{R}^d$ is defined as the infimum of the $\mu$-masses of all closed halfspaces containing $x$. A natural question is…

The scatter halfspace depth (sHD) is an extension of the location halfspace (also called Tukey) depth that is applicable in the nonparametric analysis of scatter. Using sHD, it is possible to define minimax optimal robust scatter estimators…

Over the last few years Explainable Clustering has gathered a lot of attention. Dasgupta et al. [ICML'20] initiated the study of explainable $k$-means and $k$-median clustering problems where the explanation is captured by a threshold…

Inspired by the infinite families of finite and affine root systems, we consider a "stretching" operation on general crystallographic root systems which, on the level of Coxeter diagrams, replaces a vertex with a path of unlabeled edges. We…

We investigate an invariant, called the Serre depth, from the perspective of combinatorial commutative algebra. In this paper, we establish several properties of an analogue of the depth of Stanley-Reisner rings. In particular, we relate…

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 [1] the authors showed some basic properties of a pre-order that arose in combinatorial number theory, namely the finite embeddability between sets of natural numbers, and they presented its generalization to ultrafilters, which is…

We study completely syndetic (CS) sets in discrete groups - subsets that for every natural n admit finitely many left translates that jointly cover every n-tuple of group elements. While for finitely-generated groups, the non-virtually…

Classical complexity theory measures the cost of computing a function, but many computational tasks require committing to one valid output among several. We introduce determination depth -- the minimum number of sequential layers of…

We analyse a new notion of total anisotropic higher-order variation which, differently from the Total Generalized Variation by Bredies et al., quantifies for possibly non-symmetric tensor fields their variations at arbitrary order weighted…

We define combinatorially a partial order on the set partitions and show that it is equivalent to the Bruhat-Chevalley-Renner order on the upper triangular matrices. By considering subposets consisting of set partitions with a fixed number…

A poset $\mathbf{P} = (X,\preceq)$ is {\em $m$-partite} if $X$ has a partition $X = X_1 \cup ... \cup X_m$ such that (1) each $X_i$ forms an antichain in $\mathbf{P}$, and (2) $x\prec y$ implies $x\in X_i$ and $y\in X_j$ where $i<j$. In…

Stanley's inequalities for partially ordered sets establish important log-concavity relations for sequences of linear extensions counts. Their extremals however, i.e., the equality cases of these inequalities, were until now poorly…