English
Related papers

Related papers: Lecture notes on the Ein-Popa extension result

200 papers

Summation formulae are classical tools in analysis: Taylor-MacLaurin, Euler-MacLaurin, Poisson, Vorono\"i, Circle formulae\ldots We will show how, from a single equation - referred to as the mother-equation - it is possible to unify these…

Complex Variables · Mathematics 2016-04-29 Feauveau Jean-Christophe

In the present work we prove a number of surprising results about gaps between consecutive primes and arithmetic progressions in the sequence of generalized twin primes which could not have been proven without the recent fantastic…

Number Theory · Mathematics 2013-05-28 Janos Pintz

We introduce a new technique for constructing a finite state deterministic automaton from a regular expression, based on the idea of marking a suitable set of positions inside the expression, intuitively representing the possible points…

Formal Languages and Automata Theory · Computer Science 2010-10-14 Andrea Asperti , Claudio Sacerdoti Coen , Enrico Tassi

We use a $p$-adic analogue of the analytic subgroup theorem of W\"ustholz to deduce the transcendence and linear independence of some new classes of $p$-adic numbers. In particular we give $p$-adic analogues of results of W\"ustholz…

Number Theory · Mathematics 2016-01-12 Clemens Fuchs , Duc Hiep Pham

In this short note, we present a self-contained exposition of the supersimplicity of certain expansions of the additive group of the integers, such as adding a generic predicate (due to Chatzidakis and Pillay), a predicate for the…

Logic · Mathematics 2026-05-15 Amador Martin-Pizarro , Daniel Palacín

J{\'o}nsson and Tarski's notion of the perfect extension of a Boolean algebra with operators has evolved into an extensive theory of canonical extensions of lattice-based algebras. After reviewing this evolution we make two contributions.…

Logic · Mathematics 2023-11-08 Robert Goldblatt

Non-n-ampleness as defined by Pillay and Evans is preserved under analysability. Generalizing this to a more general notion of Sigma-ampleness, we obtain an immediate proof for all simple theories of CHatzidakis weak Canonical Base Property…

Logic · Mathematics 2013-06-25 Daniel Palacin , Frank Olaf Wagner

This text gives a rough, but linear summary covering some key definitions, notations, and propositions from Lambda Calculus: Its Syntax and Semantics, the classical monograph by Barendregt. First, we define a theory of untyped extensional…

Logic in Computer Science · Computer Science 2013-10-28 Anton Salikhmetov

We study an untyped lambda calculus with quantum data and classical control. This work stems from previous proposals by Selinger and Valiron and by Van Tonder. We focus on syntax and expressiveness, rather than (denotational) semantics. We…

Logic in Computer Science · Computer Science 2007-05-23 Ugo Dal Lago , Andrea Masini , Margherita Zorzi

Dumitru Popa found asymptotic expansions for certain nonlinear recurrences, but left open the numerical evaluation of associated constants. We address this issue. A change of variables involving reciprocals and the algorithm of Mavecha &…

Classical Analysis and ODEs · Mathematics 2025-06-24 Steven Finch

A conjecture of Benjamini & Schramm from 1996 states that any finitely generated group that is not a finite extension of Z has a non-trivial percolation phase. Our main results prove this conjecture for certain groups, and in particular…

Probability · Mathematics 2016-07-01 Aran Raoufi , Ariel Yadin

This paper achieves, among other things, the following: 1)It frees the main result of [BFKM] from the hypothesis of determinant class and extends this result from unitary to arbitrary representations. 2)It extends (and at the same times…

Differential Geometry · Mathematics 2007-05-23 D. Burghelea , Leonid Friedlander , T. Kappeler

We follow the approach developed by Beilinson-Lusztig-MacPherson and modified by Fu and the first author to investigate a new realization for the i-quantum groups U^j(n) of type B, building on the multiplication formulas discovered in…

Quantum Algebra · Mathematics 2020-11-06 Jie Du , Yadi Wu

In 2007, Terence Tao wrote on his blog an essay about soft analysis, hard analysis and the finitization of soft analysis statements into hard analysis statements. One of his main examples was a quasi-finitization of the infinite pigeonhole…

Logic · Mathematics 2010-09-30 Jaime Gaspar , Ulrich Kohlenbach

Assuming standard conjectures, we show that the canonical symmetrizing trace evaluated at powers of a Coxeter element produces rational Catalan numbers for irreducible spetsial complex reflection groups. This extends a technique used by…

Representation Theory · Mathematics 2023-10-20 Weston Miller

We summarise known algebraic and model theoretic results on the ring $\mathscr{A}$ of integers modulo infinitely large primes for number theorists, and share topics in transcendental number theory with algebraists and model theorists. In…

Number Theory · Mathematics 2026-05-04 Tomoki Mihara

We extend expansion formulas of Liu given in 2013 to the context of multiple series over root systems. Liu and others have shown the usefulness of these formulas in Special Functions and number-theoretic contexts. We extend Wang and Ma's…

Classical Analysis and ODEs · Mathematics 2022-02-22 Gaurav Bhatnagar , Surbhi Rai

Given a weakly compact cardinal $\kappa$, we give an axiomatization of intuitionistic first-order logic over $\mathcal{L}_{\kappa^+, \kappa}$ and prove it is sound and complete with respect to Kripke models. As a consequence we get the…

Logic · Mathematics 2020-12-29 Christian Espíndola

Expansions of the monadic second-order (MSO) theory of the structure $\langle \mathbb{N} ; < \rangle$ have been a fertile and active area of research ever since the publication of the seminal papers of B\"uchi and Elgot & Rabin on the…

Logic in Computer Science · Computer Science 2025-07-23 Joris Nieuwveld , Joël Ouaknine

The approach taken by Gheorghiu, Gu and Pym in their paper on giving a Base-extension Semantics for Intuitionistic Multiplicative Linear Logic is an interesting adaptation of the work of Sandqvist for IPL to the substructural setting. What…

Logic in Computer Science · Computer Science 2025-10-16 Yll Buzoku