English
Related papers

Related papers: Combinatorial rigidity for some infinitely renorma…

200 papers

For any polynomial f with complex coefficients we find a remarkable subset of poles of the motivic zeta function. It is combinatorially determined by any log resolution and it admits an intrinsic interpretation in terms of contact loci of…

Algebraic Geometry · Mathematics 2026-02-17 Nero Budur , Eduardo de Lorenzo Poza , Quan Shi , Huaiqing Zuo

We show that the set of complex points in the moduli space of polynomials of degree d corresponding to post-critically finite polynomials is a set of algebraic points of bounded height. It follows that for any B, the set of conjugacy…

Number Theory · Mathematics 2011-02-15 Patrick Ingram

Fix an integer $d\geq 2$. The parameters $c_0\in \bar{\mathbb{Q}}$ for which the unicritical polynomial $f_{d,c}(z)=z^d+c\in \mathbb{C}[z]$ has finite postcritical orbit, also known as Misiurewicz parameters, play a significant role in…

Number Theory · Mathematics 2022-05-24 Robert L. Benedetto , Vefa Goksel

We prove that uniform hyperbolicity is invariant under topological conjugacy for dissipative polynomial automorphisms of C^2. Along the way we also show that a sufficient condition for hyperbolicity is that local stable and unstable…

Complex Variables · Mathematics 2020-06-04 Eric Bedford , Romain Dujardin

For any two $n$-$th$ order polynomials $a(s)$ and $b(s),$ the Hurwitz stability of their convex combination is necessary and sufficient for the existence of a polynomial $c(s)$ such that $c(s)/a(s)$ and $c(s)/b(s)$ are both strictly…

Optimization and Control · Mathematics 2007-05-23 Long Wang

Assume that the Riemann hypothesis holds for Dedekind zeta functions. Under this assumption, we prove that a degree $d$ polynomial with random multiplicative $\pm1$ coefficients is irreducible in $\mathbb{Z}[x]$ with probability…

Number Theory · Mathematics 2025-11-07 Péter P. Varjú , Max Wenqiang Xu

We showed in the first paper of this series that the generic $C_2^1$-cofactor matroid is the unique maximal abstract $3$-rigidity matroid. In this paper we obtain a combinatorial characterization of independence in this matroid. This solves…

Combinatorics · Mathematics 2022-05-16 Katie Clinch , Bill Jackson , Shin-ichi Tanigawa

Let {f_t} be any algebraic family of rational maps of a fixed degree, with a marked critical point c(t). We first prove that the hypersurfaces of parameters for which c(t) is periodic converge as a sequence of positive closed (1,1) currents…

Dynamical Systems · Mathematics 2007-08-30 Romain Dujardin , Charles Favre

We study polynomials that are orthogonal with respect to the modified Laguerre weight $z^{-n + \nu} e^{-Nz} (z-1)^{2b}$ in the limit where $n, N \to \infty$ with $N/n \to 1$ and $\nu$ is a fixed number in $\mathbb{R} \setminus…

Classical Analysis and ODEs · Mathematics 2010-07-30 Dan Dai , Arno B. J. Kuijlaars

In this paper, we study the critical orbit of a post-critically finite polynomial of the form $f_{c,d}(x) = x^d+c \in \mathbb{C}[x]$. We discover that in many cases the orbit elements satisfy some strong arithmetic properties. It is well…

Number Theory · Mathematics 2019-07-09 Vefa Goksel

Consider the one-parameter family of cubic polynomials defined by $f_t(z) =-\frac 32 t(-2z^3+3z^2)+1, t \in \mathbb{C}_2$. This family corresponds to a slice of the parameter space of cubic polynomials in $\mathbb{C}_2[z]$. We investigate…

Dynamical Systems · Mathematics 2024-01-18 Jacqueline Anderson , Emerald Stacy , Bella Tobin

We prove uniform hyperbolicity of the renormalization operator for all possible real combinatorial types. We derive from it that the set of infinitely renormalizable parameter values in the real quadratic family $P_c: x\mapsto x^2+c$ has…

Dynamical Systems · Mathematics 2016-09-07 Mikhail Lyubich

This paper provides a combinatorial characterisation for generic forced symmetric rigidity of bar-joint frameworks in the Euclidean plane that are symmetric with respect to the orientation-reversing wallpaper group…

Combinatorics · Mathematics 2025-02-21 Jack Esson , Eleftherios Kastis , Bernd Schulze

We study the Euler characteristic of the real Milnor fibres of a real analytic map, using a relation between complex monodromy and complex conjugation. We deduce the result of Coste and Kurdyka that the Euler characteristic of the link of…

alg-geom · Mathematics 2008-02-03 Clint McCrory , Adam Parusinski

It is a famous result of Lovasz and Yemini (1982) that 6-connected graphs are rigid in the plane. This was recently improved by Jackson and Jordan (2009) who showed that 6-mixed connectivity is also sufficient for rigidity. Here we give…

Combinatorics · Mathematics 2018-04-30 Viktoria E. Kaszanitzky , Bernd Schulze

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…

Metric Geometry · Mathematics 2020-04-17 Derek Kitson , Anthony Nixon , Bernd Schulze

We prove that the roots of a smooth monic polynomial with complex-valued coefficients defined on a bounded Lipschitz domain $\Omega$ in $\mathbb R^m$ admit a parameterization by functions of bounded variation uniformly with respect to the…

Classical Analysis and ODEs · Mathematics 2021-04-06 Adam Parusinski , Armin Rainer

We consider the class of all homogeneous, possibly non-reduced, polynomials $f$ whose associated reduced projective divisor $D_{\text{red}} \subset \mathbb{P}^{n-1}$ has (at worst) quasi-homogeneous isolated singularities. In an arbitrary…

Algebraic Geometry · Mathematics 2026-02-25 Daniel Bath , Willem Veys

We provide a way of determining the infinitesimal rigidity of rod configurations realizing a rank two incidence geometry in the Euclidean plane. We model each rod with a cone over its point set and prove that the resulting geometric…

Combinatorics · Mathematics 2022-04-28 Signe Lundqvist , Klara Stokes , Lars-Daniel Öhman

The combinatorial characterization of generic rigidity for bar-joint frameworks in dimensions $d \ge 3$ has been a long-standing open problem in discrete geometry. While the two-dimensional case was resolved in 1927 by Pollaczek-Geiringer…

Combinatorics · Mathematics 2026-04-21 Alexander Heaton
‹ Prev 1 8 9 10 Next ›