English
Related papers

Related papers: Complex maps without invariant densities

200 papers

We give a combinatorial classification for the class of postcritically fixed Newton maps of polynomials and indicate potential for extensions. As our main tool, we show that for a large class of Newton maps that includes all hyperbolic…

Dynamical Systems · Mathematics 2012-03-24 Johannes Rückert

We study the bifurcation values of real polynomial maps $f: \bR^{2n} \to \bR^2$ which reflect the lack of asymptotic regularity at infinity. We formulate real counterparts of some structure results which have been previously proved in case…

Complex Variables · Mathematics 2019-01-04 Ying Chen , Mihai Tibar

Let $l$ be a finite field of cardinality $q$ and let $n$ be in $\mathbb{Z}_{\geq 1}$. Let $f_1,\ldots,f_n \in l[x_1,\ldots,x_n]$ not all constant and consider the evaluation map $f=(f_1,\ldots,f_n) \colon l^n \to l^n$. Set…

Number Theory · Mathematics 2015-09-08 Michiel Kosters

Measure-theoretic slow entropy is a more refined invariant than the classical measure-theoretic entropy to characterize the complexity of dynamical systems with subexponential growth rates of distinguishable orbit types. In this paper we…

Dynamical Systems · Mathematics 2021-09-20 Shilpak Banerjee , Philipp Kunde , Daren Wei

A non-zero constant Jacobian polynomial map $F=(P,Q):\mathbb{C}^2 \longrightarrow \mathbb{C}^2$ has a polynomial inverse if the component $P$ is a simple polynomial, i.e. if, when $P$ extended to a morphism $p:X\longrightarrow \mathbb{P}^1$…

Algebraic Geometry · Mathematics 2017-09-13 Nguyen Van Chau

Let $\mu$ be a probability measure on $\mathbb{Z}$ that is not a Dirac mass and that has finite support. We prove that if the coefficients of a monic polynomial $f(x)\in\mathbb{Z}[x]$ of degree $n$ are chosen independently at random…

Number Theory · Mathematics 2023-08-16 Lior Bary-Soroker , Dimitris Koukoulopoulos , Gady Kozma

We investigate ergodic-theoretical quantities and large deviation properties of one-dimensional intermittent maps, that have not only an indifferent fixed point but also a singular structure such that the uniform measure is invariant under…

Chaotic Dynamics · Physics 2015-06-18 Soya Shinkai , Yoji Aizawa

We investigate mappings $F = (f_1, f_2) \colon \mathbb{R}^2 \to \mathbb{R}^2 $ where $ f_1, f_2 $ are bivariate normal densities from the perspective of singularity theory of mappings, motivated by the need to understand properties of…

Statistics Theory · Mathematics 2025-03-11 Yutaro Kabata , Hirotaka Matsumoto , Seiichi Uchida , Masao Ueki

We study the one-dimensional expanding Lorenz maps and show the existence of dense subset D of Lorens maps such that each f in D has an uncountable set of ergodic invariant probabilities with infinite Lyapunov exponent and positive entropy.…

Dynamical Systems · Mathematics 2022-04-05 Fabiola Pedreira , Vilton Pinheiro

We make two observations regarding the invertibility of Keller maps. i.e., polynomial maps for which the determinant of their Jacobian matrix is identically equal to 1. In our first result, we show that if P is a n-dimensional Keller map,…

Algebraic Geometry · Mathematics 2007-05-23 Richard J. Lipton , Evangelos Markakis

It is proved that each of compact linear groups of one special type admits a polynomial factorization map onto a real vector space. More exactly, the group is supposed to be non-commutative one-dimensional and to have two connected…

Algebraic Geometry · Mathematics 2014-11-24 O. G. Styrt

We study a map that sends a monic degree n complex polynomial f(x) without multiple roots to the collection of n values of its derivative at the roots of f(x). We give an answer to a question posed by Ju.S. Ilyashenko.

Algebraic Geometry · Mathematics 2011-05-26 Yuri G. Zarhin

Complex 1-variable polynomials with connected Julia sets and only repelling periodic points are called \emph{dendritic}. By results of Kiwi, any dendritic polynomial is semi-conjugate to a topological polynomial whose topological Julia set…

Dynamical Systems · Mathematics 2021-12-21 Alexander Blokh , Lex Oversteegen , Ross Ptacek , Vladlen Timorin

In this paper, we establish a coupling lemma for standard families in the setting of piecewise expanding interval maps with countably many branches. Our method merely requires that the expanding map satisfies Chernov's one-step expansion at…

Dynamical Systems · Mathematics 2020-01-31 Jianyu Chen , Hongkun Zhang , Yiwei Zhang

In this paper we consider weakly holomorphic modular forms (i.e. those meromorphic modular forms for which poles only possibly occur at the cusps) of weight $2-k\in 2\Z$ for the full modular group $\SL_2(\Z)$. The space has a distinguished…

Number Theory · Mathematics 2011-04-19 Ben Kane

In this paper, we give some determinantal and permanental representations of generalized bivariate Fibonacci p-polynomials by using various Hessenberg matrices. The results that we obtained are important since generalized bivariate…

Number Theory · Mathematics 2011-11-18 Kenan Kaygisiz , Adem Sahin

Bernoulli convolutions form a one-parameter family of self-similar measures on the unit interval. We suggest to study their two-dimensional density which has an intricate combinatorial structure. Visualizing this structure we discuss…

Dynamical Systems · Mathematics 2016-07-25 Christoph Bandt

A second order polynomial sequence is of Fibonacci type (Lucas type) if its Binet formula is similar in structure to the Binet formula for the Fibonacci (Lucas) numbers. In this paper we generalize identities from Fibonacci numbers and…

Number Theory · Mathematics 2019-04-19 Rigoberto Flórez , Nathan McAnally , Antara Mukherjee

We show the existence of Lebesgue-equivalent conservative and ergodic $\sigma$-finite invariant measures for a wide class of one-dimensional random maps consisting of piecewise convex maps. We also estimate the size of invariant measures…

Dynamical Systems · Mathematics 2023-03-21 Tomoki Inoue , Hisayoshi Toyokawa

We study the problem of generating monomials of a polynomial in the context of enumeration complexity. In this setting, the complexity measure is the delay between two solutions and the total time. We present two new algorithms for…

Computational Complexity · Computer Science 2011-02-01 Yann Strozecki
‹ Prev 1 4 5 6 7 8 10 Next ›