18 research outputs found
Ordinary Primes for Abelian Surfaces
We compute the density of the set of ordinary primes of an abelian surface
over a number field in terms of the l-adic monodromy group. Using the
classification of l-adic monodromy groups of abelian surfaces by Fite, Kedlaya,
Rotger, and Sutherland, we show the density is 1, 1/2, or 1/4.Comment: 4 pages - added reference
Upper bounds for sunflower-free sets
A collection of sets is said to form a -sunflower, or -system,
if the intersection of any two sets from the collection is the same, and we
call a family of sets sunflower-free if it contains no
sunflowers. Following the recent breakthrough of Ellenberg and Gijswijt and
Croot, Lev and Pach we apply the polynomial method directly to
Erd\H{o}s-Szemer\'{e}di sunflower problem and prove that any sunflower-free
family of subsets of has size at most We say that
a set for is
sunflower-free if every distinct triple there exists a coordinate
where exactly two of are equal. Using a version of the
polynomial method with characters
instead of polynomials, we
show that any sunflower-free set has size
where . This can be
seen as making further progress on a possible approach to proving the
Erd\H{o}s-Rado sunflower conjecture, which by the work of Alon, Sphilka and
Umans is equivalent to proving that for some constant
independent of .Comment: 5 page
Ramanujan Coverings of Graphs
Let be a finite connected graph, and let be the spectral radius of
its universal cover. For example, if is -regular then
. We show that for every , there is an -covering
(a.k.a. an -lift) of where all the new eigenvalues are bounded from
above by . It follows that a bipartite Ramanujan graph has a Ramanujan
-covering for every . This generalizes the case due to Marcus,
Spielman and Srivastava (2013).
Every -covering of corresponds to a labeling of the edges of by
elements of the symmetric group . We generalize this notion to labeling
the edges by elements of various groups and present a broader scenario where
Ramanujan coverings are guaranteed to exist.
In particular, this shows the existence of richer families of bipartite
Ramanujan graphs than was known before. Inspired by Marcus-Spielman-Srivastava,
a crucial component of our proof is the existence of interlacing families of
polynomials for complex reflection groups. The core argument of this component
is taken from a recent paper of them (2015).
Another important ingredient of our proof is a new generalization of the
matching polynomial of a graph. We define the -th matching polynomial of
to be the average matching polynomial of all -coverings of . We show this
polynomial shares many properties with the original matching polynomial. For
example, it is real rooted with all its roots inside .Comment: 38 pages, 4 figures, journal version (minor changes from previous
arXiv version). Shortened version appeared in STOC 201
Certifying the restricted isometry property is hard
This paper is concerned with an important matrix condition in compressed
sensing known as the restricted isometry property (RIP). We demonstrate that
testing whether a matrix satisfies RIP is NP-hard. As a consequence of our
result, it is impossible to efficiently test for RIP provided P \neq NP
Notes on commutation of limits and colimits
We show that there are infinitely many distinct closed classes of colimits
(in the sense of the Galois connection induced by commutation of limits and
colimits in Set) which are intermediate between the class of pseudo-filtered
colimits and that of all (small) colimits. On the other hand, if the
corresponding class of limits contains either pullbacks or equalizers, then the
class of colimits is contained in that of pseudo-filtered colimits.Comment: 5 pages. Version 2: very minor edit