English
Related papers

Related papers: On the Pila-Wilkie theorem

200 papers

We study the uniform computational content of the Vitali Covering Theorem for intervals using the tool of Weihrauch reducibility. We show that a more detailed picture emerges than what a related study by Giusto, Brown, and Simpson has…

Logic · Mathematics 2018-08-23 Vasco Brattka , Guido Gherardi , Rupert Hölzl , Arno Pauly

Empirical properties of generating systems for complex reflection groups and their braid groups have been observed by Orlik-Solomon and Brou\'e-Malle-Rouquier, using Shephard-Todd classification. We give a general existence result for…

Group Theory · Mathematics 2009-10-31 David Bessis

This paper is motivated by a 2001 paper of Choie and Kim and a 2006 paper of Bump and Choie. The paper of Choie and Kim extends an earlier result of Bol for elliptic modular forms to the setting of Siegel and Jacobi forms. The paper of Bump…

Number Theory · Mathematics 2011-10-05 Joseph Hundley

In their recent article, Min Ru and Paul Vojta, among other things, proved the so-called general theorem (arithmetic part) which can be viewed as an extension of Schmidt's subspace theorem. In this note, we extend their result by replacing…

Number Theory · Mathematics 2021-03-05 Min Ru , Julie Tzu-Yueh Wang

By a [$K$-]approximate subring of a ring we mean an additively symmetric subset $X$ such that $X \cdot X \cup (X + X)$ is covered by finitely many [resp.\ $K$] additive translates of $X$. We prove a structure theorem for finite approximate…

Rings and Algebras · Mathematics 2026-04-07 Krzysztof Krupiński , Simon Machado

The purpose of this survey is to present analytic versions of the injectivity theorem and their applications. The proof of our injectivity theorems is based on a combination of the L^2-method for the dbar-equation and the theory of harmonic…

Complex Variables · Mathematics 2015-11-16 Shin-ichi Matsumura

This work applies the ideas of Alekseev and Meinrenken's Non-commutative Chern-Weil Theory to describe a completely combinatorial and constructive proof of the Wheeling Theorem. In this theory, the crux of the proof is, essentially, the…

Quantum Algebra · Mathematics 2019-12-19 Andrew Kricker

We study $\mathbb{R}_{\textrm{an},\exp}$-definable functions $f:\mathbb{R}\to \mathbb{R}$ that take integer values at all sufficiently large positive integers. If $|f(x)|= O\big(2^{(1+10^{-5})x}\big)$, then we find polynomials $P_1, P_2$…

We present a short new proof of Cobham's theorem without using Kronecker's approximation theorem, making it suitable for generalization beyond automatic sequences.

Formal Languages and Automata Theory · Computer Science 2018-01-23 Thijmen J. P. Krebs

We give a short and self-contained proof of the Marker-Steinhorn Theorem for o-minimal expansions of ordered groups, based on an analysis of linear orders definable in such structures.

Logic · Mathematics 2013-09-25 Erik Walsberg

The null splitting theorem (proved in math.DG/9909158) is discussed. As an application, a uniqueness theorem for Minkowski space and for de Sitter space associated with the occurrence of null lines (inextendible globally achronal null…

General Relativity and Quantum Cosmology · Physics 2007-05-23 Gregory J. Galloway

In this paper we present theorems and applications of Wallis theorem related to trigonometric integrals.

General Mathematics · Mathematics 2007-08-27 Mihaly Bencze , Florentin Smarandache

We provide sharp cylindrical parametrizations of cylindrical cell decompositions by maps with bounded $C^{r}$ norm in the sharply o-minimal setting, thus generalizing and strengthening the Yomdin-Gromov Algebraic Lemma. We introduce forts,…

Logic · Mathematics 2023-01-13 Dmitri Novikov , Benny Zak

Muchnik's theorem about simple conditional descriprion states that for all words $a$ and $b$ there exists a short program $p$ transforming $a$ to $b$ that has the least possible length and is simple conditional on $b$. This paper presents a…

Computational Complexity · Computer Science 2008-11-25 Daniil Musatov

We construct Ionel-Parker's proposed refinement of the standard relative Gromov-Witten invariants in terms of abelian covers of the symplectic divisor and discuss in what sense it gives rise to invariants. We use it to obtain some vanishing…

Symplectic Geometry · Mathematics 2014-12-30 Mohammad F. Tehrani , Aleksey Zinger

The goal of this expository article is to present a proof that is as direct and elementary as possible of the fundamental theorem of complex multiplication (Shimura, Taniyama, Langlands, Tate, Deligne et al.). The article is a revision of…

Number Theory · Mathematics 2007-05-24 J. S. Milne

The usage of elementary submodels is a simple but powerful method to prove theorems, or to simplify proofs in infinite combinatorics. First we introduce all the necessary concepts of logic, then we prove classical theorems using elementary…

Logic · Mathematics 2010-12-07 Lajos Soukup

L. Weinstein's brilliant short proof of de Branges's Theorem is made even shorter by using computer algebra.

Combinatorics · Mathematics 2008-02-03 Shalosh B. Ekhad , Doron Zeilberger

An approximation result for the bilinear Hilbert transform is proved and used for the inversion of the bilinear Hilbert transform. Also, p-Lebesgue points $(p\geq 1)$ are analyzed.

Functional Analysis · Mathematics 2016-08-14 A. Bučkovska , S. Pilipović , M. Vuković

We point out that the recent proof of the Kupershmidt-Wilson theorem by Cheng and Mas-Ramos is underpinned by the Lie-Poisson property of the second Gel'fand-Dickey bracket. The supersymmetric Kupershmidt-Wilson theorem is also proved along…

q-alg · Mathematics 2009-10-28 JM Figueroa-O'Farrill , S Stanciu