170 research outputs found
A note on the probability of generating alternating or symmetric groups
We improve on recent estimates for the probability of generating the
alternating and symmetric groups and . In
particular we find the sharp lower bound, if the probability is given by a
quadratic in . This leads to improved bounds on the largest number
such that a direct product of copies
of can be generated by two elements
Rank 3 permutation characters and maximal subgroups
In this paper we classify all maximal subgroups M of a nearly simple
primitive rank 3 group G of type L=Omega_{2m+1}(3), m > 3; acting on an L-orbit
E of non-singular points of the natural module for L such that 1_P^G <=1_M^G
where P is a stabilizer of a point in E. This result has an application to the
study of minimal genera of algebraic curves which admit group actions.Comment: 41 pages, to appear in Forum Mathematicu
Finite covers of random 3-manifolds
A 3-manifold is Haken if it contains a topologically essential surface. The
Virtual Haken Conjecture posits that every irreducible 3-manifold with infinite
fundamental group has a finite cover which is Haken. In this paper, we study
random 3-manifolds and their finite covers in an attempt to shed light on this
difficult question. In particular, we consider random Heegaard splittings by
gluing two handlebodies by the result of a random walk in the mapping class
group of a surface. For this model of random 3-manifold, we are able to compute
the probabilities that the resulting manifolds have finite covers of particular
kinds. Our results contrast with the analogous probabilities for groups coming
from random balanced presentations, giving quantitative theorems to the effect
that 3-manifold groups have many more finite quotients than random groups. The
next natural question is whether these covers have positive betti number. For
abelian covers of a fixed type over 3-manifolds of Heegaard genus 2, we show
that the probability of positive betti number is 0.
In fact, many of these questions boil down to questions about the mapping
class group. We are lead to consider the action of mapping class group of a
surface S on the set of quotients pi_1(S) -> Q. If Q is a simple group, we show
that if the genus of S is large, then this action is very mixing. In
particular, the action factors through the alternating group of each orbit.
This is analogous to Goldman's theorem that the action of the mapping class
group on the SU(2) character variety is ergodic.Comment: 60 pages; v2: minor changes. v3: minor changes; final versio
Asymptotics and local constancy of characters of p-adic groups
In this paper we study quantitative aspects of trace characters
of reductive -adic groups when the representation varies. Our approach
is based on the local constancy of characters and we survey some other related
results. We formulate a conjecture on the behavior of relative to
the formal degree of , which we are able to prove in the case where
is a tame supercuspidal. The proof builds on J.-K.~Yu's construction and the
structure of Moy-Prasad subgroups.Comment: Proceedings of Simons symposium on the trace formul
A Census Of Highly Symmetric Combinatorial Designs
As a consequence of the classification of the finite simple groups, it has
been possible in recent years to characterize Steiner t-designs, that is
t-(v,k,1) designs, mainly for t = 2, admitting groups of automorphisms with
sufficiently strong symmetry properties. However, despite the finite simple
group classification, for Steiner t-designs with t > 2 most of these
characterizations have remained longstanding challenging problems. Especially,
the determination of all flag-transitive Steiner t-designs with 2 < t < 7 is of
particular interest and has been open for about 40 years (cf. [11, p. 147] and
[12, p. 273], but presumably dating back to 1965). The present paper continues
the author's work [20, 21, 22] of classifying all flag-transitive Steiner
3-designs and 4-designs. We give a complete classification of all
flag-transitive Steiner 5-designs and prove furthermore that there are no
non-trivial flag-transitive Steiner 6-designs. Both results rely on the
classification of the finite 3-homogeneous permutation groups. Moreover, we
survey some of the most general results on highly symmetric Steiner t-designs.Comment: 26 pages; to appear in: "Journal of Algebraic Combinatorics
Generators and commutators in finite groups; abstract quotients of compact groups
Let N be a normal subgroup of a finite group G. We prove that under certain
(unavoidable) conditions the subgroup [N,G] is a product of commutators [N,y]
(with prescribed values of y from a given set Y) of length bounded by a
function of d(G) and |Y| only. This has several applications: 1. A new proof
that G^n is closed (and hence open) in any finitely generated profinite group
G. 2. A finitely generated abstract quotient of a compact Hausdorff group must
be finite. 3. Let G be a topologically finitely generated compact Hausdorff
group. Then G has a countably infinite abstract quotient if and only if G has
an infinite virtually abelian continuous quotient.Comment: This paper supersedes the preprint arXiv:0901.0244v2 by the first
author and answers the questions raised there. Latest version corrects
erroneous Lemma 4.30 and adds new Cor. 1.1
Steiner t-designs for large t
One of the most central and long-standing open questions in combinatorial
design theory concerns the existence of Steiner t-designs for large values of
t. Although in his classical 1987 paper, L. Teirlinck has shown that
non-trivial t-designs exist for all values of t, no non-trivial Steiner
t-design with t > 5 has been constructed until now. Understandingly, the case t
= 6 has received considerable attention. There has been recent progress
concerning the existence of highly symmetric Steiner 6-designs: It is shown in
[M. Huber, J. Algebr. Comb. 26 (2007), pp. 453-476] that no non-trivial
flag-transitive Steiner 6-design can exist. In this paper, we announce that
essentially also no block-transitive Steiner 6-design can exist.Comment: 9 pages; to appear in: Mathematical Methods in Computer Science 2008,
ed. by J.Calmet, W.Geiselmann, J.Mueller-Quade, Springer Lecture Notes in
Computer Scienc
Life-Cycle Cost Estimation for High-Speed Vehicles: from the engineers’ to the airline’s perspective
This paper aims at upgrading the holistic Cost Estimation methodology for High-Speed
Vehicles already developed by Politecnico di Torino and the European Space Agency (ESA)
to encompass different stakeholders’ perspectives. In details, the presented methodology
combines International Air Transport Association (IATA) best practices with a detailed Life-
Cycle Cost (LCC) assessment, which includes the evaluation of Research, Development, Test
and Evaluation (RDTE) Costs, Production costs and of Direct and Indirect Operating Costs
(DOC and IOC). The integrated approach allows to further extend the capabilities of the inhouse
developed HyCost tool to support all the actors of the product value-chain (including
engineers, manufacturers, airlines and customers) in assessing the economic sustainability of
a newly under-development high-speed vehicle. However, considering the need of providing
all these cost analyses perspectives since the early design stages, the derived Cost Estimation
Relationships are mainly derived on statistical bases. To cope with the uncertainties that affect
the initial statistical population and consequently, the CERs, this paper presents each cost
item together with the estimation of related prediction intervals. Finally, results of the
application of the upgraded cost estimation methodology and of the upgraded tool to the
LAPCAT MR2.4 high-speed civil transport are reported and discussed
On a generalization of M-group
In this paper, we will show that if for every nonlinear complex irreducible
character of a finite group G, some multiple of it is induced from an
irreducible character of some proper subgroup of G, then G is solvable. This is
a generalization of Taketa's Theorem on the solvability of M-group.Comment: 17 pages, to appear in J. Algebr
- …