English
Related papers

Related papers: Optimal Embeddings of Posets in Hypercubes

200 papers

Gr\"unbaum's inequality guarantees that the centroid of a convex body has halfspace depth at least $1/e$: every halfspace containing the centroid captures at least a $1/e$ fraction of the body's volume. For mixed-integer convex sets…

Optimization and Control · Mathematics 2026-03-03 Hongyu Cheng , Amitabh Basu

We study the problem of topologically order-embedding a given topological poset X in the space of all closed subsets of X which is topologized by the Fell topology and ordered by set inclusion. We show that this can be achieved whenever X…

General Topology · Mathematics 2021-11-24 Gerald Beer , Efe A. Ok

For every hyperplane $H$ supporting a convex body $C$ in the hyperbolic space $\mathbb{H}^d$ we define the width of $C$ determined by $H$ as the distance between $H$ and a most distant ultraparallel hyperplane supporting $C$. We prove that…

Metric Geometry · Mathematics 2024-02-27 Marek Lassak

We study a variant of the median problem for a collection of point sets in high dimensions. This generalizes the geometric median as well as the (probabilistic) smallest enclosing ball (pSEB) problems. Our main objective and motivation is…

Computational Geometry · Computer Science 2019-03-04 Amer Krivošija , Alexander Munteanu

The fourth listed author and Hans Parshall (\cite{IosevichParshall}) proved that if $E \subset {\mathbb F}_q^d$, $d \ge 2$, and $G$ is a connected graph on $k+1$ vertices such that the largest degree of any vertex is $m$, then if $|E| \ge C…

Combinatorics · Mathematics 2023-08-21 Paige Bright , Xinyu Fang , Barrett Heritage , Alex Iosevich , Maxwell Sun

We devise a new embedding technique, which we call measured descent, based on decomposing a metric space locally, at varying speeds, according to the density of some probability measure. This provides a refined and unified framework for the…

Data Structures and Algorithms · Computer Science 2007-05-23 Robert Krauthgamer , James R. Lee , Manor Mendel , Assaf Naor

For a polygon $P$ with holes in the plane, we denote by $\varrho(P)$ the ratio between the geodesic and the Euclidean diameters of $P$. It is shown that over all convex polygons with $h$~convex holes, the supremum of $\varrho(P)$ is between…

Computational Geometry · Computer Science 2026-02-10 Adrian Dumitrescu , Csaba D. Tóth

A partial cube is a graph having an isometric embedding in a hypercube. Partial cubes are characterized by a natural equivalence relation on the edges, whose classes are called zones. The number of zones determines the minimal dimension of…

Discrete Mathematics · Computer Science 2013-12-11 Jean Cardinal , Stefan Felsner

For a hyperplane $H$ supporting a convex body $C$ in the hyperbolic space $\mathbb{H}^d$ we define the width of $C$ determined by $H$ as the distance between $H$ and a most distant ultraparallel hyperplane supporting $C$. The thickness…

Metric Geometry · Mathematics 2024-05-14 Marek Lassak

A compact hyperbolic "cobweb" manifold (hyperbolic space form) of symbol $Cw(6,6,6)$ will be constructed in Fig.1,4,5 as a representant of a presumably infinite series $Cw(2p,2p,2p)$ $(3 \le p \in \bN$ natural numbers). This is a by-product…

Metric Geometry · Mathematics 2017-03-21 Emil Molnár , Jenő Szirmai

We study two new parameters for finite posets motivated by the problem of efficiently determining the set of successors of a given element. A plane map of a poset $P=(X,\leq)$ is an injective mapping of $X$ into the Cartesian plane…

Combinatorics · Mathematics 2026-05-21 Stefan Felsner , Jędrzej Hodor , Giacomo Ortali , Alexander Wolff

This work studies an explicit embedding of the set of probability measures into a Hilbert space, defined using optimal transport maps from a reference probability density. This embedding linearizes to some extent the 2-Wasserstein space,…

Machine Learning · Statistics 2022-05-05 Quentin Mérigot , Alex Delalande , Frédéric Chazal

Joret, Micek, Milans, Trotter, Walczak, and Wang recently asked if there exists a constant $d$ such that if $P$ is a poset with cover graph of $P$ of pathwidth at most $2$, then $\dim(P)\leq d$. We answer this question in the affirmative by…

Combinatorics · Mathematics 2015-07-07 Csaba Biró , Mitchel T. Keller , Stephen J. Young

A subfamily $\{F_1,F_2,\dots,F_{|P|}\}\subseteq \mathcal F$ is a copy of the poset $P$ if there exists a bijection $i:P\rightarrow \{F_1,F_2,\dots,F_{|P|}\}$ such that $p\le_P q$ implies $i(p)\subseteq i(q)$. A family $\mathcal F$ is…

Combinatorics · Mathematics 2018-04-06 Dániel Gerbner , Abhishek Methuku , Dániel T. Nagy , Balázs Patkós , Máté Vizer

A new class of partial order-types, class $\gbqo^+$ is defined and investigated here. A poset $P$ is in the class $W^+ $ iff the free poset algebra $F(P)$ is generated by a better quasi-order $G$ that is included in the free lattice $L(P)$.…

General Topology · Mathematics 2012-10-23 Uri Abraham , Robert Bonnet , Wieslaw Kubis

The goal of this paper is to prove that several variants of deciding whether a poset can be (weakly) embedded into a small Boolean lattice, or to a few consecutive levels of a Boolean lattice, are NP-complete, answering a question of Griggs…

Discrete Mathematics · Computer Science 2023-06-22 Dömötör Pálvölgyi

Given a finite poset $\mathcal P$, we call a family $\mathcal F$ of subsets of $[n]$ $\mathcal P$-saturated if $\mathcal F$ does not contain an induced copy of $\mathcal P$, but adding any other set to $\mathcal F$ creates an induced copy…

Combinatorics · Mathematics 2020-05-29 Maria-Romina Ivan

In this paper, we introduce new general frameworks for estimating the maximal dimension of Hilbert cubes contained in finite truncations of arbitrary sets. As applications, we investigate Hilbert cubes in a range of arithmetic sets,…

Number Theory · Mathematics 2026-03-17 Ernie Croot , Junzhe Mao , Chi Hoi Yip

For a given graph $G$, a "hopset" $H$ with hopbound $\beta$ and stretch $\alpha$ is a set of edges such that between every pair of vertices $u$ and $v$, there is a path with at most $\beta$ hops in $G \cup H$ that approximates the distance…

Data Structures and Algorithms · Computer Science 2025-05-08 Michael Dinitz , Ama Koranteng , Yasamin Nazari

The Sample Compression Conjecture of Littlestone & Warmuth has remained unsolved for over two decades. This paper presents a systematic geometric investigation of the compression of finite maximum concept classes. Simple arrangements of…

Machine Learning · Computer Science 2014-02-04 Benjamin I. P. Rubinstein , J. Hyam Rubinstein