arXiv subjects

Vladlen Timorin

Publications and source records attributed to Vladlen Timorin.

At least 37 records · Page 2Linked to original sources

arXiv2018

Models for spaces of dendritic polynomials

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 is a dendrite. We construct a continuous map of the space of all cubic dendritic polynomials onto a laminational model that is a quotient space of a subset of the closed bidisk. This construction generalizes the "pinched disk" model of the Mandelbrot set due to Douady and Thurston. It can be viewed as a step towards constructing a model of the cubic connectedness locus.

math.DS↗

arXiv2017

Perfect subspaces of quadratic laminations

The combinatorial Mandelbrot set is a continuum in the plane, whose boundary can be defined, up to a homeomorphism, as the quotient space of the unit circle by an explicit equivalence relation. This equivalence relation was described by Douady and, in different terms, by Thurston. Thurston used quadratic invariant laminations as a major tool. As has been previously shown by the authors, the combinatorial Mandelbrot set can be interpreted as a quotient of the space of all limit quadratic invariant laminations. The topology in the space of laminations is defined by the Hausdorff distance. In this paper, we describe two similar quotients. In the first case, the identifications are the same but the space is smaller than that taken for the Mandelbrot set. The result (the quotient space) is obtained from the Mandelbrot set by "unpinching" the transitions between adjacent hyperbolic components. In the second case, we do not identify non-renormalizable laminations while identifying renormalizable laminations according to which hyperbolic lamination they can be "unrenormalised" to.

math.DS↗

arXiv2017

Laminational models for some spaces of polynomials of any degree

The so-called "pinched disk" model of the Mandelbrot set is due to A.~Douady, J.~H.~Hubbard and W.~P.~Thurston. It can be described in the language of geodesic laminations. The combinatorial model is the quotient space of the unit disk under an equivalence relation that, loosely speaking, "pinches" the disk in the plane (whence the name of the model). The significance of the model lies in particular in the fact that this quotient is planar and therefore can be easily visualized. The conjecture that the Mandelbrot set is actually homeomorphic to this model is equivalent to the celebrated MLC conjecture stating that the Mandelbrot set is locally connected. For parameter spaces of higher degree polynomials no combinatorial model is known. One possible reason may be that the higher degree analog of the MLC conjecture is known to be false. We investigate to which extent a geodesic lamination is determined by the location of its critical sets and when different choices of critical sets lead to essentially the same lamination. This yields models of various parameter spaces of laminations similar to the "pinched disk" model of the Mandelbrot set.

math.DS↗

arXiv2016

Slices of Parameter Space of Cubic Polynomials

In this paper, we study slices of the parameter space of cubic polynomials, up to affine conjugacy, given by a fixed value of the multiplier at a non-repelling fixed point. In particular, we study the location of the $main\, cubioid$ in this parameter space. The $main\, cubioid$ is the set of affine conjugacy classes of complex cubic polynomials that have certain dynamical properties generalizing those of polynomials $z^2+c$ for $c$ in the filled main cardioid.

math.DS↗

arXiv2016

The parameter space of cubic laminations with a fixed critical leaf

Thurston parameterized quadratic invariant laminations with a non-invariant lamination, the quotient of which yields a combinatorial model for the Mandelbrot set. As a step toward generalizing this construction to cubic polynomials, we consider slices of the family of cubic invariant laminations defined by a fixed critical leaf with non-periodic endpoints. We parameterize each slice by a lamination just as in the quadratic case, relying on the techniques of smart criticality previously developed by the authors.

math.DS↗

arXiv2016

Complementary components to the cubic Principal Hyperbolic Domain

We study the closure of the cubic Principal Hyperbolic Domain and its intersection $\mathcal{P}_λ$ with the slice $\mathcal{F}_λ$ of the space of all cubic polynomials with fixed point $0$ defined by the multiplier $λ$ at $0$. We show that any bounded domain $\mathcal{W}$ of $\mathcal{F}_λ\setminus\mathcal{P}_λ$ consists of $J$-stable polynomials $f$ with connected Julia sets $J(f)$ and is either of \emph{Siegel capture} type (then $f\in \mathcal{W}$ has an invariant Siegel domain $U$ around $0$ and another Fatou domain $V$ such that $f|_V$ is two-to-one and $f^k(V)=U$ for some $k>0$) or of \emph{queer} type (then at least one critical point of $f\in \mathcal{W}$ belongs to $J(f)$, the set $J(f)$ has positive Lebesgue measure, and carries an invariant line field).

math.DS↗

arXiv2016

Laminations from the Main Cubioid

