Search results for "permuta"
showing 10 items of 171 documents
A rapid method for the differentiation of yeast cells grown under carbon and nitrogen-limited conditions by means of partial least squares discrimina…
2012
This paper shows the ease of application and usefulness of mid-IR measurements for the investigation of orthogonal cell states on the example of the analysis of Pichia pastoris cells. A rapid method for the discrimination of entire yeast cells grown under carbon and nitrogen-limited conditions based on the direct acquisition of mid-IR spectra and partial least squares discriminant analysis (PLS-DA) is described. The obtained PLS-DA model was extensively validated employing two different validation strategies: (i) statistical validation employing a method based on permutation testing and (ii) external validation splitting the available data into two independent sub-sets. The Variable Importa…
A note on finite PST-groups
2007
[EN] A finite group G is said to be a PST-group if, for subgroups H and K of G with H Sylow-permutable in K and K Sylow-permutable in G, it is always the case that H is Sylow-permutable in G. A group G is a T*-group if, for subgroups H and K of G with H normal in K and K normal in G, it is always the case that H is Sylow-permutable in G. In this paper, we show that finite PST-groups and finite T*-groups are one and the same. A new characterisation of soluble PST-groups is also presented.
Algebraic (2, 2)-transformation groups
2009
This paper contains the more significant part of the article with the same title that will appear in the Volume 12 of Journal of Group Theory (2009). In this paper we determine all algebraic transformation groups $G$, defined over an algebraically closed field $\sf k$, which operate transitively, but not primitively, on a variety $\Omega$, provided the following conditions are fulfilled. We ask that the (non-effective) action of $G$ on the variety of blocks is sharply 2-transitive, as well as the action on a block $\Delta$ of the normalizer $G_\Delta$. Also we require sharp transitivity on pairs $(X,Y)$ of independent points of $\Omega$, i.e. points contained in different blocks.
The pure descent statistic on permutations
2017
International audience; We introduce a new statistic based on permutation descents which has a distribution given by the Stirling numbers of the first kind, i.e., with the same distribution as for the number of cycles in permutations. We study this statistic on the sets of permutations avoiding one pattern of length three by giving bivariate generating functions. As a consequence, new classes of permutations enumerated by the Motzkin numbers are obtained. Finally, we deduce results about the popularity of the pure descents in all these restricted sets. (C) 2017 Elsevier B.V. All rights reserved.
Unfolding of saddle-nodes and their Dulac time
2016
Altres ajuts: UNAB10-4E-378, co-funded by ERDF "A way to build Europe" and by the French ANR-11-BS01-0009 STAAVF. In this paper we study unfoldings of saddle-nodes and their Dulac time. By unfolding a saddle-node, saddles and nodes appear. In the first result (Theorem A) we give a uniform asymptotic expansion of the trajectories arriving at the node. Uniformity is with respect to all parameters including the unfolding parameter bringing the node to a saddle-node and a parameter belonging to a space of functions. In the second part, we apply this first result for proving a regularity result (Theorem B) on the Dulac time (time of Dulac map) of an unfolding of a saddle-node. This result is a b…
Whole mirror duplication-random loss model and pattern avoiding permutations
2010
International audience; In this paper we study the problem of the whole mirror duplication-random loss model in terms of pattern avoiding permutations. We prove that the class of permutations obtained with this model after a given number p of duplications of the identity is the class of permutations avoiding the alternating permutations of length p2+1. We also compute the number of duplications necessary and sufficient to obtain any permutation of length n. We provide two efficient algorithms to reconstitute a possible scenario of whole mirror duplications from identity to any permutation of length n. One of them uses the well-known binary reflected Gray code (Gray, 1953). Other relative mo…
Gray code for Cayley permutations
2003
A length-n Cayley permutation p of a total ordered set S is a length-n sequence of elements from S, subject to the condition that if an element x appears in p then all elements y < x also appear in p . In this paper, we give a Gray code list for the set of length-n Cayley permutations. Two successive permutations in this list differ at most in two positions.
Gray code for compositions of n with parts 1 and p
2009
International audience
ECO-generation for some restricted classes of compositions
2013
International audience; We study several restricted classes of compositions by giving one-to-one maps between them and different classes of restricted binary strings or pattern avoiding permutations. Inspired by the ECO method, new succession rules for these classes are presented. Finally, we obtain generating algorithms in Constant Amortized Time (CAT) for theses classes.
Etudes d'objets combinatoires : applications à la bio-informatique
2011
This thesis considers classes of combinatorial objects that model data in bioinformatics. We have studied two methods of mutation of genes within the genome : duplication and inversion. At first,we study the problem of the whole mirror duplication-random lossmodel in terms of pattern avoiding permutations. We prove that the class of permutations obtained with this method after p duplications from the identity is the class of permutations avoiding alternating permutations of length 2p + 1.We also enumerate the number of duplications that are necessary and sufficient to obtain any permutation of length n from the identity. We also suggest two efficient algorithms to reconstruct two different …