Related papers: A Variant of the Stanley Depth for Multisets
The partition problem is a well-known basic NP-complete problem. We mainly consider the optimization version of it in this paper. The problem has been investigated from various perspectives for a long time and can be solved efficiently in…
We apply Miller's theory on multigraded modules over a polynomial ring to the study of the Stanley depth of these modules. Several tools for Stanley's conjecture are developed, and a few partial answers are given. For example, we show that…
Let $h:\mathbb Z \to \mathbb Z_{\geq 0}$ be a nonzero function with $h(k)=0$ for $k\ll 0$. We define the Hilbert depth of $h$ by $\operatorname{hdepth}(h)=\max\{d\;:\; \sum_{j\leq k} (-1)^{k-j}\binom{d-j}{k-j}h(j)\geq 0\text{ for all }k\leq…
Entanglement depth characterizes the minimal number of particles in a system that are mutually entangled. For symmetric states, we show that there is a dichotomy for entanglement depth: an $N$-particle symmetric state is either fully…
We study the set of irregular points for topologically mixing subshifts of finite type. It is well known that despite the irregular set having zero measure for every invariant measure, it has full topological entropy and full Hausdorff…
In this paper we introduce a new formulation of Bennett's logical depth based on pebble transducers. This notion is defined based on the difference between the minimal length descriptional complexity of prefixes of infinite sequences from…
We characterize the downsets of integer partitions (ordered by containment of Ferrers diagrams) and compositions (ordered by the generalized subword order) which have finite dimension in the sense of Dushnik and Miller. In the case of…
The Tukey depth of a flat with respect to a point set is a concept that appears in many areas of discrete and computational geometry. In particular, the study of centerpoints, center transversals, Ham Sandwich cuts, or $k$-edges can all be…
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.…
The space of subvarieties of P^n with a fixed Hilbert polynomial is not complete. Grothendieck defined a completion by relaxing "variety" to "scheme", giving the complete_Hilbert scheme_ of subschemes of P^n with fixed Hilbert polynomial.…
Tukey's depth (or halfspace depth) is a widely used measure of centrality for multivariate data. However, exact computation of Tukey's depth is known to be a hard problem in high dimensions. As a remedy, randomized approximations of Tukey's…
The halfspace depth is a well studied tool of nonparametric statistics in multivariate spaces, naturally inducing a multivariate generalisation of quantiles. The halfspace depth of a point with respect to a measure is defined as the infimum…
This work regards the order polytopes arising from the class of generalized snake posets and their posets of meet-irreducible elements. Among generalized snake posets of the same rank, we characterize those whose order polytopes have…
We propose halfspace depth concepts for scatter, concentration and shape matrices. For scatter matrices, our concept is similar to those from Chen, Gao and Ren (2017) and Zhang (2002). Rather than focusing, as in these earlier works, on…
This work presents Prior Depth Anything, a framework that combines incomplete but precise metric information in depth measurement with relative but complete geometric structures in depth prediction, generating accurate, dense, and detailed…
For the elements of a Coxeter group, we present a statistic called depth, defined in terms of factorizations of the elements into products of reflections. Depth is bounded above by length and below by the average of length and reflection…
For a finite partially ordered set we calculate the dimension of the variety of its subspace representations having fixed dimension vector. The dimension is given in terms of the Euler quadratic form associated with a partially ordered set,…
We study the Stanley depth and the Hilbert depth of the edge ideals of path graphs, cycle graphs, generalized star graphs and double broom graphs.
One of possible cryptomorphic definitions of a partially ordered set (= a poset) $P$ on a non-empty finite basic set $N$ is in terms of the set ${\cal L}(P)$ of all its linear extensions, that is, in terms of the set of total orders of $N$…
Let $\mathcal{H}_i$ be a finite dimensional complex Hilbert space of dimension $d_i$ associated with a finite level quantum system $A_i$ for $i = i, 1,2, ..., k$. A subspace $S \subset \mathcal{H} = \mathcal{H}_{A_{1} A_{2}... A_{k}} =…