中文
相关论文

相关论文: Filled Julia sets with empty interior are computab…

200 篇论文

We prove that the Julia set $J(f)$ of at most finitely renormalizable unicritical polynomial $f:z\mapsto z^d+c$ with all periodic points repelling is locally connected. (For $d=2$ it was proved by Yoccoz around 1990.) It follows from a…

动力系统 · 数学 2007-05-23 Jeremy Kahn , Mikhail Lyubich

We study how the orbits of the singularities of the inverse of a meromorphic function prescribe the dynamics on its Julia set, at least up to a set of (Lebesgue) measure zero. We concentrate on a family of entire transcendental functions…

动力系统 · 数学 2007-05-23 Jan-Martin Hemke

We prove a Julia inequality for bounded non-commutative functions on polynomial polyhedra. We use this to deduce a Julia inequality for holomorphic functions on classical domains in $\mathbb{C}^d$. We look at differentiability at a boundary…

复变函数 · 数学 2017-08-22 John E. McCarthy , James E. Pascoe

The Jacobian conjecture over a field of characteristic zero is considered directly in view of the nonlinear partial differential equations it is associated with. Exploring the integrals of such partial differential equations, this work…

代数几何 · 数学 2025-07-25 Yisong Yang

Given a separable nonconstant polynomial $f(x)$ with integer coefficients, we consider the set $S$ consisting of the squarefree parts of all the rational values of $f(x)$, and study its behavior modulo primes. Fixing a prime $p$, we…

数论 · 数学 2014-07-21 David Krumm

A cubic polynomial $P$ with a non-repelling fixed point $b$ is said to be \emph{immediately renormalizable} if there exists a (connected) quadratic-like invariant filled Julia set $K^*$ such that $b\in K^*$. In that case exactly one…

动力系统 · 数学 2021-02-23 Alexander Blokh , Lex Oversteegen , Vladlen Timorin

We prove the existence of a transcendental entire function whose Julia set is a "bouquet of pseudo-arcs". More precisely, the union of the Julia set with infinity is an uncountable union of pseudo-arcs, which are pairwise disjoint except at…

动力系统 · 数学 2021-05-24 Tania Gricel Benitez , Lasse Rempe

A syntactical proof is given that all functions definable in a certain affine linear typed lambda-calculus with iteration in all types are polynomial time computable. The proof provides explicit polynomial bounds that can easily be…

计算机科学中的逻辑 · 计算机科学 2007-05-23 Klaus Aehlig , Helmut Schwichtenberg

Let $D$ be an integrally closed domain with quotient field $K$. Let $A$ be a torsion-free $D$-algebra that is finitely generated as a $D$-module. For every $a$ in $A$ we consider its minimal polynomial $\mu_a(X)\in D[X]$, i.e. the monic…

交换代数 · 数学 2018-10-03 Giulio Peruginelli , Nicholas J. Werner

Let f be a rational function such that the multipliers of all repelling periodic points are real. We prove that the Julia set of such a function belongs to a circle. Combining this with a result of Fatou we conclude that whenever J(f)…

动力系统 · 数学 2012-02-07 Alexandre Eremenko , Sebastian van Strien

For a commutative ring $R$, a polynomial $f\in R[x]$ is called separable if $R[x]/f$ is a separable $R$-algebra. We derive formulae for the number of separable polynomials when $R = \mathbb{Z}/n$, extending a result of L. Carlitz. For…

环与代数 · 数学 2017-03-22 Jason K. C. Polak

We develop a duality for operations on nested pairs of modules that generalizes the duality between absolute interior operations and residual closure operations from [ER21], extending our previous results to the expanded context. We apply…

交换代数 · 数学 2022-09-02 Neil Epstein , Rebecca R. G. , Janet Vassilev

In \cite{Bedford}, the dynamics of a particular polynomial diffeomorphism of $\mathbb{C}^N$, called a polynomial shift-like map of type $\nu$, has been studied as a higher dimensional analog of H\'enon maps. In this note, we prove that the…

动力系统 · 数学 2026-05-01 Ramanpreet Kaur

Recently the problem of constructing a perfect Euler cuboid was related with three conjectures asserting the irreducibility of some certain three polynomials depending on integer parameters. In this paper a partial result toward proving the…

数论 · 数学 2011-09-13 Ruslan Sharipov

We study the representability of sets that admit extended formulations using mixed-integer bilevel programs. We show that feasible regions modeled by continuous bilevel constraints (with no integer variables), complementarity constraints,…

最优化与控制 · 数学 2018-10-10 Amitabh Basu , Christopher Thomas Ryan , Sriram Sankaranarayanan

In this article, we propose a few sufficient conditions on polynomials having integer coefficients all of whose zeros lie outside a closed disc centered at the origin in the complex plane and deduce the irreducibility over the ring of…

数论 · 数学 2019-08-23 Jitender Singh , Sanjeev Kumar

We give two natural definitions of polynomial-time computability for L2 functions; and we show them incomparable (unless complexity class FP_1 includes #P_1).

计算复杂性 · 计算机科学 2026-02-03 Aras Bacho , Svetlana Selivanova , Martin Ziegler

We prove that every wandering exposed Julia component of a rational map is to a singleton, provided that each wandering Julia component containing critical points is non-recurrent. Moreover, we show that the Julia set contains only finitely…

动力系统 · 数学 2025-09-09 Yan Gao , Lele Xu , Luxian Yang

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

交换代数 · 数学 2009-08-22 Ivan V. Arzhantsev , Anatoliy P. Petravchuk

In this paper we present an equivalent statement to the Jacobian conjecture. For a polynomial map F on an affine space of dimension n, we define recursively n finite sequences of polynomials. We give an equivalent condition to the…

交换代数 · 数学 2016-01-05 Elzbieta Adamus , Pawel Bogdan , Teresa Crespo , Zbigniew Hajto