English
Related papers

Related papers: Complex analytic proofs of two probabilistic theor…

200 papers

We show that a nonvanishing analytic function on a domain in the unit disc can be approximated by (a scalar multiple of) a Blaschke product whose zeros lie on a prescribed circle enclosing the domain. We also give a new proof of the…

Complex Variables · Mathematics 2010-02-02 David W. Farmer , Pamela Gorkin

In this paper we establish several invariant boundary versions of the (infinitesimal) Schwarz-Pick lemma for conformal pseudometrics on the unit disk and for holomorphic selfmaps of strongly convex domains in $\mathbb C^N$ in the spirit of…

Complex Variables · Mathematics 2023-08-08 Filippo Bracci , Daniela Kraus , Oliver Roth

For encompassing the limitations of probabilistic coherence spaces which do not seem to provide natural interpretations of continuous data types such as the real line, Ehrhard and al. introduced a model of probabilistic higher order…

Logic in Computer Science · Computer Science 2020-01-14 Thomas Ehrhard

We prove that Picard-Lindel\"of iterations for an arbitrary smooth normal Cauchy problem for PDE converge if we assume a suitable Weissinger-like sufficient condition. This condition includes both a large class of non-analytic PDE or…

Analysis of PDEs · Mathematics 2022-11-03 Paolo Giordano , Lorenzo Luperi Baglini

We extend the polynomial method of Chen--Garza-Vargas--Tropp--van Handel and Magee--Puder--van Handel for operator-norm bounds in random permutation models to the setting where torsion is present. The main new feature is that asymptotic…

Spectral Theory · Mathematics 2026-02-13 Marco Barbieri , Urban Jezernik

Let $f$ be an $E$-function (in Siegel's sense) not of the form $e^{\beta z}$, $\beta \in \overline{\mathbb{Q}}$, and let $\log$ denote any fixed determination of the complex logarithm. We first prove that there exists a finite set $S(f)$…

Number Theory · Mathematics 2024-09-30 Stéphane Fischler , Tanguy Rivoal

The synthesis of classical Computational Complexity Theory with Recursive Analysis provides a quantitative foundation to reliable numerics. Here the operators of maximization, integration, and solving ordinary differential equations are…

Numerical Analysis · Computer Science 2012-11-22 Akitoshi Kawamura , Norbert Th. Müller , Carsten Rösnick , Martin Ziegler

We prove that the HRT (Heil, Ramanathan, and Topiwala) conjecture holds for finite Gabor systems generated by square-integrable functions with certain behavior at infinity. These functions include functions ultimately decaying faster than…

Functional Analysis · Mathematics 2012-11-05 John J. Benedetto , Abdelkrim Bourouihiya

The object of this paper is to prove a version of the Beurling-Helson-Lowdenslager invariant subspace theorem for operators on certain Banach spaces of functions on a multiply connected domain in the complex plane. The norms for these…

Functional Analysis · Mathematics 2016-07-06 Yanni Chen , Don Hadwin , Zhe Liu , Eric Nordgren

We prove a pointwise ergodic theorem for quasi-probability-measure-preserving (quasi-pmp) locally countable measurable graphs, equivalently, Schreier graphs of quasi-pmp actions of countable groups. For ergodic graphs, the theorem gives an…

Dynamical Systems · Mathematics 2023-08-29 Anush Tserunyan

Affine continuous logic is extended to affine integration logic. Affine compactness theorem is proved by both the ultramean construction and Henkin's method. Also, a proof system and a completeness theorem are given. An appropriate variant…

Logic · Mathematics 2026-02-24 Seyed-Mohammad Bagheri

In this paper we introduce, via a Phragmen-Lindel\"of type theorem, a maximal plurisubharmonic function in a strongly pseudoconvex domain. We call such a function the {\sl pluricomplex Poisson kernel} because it shares many properties with…

Complex Variables · Mathematics 2020-12-02 Filippo Bracci , Alberto Saracco , Stefano Trapani

We study several rigidity properties of $p$-adic local systems on a smooth rigid analytic space $X$ over a $p$-adic field. We prove that the monodromy of the log isocrystal attached to a $p$-adic local system is ''rigid'' along irreducible…

Algebraic Geometry · Mathematics 2025-09-25 Hansheng Diao , Zijian Yao

The classical Julia-Wolff-Caratheodory theorem gives a condition ensuring the existence of the non-tangential limit of both a bounded holomorphic function and its derivative at a given boundary point of the unit disk in the complex plane.…

Complex Variables · Mathematics 2008-02-03 Marco Abate

The aim of this paper is to extend probability theory from the classical to the product t-norm fuzzy logic setting. More precisely, we axiomatize a generalized notion of finitely additive probability for product logic formulas, called…

Logic · Mathematics 2018-03-09 Tommaso Flaminio , Lluis Godo , Sara Ugolini

By Lindstr\"{o}m's theorems, the expressive power of first order logic (and similarly continuous logic) is not strengthened without losing some interesting property. Weakening it, is however less harmless and has been payed attention by…

Logic · Mathematics 2024-08-23 Seyed-Mohammad Bagheri

We prove a Tb Theorem that characterizes all Calderon-Zygmund operators that extend compactly on L^p(R^n), 1<p<\infty . The result, whose proof does not require the property of accretivity, can be used to prove compactness of the Double…

Classical Analysis and ODEs · Mathematics 2017-10-24 Paco Villarroya

In this paper, we study the compactness of the product and the commutator of two inner projections on the Hardy spaces over the unit disk and the polydisc. For the single-variable case, we provide a complete characterization of the…

Functional Analysis · Mathematics 2026-04-28 Peiran Zhang , Roumei Tian , Yufeng Lu , Yixin Yang , Chao Zu

Let $\mathfrak{p}_{\mathbb{P}_r}(n)$ denote the number of partitions of $n$ into $r$-full primes. We use the Hardy-Littlewood circle method to find the asymptotic of $\mathfrak{p}_{\mathbb{P}_r}(n)$ as $n \to \infty$. This extends previous…

Number Theory · Mathematics 2025-05-01 Anji Dong , Nicolas Robles , Alexandru Zaharescu , Dirk Zeindler

In \cite{Craig}, we introduced a syntactically defined and highly general class of calculi known as \emph{semi-analytic}. We then demonstrated that any sufficiently strong (modal) substructural logic with a semi-analytic calculus must…

Logic in Computer Science · Computer Science 2025-06-27 Amirhossein Akbar Tabatabai , Raheleh Jalali
‹ Prev 1 8 9 10 Next ›