From the 1 of 11 linked papers with an AI index.
11 papers
On graphically local versions of metric embeddings
Vishesh Jain, Duan Tu
We consider the problem of graphically local metric embedding, i.e. embedding points from an arbitrary finite metric space into a target metric space while preserving, up to a smal…
Entanglement asymmetry characterization of the Chiral Anomaly
Alfred Benedito, Alfred Benedito German Sierra, German Sierra
Shao et al. recently showed that the 1+1D staggered fermion Hamiltonian admits a whole algebra of lattice operators that flow to the same axial charge in the thermodynamic limit (T…
Total variation cutoff for Kac's walk on the sphere
Vishesh Jain, Clayton Mizgerd
The paper proves that the discrete-time Kac walk on the (n‑1)-dimensional sphere, started from a coordinate vector, exhibits a total‑variation cutoff at time C_{BRW}·n·log n (with…
The online monotone array completion problem
Vishesh Jain, Dylan King, Clayton Mizgerd
Consider the following online filling game. An array of length is initially empty. At each time step one observes an independent sample from and must eithe…
On the maximum density of -graphs in which every -set spans or edges
Vishesh Jain, Haoran Luo, Dhruv Mubayi
In 1984, Frankl and Füredi asked for the maximum density of an -vertex -graph in which every -set of vertices spans or edges. They gave a construction with as…
The size of the spanning-tree spectrum of simple graphs
Vishesh Jain
For a graph , let denote the number of spanning trees. We show that for every fixed , the number of distinct values of , as ranges over simple gr…