arXiv subjects

Jiaye Wei

Publications and source records attributed to Jiaye Wei.

4 recordsLinked to original sources

arXiv2026

On Feige's conjecture

We present a short proof of Feige's conjecture: for $n$ independent nonnegative random variables with expectation one, the probability that their sum is less than $n+1$ is at least $\left(\frac{n}{n+1}\right)^n\ge \frac{1}{e}$. The proof was obtained with the assistance of GPT-5.6 Sol and builds on the recent breakthrough of Vlassis and Thomas establishing Gaffke's conjecture on the finite-sample validity of a distribution-free $p$-value. We also discuss the implications of the subsequent work of Ming, Ramdas, Shen, Wang, and Waudby-Smith.

math.PR↗

arXiv2026

Polyhedral extended formulations that approximate the Gomory closure for packing problems

We consider $0/1$ packing problems $\max\{c^T x \colon Ax \leq 1, \, x \in \{0,1\}^n\}$, with $A \in \mathbb{R}_{\geq 0}^{m \times n}$. A way to solve such problems is via tightening the linear programming relaxation $P$ with Gomory \emph{cutting-planes}. The Gomory-closure $P'$ of $P$ is the intersection of $P$ with all its cutting planes. The optimization problem over $P'$ is NP-hard. Mastrolilli (2020) has shown that for fixed $ε>0$, the Lasserre hierarchy yields a polynomial-size convex but non-polyhedral extended formulation that approximates $P'$ up to a factor of $1+ε$. Our main result is the construction of a polyhedral and polynomial extended formulation that approximates $P'$ with the same approximation guarantee. Our construction is based on first principles. Like Mastrolilli's approach, ours also applies to higher iterates $P^{(t)}$ for fixed $t$ and $ε>0$. In contrast to an explicit construction, communication complexity provides an alternative way to describe extended formulations. Using this approach we obtain a quasi-polynomial polyhedral extended formulation for the above problem that is superior in some parameter regimes. To achieve this, we describe a communication protocol extending Yannakakis' protocol to decide whether the clique of Alice and the stable set of Bob intersect.

math.OC↗

arXiv2025

Second Price Matching with Complete Allocation and Degree Constraints

We study the Second Price Matching problem, introduced by Azar, Birnbaum, Karlin, and Nguyen in 2009. In this problem, a bipartite graph (bidders and goods) is given, and the profit of a matching is the number of matches containing a second unmatched bidder. Maximizing profit is known to be APX-hard and the current best approximation guarantee is $1/2$. APX-hardness even holds when all degrees are bounded by a constant. In this paper, we investigate the approximability of the problem under regular degree constraints. Our main result is an improved approximation guarantee of $9/10$ for Second Price Matching in $(3,2)$-regular graphs and an exact polynomial-time algorithm for $(d,2)$-regular graphs if $d\geq 4$. Our algorithm and its analysis are based on structural results in non-bipartite matching, in particular the Tutte-Berge formula coupled with novel combinatorial augmentation methods. We also introduce a variant of Second Price Matching where all goods have to be matched, which models the setting of expiring goods. We prove that this problem is hard to approximate within a factor better than $(1-1/e)$ and show that the problem can be approximated to a tight $(1-1/e)$ factor by maximizing a submodular function subject to a matroid constraint. We then show that our algorithm also solves this problem exactly on regular degree constrained graphs as above.

cs.DS↗

arXiv2021

Filtering cohomology of ordinary and Lagrangian Grassmannians

This paper studies, for a positive integer $m$, the subalgebra of the cohomology ring of the complex Grassmannians generated by the elements of degree at most $m$. We build in two ways upon a conjecture for the Hilbert series of this subalgebra due to Reiner and Tudose. The first reinterprets it in terms of the operation of $k$-conjugation, suggesting two conjectural bases for the subalgebras that would imply their conjecture. The second introduces an analogous conjecture for the cohomology of Lagrangian Grassmannians.

math.CO↗