Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userAutomorphism loci for degree 3 and degree 4 endomorphisms of the projective line
126
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Let $f$ be an endomorphism of the projective line. There is a natural conjugation action on the space of such morphisms by elements of the projective linear group. The group of automorphisms, or stabilizer group, of a given $f$ for this action is known to be a finite group. We determine explicit families that parameterize all endomorphisms defined over $bar{mathbb{Q}}$ of degree $3$ and degree $4$ that have a nontrivial automorphism, the textit{automorphism locus} of the moduli space of dynamical systems. We analyze the geometry of these loci in the appropriate moduli space of dynamical systems. Further, for each family of maps, we study the possible structures of $mathbb{Q}$-rational preperiodic points which occur under specialization.
rate research
Read More
We study the discriminant of a degree 4 extension given by a deformed bidouble cover, i.e., by equations z^2= u + a w, w^2= v + bz. We first show that the discriminant surface is a quartic which is cuspidal on a twisted cubic, i.e.,is the discriminant of the general equation of degree 3. We then take a(u,v), b(u,v) and get a 3-cuspidal affine quartic curve whose braid monodromy we compute. This calculation of the local braid monodromy is a step towards the determination of global braid monodromies, e.g. for the (a,b,c) surfaces previously considered by the authors. In the revision we fill a gap (noticed by the referee) in the proof of the classical theorem that any quartic surface which has the twisted cubic as cuspidal curve is its tangential developable, and we changed a base point in order to make a picture correct.
We demonstrate how recent work of Favre and Gauthier, together with a modification of a result of the author, shows that a family of polynomials with infinitely many post-critically finite specializations cannot have any periodic cycles with multiplier of very low degree, except those which vanish, generalizing results of Baker and DeMarco, and Favre and Gauthier.
The degree-$4$ Sum-of-Squares (SoS) SDP relaxation is a powerful algorithm that captures the best known polynomial time algorithms for a broad range of problems including MaxCut, Sparsest Cut, all MaxCSPs and tensor PCA. Despite being an explicit algorithm with relatively low computational complexity, the limits of degree-$4$ SoS SDP are not well understood. For example, existing integrality gaps do not rule out a $(2-varepsilon)$-algorithm for Vertex Cover or a $(0.878+varepsilon)$-algorithm for MaxCut via degree-$4$ SoS SDPs, each of which would refute the notorious Unique Games Conjecture. We exhibit an explicit mapping from solutions for degree-$2$ Sum-of-Squares SDP (Goemans-Williamson SDP) to solutions for the degree-$4$ Sum-of-Squares SDP relaxation on boolean variables. By virtue of this mapping, one can lift lower bounds for degree-$2$ SoS SDP relaxation to corresponding lower bounds for degree-$4$ SoS SDPs. We use this approach to obtain degree-$4$ SoS SDP lower bounds for MaxCut on random $d$-regular graphs, Sherington-Kirkpatrick model from statistical physics and PSD Grothendieck problem. Our constructions use the idea of pseudocalibration towards candidate SDP vectors, while it was previously only used to produce the candidate matrix which one would show is PSD using much technical work. In addition, we develop a different technique to bound the spectral norms of _graphical matrices_ that arise in the context of SoS SDPs. The technique is much simpler and yields better bounds in many cases than the _trace method_ -- which was the sole technique for this purpose.
This paper considers the topological degree of $G$-shifts of finite type for the case where $G$ is a nonabelian monoid. Whenever the Cayley graph of $G$ has a finite representation and the relationships among the generators of $G$ are determined by a matrix $A$, the coefficients of the characteristic polynomial of $A$ are revealed as the number of children of the graph. After introducing an algorithm for the computation of the degree, the degree spectrum, which is finite, relates to a collection of matrices in which the sum of each row of every matrix is bounded by the number of children of the graph. Furthermore, the algorithm extends to $G$ of finite free-followers.
We classify the Ulrich vector bundles of arbitrary rank on smooth projective varieties of minimal degree. In the process, we prove the stability of the sheaves of relative differentials on rational scrolls.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
