Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userFinite index theorems for iterated Galois groups of unicritical polynomials
176
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Let $K$ be the function field of a smooth, irreducible curve defined over $overline{mathbb{Q}}$. Let $fin K[x]$ be of the form $f(x)=x^q+c$ where $q = p^{r}, r ge 1,$ is a power of the prime number $p$, and let $betain overline{K}$. For all $ninmathbb{N}cup{infty}$, the Galois groups $G_n(beta)=mathop{rm{Gal}}(K(f^{-n}(beta))/K(beta))$ embed into $[C_q]^n$, the $n$-fold wreath product of the cyclic group $C_q$. We show that if $f$ is not isotrivial, then $[[C_q]^infty:G_infty(beta)]<infty$ unless $beta$ is postcritical or periodic. We are also able to prove that if $f_1(x)=x^q+c_1$ and $f_2(x)=x^q+c_2$ are two such distinct polynomials, then the fields $bigcup_{n=1}^infty K(f_1^{-n}(beta))$ and $bigcup_{n=1}^infty K(f_2^{-n}(beta))$ are disjoint over a finite extension of $K$.
rate research
Read More
We formulate a general question regarding the size of the iterated Galois groups associated to an algebraic dynamical system and then we discuss some special cases of our question.
In this paper we introduce the additive analogue of the index of a polynomial over finite fields. We study several problems in the theory of polynomials over finite fields in terms of their additive indices, such as value set sizes, bounds on multiplicative character sums, and characterizations of permutation polynomials.
We describe and implement an algorithm to find all post-critically finite (PCF) cubic polynomials defined over $mathbb{Q}$, up to conjugacy over $text{PGL}_2(bar{mathbb{Q}})$. We describe normal forms that classify equivalence classes of cubic polynomials while respecting the field of definition. Applying known bounds on the coefficients of post-critically bounded polynomials to these normal forms simultaneously at all places of $mathbb{Q}$, we create a finite search space of cubic polynomials over $mathbb{Q}$ that may be PCF. Using a computer search of these possibly PCF cubic polynomials, we find fifteen which are in fact PCF.
For each odd prime p>=5, there exist finite p-groups G with derived quotient G/D(G)=C(p)xC(p) and nearly constant transfer kernel type k(G)=(1,2,...,2) having two fixed points. It is proved that, for p=7, this type k(G) with the simplest possible case of logarithmic abelian quotient invariants t(G)=(11111,111,21,21,21,21,21,21) of the eight maximal subgroups is realized by exactly 98 non-metabelian Schur sigma-groups S of order 7^11 with fixed derived length dl(S)=3 and metabelianizations S/D(D(S)) of order 7^7. For p=5, the type k(G) with t(G)=(2111,111,21,21,21,21) leads to infinitely many non-metabelian Schur sigma-groups S of order at least 5^14 with unbounded derived length dl(S)>=3 and metabelianizations S/D(D(S)) of fixed order 5^7. These results admit the conclusion that d=-159592 is the first known discriminant of an imaginary quadratic field with 7-class field tower of precise length L=3, and d=-90868 is a discriminant of an imaginary quadratic field with 5-class field tower of length L>=3, whose exact length remains unknown.
In this paper we generalize results of P. Le Duff to genus n hyperelliptic curves. More precisely, let C/Q be a hyperelliptic genus n curve and let J(C) be the associated Jacobian variety. Assume that there exists a prime p such that J(C) has semistable reduction with toric dimension 1 at p. We provide an algorithm to compute a list of primes l (if they exist) such that the Galois representation attached to the l-torsion of J(C) is surjective onto the group GSp(2n, l). In particular we realize GSp(6, l) as a Galois group over Q for all primes l in [11, 500000].
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
