Let $\mathbb{P}(x\prec y)$ be the probability that $x$ precedes $y$ in a uniformly random linear extension of an $n$-element poset $P$, and define the balancing coefficient to be $\delta(x,y)=\min(\mathbb{P}(x\prec y),\mathbb{P}(y\prec x))$ with $\delta(P)=\max_{x,y}\delta(x,y)$. We prove (Theorem 1) that sufficiently large width forces $\delta(P)$ to be arbitrarily close to $1/2$, answering a long-standing conjecture of Kahn and Saks. In fact, we prove the stronger result (Theorem 2) that large width forces one of two configurations in our poset: either a nearly uniform order on $k$ vertices, or an almost fixed order on $t$ vertices with one further vertex inserted uniformly among the $t+1$ slots. We also show that, for fixed $k$, the first possibility must occur within any antichain $X$ of size $\Omega(n^{2/3})$.
We establish two quantitative results concerning additive decompositions of the set $\mathbb{P}$ of primes. First, we prove that, if $A,B\subseteq\mathbb N$ have at least two elements and $A+B$ differs from the primes by only finitely many elements, then $$ \frac{\sqrt{x}}{\log x}\ll A(x),B(x) \ll \sqrt{x}. $$ Second,...
We continue our studies on parametric norm forms $F_t({\bf x})$, with ${\bf x}=(x_0,x_1,\ldots,x_{d-1})$ lying in some parametric linear subvariety $W_t$ and integers $t$ sufficiently large. In a previous paper [Am-Ma-Za2] we proved some effective specialization results for integer solutions $\bf x$ of $F_t({\bf x})=1$...
For an integer $k \ge 0$, let $f_k(x) = 1 + e(x) + e((k+2)x)$ and $g_k(x) = 1 + e(x) - e((k+2)x)$ on $\mathbb{T} = \mathbb{R}/\mathbb{Z}$, where $e(x) = e^{2\pi i x}$. Mockenhaupt conjectured that $\|g_k\|_{L^p(\mathbb{T})}>\|f_k\|_{L^p(\mathbb{T})}$ whenever $2k<p<2k+2$. The conjecture was previously known for $k \le...
Guan-Cheng Pan, Cheng-Song You, Heng-Yu Wang et al.· 0 citations
Friedlander and Iwaniec proved that the number of points of the orbit $\{\gamma i \colon \gamma\in\SL_2(\Z)\}$ lying at a distance $p-2$ from the origin $i$ of the upper half-plane, with $p\le x$ prime, is of order $x/\log x$; the upper bound is unconditional, while the lower one rests on a strong hypothesis concerning...
Let $P_n(q)=\prod_{j=1}^n(1-q^{3j-2})(1-q^{3j-1})$. For each $p\in\{4,5,6,7,8\}$, we prove that the coefficients of $P_n(q)^p$ in residue class $0$ modulo $3$ are nonnegative, and that those in residue class $2$, after zero terms are omitted, change sign exactly once, from positive to negative. The residue-$0$ coeffici...
Let $q=p^f$, where $p$ is prime. We prove that every $q$-ary linear code meeting the Griesmer bound, with positive dimension and minimum distance $d\ge1$, is $p^{\max\{0,\nu_p(d)-f+1\}}$-divisible, as asserted in Ward's conjecture. Arbitrary projective column multiplicities are allowed. The geometric ingredient is a bo...
Guang-Hui Zhang· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.