arXiv AI

An Explicit Counterexample to Stanley's Rankwise Lower-Bound Conjecture for Differential Posets

arXiv:2607. 22988v1 Announce Type: cross Abstract: In Problem~6 of his 1988 paper on differential posets, Stanley asked for the least possible cardinality of a fixed rank of an $r$-differential poset and suggested that the minimum should be attained by $Y^r$, the $r$-fold Cartesian power of Young's lattice.

arXiv Machine Learning
Aug 31

An algebraic proof of Colombo's difference-power determinant conjecture

arXiv:2608. 28274v1 Announce Type: new Abstract: Let $n\ge2$ be even, let $\lambda=(\lambda_1,\ldots,\lambda_n)\in\mathbb{R}^n$ have pairwise distinct coordinates, and define the difference-power matrix \[ A_d(\lambda) := \bigl[(\lambda_r-\lambda_s)^d\bigr]_{r,s=1}^n, \qquad d\in\mathbb{N}.

By Kun Li, Li Tie, Peng Wang, Zihan Liu
arXiv AI
Jul 1

Improved Upper Bounds for Slicing the Hypercube

arXiv:2602. 16807v2 Announce Type: replace Abstract: A collection of hyperplanes $\mathcal{H}$ slices all edges of the $n$-dimensional hypercube $Q_n$ with vertex set $\{-1,1\}^n$ if, for every edge $e$ in the hypercube, there exists a hyperplane in $\mathcal{H}$ intersecting $e$ in its interior.

By Duncan Soiffer, Nathaniel Itty, Christopher D. Rosin, Blake Bruell, Mason DiCicco, G\'abor N. S\'ark\"ozy, Ryan Offstein, Daniel Reichman
arXiv Machine Learning
Sep 25

An Exposition of GPT Astra's Proof of Lower Bound on DP Continual Counting

The note provides a detailed proof of Astra’s lower bound for differentially private continual counting, building on recent work by Harrison and Leeman. It discusses earlier results, including a Ω(√{3}√{log(n)}) bound by Bairaktari and Larsen and their subsequent Ω(log^2(n)) bound for pure differential privacy. The authors aim to offer a more natural and accessible proof, hoping to aid further research in the area.

By Jalaj Upadhyay