Cover Image

Equality in Fill's spectral gap problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Jain, Vishesh, Mizgerd, Clayton
Format:	Preprint
Published:	2026
Subjects:	Combinatorics Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The random graph process is globally synchronizing
by: Jain, Vishesh, et al.
Published: (2025)

Rapid mixing of the down-up walk on matchings of a fixed size
by: Jain, Vishesh, et al.
Published: (2024)

On the chromatic number of random triangle-free graphs
by: Mizgerd, Clayton, et al.
Published: (2025)

Sampling Colorings Close to the Maximum Degree: Non-Markovian Coupling and Local Uniformity
by: Jain, Vishesh, et al.
Published: (2026)

An interesting spectral gap problem, from Jim Fill
by: Fill, James Allen
Published: (2025)

Thinned Quantile Shares are Universally Feasible
by: Jain, Vishesh, et al.
Published: (2026)

A Nordhaus--Gaddum problem for the spectral gap of a graph
by: Kim, Sooyeong, et al.
Published: (2024)

A combinatorial approach to nonlinear spectral gaps
by: Altschuler, Dylan J., et al.
Published: (2024)

Inducibility of rainbow graphs
by: Cairncross, Emily, et al.
Published: (2024)

Eigenvalue gaps of the Laplacian of random graphs
by: Christoffersen, Nicholas, et al.
Published: (2024)

The random graph process is globally synchronizing
by: Vishesh Jain, et al.
Published: (2025)

Spectral gap of biased adjacent-transposition chains
by: Greaves, Gary R. W., et al.
Published: (2026)

The limiting spectral law for sparse iid matrices
by: Sah, Ashwin, et al.
Published: (2023)

Limiting spectral laws for sparse random circulant matrices
by: Beker, Adrian
Published: (2025)

The Reverse Littlewood--Offord problem of Erdős
by: He, Xiaoyu, et al.
Published: (2024)

The Ulam-Hammersley problem for multiset permutations
by: Gerin, Lucas
Published: (2023)

Revisiting the Random Subset Sum problem
by: da Cunha, Arthur, et al.
Published: (2022)

Central limit theorems for linear spectral statistics of inhomogeneous random graphs with graphon limits
by: Zhu, Xiangyi, et al.
Published: (2024)

Some easy optimization problems have the overlap-gap property
by: Li, Shuangping, et al.
Published: (2024)

The number of solutions of a random system of polynomials over a finite field
by: Jain, Ritik
Published: (2024)

A combinatorial problem related to the classical probability
by: Zhou, Jiang
Published: (2024)

The random stable roommates problem typically has no solution
by: Chin, Byron, et al.
Published: (2026)

The generalized Alice HH vs Bob HT problem
by: Janson, Svante, et al.
Published: (2025)

Double-jump phase transition for the reverse Littlewood--Offord problem
by: Hollom, Lawrence, et al.
Published: (2025)

Hitting time mixing for the random transposition walk
by: Jain, Vishesh, et al.
Published: (2024)

The Large Deviation Principle for $W$-random spectral measures
by: Ghandehari, Mahya, et al.
Published: (2024)

Random permutations acting on $k$--tuples have near--optimal spectral gap for $k=\mathrm{poly}(n)$
by: Cassidy, Ewan
Published: (2024)

Large deviations of the empirical spectral measure of supercritical sparse Wigner matrices
by: Augeri, Fanny
Published: (2024)

A symbolic computational approach to the generalized gambler's ruin problem in one and two dimensions
by: Martinez, Lucy
Published: (2024)

$q$-deformed Gaussian unitary ensemble: spectral moments and genus-type expansions
by: Byun, Sung-Soo, et al.
Published: (2024)

On a discrete max-plus transportation problem
by: Mayorga, Sergio, et al.
Published: (2026)

Algebraic aspects of the polynomial Littlewood-Offord problem
by: Jin, Zhihan, et al.
Published: (2025)

Symmetric functions and the explicit moment problem for abelian groups
by: Van Peski, Roger
Published: (2024)

Geometric Littlewood-Offord problems via lattice point counting
by: Grebennikov, Alexandr, et al.
Published: (2025)

$q$-deformation of random partitions, determinantal structure, and Riemann-Hilbert problem
by: Kimura, Taro
Published: (2025)

Spectral gap of nonreversible Markov chains
by: Chatterjee, Sourav
Published: (2023)

The Chvátal-Sankoff problem: Understanding random string comparison through stochastic processes
by: Tiskin, Alexander
Published: (2022)

Separating complexity classes of LCL problems on grids
by: Berlow, Katalin, et al.
Published: (2025)

Card guessing and the birthday problem for sampling without replacement
by: He, Jimmy, et al.
Published: (2021)

A concentration inequality for random combinatorial optimisation problems
by: Danielsson, Joel Larsson
Published: (2024)