scholarly journals SIEVES AND THE MINIMAL RAMIFICATION PROBLEM

2018 ◽  
Vol 19 (3) ◽  
pp. 919-945 ◽  
Author(s):  
Lior Bary-Soroker ◽  
Tomer M. Schlank

The minimal ramification problem may be considered as a quantitative version of the inverse Galois problem. For a nontrivial finite group $G$, let $m(G)$ be the minimal integer $m$ for which there exists a $G$-Galois extension $N/\mathbb{Q}$ that is ramified at exactly $m$ primes (including the infinite one). So, the problem is to compute or to bound $m(G)$.In this paper, we bound the ramification of extensions $N/\mathbb{Q}$ obtained as a specialization of a branched covering $\unicode[STIX]{x1D719}:C\rightarrow \mathbb{P}_{\mathbb{Q}}^{1}$. This leads to novel upper bounds on $m(G)$, for finite groups $G$ that are realizable as the Galois group of a branched covering. Some instances of our general results are: $$\begin{eqnarray}1\leqslant m(S_{k})\leqslant 4\quad \text{and}\quad n\leqslant m(S_{k}^{n})\leqslant n+4,\end{eqnarray}$$ for all $n,k>0$. Here $S_{k}$ denotes the symmetric group on $k$ letters, and $S_{k}^{n}$ is the direct product of $n$ copies of $S_{k}$. We also get the correct asymptotic of $m(G^{n})$, as $n\rightarrow \infty$ for a certain class of groups $G$.Our methods are based on sieve theory results, in particular on the Green–Tao–Ziegler theorem on prime values of linear forms in two variables, on the theory of specialization in arithmetic geometry, and on finite group theory.

2008 ◽  
Vol 60 (3) ◽  
pp. 556-571 ◽  
Author(s):  
Jan Draisma ◽  
Gregor Kemper ◽  
David Wehlau

AbstractWe prove a characteristic free version of Weyl’s theorem on polarization. Our result is an exact analogue ofWeyl’s theorem, the difference being that our statement is about separating invariants rather than generating invariants. For the special case of finite group actions we introduce the concept of cheap polarization, and show that it is enough to take cheap polarizations of invariants of just one copy of a representation to obtain separating vector invariants for any number of copies. This leads to upper bounds on the number and degrees of separating vector invariants of finite groups.


1959 ◽  
Vol 11 ◽  
pp. 59-60 ◽  
Author(s):  
Hirosi Nagao

Let G be a finite group of order g, andbe an absolutely irreducible representation of degree fμ over a field of characteristic zero. As is well known, by using Schur's lemma (1), we can prove the following orthogonality relations for the coefficients :1It is easy to conclude from (1) the following orthogonality relations for characters:whereand is 1 or 0 according as t and s are conjugate in G or not, and n(t) is the order of the normalize of t.


Author(s):  
Juan Pablo Ramírez

We provide an axiomatic base for the set of natural numbers, that has been proposed as a canonical construction, and use this definition of $\mathbb N$ to find several results on finite group theory. Every finite group $G$, is well represented with a natural number $N_G$; if $N_G=N_H$ then $H,G$ are in the same isomorphism class. We have a linear order on all finite groups, that is well behaved with respect to cardinality. In fact, if $H,G$ are two finite groups such that $|H|=m<n=|G|$, then $H<\mathbb Z_n\leq G$. Internally, there is also a canonical order for the elements of any finite group $G$, and we find equivalent objects. This allows us to find the automorphisms of $G$. The Cayley table of $G$ takes canonical block form, and a minimal set of independent equations that define the group is obtained. Examples are given, using all groups with less than ten elements, to illustrate the procedure for finding all groups of $n$ elements, and we order them externally and internally. The canonical block form of the symmetry group $\Delta_4$ is given and we find its automorphisms. These results are extended to the infinite case. A real number is an infinite set of natural numbers. A real function is a set of real numbers, and a sequence of real functions $f_1,f_2,\ldots$ is well represented by a set of real numbers, also. We make brief mention on the calculus of real numbers. In general, we are able to represent mathematical objects using the smallest possible data-type. In the last section, mathematical objects of all types are well assigned to tree structures. We conclude with comments on type theory and future work on computational and physical aspects of these representations.


