相关论文: Improving the $\frac{1}{3}-\frac{2}{3}$ Conjecture…

We show that for large enough $n$, the number of non-isomorphic pseudoline arrangements of order $n$ is greater than $2^{c\cdot n^2}$ for some constant $c > 0.2604$, improving the previous best bound of $c>0.2083$ by Dumitrescu and Mandal…

The dimension of a poset $P$, denoted $\dim(P)$, is the least positive integer $d$ for which $P$ is the intersection of $d$ linear extensions of $P$. The maximum dimension of a poset $P$ with $|P|\le 2n+1$ is $n$, provided $n\ge2$, and this…

An old conjecture of Kahn and Saks says, roughly, that any poset $P$ of large enough width contains elements $x,y$ which are "balanced" in the sense that the probability that $x$ precedes $y$ in a uniformly random linear extension of $P$ is…

We give a conditional result on the constant in the B\'aez-Duarte reformulation of the Nyman-Beurling criterion for the Riemann Hypothesis. We show that assuming the Riemann hypothesis and that $\sum_{\rho}\frac{1}{|\zeta'(\rho)|^2}\ll…

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 approximate Carath\'eodory problem in general form is as follows: Given two symmetric convex bodies $P,Q \subseteq \mathbb{R}^m$, a parameter $k \in \mathbb{N}$ and $\mathbf{z} \in \textrm{conv}(X)$ with $X \subseteq P$, find…

Erdos, Herzog and Piranian asked whether, for $n$ points in the plane with fixed diameter (maximum distance between points), an arrangement of a regular $n$-gon maximizes their product of all pairs of distances. Recently, it was discovered…

Motivated by the study of the dimension of random posets, it was conjectured by Bollob\'as and Brightwell in 1997 that if $P$ is a finite poset whose cover graph contains at most one cycle then its order dimension is at most $3$. In this…

The queue number of a poset is the queue number of its cover graph when the vertex order is a linear extension of the poset. Heath and Pemmaraju conjectured that every poset of width $w$ has queue number at most $w$. The conjecture has been…

For parameters $\,c\in(0,1)\,$ and $\,\beta>0$, let $\,\ell_{2}(c,\beta)\,$ be the Hilbert space of real functions defined on $\,\mathbb{N}\,$ (i.e., real sequences), for which $$ \| f \|_{c,\beta}^2 :=…

We introduce a new decomposition technique for random variables that maps a generic instance of the prophet inequalities problem to a new instance where all but a constant number of variables have a tractable structure that we refer to as…

Given a finite poset $\mathcal P$, the hypercube-height, denoted by $h^*(\mathcal P)$, is defined to be the largest $h$ such that, for any natural number $n$, the subsets of $[n]$ of size less than $h$ do not contain an induced copy of…

Let $P$ be a polytope defined by the system $A x \leq b$, where $A \in R^{m \times n}$, $b \in R^m$, and $\text{rank}(A) = n$. We give a short geometric proof of the following tight upper bound on the number of vertices of $P$: $$ n! \cdot…

We study a lower bound for the constant of the Szemer\'edi-Trotter theorem. In particular, we show that a recent infinite family of point-line configurations satisfies $I({\mathcal P},{\mathcal L})\ge (c+o(1)) |{\mathcal P}|^{2/3}|{\mathcal…

The Hardy--Littlewood inequality for $m$-linear forms on $\ell _{p}$ spaces and $m<p\leq 2m$ asserts that \begin{equation*} \left( \sum_{j_{1},...,j_{m}=1}^{\infty }\left\vert T\left( e_{j_{1}},\ldots ,e_{j_{m}}\right) \right\vert…

The dimension of a partially ordered set $P$ (poset for short) is the least positive integer $d$ such that $P$ is isomorphic to a subposet of $\mathbb{R}^d$ with the natural product order. Dimension is arguably the most widely studied…

Let $E\subset \mathbb R^n$, $n\ge 2$, be a set of finite perimeter with $|E|=|B|$, where $B$ denotes the unit ball. When $n=2$, since convexification decreases perimeter (in the class of open connected sets), it is easy to prove the…

We consider the problem of sketching the $p$-th frequency moment of a vector, $p>2$, with multiplicative error at most $1\pm \epsilon$ and \emph{with high confidence} $1-\delta$. Despite the long sequence of work on this problem, tight…

Felsner and Reuter introduced the linear extension diameter of a partially ordered set $\mathbf{P}$, denoted $\mbox{led}(\mathbf{P})$, as the maximum distance between two linear extensions of $\mathbf{P}$, where distance is defined to be…

The classical 1991 result by Brightwell and Winkler states that the number of linear extensions of a poset is #P-complete. We extend this result to posets with certain restrictions. First, we prove that the number of linear extension for…