English
Related papers

Related papers: Wandering polygons and recurrent critical leaves

200 papers

Given a permutation group $G$, the derangement graph of $G$ is the Cayley graph with connection set the derangements of $G$. The group $G$ is said to be innately transitive if $G$ has a transitive minimal normal subgroup. Clearly, every…

Group Theory · Mathematics 2024-04-24 Marco Fusari , Andrea Previtali , Pablo Spiga

Let V $\subset$ C n be an equidimensional algebraic set and g be an n-variate polynomial with rational coefficients. Computing the critical points of the map that evaluates g at the points of V is a cornerstone of several algorithms in real…

Symbolic Computation · Computer Science 2016-05-10 Mohab Safey El Din , Pierre-Jean Spaenlehauer

We study rational self-maps of $\mathbb{P}^{1}$ whose critical points all have finite forward orbit. Thurston's rigidity theorem states that outside a single well-understood family, there are finitely many such maps over $\mathbb{C}$ of…

Algebraic Geometry · Mathematics 2012-12-03 Alon Levy

Let f be a transcendental entire map that is subhyperbolic, i.e., the intersection of the Fatou set F(f) and the postsingular set P(f) is compact and the intersection of the Julia set J(f) and P(f) is finite. Assume that no asymptotic value…

Dynamical Systems · Mathematics 2014-09-16 Helena Mihaljevic-Brandt

We investigate the discontinuity of codings for the Julia set of a quadratic map. To each parameter ray, we associate a natural coding for Julia sets on the ray. Given a hyperbolic component $H$ of the Mandelbrot set, we consider the…

Dynamical Systems · Mathematics 2025-06-19 Yutaka Ishii , Thomas Richards

Let $f, g:S^1\to S^1$ be two $C^3$ critical homeomorphisms of the circle with the same irrational rotation number and the same (finite) number of critical points, all of which are assumed to be non-flat, of power-law type. In this paper we…

Dynamical Systems · Mathematics 2015-12-01 Gabriela Estevez , Edson de Faria

We study the parameter space ${\mathcal S}_p$ for cubic polynomial maps with a marked critical point of period $p$. We will outline a fairly complete theory as to how the dynamics of the map $F$ changes as we move around the parameter space…

Dynamical Systems · Mathematics 2025-03-13 Araceli Bonifant , John Milnor

In a recent paper, we showed that every sufficiently large regular digraph G on n vertices whose degree is linear in n and which is a robust outexpander has a decomposition into edge-disjoint Hamilton cycles. The main consequence of this…

Combinatorics · Mathematics 2013-11-01 Daniela Kühn , Deryk Osthus

Given a permutation group acting on coordinates of $\mathbb{R}^n$, we consider lattice-free polytopes that are the convex hull of an orbit of one integral vector. The vertices of such polytopes are called \emph{core points} and they play a…

Metric Geometry · Mathematics 2015-02-24 Katrin Herr , Thomas Rehn , Achill Schürmann

In 1982, Ungar proved that the connecting lines of a set of $n$ noncollinear points in the plane determine at least $2\lfloor n/2 \rfloor$ directions (slopes). Sets achieving this minimum for $n$ odd (even) are called…

Combinatorics · Mathematics 2022-10-25 Silvia Fernández-Merchant , Rimma Hämäläinen

The space of monic centered cubic polynomials with marked critical points is isomorphic to C^2. For each n>0, the locus Sn formed by all polynomials with a specified critical point periodic of exact period n forms an affine algebraic set.…

Dynamical Systems · Mathematics 2019-05-14 Matthieu Arfeux , Jan Kiwi

Given a simple graph $G$ on $n$ vertices, a subset of vertices $U \subseteq V(G)$ is dominating if every vertex of $V(G)$ is either in $U$ or adjacent to a vertex of $U$. The domination polynomial of $G$ is the generating function whose…

Combinatorics · Mathematics 2021-10-05 Amanda Burcroff , Grace O'Brien

A set of nodes is called $n$-independent if each its node has a fundamental polynomial of degree $n.$ We proved in a previous paper [H. Hakopian and S. Toroyan, On the minimal number of nodes determining uniquelly algebraic curves, accepted…

Numerical Analysis · Mathematics 2015-10-20 H. Hakopian , S. Toroyan

Thurston maps are branched self-coverings of the sphere whose critical points have finite forward orbits. We give combinatorial and algebraic characterizations of Thurston maps that are isotopic to expanding maps as "Levy-free" maps and as…

Dynamical Systems · Mathematics 2016-10-11 Laurent Bartholdi , Dzmitry Dudko

How many $n$-step polygons exist that contain a given vertex of an infinite quasi-transitive graph $G$? The exponential growth rate of such polygons is identified as the connective constant when $G$ has sub-exponential growth and possesses…

Combinatorics · Mathematics 2026-01-06 Geoffrey R. Grimmett

We study the dynamics of a class of endomorphisms of A^N which restricts, when N = 1, to the class of unicritical polynomials. Over the complex numbers, we obtain lower bounds on the sum of Lyapunov exponents, and a statement which…

Dynamical Systems · Mathematics 2021-03-08 Patrick Ingram

The study of entrywise powers of matrices was originated by Loewner in the pursuit of the Bieberbach conjecture. Since the work of FitzGerald and Horn (1977), it is known that $A^{\circ \alpha} := (a_{ij}^\alpha)$ is positive semidefinite…

Combinatorics · Mathematics 2015-11-24 Dominique Guillot , Apoorva Khare , Bala Rajaratnam

We consider order preserving $C^3$ circle maps with a flat piece, irrational rotation number and critical exponents $(\ell_1, \ell_2)$. We detect a change in the geometry of the system. For $(\ell_1, \ell_2) \in [1,2]^2$ the geometry is…

Dynamical Systems · Mathematics 2021-07-30 Bertuel Tangue Ndawa

In the neighbourhood of the critical point, the correlation length of the spin-spin correlation function of the two-dimensional Ising model diverges. The correlation function permits a scaling limit in which the separation $N$ between spins…

Mathematical Physics · Physics 2019-05-22 P. J. Forrester , J. H. H. Perk , A. K. Trinh , N. S. Witte

We investigate the computational complexity of finding temporally disjoint paths or walks in temporal graphs. There, the edge set changes over discrete time steps and a temporal path (resp. walk) uses edges that appear at monotonically…

Data Structures and Algorithms · Computer Science 2021-05-25 Nina Klobas , George B. Mertzios , Hendrik Molter , Rolf Niedermeier , Philipp Zschoche