4 citations · 11 across the 12 of their papers we have counts for
15 papers
symmetry broken supersolid in spin-orbit-coupled Bose-Einstein condensates
Ze-Hong Guo, Qizhong Zhu
Supersolid is an exotic state of matter characterized by both superfluid properties and periodic particle density modulation, due to spontaneous breaking of U(1) gauge symmetry and…
Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets
Zeyu Guo, Zihan Zhang
This paper shows that, with high probability, randomly punctured Reed-Solomon codes over fields of polynomial size achieve the list decoding capacity. More specifically, we prove t…
Extractors for Images of Varieties
Zeyu Guo, Ben Lee Volk, Akhil Jalan +1
We construct explicit deterministic extractors for polynomial images of varieties, that is, distributions sampled by applying a low-degree polynomial map $f : \mathbb{F}_q^r \to \m…
Fast Multivariate Multipoint Evaluation Over All Finite Fields
Vishwas Bhargava, Sumanta Ghosh, Zeyu Guo +2
Multivariate multipoint evaluation is the problem of evaluating a multivariate polynomial, given as a coefficient vector, simultaneously at multiple evaluation points. In this work…
Variety Evasive Subspace Families
Zeyu Guo
We introduce the problem of constructing explicit variety evasive subspace families. Given a family of subvarieties of a projective or affine space, a collection $\ma…
Efficient List-Decoding with Constant Alphabet and List Sizes
Zeyu Guo, Noga Ron-Zewi
We present an explicit and efficient algebraic construction of capacity-achieving list decodable codes with both constant alphabet and constant list sizes. More specifically, for a…
Improved List-Decodability of Reed--Solomon Codes via Tree Packings
Zeyu Guo, Ray Li, Chong Shangguan +2
This paper shows that there exist Reed--Solomon (RS) codes, over \black{exponentially} large finite fields \black{in the code length}, that are combinatorially list-decodable well…
Factoring Polynomials over Finite Fields with Linear Galois Groups: An Additive Combinatorics Approach
Zeyu Guo
Let be a degree- polynomial such that factorizes into distinct linear factors over . We study the pr…
Derandomization from Algebraic Hardness
Zeyu Guo, Mrinal Kumar, Ramprasad Saptharishi +1
A hitting-set generator (HSG) is a polynomial map such that for all -variate polynomials of small enough circuit size and degree, if is…
Algebraic dependencies and PSPACE algorithms in approximative complexity
Zeyu Guo, Nitin Saxena, Amit Sinhababu
Testing whether a set of polynomials has an algebraic dependence is a basic problem with several applications. The polynomials are given as algebraic circuits. Algebra…
-schemes and Deterministic Polynomial Factoring over Finite Fields
Zeyu Guo
We introduce a family of mathematical objects called -schemes, where is a poset of subgroups of a finite group . A -scheme is a collectio…
Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields
Zeyu Guo, Anand Kumar Narayanan, Chris Umans
The fastest known algorithm for factoring univariate polynomials over finite fields is the Kedlaya-Umans (fast modular composition) implementation of the Kaltofen-Shoup algorithm.…
Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading
Zeyu Guo, He Sun
We study gossip algorithms for the rumor spreading problem which asks one node to deliver a rumor to all nodes in an unknown network. We present the first protocol for any expander…
Randomness-efficient Curve Samplers
Zeyu Guo
Curve samplers are sampling algorithms that proceed by viewing the domain as a vector space over a finite field, and randomly picking a low-degree curve in it as the sample. Curve…
Randomness-Efficient Rumor Spreading
Zeyu Guo, He Sun
We study the classical rumor spreading problem, which is used to spread information in an unknown network with nodes. We present the first protocol for any expander graph w…