Search results for "Combinatorics"
showing 10 items of 1770 documents
Some Characterisations of Soluble SST-Groups
2016
All groups considered in this paper are finite. A subgroup H of a group G is said to be SS-permutable or SS-quasinormal in G if H has a supplement K in G such that H permutes with every Sylow subgroup of K. Following [6], we call a group G an SST-group provided that SS-permutability is a transitive relation in G, that is, if A is an SS-permutable subgroup of B and B is an SS-permutable subgroup of G, then A is an SS-permutable subgroup of G. The main aim of this paper is to present several characterisations of soluble SST-groups.
Generalizations of the periodicity Theorem of Fine and Wilf
2005
We provide three generalizations to the two-dimensional case of the well known periodicity theorem by Fine and Wilf [4] for strings (the one-dimensional case). The first and the second generalizations can be further extended to hold in the more general setting of Cayley graphs of groups. Weak forms of two of our results have been developed for the design of efficient algorithms for two-dimensional pattern matching [2, 3, 6].
On the product of a nilpotent group and a group with non-trivial center
2007
Abstract It is proved that a finite group G = A B which is a product of a nilpotent subgroup A and a subgroup B with non-trivial center contains a non-trivial abelian normal subgroup.
p-Blocks relative to a character of a normal subgroup
2018
Abstract Let G be a finite group, let N ◃ G , and let θ ∈ Irr ( N ) be a G-invariant character. We fix a prime p, and we introduce a canonical partition of Irr ( G | θ ) relative to p. We call each member B θ of this partition a θ-block, and to each θ-block B θ we naturally associate a conjugacy class of p-subgroups of G / N , which we call the θ-defect groups of B θ . If N is trivial, then the θ-blocks are the Brauer p-blocks. Using θ-blocks, we can unify the Gluck–Wolf–Navarro–Tiep theorem and Brauer's Height Zero conjecture in a single statement, which, after work of B. Sambale, turns out to be equivalent to the Height Zero conjecture. We also prove that the k ( B ) -conjecture is true i…
On the product of a π-group and a π-decomposable group
2007
[EN] The main result in the paper states the following: Let π be a set of odd primes. Let the finite group G=AB be the product of a π -decomposable subgroup A=Oπ(A)×Oπ′(A) and a π -subgroup B . Then Oπ(A)⩽Oπ(G); equivalently the group G possesses Hall π -subgroups. In this case Oπ(A)B is a Hall π-subgroup of G. This result extends previous results of Berkovich (1966), Rowley (1977), Arad and Chillag (1981) and Kazarin (1980) where stronger hypotheses on the factors A and B of the group G were being considered. The results under consideration in the paper provide in particular criteria for the existence of non-trivial soluble normal subgroups for a factorized group G.
On finite groups generated by strongly cosubnormal subgroups
2003
[EN] Two subgroups A and B of a group G are cosubnormal if A and B are subnormal in their join and are strongly cosubnormal if every subgroup of A is cosubnormal with every subgroup of B. We find necessary and sufficient conditions for A and B to be strongly cosubnormal in and, if Z is the hypercentre of G=, we show that A and B are strongly cosubnormal if and only if G/Z is the direct product of AZ/Z and BZ/Z. We also show that projectors and residuals for certain formations can easily be constructed in such a group. Two subgroups A and B of a group G are N-connected if every cyclic subgroup of A is cosubnormal with every cyclic subgroup of B (N denotes the class of nilpotent groups). Thou…
Primitive characters of subgroups ofM-groups
1995
One of the hardest areas in the Character Theory of Solvable Groups continues to be the monomial groups. A finite group is said to be an M-group (or monomial) if all of its irreducible characters are monomial, that is to say, induced from linear characters. Two are still the main problems on M-groups: are Hall subgroups of M groups monomial? Under certain oddness hypothesis, are normal subgroups of M-groups monomial? In both cases there is evidence that this could be the case: the primitive characters of the subgroups in question are the linear characters. This is the best result up to date ([4], [6]). Recently, some idea appears to be taking form. In [14], T. Okuyama proved that if G is an…
Affine Surfaces With a Huge Group of Automorphisms
2013
We describe a family of rational affine surfaces S with huge groups of automorphisms in the following sense: the normal subgroup Aut(S)alg of Aut(S) generated by all algebraic subgroups of Aut(S) is not generated by any countable family of such subgroups, and the quotient Aut(S)/Aut(S)alg cointains a free group over an uncountable set of generators.
Quantum algorithms for search with wildcards and combinatorial group testing
2012
We consider two combinatorial problems. The first we call "search with wildcards": given an unknown n-bit string x, and the ability to check whether any subset of the bits of x is equal to a provided query string, the goal is to output x. We give a nearly optimal O(sqrt(n) log n) quantum query algorithm for search with wildcards, beating the classical lower bound of Omega(n) queries. Rather than using amplitude amplification or a quantum walk, our algorithm is ultimately based on the solution to a state discrimination problem. The second problem we consider is combinatorial group testing, which is the task of identifying a subset of at most k special items out of a set of n items, given the…
Limits on entropic uncertainty relations
2010
We consider entropic uncertainty relations for outcomes of the measurements of a quantum state in 3 or more mutually unbiased bases (MUBs), chosen from the standard construction of MUBs in prime dimension. We show that, for any choice of 3 MUBs and at least one choice of a larger number of MUBs, the best possible entropic uncertainty relation can be only marginally better than the one that trivially follows from the relation by Maassen and Uffink for 2 bases.