相关论文: Large subposets with small dimension

For a symmetric convex body $K\subset\mathbb{R}^n$, the Dvoretzky dimension $k(K)$ is the largest dimension for which a random central section of $K$ is almost spherical. A Dvoretzky-type theorem proved by V.~D.~Milman in 1971 provides a…

We obtain a Fourier dimension estimate for sets of exact approximation order introduced by Bugeaud for certain approximation functions $\psi$. This Fourier dimension estimate implies that these sets of exact approximation order contain…

Let ${\mathcal D}(n)$ be the maximal determinant for $n \times n$ $\{\pm 1\}$-matrices, and $\mathcal R(n) = {\mathcal D}(n)/n^{n/2}$ be the ratio of ${\mathcal D}(n)$ to the Hadamard upper bound. Using the probabilistic method, we prove…

The Johnson-type upper bound on the maximum size of a code of length $n$, distance $d=2w-1$ and constant composition ${\overline{w}}$ is $\lfloor\dfrac{n}{w_1}\rfloor$, where $w$ is the total weight and $w_1$ is the largest component of…

A difference basis with respect to $n$ is a subset $A \subseteq \mathbb{Z}$ such that $A - A \supseteq \{1, \ldots, n\}$. R\'{e}dei and R\'{e}nyi showed that the minimum size of a difference basis with respect to $n$ is $(c+o(1))\sqrt{n}$…

In a projective plane $\Pi_{q}$ (not necessarily Desarguesian) of order $q$, a point subset $\mathcal{S}$ is saturating (or dense) if any point of $\Pi_{q}\setminus \mathcal{S}$ is collinear with two points in $\mathcal{S}$. Modifying an…

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…

A finite subset $X$ on the unit sphere $\mathbb{S}^{d-1}$ is called an $s$-distance set with strength $t$ if its angle set $A(X):=\{\langle \mathbf{x},\mathbf{y}\rangle : \mathbf{x},\mathbf{y}\in X,\mathbf{x}\neq\mathbf{y} \}$ has size $s$,…

Using the notion of higher-order Fourier dimension introduced in \cite{M2} (which was a sort of psuedorandomness condition stemming from the Gowers norms of Additive Combinatorics), we prove a maximal theorem and corresponding…

A polytope in a finite-dimensional normed space is subequilateral if the length in the norm of each of its edges equals its diameter. Subequilateral polytopes occur in the study of two unrelated subjects: surface energy minimizing cones and…

Let $Q_n$ be the poset that consists of all subsets of a fixed $n$-element set, ordered by set inclusion. The poset cube Ramsey number $R(Q_n,Q_n)$ is defined as the least $m$ such that any 2-coloring of the elements of $Q_m$ admits a…

Given natural numbers $k \leq s \leq n$, we ask: what is the minimal VC-dimension of a family $\mathcal{F}$ of $s$-subsets of $[n]$ that covers all $k$-subsets of $[n]$? We first show that for sufficiently large $n$ this number is always…

Finding a good bound on the maximal edge diameter $\Delta(d,n)$ of a polytope in terms of its dimension $d$ and the number of its facets $n$ is one of the basic open questions in polytope theory \cite{BG}. Although some bounds are known,…

The Generalized Lax Conjecture asks whether every hyperbolicity cone is a section of a semidefinite cone of sufficiently high dimension. We prove that the space of hyperbolicity cones of hyperbolic polynomials of degree $d$ in $n$ variables…

We study asymptotic lower and upper bounds for the sizes of constant dimension codes with respect to the subspace or injection distance, which is used in random linear network coding. In this context we review known upper bounds and show…

Sublinear time algorithms for approximating maximum matching size have long been studied. Much of the progress over the last two decades on this problem has been on the algorithmic side. For instance, an algorithm of Behnezhad [FOCS'21]…

It has been known for more than 40 years that there are posets with planar cover graphs and arbitrarily large dimension. Recently, Streib and Trotter proved that such posets must have large height. In fact, all known constructions of such…

The dimension of a block design is the maximum positive integer $d$ such that any $d$ of its points are contained in a proper subdesign. Pairwise balanced designs PBD$(v,K)$ have dimension at least two as long as not all points are on the…

Boros and Furedi (for d=2) and Barany (for abritrary d) proved that there exists a positive real number c_d such that for every set P of n points in R^d in general position, there exists a point of R^d contained in at least c_d…

We consider boundary roughness for the ``droplet'' created when supercritical two-dimensional Bernoulli percolation is conditioned to have an open dual circuit surrounding the origin and enclosing an area at least $l^2$, for large $l$. The…