Search results for "permuta"
showing 10 items of 171 documents
A generalization to Sylow permutability of pronormal subgroups of finite groups
2020
[EN] In this note, we present a new subgroup embedding property that can be considered as an analogue of pronormality in the scope of permutability and Sylow permutability in finite groups. We prove that finite PST-groups, or groups in which Sylow permutability is a transitive relation, can be characterized in terms of this property, in a similar way as T-groups, or groups in which normality is transitive, can be characterized in terms of pronormality.
Magic informationally complete POVMs with permutations
2017
Eigenstates of permutation gates are either stabilizer states (for gates in the Pauli group) or magic states, thus allowing universal quantum computation [M. Planat and Rukhsan-Ul-Haq, Preprint 1701.06443]. We show in this paper that a subset of such magic states, when acting on the generalized Pauli group, define (asymmetric) informationally complete POVMs. Such IC-POVMs, investigated in dimensions $2$ to $12$, exhibit simple finite geometries in their projector products and, for dimensions $4$ and $8$ and $9$, relate to two-qubit, three-qubit and two-qutrit contextuality.
Comparing fMRI inter-subject correlations between groups using permutation tests
2018
AbstractInter-subject correlation (ISC) based analysis is a conceptually simple approach to analyze functional magnetic resonance imaging (fMRI) data acquired under naturalistic stimuli such as a movie. We describe and validate the statistical approaches for comparing ISCs between two groups of subjects implemented in the ISC toolbox, which is an open source software package for ISC-based analysis of fMRI data. The approaches are based on permutation tests. We validated the approaches using five different data sets from the ICBM functional reference battery tasks. First, we created five null datasets (one for each task) by dividing the subjects into two matched groups and assumed that no gr…
Characterizing normal Sylow p-subgroups by character degrees
2012
Abstract Suppose that G is a finite group, let p be a prime and let P ∈ Syl p ( G ) . We prove that P is normal in G if and only if all the irreducible constituents of the permutation character ( 1 P ) G have degree not divisible by p.
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…
Over 30% of patients with splenic marginal zone lymphoma express the same immunoglobulin heavy variable gene: ontogenetic implications.
2012
We performed an immunogenetic analysis of 345 IGHV-IGHD-IGHJ rearrangements from 337 cases with primary splenic small B-cell lymphomas of marginal-zone origin. Three immunoglobulin (IG) heavy variable (IGHV) genes accounted for 45.8% of the cases (IGHV1-2, 24.9%; IGHV4-34, 12.8%; IGHV3-23, 8.1%). Particularly for the IGHV1-2 gene, strong biases were evident regarding utilization of different alleles, with 79/86 rearrangements (92%) using allele *04. Among cases more stringently classified as splenic marginal-zone lymphoma (SMZL) thanks to the availability of splenic histopathological specimens, the frequency of IGHV1-2*04 peaked at 31%. The IGHV1-2*04 rearrangements carried significantly lo…
Block–Savits Characterization and Star Ordering of Exponential Mixtures
2008
Block and Savits (1980) established a characterization of life distributions using the Laplace transform. In this article, we remark that one of the necessary conditions to be IFRA distribution is equivalent to the star ordering of exponential mixtures. It leads to the definition of two new classes of life distributions, called LIFR and LIFRA, and their dual classes: LDFR and LDFRA. It occurs that these classes have many useful aging properties and preserve known reliability operations. Properties of the classes are studied and relations with known classes are established.
A Hardware and Secure Pseudorandom Generator for Constrained Devices
2018
Hardware security for an Internet of Things or cyber physical system drives the need for ubiquitous cryptography to different sensing infrastructures in these fields. In particular, generating strong cryptographic keys on such resource-constrained device depends on a lightweight and cryptographically secure random number generator. In this research work, we have introduced a new hardware chaos-based pseudorandom number generator, which is mainly based on the deletion of an Hamilton cycle within the $N$ -cube (or on the vectorial negation), plus one single permutation. We have rigorously proven the chaotic behavior and cryptographically secure property of the whole proposal: the mid-term eff…
Right-jumps and pattern avoiding permutations
2015
We study the iteration of the process "a particle jumps to the right" in permutations. We prove that the set of permutations obtained in this model after a given number of iterations from the identity is a class of pattern avoiding permutations. We characterize the elements of the basis of this class and we enumerate these "forbidden minimal patterns" by giving their bivariate exponential generating function: we achieve this via a catalytic variable, the number of left-to-right maxima. We show that this generating function is a D-finite function satisfying a nice differential equation of order~2. We give some congruence properties for the coefficients of this generating function, and we sho…
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…