Improved bounds in Weaver and Feichtinger conjectures
نویسندگان
چکیده
منابع مشابه
Bounds for the Lang-trotter Conjectures
For a non-CM elliptic curve E/Q, Lang and Trotter made very deep conjectures concerning the number of primes p ≤ x for which ap(E) is a fixed integer (and for which the Frobenius field at p is a fixed imaginary quadratic field). Under GRH, we use a smoothed version of the Chebotarev density theorem to improve the best known Lang-Trotter upper bounds of Murty, Murty and Saradha, and Cojocaru and...
متن کاملFrames and the Feichtinger Conjecture
We show that the conjectured generalization of the BourgainTzafriri restricted-invertibility theorem is equivalent to the conjecture of Feichtinger, stating that every bounded frame can be written as a finite union of Riesz basic sequences. We prove that any bounded frame can at least be written as a finite union of linear independent sequences. We further show that the two conjectures are impl...
متن کاملSmall-Scale Structure of Spacetime: Bounds and Conjectures
This review consists of two parts. The first part establishes certain astrophysical bounds on the smoothness of classical spacetime. The best bounds to date are based on the absence of vacuum Cherenkov radiation in ultra-high-energy cosmic rays. The second part discusses possible theoretical implications for the quantum structure of spacetime. A conjecture is presented that the fundamental leng...
متن کاملEditorial "In honor of Gustav Feichtinger"
The objective of this special issue is to demonstrate the influence of Prof. Gustav Feichtinger on OR in Austria. He became professor emeritus in 2008, but he is still highly active and also through his students, assistants, co-authors, and collaboration partners his work lives on. Many authors of this special issue have been former students and assistants of Gustav. Meanwhile, many of them bec...
متن کامل5 Improved Pebbling Bounds
Consider a configuration of pebbles distributed on the vertices of a connected graph of order n. A pebbling step consists of removing two pebbles from a given vertex and placing one pebble on an adjacent vertex. A distribution of pebbles on a graph is called solvable if it is possible to place a pebble on any given vertex using a sequence of pebbling steps. The pebbling number of a graph, denot...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal für die reine und angewandte Mathematik (Crelles Journal)
سال: 2019
ISSN: 0075-4102,1435-5345
DOI: 10.1515/crelle-2016-0032