Search results for "permuta"
showing 10 items of 171 documents
Sensitivity Versus Certificate Complexity of Boolean Functions
2016
Sensitivity, block sensitivity and certificate complexity are basic complexity measures of Boolean functions. The famous sensitivity conjecture claims that sensitivity is polynomially related to block sensitivity. However, it has been notoriously hard to obtain even exponential bounds. Since block sensitivity is known to be polynomially related to certificate complexity, an equivalent of proving this conjecture would be showing that the certificate complexity is polynomially related to sensitivity. Previously, it has been shown that $$bsf \le Cf \le 2^{sf-1} sf - sf-1$$. In this work, we give a better upper bound of $$bsf \le Cf \le \max \left 2^{sf-1}\left sf-\frac{1}{3}\right , sf\right $…
Classical sequences revisited with permutations avoiding dotted pattern
2011
International audience; Inspired by the definition of the barred pattern-avoiding permutation, we introduce the new concept of dotted pattern for permutations. We investigate permutations classes avoiding dotted patterns of length at most 3, possibly along with other classical patterns. We deduce some enumerating results which allow us to exhibit new families of permutations counted by the classical sequences: 2^n, Catalan, Motzkin, Pell, Fibonacci, Fine, Riordan, Padovan, Eulerian.
McKay natural correspondences on characters
2014
Let [math] be a finite group, let [math] be an odd prime, and let [math] . If [math] , then there is a canonical correspondence between the irreducible complex characters of [math] of degree not divisible by [math] belonging to the principal block of [math] and the linear characters of [math] . As a consequence, we give a characterization of finite groups that possess a self-normalizing Sylow [math] -subgroup or a [math] -decomposable Sylow normalizer.
A note on a result of Guo and Isaacs about p-supersolubility of finite groups
2016
In this note, global information about a finite group is obtained by assuming that certain subgroups of some given order are S-semipermutable. Recall that a subgroup H of a finite group G is said to be S-semipermutable if H permutes with all Sylow subgroups of G of order coprime to . We prove that for a fixed prime p, a given Sylow p-subgroup P of a finite group G, and a power d of p dividing such that , if is S-semipermutable in for all normal subgroups H of P with , then either G is p-supersoluble or else . This extends the main result of Guo and Isaacs in (Arch. Math. 105:215-222 2015). We derive some theorems that extend some known results concerning S-semipermutable subgroups.
On the supersoluble hypercentre of a finite group
2016
[EN] We give some sufficient conditions for a normal p-subgroup P of a finite group G to have every G-chief factor below it cyclic. The S-permutability of some p-subgroups of O^p(G)plays an important role. Some known results can be reproved and some others appear as corollaries of our main theorems.
On self-normalising subgroups of finite groups
2010
[EN] The aim of this paper is to characterise the classes of groups in which every subnormal subgroup is normal, permutable, or S-permutable by the embedding of the subgroups (respectively, subgroups of prime power order) in their normal, permutable, or S-permutable closure, respectively.
On a graph related to permutability in finite groups
2010
For a finite group G we define the graph $\Gamma(G)$ to be the graph whose vertices are the conjugacy classes of cyclic subgroups of G and two conjugacy classes $\{\mathcal {A}, \mathcal {B}\}$ are joined by an edge if for some $\{A \in \mathcal {A},\, B \in \mathcal {B}\, A\}$ and B permute. We characterise those groups G for which $\Gamma(G)$ is complete.
Generating restricted classes of involutions, Bell and Stirling permutations
2010
AbstractWe present a recursive generating algorithm for unrestricted permutations which is based on both the decomposition of a permutation as a product of transpositions and that as a union of disjoint cycles. It generates permutations at each recursive step and slight modifications of it produce generating algorithms for Bell permutations and involutions. Further refinements yield algorithms for these classes of permutations subject to additional restrictions: a given number of cycles or/and fixed points. We obtain, as particular cases, generating algorithms for permutations counted by the Stirling numbers of the first and second kind, even permutations, fixed-point-free involutions and d…
Equivalence classes of permutations modulo descents and left-to-right maxima
2014
Abstract In a recent paper [2], the authors provide enumerating results for equivalence classes of permutations modulo excedances. In this paper we investigate two other equivalence relations based on descents and left-to-right maxima. Enumerating results are presented for permutations, involutions, derangements, cycles and permutations avoiding one pattern of length three.
THE STRUCTURE OF MUTUALLY PERMUTABLE PRODUCTS OF FINITE NILPOTENT GROUPS
2007
We consider mutually permutable products G = AB of two nilpotent groups. The structure of the Sylow p-subgroups of its nilpotent residual is described.