Search results for "Mathematics::Combinatorics"
showing 10 items of 81 documents
On finite T-groups
2003
[EN] Characterisations of finite groups in which normality is a transitive relation are presented in the paper. We also characterise the finite groups in which every subgroup is either permutable or coincides with its permutiser as the groups in which every subgroup is permutable.
Transitivity of Sylow permutability, the converse of Lagrange's theorem, and mutually permutable products
2008
This paper is devoted to the study of mutually permutable products of finite groups. A factorised group G = AB is said to be a mutually permutable product of its factors A and B when each factor permutes with every subgroup of the other factor. We prove that mutually permutable products of Y -groups (groups satisfying the converse of Lagrange's theorem) and SC-groups (groups whose chief factors are simple) are SC -groups. Next, we show that a product of pairwise mutually permutable Y -groups is supersoluble. Finally, we give a local version of the result stating that if a mutually permutable product of two groups is a PST - group (that is, a group in which every subnormal subgroup permutes …
Some subgroup embeddings in finite groups
2015
In this survey paper several subgroup embedding properties related to some types of permutability are introduced and studied.
Avoiding patterns in irreducible permutations
2016
We explore the classical pattern avoidance question in the case of irreducible permutations, <i>i.e.</i>, those in which there is no index $i$ such that $\sigma (i+1) - \sigma (i)=1$. The problem is addressed completely in the case of avoiding one or two patterns of length three, and several well known sequences are encountered in the process, such as Catalan, Motzkin, Fibonacci, Tribonacci, Padovan and Binary numbers. Also, we present constructive bijections between the set of Motzkin paths of length $n-1$ and the sets of irreducible permutations of length $n$ (respectively fixed point free irreducible involutions of length $2n$) avoiding a pattern $\alpha$ for $\alpha \in \{13…
Permutable subnormal subgroups of finite groups
2009
The aim of this paper is to prove certain characterization theorems for groups in which permutability is a transitive relation, the so called PT -groups. In particular, it is shown that the finite solvable PT -groups, the finite solvable groups in which every subnormal subgroup of defect two is permutable, the finite solvable groups in which every normal subgroup is permutable sensitive, and the finite solvable groups in which conjugatepermutability and permutability coincide are all one and the same class. This follows from our main result which says that the finite modular p-groups, p a prime, are those p-groups in which every subnormal subgroup of defect two is permutable or, equivalentl…
"Table 1" of "$\Lambda$ polarization in associated K$^+$ - $\Lambda$ electro-production"
2000
LAMBDA polarization, with respect to the p_gamma x p_k axis.
Color Image Segmentation: The Hypergraph Framework
2006
International audience; Color Image Segmentation: The Hypergraph Framework
Permutation Tests in Linear Regression
2015
Exact permutation tests are available only in rather simple linear models. The problem is that, although standard assumptions allow permuting the errors of the model, we cannot permute them in practice, because they are unobservable. Nevertheless, the residuals of the model can be permuted. A proof is given here which shows that it is possible to approximate the unobservable permutation distribution where the true errors are permuted by permuting the residuals. It is shown that approximation holds asymptotically and almost surely for certain quadratic statistics as well as for statistics which are expressible as the maximum of appropriate linear functions. The result is applied to testing t…
Some classes of finite groups and mutually permutable products
2008
[EN] This paper is devoted to the study of mutually permutable products of finite groups. A factorised group G=AB is said to be a mutually permutable product of its factors A and B when each factor permutes with every subgroup of the other factor. We prove that mutually permutable products of Y-groups (groups satisfying a converse of Lagrange's theorem) and SC-groups (groups whose chief factors are simple) are SC-groups, by means of a local version. Next we show that the product of pairwise mutually permutable Y-groups is supersoluble. Finally, we give a local version of the result stating that when a mutually permutable product of two groups is a PST-group (that is, a group in which every …
Some Generalizations of a Simion Schmidt Bijection
2007
In 1985, Simion and Schmidt gave a constructive bijection φ from the set of all length (n-1) binary strings having no two consecutive 1s to the set of all length n permutations avoiding all patterns in {123,132,213}. In this paper, we generalize φ to an injective function from {0,1}n-1 to the set Sn of all length n permutations and derive from it four bijections φ : P →Q where P⊆{0,1}n-1 and Q ⊂ Sn. The domains are sets of restricted binary strings and the codomains are sets of pattern-avoiding permutations. As a particular case we retrieve the original Simion–Schmidt bijection. We also show that the bijections obtained are actually combinatorial isomorphisms, i.e. closeness-preserving bije…