English
Related papers

Related papers: The Dimension of Divisibility Orders and Multiset …

200 papers

This paper considers coresets for the robust $k$-medians problem with $m$ outliers, and new constructions in various metric spaces are obtained. Specifically, for metric spaces with a bounded VC or doubling dimension $d$, the coreset size…

Data Structures and Algorithms · Computer Science 2025-07-16 Lingxiao Huang , Zhenyu Jiang , Yi Li , Xuan Wu

We define and study a variant of the \emph{Stanley depth} which we call \emph{total depth} for partially ordered sets (posets). This total depth is the most natural variant of Stanley depth from $\llbracket S_k\rrbracket$ -- the poset of…

Combinatorics · Mathematics 2019-02-11 Yinghui Wang

Felsner, Li and Trotter showed that the dimension of the adjacency poset of an outerplanar graph is at most 5, and gave an example of an outerplanar graph whose adjacency poset has dimension 4. We improve their upper bound to 4, which is…

Combinatorics · Mathematics 2022-03-09 Marcin Witkowski

We present two fully mechanized proofs of Dilworths and Mirskys theorems in the Coq proof assistant. Dilworths Theorem states that in any finite partially ordered set (poset), the size of a smallest chain cover and a largest antichain are…

Logic in Computer Science · Computer Science 2017-03-20 Abhishek Kr Singh

Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs of objects are incomparable. This generalization is relevant…

Data Structures and Algorithms · Computer Science 2007-07-12 Constantinos Daskalakis , Richard M. Karp , Elchanan Mossel , Samantha Riesenfeld , Elad Verbin

Extending results of Linial (1984) and Aigner (1985), we prove a uniform lower bound on the balance constant of a poset $P$ of width $2$. This constant is defined as $\delta(P) = \max_{(x, y)\in P^2}\min\{\mathbb{P}(x\prec y),…

Combinatorics · Mathematics 2021-06-21 Ashwin Sah

We give an attempt to build a classification of planar integral point sets. For two obtained classes, we provide general constructions of upper bounds for minimal diameter of integral point sets in higher dimensions of certain cardinality.…

Combinatorics · Mathematics 2021-11-23 N. N. Avdeev , R. E. Zvolinsky , E. A. Momot

We study the Noether-Lefschetz locus of the moduli space $\mathcal{M}$ of $K3^{[2]}$-fourfolds with a polarization of degree $2$. Following Hassett's work on cubic fourfolds, Debarre, Iliev, and Manivel have shown that the Noether-Lefschetz…

Algebraic Geometry · Mathematics 2023-06-19 Jack Petok

For Riesz $s$-potentials $K(x,y)=|x-y|^{-s}$, $s>0$, we investigate separation and covering properties of $N$-point configurations $\omega^*_N=\{x_1, \ldots, x_N\}$ on a $d$-dimensional compact set $A\subset \mathbb{R}^\ell$ for which the…

Classical Analysis and ODEs · Mathematics 2017-03-02 Alexander Reznikov , Edward B. Saff , Alexander Volberg

Given a lower envelope in the form of an arbitrary sequence $u$, let $LSP(u, d)$ denote the maximum length of any subsequence of $u$ that can be realized as the lower envelope of a set of polynomials of degree at most $d$. Let $sp(m, d)$…

Combinatorics · Mathematics 2016-06-07 Jesse Geneson

The Minkowski mixed volume of $n$ subpolytopes $D_1, \dots, D_n$ of a polytope $P \subset {\mathbb R}^n$ clearly does not exceed the normalized volume $n! \text{Vol}(P)$. Equality holds if and only if the subpolytopes are interlaced, i.e.,…

Combinatorics · Mathematics 2026-05-14 Fedor Selyanin

Fix positive integers $k$ and $d$. We show that, as $n\to\infty$, any set system $\mathcal{A} \subset 2^{[n]}$ for which the VC dimension of $\{ \triangle_{i=1}^k S_i \mid S_i \in \mathcal{A}\}$ is at most $d$ has size at most…

Combinatorics · Mathematics 2018-10-16 Stijn Cambie , António Girão , Ross J. Kang

Given a positive, decreasing sequence $a,$ whose sum is $L$, we consider all the closed subsets of $[0,L]$ such that the lengths of their complementary open intervals are in one to one correspondence with the sequence $a$. The aim of this…

Classical Analysis and ODEs · Mathematics 2016-04-06 Ignacio Garcia , Kathryn Hare , Franklin Mendivil

The order polytopes arising from the finite poset were first introduced and studied by Stanley. For any positive integer $d\geq 14$, Liu and Tsuchiya proved that there exists a non-Ehrhart positive order polytope of dimension $d$. They also…

Combinatorics · Mathematics 2026-04-13 Feihu Liu , Guoce Xin , Zihao Zhang

A divisibility relation on ultrafilters on the set $\mathbb{N}$ of natural numbers is defined as follows: ${\cal F}\hspace{1mm}\widetilde{\mid}\hspace{1mm}{\cal G}$ if and only if every set in $\cal F$ upward closed for divisibility also…

Logic · Mathematics 2025-06-03 Boris Šobot

Consider the partition function S(\epsilon) associated in theory of Renyi dimension to a finite Borel measure \mu on Euclidean d-space. This partion function S(\epsilon) is the sum of the q-th powers of the measure applied to a partition of…

Functional Analysis · Mathematics 2011-11-09 Terry A. Loring

We study the problem of constructing $\varepsilon$-coresets for the $(k, z)$-clustering problem in a doubling metric $M(X, d)$. An $\varepsilon$-coreset is a weighted subset $S\subseteq X$ with weight function $w : S \rightarrow…

Data Structures and Algorithms · Computer Science 2018-08-21 Lingxiao Huang , Shaofeng H. -C. Jiang , Jian Li , Xuan Wu

We examine the scaling of the linear dimension of the system size of a real polymer solution at constant excess free energy and in two different spacial dimensionalities, d=d0 and d=d1. Standard results for the functional form of the excess…

Soft Condensed Matter · Physics 2008-09-23 C. P. Lowe , M. W. Dreischor

It is known that any $n$-point set in the $d$-dimensional Euclidean space $\mathbb{R}^d$, for $d = O(1)$, admits: 1) a $(1+\epsilon)$-spanner with maximum degree $\tilde{O}(\epsilon^{-d+1})$ and with lightness $\tilde{O}(\epsilon^{-d})$; 2)…

Computational Geometry · Computer Science 2026-03-30 An La , Hung Le , Shay Solomon , Cuong Than , Vinayak , Shuang Yang , Tianyi Zhang

Two boxes in $\mathbb{R}^d$ are comparable if one of them is a subset of a translation of the other one. The comparable box dimension of a graph $G$ is the minimum integer $d$ such that $G$ can be represented as a touching graph of…

Discrete Mathematics · Computer Science 2022-03-16 Zdenek Dvorák , Daniel Goncalves , Abhiruk Lahiri , Jane Tan , Torsten Ueckerdt
‹ Prev 1 8 9 10 Next ›