Search results for "init"
showing 10 items of 6629 documents
A local approach to a class of locally finite groups
2003
This paper is devoted to the study of a class of generalised P-nilpotent groups in the universe cℒ̄ of all radical locally finite groups satisfying min-q for every prime q. Some results of finite groups are extended and a characterisation of the injectors associated with this class is given.
The Jordan-Hölder theorem and prefrattini subgroups of finite groups
1995
by A. BALLESTER-BOLINCHES and L. M. EZQUERRO(Received 26 January, 1994)Introduction. All groups considered are finite. In recent years a number ofgeneralizations of the classic Jordan-Holder Theorem have been obtained (see [7],Theorem A.9.13): in a finite group G a one-to-one correspondence as in the Jordan-Holder Theorem can be defined preserving not only G-isomorphic chief factors but eventheir property of being Frattini or non-Frattini chief factors. In [2] and [13] a newdirection of generalization is presented: the above correspondence can be defined in sucha way that the corresponding non-Frattini chief factors have the same complement(supplement).In this paper we present a necessary a…
On finite products of groups and supersolubility
2010
Two subgroups X and Y of a group G are said to be conditionally permutable in G if X permutes with Y(g) for some element g E G. i.e., XY(g) is a subgroup of G. Using this permutability property new criteria for the product of finite supersoluble groups to be supersoluble are obtained and previous results are recovered. Also the behaviour of the supersoluble residual in products of finite groups is studied.
On conditional permutability and saturated formations
2011
Two subgroups A and B of a group G are said to be totally completely conditionally permutable (tcc-permutable) in G if X permutes with Yg for some g ¿ ¿X, Y¿ for all X ¿ A and Y ¿ B. We study the belonging of a finite product of tcc-permutable subgroups to a saturated formation of soluble groups containing all finite supersoluble groups. © 2011 Edinburgh Mathematical Society.
Optimal Locations and Inner Products
1997
Abstract In a normed space X , we consider objective functions which depend on the distances between a variable point and the points of certain finite sets A . A point where such a function attains its minimum on X is generically called an optimal location. In this paper we obtain characterizations of inner product spaces with properties connecting optimal locations and the convex hull of A or barycenters of points of A with well chosen weights. We thus generalize several classical results about characterization of inner product spaces.
Hamming, Permutations and Automata
2007
Quantum finite automata with mixed states are proved to be super-exponentially more concise rather than quantum finite automata with pure states. It was proved earlier by A.Ambainis and R.Freivalds that quantum finite automata with pure states can have exponentially smaller number of states than deterministic finite automata recognizing the same language. There was a never published "folk theorem" proving that quantum finite automata with mixed states are no more than superexponentially more concise than deterministic finite automata. It was not known whether the super-exponential advantage of quantum automata is really achievable. We prove that there is an infinite sequence of distinct int…
Super-Exponential Size Advantage of Quantum Finite Automata with Mixed States
2008
Quantum finite automata with mixed states are proved to be super-exponentially more concise rather than quantum finite automata with pure states. It was proved earlier by A.Ambainis and R.Freivalds that quantum finite automata with pure states can have exponentially smaller number of states than deterministic finite automata recognizing the same language. There was a never published "folk theorem" proving that quantum finite automata with mixed states are no more than super-exponentially more concise than deterministic finite automata. It was not known whether the super-exponential advantage of quantum automata is really achievable. We use a novel proof technique based on Kolmogorov complex…
Saturated formations and products of connected subgroups
2011
Abstract For a non-empty class of groups C , two subgroups A and B of a group G are said to be C -connected if 〈 a , b 〉 ∈ C for all a ∈ A and b ∈ B . Given two sets π and ρ of primes, S π S ρ denotes the class of all finite soluble groups that are extensions of a normal π-subgroup by a ρ-group. It is shown that in a finite group G = A B , with A and B soluble subgroups, then A and B are S π S ρ -connected if and only if O ρ ( B ) centralizes A O π ( G ) / O π ( G ) , O ρ ( A ) centralizes B O π ( G ) / O π ( G ) and G ∈ S π ∪ ρ . Moreover, if in this situation A and B are in S π S ρ , then G is in S π S ρ . This result is then extended to a large family of saturated formations F , the so-c…
On the Quadratic Type of Some Simple Self-Dual Modules over Fields of Characteristic Two
1997
Let G be a finite group and let K be an algebraically closed field of Ž characteristic 2. Let V be a non-trivial simple self-dual KG-module we . say that V is self-dual if it is isomorphic to its dual V * . It is a theorem of w x Fong 4, Lemma 1 that in this case there is a non-degenerate G-invariant alternating bilinear form, F, say, defined on V = V. We say that V is a KG-module of quadratic type if F is the polarization of a non-degenerate w x G-invariant quadratic form defined on V. In a previous paper 6 , the present authors described some methods to decide if such a module V is of w x quadratic type. One of the main results of 6 is the following. Suppose that Ž . G is a group with a s…
BOUNDING THE NUMBER OF IRREDUCIBLE CHARACTER DEGREES OF A FINITE GROUP IN TERMS OF THE LARGEST DEGREE
2013
We conjecture that the number of irreducible character degrees of a finite group is bounded in terms of the number of prime factors (counting multiplicities) of the largest character degree. We prove that this conjecture holds when the largest character degree is prime and when the character degree graph is disconnected.