Search results for "permuta"

showing 10 items of 171 documents

Cyclic and lift closures for k…21-avoiding permutations

2011

We prove that the cyclic closure of the permutation class avoiding the pattern k(k-1)...21 is finitely based. The minimal length of a minimal permutation is 2k-1 and these basis permutations are enumerated by (2k-1).c"k where c"k is the kth Catalan number. We also define lift operations and give similar results. Finally, we consider the toric closure of a class and we propose some open problems.

CombinatoricsCatalan numberDiscrete mathematicsLift (mathematics)PermutationMathematics::CombinatoricsClosure (computer programming)Discrete Mathematics and CombinatoricsTheoretical Computer ScienceCyclic permutationMathematicsDiscrete Mathematics
researchProduct

HEIGHTS OF CHARACTERS IN BLOCKS OF $p$-SOLVABLE GROUPS

2005

In this paper, it is proved that if $B$ is a Brauer $p$ -block of a $p$ -solvable group, for some odd prime $p$ , then the height of any ordinary character in $B$ is at most $2b$ , where $p^b$ is the largest degree of the irreducible characters of the defect group of $B$ . Some other results that relate the heights of characters with properties of the defect group are obtained.

CombinatoricsCharacter (mathematics)Degree (graph theory)Solvable groupGeneral MathematicsDefect groupBlock (permutation group theory)Prime (order theory)MathematicsBulletin of the London Mathematical Society
researchProduct

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.

CombinatoricsConditional permutabilityAlgebra and Number TheoryGroup (mathematics)Product (mathematics)Products of subgroupsPermutable primeElement (category theory)MATEMATICA APLICADAFinite groupsSupersoluble groupsMathematicsJournal of Algebra
researchProduct

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.

CombinatoricsConditional permutabilityGroup (mathematics)General MathematicsProduct (mathematics)Products of subgroupsMATEMATICA APLICADAFinite groupsSaturated formationsMathematics
researchProduct

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…

CombinatoricsDiscrete mathematicsFinite groupAlgebra and Number Theory2-generated subgroupsGroup (mathematics)Products of subgroupsPermutable primeFinite groupsSaturated formationsSoluble groupsMathematicsJournal of Algebra
researchProduct

Injectors and Radicals in Products of Totally Permutable Groups

2003

Abstract Two subgroups H and K of a group G are said to be totally permutable if every subgroup of H permutes with every subgroup of K. In this paper the behaviour of radicals and injectors associated to Fitting classes in a product of pairwise totally permutable finite groups is studied.

CombinatoricsDiscrete mathematicsMathematics::Group TheoryMathematics::CombinatoricsAlgebra and Number TheoryGroup (mathematics)Product (mathematics)Permutable primeMathematicsCommunications in Algebra
researchProduct

Quantum Queries on Permutations with a Promise

2009

This paper studies quantum query complexities for deciding (exactly or with probability 1.0) the parity of permutations of n numbers, 0 through n *** 1. Our results show quantum mechanism is quite strong for this non-Boolean problem as it is for several Boolean problems: (i) For n = 3, we need a single query in the quantum case whereas we obviously need two queries deterministically. (ii) For even n , n /2 quantum queries are sufficient whereas we need n *** 1 queries deterministically. (iii) Our third result is for the problem deciding whether the given permutation is the identical one. For this problem, we show that there is a nontrivial promise such that if we impose that promise to the …

CombinatoricsDiscrete mathematicsQuantum queryPermutationQuantum algorithmParity (physics)Boolean functionQuantumComputer Science::DatabasesMathematics
researchProduct

Central Units, Class Sums and Characters of the Symmetric Group

2010

In the search for central units of a group algebra, we look at the class sums of the group algebra of the symmetric group S n in characteristic zero, and we show that they are units in very special instances.

CombinatoricsDiscrete mathematicsSymmetric algebraAlgebra and Number TheoryCharacter tableSymmetric groupQuaternion groupAlternating groupGroup algebraPermutation groupGroup ringMathematicsCommunications in Algebra
researchProduct

Group algebras whose units satisfy a group identity

1997

Let F G FG be the group algebra of a torsion group over an infinite field F F . Let U U be the group of units of F G FG . We prove that if U U satisfies a group identity, then F G FG satisfies a polynomial identity. This confirms a conjecture of Brian Hartley.

CombinatoricsGroup (mathematics)Collective identityG-moduleApplied MathematicsGeneral MathematicsMathematicsofComputing_GENERALQuaternion groupIdentity componentPermutation groupGroup objectMathematicsProceedings of the American Mathematical Society
researchProduct

Permutability in finite soluble groups

1994

Let G be a finite soluble group and let Σ be a Hall system of G. A subgroup U of G is said to be Σ-permutable if U permutes with every member of Σ. In [1; I, 4·29] it is proved that if U and V are Σ-permutable subgroups of G then so also are U ∩ V and 〈U, V〉.

CombinatoricsGroup (mathematics)General MathematicsGeometryPermutable primeMathematicsMathematical Proceedings of the Cambridge Philosophical Society
researchProduct