According to a recent paper \cite{bopt13}, polynomials from the closure $\bar{\rm PHD}_3$ of the {\em Principal Hyperbolic Domain} ${\rm PHD}_3$ of the cubic connectedness locus have a few specific properties. The family $\mathrm{CU}$ of all polynomials with these properties is called the \emph{Main Cubioid}. In this paper we describe the set $\mathrm{CU}^c$ of laminations which can be associated to polynomials from $\mathrm{CU}$.

math.DS↗

arXiv2015

Quadratic-like dynamics of cubic polynomials

A small perturbation of a quadratic polynomial with a non-repelling fixed point gives a polynomial with an attracting fixed point and a Jordan curve Julia set, on which the perturbed polynomial acts like angle doubling. However, there are cubic polynomials with a non-repelling fixed point, for which no perturbation results into a polynomial with Jordan curve Julia set. Motivated by the study of the closure of the Cubic Principal Hyperbolic Domain, we describe such polynomials in terms of their quadratic-like restrictions.

math.DS↗

arXiv2015

Combinatorial models for spaces of cubic polynomials

A model for the Mandelbrot set is due to Thurston and is stated in the language of geodesic laminations. The conjecture that the Mandelbrot set is actually homeomorphic to this model is equivalent to the celebrated MLC conjecture stating that the Mandelbrot set is locally connected. For parameter spaces of higher degree polynomials, even conjectural models are missing, one possible reason being that the higher degree analog of the MLC conjecture is known to be false. We provide a combinatorial model for an essential part of the parameter space of complex cubic polynomials, namely, for the space of all cubic polynomials with connected Julia sets all of whose cycles are repelling (we call such polynomials \emph{dendritic}). The description of the model turns out to be very similar to that of Thurston.

math.DS↗

arXiv2014

On maps taking lines to plane curves

We study cubic rational maps that take lines to plane curves. A complete description of such cubic rational maps concludes the classification of all planarizations, i.e., maps taking lines to plane curves.

math.AG↗

arXiv2013

On the theory of coconvex bodies

If the complement of a closed convex set in a closed convex cone is bounded, then this complement minus the apex of the cone is called a coconvex set. Coconvex sets appear in singularity theory (they are closely related to Newton diagrams) and in commutative algebra. Such invariants of coconvex sets as volumes, mixed volumes, number of integer points, etc., play an important role. This paper aims at extending various results from the theory of convex bodies to the coconvex setting. These include the Aleksandrov-Fenchel inequality and the Ehrhart duality.

math.MG↗

arXiv2013

Disquisitiones 235

Section 235 of Gauss' fundamental treatise "Disquisitiones Arithmeticae" establishes basic properties that compositions of binary quadratic forms must satisfy. Although this section is very technical, it contains truly important results. We review section 235 using a more invariant language and simplifying the arguments. We also make the statements slightly stronger by removing unnecessary assumptions.

math.HO↗

arXiv2013

The Main Cubioid

We discuss different analogs of the main cardioid in the parameter space of cubic polynomials, and establish relationships between them.

math.DS↗

arXiv2013

Aleksandrov-Fenchel inequality for coconvex bodies

We prove a version of the Aleksandrov-Fenchel inequality for mixed volumes of coconvex bodies. This version is motivated by an inequality from commutative algebra relating intersection multiplicities of ideals.

math.MG↗

arXiv2012

Number of vertices in Gelfand-Zetlin polytopes

We discuss the problem of counting vertices in Gelfand-Zetlin polytopes. Namely, we deduce a partial differential equation with constant coefficients on the exponential generating function for these numbers. For some particular classes of Gelfand-Zetlin polytopes, the number of vertices can be given by explicit formulas.

math.CO↗

arXiv2011

Captures, matings and regluings

In parameter slices of quadratic rational functions, we identify arcs represented by matings of quadratic polynomials. These arcs are on the boundaries of hyperbolic components.

math.DS↗

arXiv2011

Cut and semi-conjugate

We define a very general class of rational functions f:CP^1 --> CP^1 such that for every function f of this class, there exists a countable family of smooth curves γ_i and a critically finite hyperbolic function R such that the dynamical system obtained from f by cutting along the curves γ_i is topologically semi-conjugate to R.

math.DS↗

arXiv2011

Schubert calculus and Gelfand-Zetlin polytopes

We describe a new approach to the Schubert calculus on complete flag varieties using the volume polynomial associated with Gelfand-Zetlin polytopes. This approach allows us to compute the intersection products of Schubert cycles by intersecting faces of a polytope.

math.AG↗