中文
相关论文

相关论文: Fast-growing series are transcendental

200 篇论文

This paper presents various transcendence results in the ring of integers modulo infinitely large primes $\mathcal{A}$. In the ring $\mathcal{A}$, one can consider two notions of transcendence. One is based on the notion of finite algebraic…

数论 · 数学 2026-04-29 Toshiki Matsusaka , Shin-ichiro Seki

We establish the existence of infinitely many \emph{polynomial} progressions in the primes; more precisely, given any integer-valued polynomials $P_1, >..., P_k \in \Z[\m]$ in one unknown $\m$ with $P_1(0) = ... = P_k(0) = 0$ and any $\eps…

数论 · 数学 2013-03-01 Terence Tao , Tamar Ziegler

A generalized family of transcendental (non-polynomial entire) functions is constructed, where the Hausdorff dimension and the packing dimension of the Julia sets are equal to one. Further, there exist multiply connected wandering domains,…

动力系统 · 数学 2022-02-28 Xu Zhang

The following result, a consequence of Dumas criterion for irreducibility of polynomials over integers, is generally proved using the notion of Newton diagram: Let $f(x)$ be a polynomial with integer coefficients and $k$ be a positive…

历史与综述 · 数学 2016-12-21 Akash Jena , Binod Kumar Sahoo

We study real numbers defined by multidimensional automatic arrays weighted by multiplicatively independent bases. Let $a_1, \dots, a_r\geq 2$ be integers such that $\log a_1, \dots, \log a_r$ are $\mathbb Q$-linearly independent. Given…

数论 · 数学 2026-04-15 Aadrita Paul , Anwesh Ray

This paper is concerned with growth series for expansion complexes for finite subdivision rules. Suppose X is an expansion complex for a finite subdivision rule with bounded valence and mesh approaching 0, and let S be a seed for X. One can…

动力系统 · 数学 2016-12-15 James W. Cannon , William J. Floyd , Walter R. Parry

In this paper, an explanation of the Newton-Peiseux algorithm is given. This explanation is supplemented with well-worked and explained examples of how to use the algorithm to find fractional power series expansions for all branches of a…

代数几何 · 数学 2008-07-30 Nicholas J. Willis , Annie K. Didier , Kevin M. Sonnanburg

The roots of a complex polynomial depend continuously on the coefficients; that is, an infinitesimal perturbation of the coefficients results in an infinitesimal perturbation of the roots. A short, straightforward proof of this is possible…

经典分析与常微分方程 · 数学 2022-07-08 David A. Ross

Starting from the expression for the superdeterminant of $ (xI-M)$, where $M$ is an arbitrary supermatrix , we propose a definition for the corresponding characteristic polynomial and we prove that each supermatrix satisfies its…

高能物理 - 理论 · 物理学 2015-06-26 L. F. Urrutia , N. Morales

We show that doubling at some large scale in a Cayley graph implies uniform doubling at all subsequent scales. The proof is based on the structure theorem for approximate subgroups proved by Green, Tao and the first author. We also give a…

群论 · 数学 2016-08-16 Emmanuel Breuillard , Matthew Tointon

Exponential sums with monomials are highly related to many interesting problems in number theory and well studied by many literatures. In this paper, we consider the exponential sums with polynomials and prove a new upper bound. As an…

数论 · 数学 2025-10-24 Lingyu Guo , Victor Zhenyu Guo , Mengyao Jing

For supercritical multitype branching processes in continuous time, we investigate the evolution of types along those lineages that survive up to some time t. We establish almost-sure convergence theorems for both time and population…

概率论 · 数学 2007-05-23 Hans-Otto Georgii , Ellen Baake

{\em The Liouville number}, denoted $l$, is defined by $$l:=0.100101011101101111100...,$$ where the $n$th bit is given by ${1/2}(1+\gl(n))$; here $\gl$ is the Liouville function for the parity of prime divisors of $n$. Presumably the…

数论 · 数学 2008-06-11 Peter Borwein , Michael Coons

Let R be a commutative ring with1 and R[X] be the polynomial ring over R. We determine the underlying ring R over which the polynomial ring R[X] has the property that all its prime ideals are set theoretic complete intersections.

交换代数 · 数学 2007-05-23 Vahap Erdogdu

It is shown that for a finite set $A$ of four or more complex numbers, the cardinality of the set $C[A]$ of all cross-ratios generated by quadruples of pair-wise distinct elements of $A$ is $|C[A]|\gg…

组合数学 · 数学 2017-05-05 Misha Rudnev

Building on the concept of pretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions.

数论 · 数学 2019-02-20 Dimitris Koukoulopoulos

Recently Conlon, Fox, and the author gave a new proof of a relative Szemer\'edi theorem, which was the main novel ingredient in the proof of the celebrated Green-Tao theorem that the primes contain arbitrarily long arithmetic progressions.…

数论 · 数学 2019-02-20 Yufei Zhao

Let $(X,L)$ be a polarized variety over a number field. We suppose that $L$ is an hermitian line bundle. Let $M$ be a non compact Riemann Surface and $U\subset M$ be a relatively compact open set. Let $\varphi:M\to X({\Bbb C})$ be a…

代数几何 · 数学 2018-08-30 Carlo Gasbarri

The Schinzel Hypothesis is a conjecture about irreducible polynomials in one variable over the integers: under some standard condition, they should assume infinitely many prime values at integers. We consider a relative version: if the…

数论 · 数学 2020-02-13 Arnaud Bodin , Pierre Dèbes , Salah Najib

We prove the "strong conjecture" expressed by Gazeau et al. in arXiv:1203.3936v1 [math-ph] about the coefficients of the Taylor expansion of the exponential of a polynomial. This implies the "weak conjecture" as a special case. The proof…

数学物理 · 物理学 2015-06-04 C. Vignat , O. Lévêque