Related papers: Dynamics of quadratic polynomials II: rigidity
In the moduli space of polynomials of degree 3 with marked critical points c_1 and c_2, let C_{1,n} be the locus of maps for which c_1 has period n and let C_{2,m} be the locus of maps for which c_2 has period m. A consequence of Thurston's…
We consider the notions of (i) critical points, (ii) second-order points, (iii) local minima, and (iv) strict local minima for multivariate polynomials. For each type of point, and as a function of the degree of the polynomial, we study the…
With respect to earlier investigations, the theory of multi-component, concentric, copolar, axisymmetric, rigidly rotating polytropes is improved and extended, including subsystems with nonzero density on the boundary and subsystems with…
A sequence of representations \(V_n\) of the symmetric group \(S_n\) is called representation (multiplicity) stable if, after some \(n\), the irreducible decomposition of \(V_n\) stabilizes. In particular, Church, Ellenburg and Farb (2015)…
An affine algebraic variety $X$ is rigid if the algebra of regular functions ${\mathbb K}[X]$ admits no nonzero locally nilpotent derivation. We prove that a factorial trinomial hypersurface is rigid if and only if every exponent in the…
In this paper, we describe properties of the characteristic polynomial of a weighted lattice and show that it has a recursive description, which we use to obtain results on the critical exponent of $q$-polymatroids. We give a Critical…
We study the dynamics of polynomial maps on the boundary of the central hyperbolic component $\mathcal H_d$. We prove the local connectivity of Julia sets and a rigidity theorem for maps on the regular part of $\partial\mathcal H_d$. Our…
We prove a robust generalization of a Sylvester-Gallai type theorem for quadratic polynomials, generalizing the result in [S'20]. More precisely, given a parameter $0 < \delta \leq 1$ and a finite collection $\mathcal{F}$ of irreducible and…
We define the (dynamical) core of a topological polynomial (and the associated lamination). This notion extends that of the core of a unimodal interval map. Two explicit descriptions of the core are given: one related to periodic objects…
A rigidity theory is developed for bar-joint frameworks in $\mathbb{R}^{d+1}$ whose vertices are constrained to lie on concentric $d$-spheres with independently variable radii. In particular, combinatorial characterisations are established…
We develop a combinatorial rigidity theory for symmetric bar-joint frameworks in a general finite dimensional normed space. In the case of rotational symmetry, matroidal Maxwell-type sparsity counts are identified for a large class of…
For a class of polynomials $f \in \mathbb{Z}[X]$, which in particular includes all quadratic polynomials, and also trinomials of some special form, we show that, under some natural conditions (necessary for quadratic polynomials), the set…
We provide some conditions for the graph of a Hoelder-continuous function on \bar{D}, where \bar{D} is a closed disc in the complex plane, to be polynomially convex. Almost all sufficient conditions known to date --- provided the function…
We interpret the combinatorial Mandelbrot set in terms of \it{quadratic laminations} (equivalence relations $\sim$ on the unit circle invariant under $\sigma_2$). To each lamination we associate a particular {\em geolamination} (the…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
A natural problem in combinatorial rigidity theory concerns the determination of the rigidity or flexibility of bar-joint frameworks in $\mathbb{R}^d$ that admit some non-trivial symmetry. When $d=2$ there is a large literature on this…
The problem of expressing a multivariate polynomial as the determinant of a monic (definite) symmetric or Hermitian linear matrix polynomial (LMP) has drawn a huge amount of attention due to its connection with optimization problems. In…
The growing complexity of dynamical systems and advances in data collection necessitates robust data-driven control strategies without explicit system identification and robust synthesis. Data-driven stability has been explored in linear…
Dynamical systems with quadratic or polynomial drift exhibit complex dynamics, yet compared to nonlinear systems in general form, are often easier to analyze, simulate, control, and learn. Results going back over a century have shown that…
For complex quadratic polynomials, the topology of the Julia set and the dynamics are understood from another perspective by considering the Hausdorff dimension of biaccessing angles and the core entropy: the topological entropy on the…