6 papers
Good Locally Testable Codes with Small Alphabet and Small Query Size
Uriya First, Stav Lazarovici
Ben-Sasson, Goldreich and Sudan showed that a binary error correcting code admitting a -query tester cannot be good, i.e., it cannot have both linear distance and constant rate.…
Hypergraph Samplers: Typical and Worst Case Behavior
Vedat Levi Alev, Uriya A. First
We study the utility and limitations of using -uniform hypergraphs () in the context of error reduction for randomized algorithms for deci…
Algebraic Groups with Torsors That Are Versal for All Affine Varieties
Uriya A. First, Mathieu Florence, Zev Rosengarten
Let be a field and let be an affine algebraic group over . Call a -torsor weakly versal for a class of -schemes if it specializes to every -torsor over…
Counterexamples in Involutions of Azumaya Algebras
Uriya First, Ben Williams
Suppose is an Azumaya algebra over a ring and is an involution of extending an order- automorphism . We say is extraordinary if there does not e…
The Cheeger Inequality and Coboundary Expansion: Beyond Constant Coefficients
Uriya A. First, Tali Kaufman
The Cheeger constant of a graph, or equivalently its coboundary expansion, quantifies the expansion of the graph. This notion assumes an implicit choice of a coefficient group, nam…
Irredundant Generating Sets for Matrix Algebras
Yonatan Blumenthal, Uriya First
Let be a field. We show that the largest irredundant generating sets for the algebra of matrices over have elements when . (A result of Laffey stat…