Aug 2026· 1 citation· ⚡ 1 influential· 22 references
MathematicsComputer Science
Abstract
Let $P$ be a finite nonempty poset with $n$ elements, let $f:P\to\{1,\ldots,n\}$ be a uniformly random order-preserving bijection, and put $h_P(x)=\mathbb{E}[f(x)]$. Aires and Kahn (2025) introduced $\operatorname{gap}(P)$ as the largest difference between consecutive values in the ordered list consisting of $0$, $n+1$, and all the expected ranks $h_P(x)$. Write ${w}(P)$ for the largest size of a pairwise incomparable subset. We prove three results. First, we prove a weighted strengthening of an ideal inequality conjectured by Kahn and obtain the explicit gap-width bound $\operatorname{gap}(P)\le 2 {w}(P)-1$. Second, for every $L>0$ we construct a width-two poset such that the expected-rank list of every maximal chain has a gap of at least $L$, with $0$ and $|P|+1$ added as endpoints. Finally, for every $r\in\mathbb{N}$, we construct a poset $P_r$ for which the relative order induced on every nonempty selected set $X$ has base-two entropy below $3|X|$, while $\operatorname{gap}(P_r)\ge(3/2)^r$. Thus the gap can be arbitrarily large while the induced order on every selected set has relatively small entropy. The key ideas behind all three results were found by ChatGPT 5.6 Sol.
We recall the concept of the dimension of a finite poset $P$, and the longstanding conjecture that for all finite nonempty posets $P$ and $Q$, $\dim(P\times Q)\geq\dim(P)+\dim(Q)-2.$ We then note two other plausible inequalities, either of which would imply that one. In the final section, writing $P\preccurlyeq P'$ if,...
Let $q=p^k$, where $p$ is prime, and let $M$ be a finite matroid representable over ${\Bbb{F}}_q$. Write $\chi_M(t)$ for its characteristic polynomial and $\mbox{decop}(M)$ for the least number of independent sets needed to cover its ground set. We prove that $\chi_M(q)>0$ whenever $k\ge\mbox{decop}(M)$. Geometrically,...
We prove the $p$-Frobenius problems proposed as Conjectures 7.1 and 7.5 developed by T. Komatsu and R. Pandey (Bull. Korean Math. Soc. 2025;62:1397--1409.) for two families of consecutive odd integers. For integers $r,L,n\ge0$, the bounded restricted partition function $p_{\le r}^{(\le L)}(\le n)$ counts partitions of...
Let $h$ be a positive integer, and let $A$ be a finite set of integers. We derive an exact formula for $|hA|$. Furthermore, let $A=\{0,1,\ldots,s,a,b\}$, $1\leq s<a<b$, and write $b=qa+r$ with $0\leq r<a$. By using generating function, we prove that $|hA|$ equals a definite explicit formula expressed in terms of certai...
Let $H$ be a numerical monoid, that is, a cofinite submonoid of $\mathbb N$ (the non-negative integers under addition). Denote by $\mathcal P_{\text{fin},0}(H)$ the monoid obtained by endowing the family of all finite subsets of $H$ containing $0$ with the operation of setwise addition induced by $H$ on its power set....
Let $X_1,X_2,\ldots$ be independent $\mathrm{Bernoulli}(\theta)$ random variables, and let $\bar X_n = n^{-1}(X_1 + \cdots + X_n)$. We prove that, for every real $p \geq 1$, the sequence $\{\mathsf{E}(\bar X_n^p)\}_{n \geq 1}$ is log-convex. This proves the Bernoulli case of a conjecture of Lamkin and Tkocz [Canad. Mat...
Frédéric Ouimet· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
