English
Related papers

Related papers: T1 testing implies Tp polynomial testing: optimal …

200 papers

Local $Tb$ theorems with $L^p$ type testing conditions, which are not scale invariant, have been studied widely in the case of the Lebesgue measure. Until very recently, local $Tb$ theorems in the non-homogeneous case had only been proved…

Classical Analysis and ODEs · Mathematics 2016-04-18 Michael T. Lacey , Henri Martikainen

We prove a T(1) theorem for bilinear singular integral operators (trilinear forms) with a one-dimensional modulation symmetry.

Classical Analysis and ODEs · Mathematics 2007-10-05 Arpad Benyi , Ciprian Demeter , Andrea R. Nahmod , Christoph M. Thiele , Rodolfo H. Torres , Francisco Villarroya

We consider vanishing properties of exponential sums of the Liouville function $\lambda$ of the form $$ \lim_{H\to\infty}\limsup_{X\to\infty}\frac{1}{\log X}\sum_{m\leq X}\frac{1}{m}\sup_{\alpha\in C}\bigg|\frac{1}{H}\sum_{h\leq…

Dynamical Systems · Mathematics 2024-08-19 Adam Kanigowski , Mariusz Lemańczyk , Florian Karl Richter , Joni Teräväinen

We obtain structural results on translational tilings of periodic functions in $\mathbb{Z}^d$ by finite tiles. In particular, we show that any level one tiling of a periodic set in $\mathbb{Z}^2$ must be weakly periodic (the disjoint union…

Classical Analysis and ODEs · Mathematics 2021-09-27 Rachel Greenfeld , Terence Tao

We prove in a direct fashion that a multidimensional probability measure is determinate if the higher dimensional analogue of Carleman's condition is satisfied. In that case, the polynomials, as well as certain proper subspaces of the…

Classical Analysis and ODEs · Mathematics 2023-05-31 Marcel de Jeu

We give a nearly-optimal algorithm for testing uniformity of distributions supported on $\{-1,1\}^n$, which makes $\tilde O (\sqrt{n}/\varepsilon^2)$ queries to a subcube conditional sampling oracle (Bhattacharyya and Chakraborty (2018)).…

Data Structures and Algorithms · Computer Science 2021-02-08 Clément L. Canonne , Xi Chen , Gautam Kamath , Amit Levi , Erik Waingarten

Conformal testing is a way of testing the IID assumption based on conformal prediction. The topic of this note is computational evaluation of the performance of conformal testing in a model situation in which IID binary observations…

Machine Learning · Computer Science 2021-04-06 Vladimir Vovk

For a general Calderon-Zygmund operator $T$ on $R^N$, it is shown that $\|Tf\|_{L^2(w)}\leq C(T)\|w\|_{A_2}\|f\|_{L^2(w)}$ for all Muckenhoupt weights $w\in A_2$. This optimal estimate was known as the $A_2$ conjecture. A recent result of…

Classical Analysis and ODEs · Mathematics 2010-07-27 Tuomas P. Hytönen

We propose a general methodology for testing whether a given polynomial with integer coefficients is identically zero. The methodology evaluates the polynomial at efficiently computable approximations of suitable irrational points. In…

Data Structures and Algorithms · Computer Science 2007-05-23 Zhi-Zhong Chen , Ming-Yang Kao

We consider a field $f \circ T_1^{i_1} \circ \cdots \circ T_d^{i_d}$ where $T_1, \dots , T_d$ arecommuting transformations, one of them at least being ergodic. Considering the case of commuting filtrations, we are interested by giving…

Probability · Mathematics 2025-03-27 Christophe Cuny , Jérôme Dedecker , Florence Merlevède

The algorithmic theory of randomness is well developed when the underlying space is the set of finite or infinite sequences and the underlying probability distribution is the uniform distribution or a computable distribution. These…

Computational Complexity · Computer Science 2016-08-31 Peter Gacs

We study the necessary and sufficient conditions on Abelianizable first class constraints. The necessary condition is derived from topological considerations on the structure of gauge group. The sufficient condition is obtained by applying…

High Energy Physics - Theory · Physics 2016-09-06 Farhang Loran

In the past few years, several new matching models have been proposed and studied that take into account complex distributional constraints. Relevant lines of work include (1) school choice with diversity constraints where students have…

Computer Science and Game Theory · Computer Science 2020-02-18 Haris Aziz , Serge Gaspers , Zhaohong Sun , Toby Walsh

The Algebraic Dichotomy Conjecture states that the Constraint Satisfaction Problem over a fixed template is solvable in polynomial time if the algebra of polymorphisms associated to the template lies in a Taylor variety, and is NP-complete…

Logic in Computer Science · Computer Science 2015-07-01 Libor Barto , Marcin Kozik

We prove the $l^2$ Decoupling Conjecture for compact hypersurfaces with positive definite second fundamental form and also for the cone. This has a wide range of important consequences. One of them is the validity of the Discrete…

Classical Analysis and ODEs · Mathematics 2015-07-28 Jean Bourgain , Ciprian Demeter

A once-extended d-dimensional topological field theory Z is a symmetric monoidal functor (taking values in a chosen target symmetric monoidal (infty,2)-category) assigning values to (d-2)-manifolds, (d-1)-manifolds, and d-manifolds. We show…

Algebraic Topology · Mathematics 2018-06-13 Christopher Schommer-Pries

We prove an integral R = T theorem for odd two dimensional p-adic representations of the absolute Galois group which are unramified at p, extending results of [CG] to the non-minimal case. We prove, for any p, the existence of Katz modular…

Number Theory · Mathematics 2015-02-03 Frank Calegari

A toric polyhedron is a reduced closed subscheme of a toric variety that are partial unions of the orbits of the torus action. We prove vanishing theorems for toric polyhedra. We also give a proof of the $E_1$-degeneration of Hodge to de…

Algebraic Geometry · Mathematics 2008-02-04 Osamu Fujino

Standard singularity theorems are proven in Lorentzian manifolds of arbitrary dimension n if they contain closed trapped submanifolds of arbitrary co-dimension. By using the mean curvature vector to characterize trapped submanifolds, a…

General Relativity and Quantum Cosmology · Physics 2014-11-21 Gregory J. Galloway , José M. M. Senovilla

Unit two-variable-per-inequality (UTVPI) constraints form one of the largest class of integer constraints which are polynomial time solvable (unless P=NP). There is considerable interest in their use for constraint solving, abstract…

Data Structures and Algorithms · Computer Science 2007-09-20 Andreas Schutt , Peter J. Stuckey
‹ Prev 1 8 9 10 Next ›