1979 ◽  
Vol 86 (3) ◽  
pp. 413-419 ◽  
Author(s):  
J. F. Humphreys

Let G bea finite group, let C1, …, Cn be the cyclic subgroups of G and let 1i be the identity linear character of Ci (1 ≤ i ≤ n). It is a well-known result of Artin ((l), 39·1) that a character x of a linear representation of G over the rational numbers may be writtenwhere a1, …, an are integers. In this note, we establish an analogue of this result for characters of projective representations over the rational numbers.


2019 ◽  
Vol 84 (1) ◽  
pp. 290-300
Author(s):  
JOHN S. WILSON

AbstractIt is proved that there is a formula$\pi \left( {h,x} \right)$in the first-order language of group theory such that each component and each non-abelian minimal normal subgroup of a finite groupGis definable by$\pi \left( {h,x} \right)$for a suitable elementhofG; in other words, each such subgroup has the form$\left\{ {x|x\pi \left( {h,x} \right)} \right\}$for someh. A number of consequences for infinite models of the theory of finite groups are described.


2020 ◽  
Vol 8 ◽  
Author(s):  
ANDREA LUCCHINI ◽  
CLAUDE MARION ◽  
GARETH TRACEY

For a finite group $G$ , let $d(G)$ denote the minimal number of elements required to generate $G$ . In this paper, we prove sharp upper bounds on $d(H)$ whenever $H$ is a maximal subgroup of a finite almost simple group. In particular, we show that $d(H)\leqslant 5$ and that $d(H)\geqslant 4$ if and only if $H$ occurs in a known list. This improves a result of Burness, Liebeck and Shalev. The method involves the theory of crowns in finite groups.


1968 ◽  
Vol 8 (1) ◽  
pp. 49-55 ◽  
Author(s):  
John Poland

Let G be a finite group of order g having exactly k conjugate classes. Let π(G) denote the set of prime divisors of g. K. A. Hirsch [4] has shown that By the same methods we prove g ≡ k modulo G.C.D. {(p–1)2 p ∈ π(G)} and that if G is a p-group, g = h modulo (p−1)(p2−1). It follows that k has the form (n+r(p−1)) (p2−1)+pe where r and n are integers ≧ 0, p is a prime, e is 0 or 1, and g = p2n+e. This has been established using representation theory by Philip Hall [3] (see also [5]). If then simple examples show (for 6 ∤ g obviously) that g ≡ k modulo σ or even σ/2 is not generally true.


2010 ◽  
Vol 82 (2) ◽  
pp. 293-304 ◽  
Author(s):  
SILVIO DOLFI ◽  
MARCEL HERZOG ◽  
ENRICO JABARA

AbstractA finite group is called a CH-group if for every x,y∈G∖Z(G), xy=yx implies that $\|\cent Gx\| = \|\cent Gy\|$. Applying results of Schmidt [‘Zentralisatorverbände endlicher Gruppen’, Rend. Sem. Mat. Univ. Padova44 (1970), 97–131] and Rebmann [‘F-Gruppen’, Arch. Math. 22 (1971), 225–230] concerning CA-groups and F-groups, the structure of CH-groups is determined, up to that of CH-groups of prime-power order. Upper bounds are found for the derived length of nilpotent and solvable CH-groups.


1973 ◽  
Vol 18 (4) ◽  
pp. 247-249 ◽  
Author(s):  
Thomas J. Laffey

Let G be a finite group and let S be a subgroup of G with


2014 ◽  
Vol 13 (08) ◽  
pp. 1450067 ◽  
Author(s):  
M. R. Darafsheh ◽  
S. M. Robati

Let G be a finite group. We define the derived covering number and the derived character covering number of G, denoted respectively by dcn (G) and dccn (G), as the smallest positive integer n such that Cn = G′ for all non-central conjugacy classes C of G and Irr ((χn)G′) = Irr (G′) for all nonlinear irreducible characters χ of G, respectively. In this paper, we obtain some results on dcn and dccn for a finite group G, such as the existence of these numbers and upper bounds on them.


Sign in / Sign up

Export Citation Format

Share Document