English
Related papers

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

200 papers

The paper provides an elementary proof establishing a sharp universal bound on the $(d-1)$-Hausdorff measure of the zeros of any nontrivial multivariable polynomial $p:\mathbb{R}^d\to\mathbb{R}$ within a $d$-dimensional cube of size $r$.…

Classical Analysis and ODEs · Mathematics 2024-04-30 Andrew Murdza , Khai T. Nguyen , Etienne Phillips

We show that the maximum cardinality of an anti-chain composed of intersections of a given set of n points in the plane with half-planes is close to quadratic in n. We approach this problem by establishing the equivalence with the problem…

Metric Geometry · Mathematics 2015-02-18 Rom Pinchasi , Günter Rote

For any given integer $r\geqslant 3$, let $k=k(n)$ be an integer with $r\leqslant k\leqslant n$. A hypergraph is $r$-uniform if each edge is a set of $r$ vertices, and is said to be linear if two edges intersect in at most one vertex. Let…

Combinatorics · Mathematics 2021-07-13 Fang Tian

In 2010, Matom\"{a}ki investigated the set of $A>1$ such that the integer part of $ A^{c^k} $ is a prime number for every $k\in \mathbb{N}$, where $c\geq 2$ is any fixed real number. She proved that the set is uncountable, nowhere dense,…

Number Theory · Mathematics 2021-02-09 Kota Saito

Let $\mathcal{F}$ be an antichain of finite subsets of $\mathbb{N}$. How quickly can the quantities $|\mathcal{F}\cap 2^{[n]}|$ grow as $n\to\infty$? We show that for any sequence $(f_n)_{n\ge n_0}$ of positive integers satisfying…

Combinatorics · Mathematics 2022-06-14 Paul Balister , Emil Powierski , Alex Scott , Jane Tan

A set of integers is \emph{primitive} if it does not contain an element dividing another. Denote by $f(n)$ the number of maximum-size primitive subsets of $\{1,\ldots, 2n\}$. We prove that the limit $\alpha=\lim_{n\rightarrow…

Combinatorics · Mathematics 2023-06-22 Hong Liu , Péter Pál Pach , Richárd Palincza

We consider the construction of a family $\{K_N\}$ of $3$-dimensional Koch-type surfaces, with a corresponding family of $3$-dimensional Koch-type ``snowflake analogues" $\{\mathcal{C}_N\}$, where $N>1$ are integers with $N \not\equiv 0…

Metric Geometry · Mathematics 2023-02-23 Giovanni Ferrer , Alejandro Vélez-Santiago

Let $G$ and $H$ be $k$-graphs ($k$-uniform hypergraphs); then a perfect $H$-packing in $G$ is a collection of vertex-disjoint copies of $H$ in $G$ which together cover every vertex of $G$. For any fixed $H$ let $\delta(H, n)$ be the minimum…

Combinatorics · Mathematics 2015-09-16 Richard Mycroft

A $k$-uniform hypergraph with $n$ vertices is an $(n,k,\ell)$-omitting system if it does not contain two edges whose intersection has size exactly $\ell$. If in addition it does not contain two edges whose intersection has size greater than…

Combinatorics · Mathematics 2021-01-13 Tom Bohman , Xizhi Liu , Dhruv Mubayi

In their paper from 1981, Milner and Sauer conjectured that for any poset P, if cf(P)=lambda>cf(lambda)=kappa, then P must contain an antichain of size kappa. We prove that for lambda>cf(lambda)=kappa, if there exists a cardinal mu<lambda…

Logic · Mathematics 2007-05-23 Assaf Rinot

We develop a connection between DP-colorings of $k$-uniform hypergraphs of order $n$ and coverings of $n$-dimensional Boolean hypercube by pairs of antipodal $(n-k)$-dimensional faces. Bernshteyn and Kostochka established that the lower…

Combinatorics · Mathematics 2024-03-06 Vladimir N. Potapov

We establish sharp bounds for the Hausdorff dimension of sets of irrational numbers in $(0,1)$ whose digits in the $N$-expansion are either uniformly bounded or tend to infinity. For sets with digits bounded by an integer $M \ge N$, we…

Number Theory · Mathematics 2026-03-31 Andreea Catalina Chitu , Gabriela Ileana Sebe , Dan Lascu

In a previous work we proved that if a finite Borel measure $\mu$ in a Euclidean space has Hausdorff dimension smaller than a positive integer $k$, then the orthogonal projection onto almost every $k$-dimensional linear subspace is…

Classical Analysis and ODEs · Mathematics 2023-06-27 Krzysztof Barański , Yonatan Gutman , Adam Śpiewak

For integers $k,n$ with $1 \le k \le n/2$, let $f(k,n)$ be the smallest integer $t$ such that every $t$-connected $n$-vertex graph has a spanning bipartite $k$-connected subgraph. A conjecture of Thomassen asserts that $f(k,n)$ is upper…

Combinatorics · Mathematics 2024-03-26 Raphael Yuster

Let $X$ be a Fano manifold of dimension at least $2$ and $D$ be a smooth divisor in a multiple of the anticanonical class, $\frac1\alpha(-K_X)$ with $\alpha>1$. It is well-known that K\"ahler-Einstein metrics on $X$ with conic singularities…

Differential Geometry · Mathematics 2026-01-21 Olivier Biquard , Henri Guenancia

A strong law of large numbers for $d$-dimensional random projections of the $n$-dimensional cube is derived. It shows that with respect to the Hausdorff distance a properly normalized random projection of $[-1,1]^n$ onto $\mathbb{R}^d$…

Probability · Mathematics 2019-10-08 Zakhar Kabluchko , Joscha Prochno , Christoph Thaele

Say that a permutation of $1,2,\ldots,n$ is \textit{$k$-bounded} if every pair of consecutive entries in the permutation differs by no more than $k$. Such a permutation is \textit{anchored} if the first entry is $1$ and the last entry is…

Combinatorics · Mathematics 2019-09-11 Maria M. Gillespie , Kenneth G. Monks , Kenneth M. Monks

Let $m\in\mathbb N_{\ge 2}$, and let $\mathcal K=\{K_\lambda: \lambda\in(0, 1/m]\}$ be a class of Cantor sets, where $K_{\lambda}=\{\sum_{i=1}^\infty d_i\lambda^i: d_i\in\{0,1,\ldots, m-1\}, i\ge 1\}$. We investigate in this paper the…

Dynamical Systems · Mathematics 2022-02-16 Kan Jiang , Derong Kong , Wenxia Li

Let $H$ and $K$ be subsets of the vertex set $V(Q_d)$ of the $d$-cube $Q_d$ (we call $H$ and $K$ configurations in $Q_d$). We say $K$ is an \emph{exact copy} of $H$ if there is an automorphism of $Q_d$ which sends $H$ to $K$. If $d$ is a…

Combinatorics · Mathematics 2020-09-22 John Goldwasser , Ryan Hansen

We study the problem of $k$-means clustering in the space of straight-line segments in $\mathbb{R}^{2}$ under the Hausdorff distance. For this problem, we give a $(1+\epsilon)$-approximation algorithm that, for an input of $n$ segments, for…

Computational Geometry · Computer Science 2023-05-19 Sergio Cabello , Panos Giannopoulos
‹ Prev 1 4 5 6 7 8 10 Next ›