English
Related papers

Related papers: On $k$-antichains in the unit $n$-cube

200 papers

A \emph{chain} in the unit $n$-cube is a set $C\subset [0,1]^n$ such that for every $\mathbf{x}=(x_1,\ldots,x_n)$ and $\mathbf{y}=(y_1,\ldots,y_n)$ in $C$ we either have $x_i\le y_i$ for all $i\in [n]$, or $x_i\ge y_i$ for all $i\in [n]$.…

Classical Analysis and ODEs · Mathematics 2019-04-23 Themis Mitsis , Christos Pelekis , Václav Vlasák

An \emph{$n$-cube antichain} is a subset of the unit $n$-cube $[0,1]^n$ that does not contain two elements $\mathbf{x}=(x_1, x_2,\ldots, x_n)$ and $\mathbf{y}=(y_1, y_2,\ldots, y_n)$ satisfying $x_i\le y_i$ for all $i\in \{1,\ldots,n\}$.…

Combinatorics · Mathematics 2017-07-18 Konrad Engel , Themis Mitsis , Christos Pelekis

It is well-known that an antichain in the poset $[0,1]^n$ must have measure zero. Engel, Mitsis, Pelekis and Reiher showed that in fact it must have $(n-1)$-dimensional Hausdorff measure at most $n$, and they conjectured that this bound can…

Combinatorics · Mathematics 2020-04-10 Barnabás Janzer

A set $A \subseteq {\mathbb{R}}^n$ is called an antichain (resp. antichain) if it does not contain two distinct elements ${\mathbf x}=(x_1,\ldots, x_n)$ and ${\mathbf y}=(y_1,\ldots, y_n)$ satisfying $x_i\le y_i$ (resp. $x_i < y_i$) for all…

Combinatorics · Mathematics 2020-12-18 Konrad Engel , Themis Mitsis , Christos Pelekis , Christian Reiher

Motivated by a well-known result in extremal set theory, due to Nicolaas Govert de Bruijn and Paul Erd\H{o}s, we consider curves in the unit $n$-cube $[0,1]^n$ of the form \[ A=\{(x,f_1(x),\ldots,f_{n-2}(x),\alpha): x\in [0,1]\}, \] where…

Classical Analysis and ODEs · Mathematics 2018-05-29 Martin Doležal , Themis Mitsis , Christos Pelekis

A unit cube in $k$ dimensional space (or \emph{$k$-cube} in short) is defined as the Cartesian product $R_1\times R_2\times...\times R_k$ where $R_i$(for $1\leq i\leq k$) is a closed interval of the form $[a_i,a_i+1]$ on the real line. A…

Discrete Mathematics · Computer Science 2008-03-26 L. Sunil Chandran , Mathew C. Francis , Naveen Sivadasan

We show that if $B \subset \mathbb{R}^n$ and $E \subset A(n,k)$ is a nonempty collection of $k$-dimensional affine subspaces of $\mathbb{R}^n$ such that every $P \in E$ intersects $B$ in a set of Hausdorff dimension at least $\alpha$ with…

Metric Geometry · Mathematics 2019-03-12 Kornélia Héra

We say that $E$ is a microset of the compact set $K\subset \mathbb{R}^d$ if there exist sequences $\lambda_n\geq 1$ and $u_n\in \mathbb{R}^d$ such that $(\lambda_n K + u_n ) \cap [0,1]^d$ converges to $E$ in the Hausdorff metric, and…

Classical Analysis and ODEs · Mathematics 2021-04-21 Richárd Balka , Márton Elekes , Viktor Kiss

The following generalisation of the Erd\H{o}s unit distance problem was recently suggested by Palsson, Senger and Sheffer. Given $k$ positive real numbers $\delta_1,\dots,\delta_k$, a $(k+1)$-tuple $(p_1,\dots,p_{k+1})$ in $\mathbb{R}^d$ is…

Combinatorics · Mathematics 2020-10-19 Nora Frankl , Andrey Kupavskii

Odifreddi asked whether every non-irreducible many-one degree must contain an infinite antichain of one-one degrees. Positive answers are known for computably enumerable many-one degrees (Degtev) and, more recently, for many-one degrees…

Logic · Mathematics 2026-02-27 Patrizio Cintioli

A \emph{subcube partition} is a partition of the Boolean cube $\{0,1\}^n$ into subcubes. A subcube partition is irreducible if the only sub-partitions whose union is a subcube are singletons and the entire partition. A subcube partition is…

A family of sets $A$ is said to be an antichain if $x\not\subset y$ for all distinct $x,y\in A$, and it is said to be a distance-$r$ code if every pair of distinct elements of $A$ has Hamming distance at least $r$. Here, we prove that if…

Combinatorics · Mathematics 2022-12-19 Benjamin Gunby , Xiaoyu He , Bhargav Narayanan , Sam Spiro

We provide precise asymptotics for the number of antichains in the poset $\{0,1,2\}^n$, answering a question of Sapozhenko. Finding improved estimates for this number was also a problem suggested by Noel, Scott, and Sudakov, who obtained…

Combinatorics · Mathematics 2026-01-13 Matthew Jenssen , Jinyoung Park , Michail Sarantis

We show that if $E$ is a countable Borel equivalence relation on $\mathbb{R}^n$, then there is a closed subset $A \subset [0,1]^n$ of Hausdorff dimension $n$ so that $E \restriction A$ is smooth. More generally, if $\leq_Q$ is a locally…

Logic · Mathematics 2024-10-30 Andrew Marks , Dino Rossegger , Theodore Slaman

We prove that for any $1 \le k<n$ and $s\le 1$, the union of any nonempty $s$-Hausdorff dimensional family of $k$-dimensional affine subspaces of ${\mathbb R}^n$ has Hausdorff dimension $k+s$. More generally, we show that for any $0 <…

Metric Geometry · Mathematics 2018-03-08 K. Héra , T. Keleti , A. Máthé

Let $\mathcal{Q}_n$ be the $n$-dimensional hypercube: the graph with vertex set $\{0,1\}^n$ and edges between vertices that differ in exactly one coordinate. For $1\leq d\leq n$ and $F\subseteq \{0,1\}^d$ we say that $S\subseteq \{0,1\}^n$…

Combinatorics · Mathematics 2009-07-16 J. Robert Johnson , John Talbot

In a recent paper, Chan, \L aba, and Pramanik investigated geometric configurations inside thin subsets of the Euclidean set possessing measures with Fourier decay properties. In this paper we ask which configurations can be found inside…

Classical Analysis and ODEs · Mathematics 2016-07-06 Mike Bennett , Alex Iosevich , Krystal Taylor

A family of subsets of $\{1,2,\ldots,n\}$ is said to be {\em antipodal} if it is closed under taking complements. We prove a best-possible isoperimetric inequality for antipodal families of subsets of $\{1,2,\ldots,n\}$. Our inequality…

Combinatorics · Mathematics 2017-11-15 David Ellis , Imre Leader

Let $f$ be an endomorphism of $\mathbb{CP}^k$ and $\nu$ be an $f$-invariant measure with positive Lyapunov exponents $(\lambda_1,\...,\lambda_k)$. We prove a lower bound for the pointwise dimension of $\nu$ in terms of the degree of $f$,…

Dynamical Systems · Mathematics 2010-04-14 Christophe Dupont

This paper investigates the Hausdorff dimension properties of chains and antichains in Turing degrees and hyperarithmetic degrees. Our main contributions are threefold: First, for antichains in hyperarithmetic degrees, we prove that every…

Logic · Mathematics 2025-11-25 Sirun Song , Liang Yu
‹ Prev 1 2 3 10 Next ›