中文
相关论文

相关论文: Classification of Escaping Exponential Maps

200 篇论文

Let k be an algebraically closed field of characteristic p. Let X(p^e;N) be the curve parameterizing elliptic curves with full level N structure (where p does not divide N) and full level p^e Igusa structure. By modular curve, we mean a…

代数几何 · 数学 2017-04-03 Bjorn Poonen

We answer a variant of a question of Rodl and Voigt by showing that, for a given infinite cardinal lambda, there is a graph G of cardinality kappa =(2^lambda)^+ such that for any colouring of the edges of G with lambda colours, there is an…

逻辑 · 数学 2008-02-03 Eric C. Milner , Saharon Shelah

We classify transcendental entire functions that are compositions of a polynomial and the exponential for which all singular values escape on disjoint rays. The construction involves an iteration procedure on an infinite-dimensional…

动力系统 · 数学 2025-07-29 Konstantin Bogdanov

A graph property is elusive (or evasive) if any algorithm testing it by asking questions of the form ''Is there an edge between vertices x and y?'' must, in the worst case, examine all pairs of vertices. Elusiveness for infinite vertex sets…

组合数学 · 数学 2025-10-22 Márton Elekes , Tamás Kátay , Anett Kocsis

Two graphs are of the same topological type if they can be mutually embedded into each other topologically. We show that there are exactly $\aleph_1$ distinct topological types of countable trees. In general, for any infinite cardinal…

组合数学 · 数学 2023-05-24 Thilo Krill , Max Pitz

A graph property is said to be elusive ( evasive) if every algorithm testing this property by asking questions of the form "is there an edge between vertices x and y" requires, in the worst case, to ask about all pairs of vertices. The…

组合数学 · 数学 2022-06-22 Tamás Csernák , Lajos Soukup

The main aim of this article is to show that maps with specification property have invariant distributionally scrambled sets and that this kind of scrambled set can be transferred from factor to extension under finite-to-one factor maps.…

动力系统 · 数学 2012-09-12 Magdalena Foryś , Piotr Oprocha , Paweł Wilczyński

We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…

计算机科学中的逻辑 · 计算机科学 2015-07-01 Martin Escardo

Let f be an entire function with a bounded set of singular values, and suppose furthermore that the postsingular set of f is bounded. We show that every component of the escaping set I(f) is unbounded. This provides a partial answer to a…

动力系统 · 数学 2007-12-11 Lasse Rempe

Suppose L = {<, . . .} is any countable first order language in which < is interpreted as a linear order. Let T be any complete first order theory in the language L such that T has a kappa-like model where kappa is an inaccessible cardinal.…

逻辑 · 数学 2010-06-22 Shahram Mohsenipour

We consider the long time behavior of the trajectories of the discontinuous analog of the standard Chirikov map. We prove that for some values of parameters all the trajectories remains bounded for all time. For other set of parameters we…

动力系统 · 数学 2018-12-18 Maxim Arnold , Thomas Dauer , Meg Doucette , Shan-Conrad Wolf

A well-known result of Bill Parry shows that a topologically transitive continuous piecewise monotone mapping with positive topological entropy is conjugate to a uniformly piecewise linear mapping with slope determined by the entropy. In…

动力系统 · 数学 2010-08-05 Chris Preston

We consider the totally asymmetric exclusion process on a ring in discrete time with the backward-ordered sequential update and particle-dependent hopping probabilities. Using a combinatorial treatment of the Bethe ansatz, we derive the…

统计力学 · 物理学 2008-07-02 V. S. Poghosyan , V. B. Priezzhev

We derive the full phase diagram for a large family of two-parameter exponential random graph models, each containing a first order transition curve ending in a critical point.

概率论 · 数学 2013-12-06 Charles Radin , Mei Yin

Answering some of the main questions from [MR13], we show that whenever $\kappa$ is a cardinal satisfying $\kappa^{< \kappa} = \kappa > \omega$, then the embeddability relation between $\kappa$-sized structures is strongly invariantly…

逻辑 · 数学 2021-02-18 Filippo Calderoni , Heike Mildenberger , Luca Motto Ros

Let $S$ be a connected orientable surface of finite topological type. We prove that there is an exhaustion of the curve complex $\mathcal{C}(S)$ by a sequence of finite rigid sets.

几何拓扑 · 数学 2016-03-30 Javier Aramayona , Christopher J. Leininger

The topological entropy of piecewise affine maps is studied. It is shown that singularities may contribute to the entropy only if there is angular expansion and we bound the entropy via the expansion rates of the map. As a corollary we…

动力系统 · 数学 2007-05-23 Boris Kruglikov , Martin Rypdal

The current paper answers an open question of abs/1007.2426 We say that a countable model M characterizes an infinite cardinal kappa, if the Scott sentence of M has a model in cardinality kappa, but no models in cardinality kappa plus. If M…

逻辑 · 数学 2012-05-07 Ioannis Souldatos

We study conditions on automorphisms of Boolean algebras of the form $P(\lambda)/I_\kappa$ (where $\lambda$ is an uncountable cardinal and $I_\kappa$ is the ideal of sets of cardinality less than $\kappa$) which allow one to conclude that a…

逻辑 · 数学 2015-08-31 Paul Larson , Paul McKenney

Given any finitely aligned higher-rank graph $\Lambda$ and any unital commutative ring $R$, the Kumjian-Pask algebra $\mathrm{KP}_R(\Lambda)$ is known as the higher-rank generalization of Leavitt path algebras. After characterizing simple…

环与代数 · 数学 2017-01-04 Hossein Larki