Search results for "permuta"
showing 10 items of 171 documents
On finite soluble groups in which Sylow permutability is a transitive relation
2003
A characterisation of finite soluble groups in which Sylow permutability is a transitive relation by means of subgroup embedding properties enjoyed by all the subgroups is proved in the paper. The key point is an extension of a subnormality criterion due to Wielandt.
Algorithms for permutability in finite groups
2013
In this paper we describe some algorithms to identify permutable and Sylow-permutable subgroups of finite groups, Dedekind and Iwasawa finite groups, and finite T-groups (groups in which normality is transitive), PT-groups (groups in which permutability is transitive), and PST-groups (groups in which Sylow permutability is transitive). These algorithms have been implemented in a package for the computer algebra system GAP.
Distinctive Patterns of Intraclonal Diversification In IGHV1-2*04 Immunoglobulin Receptors of Patients with Splenic Marginal Zone Lymphoma: A of Ongo…
2011
Abstract Abstract 2638 We recently demonstrated that over 30% of cases with splenic marginal-zone lymphoma (SMZL) express distinctive immunoglobulin (IG) receptors that utilize a single polymorphic variant of the IGHV1-2 gene (IGHV1-2*04) and also exhibit restricted antigen-binding site motifs and precise targeting of somatic hypermutation (SHM). On these grounds, we proposed the existence of molecular subtypes of SMZL defined by immunogenetic analysis of the IG receptors with implications for selection by specific (super) antigenic element(s) in the development of at least a major subset of SMZL. In order to gain insight as to whether antigen involvement is relevant only prior to the malig…
Gray code for permutations with a fixed number of cycles
2007
AbstractWe give the first Gray code for the set of n-length permutations with a given number of cycles. In this code, each permutation is transformed into its successor by a product with a cycle of length three, which is optimal. If we represent each permutation by its transposition array then the obtained list still remains a Gray code and this allows us to construct a constant amortized time (CAT) algorithm for generating these codes. Also, Gray code and generating algorithm for n-length permutations with fixed number of left-to-right minima are discussed.
Simple method for limiting delay of optimized interleavers for turbo-codes
2000
An iterative interleaver growth algorithm is extended to allow the delay and required memory of designed interleavers to be halved with negligible performance loss. The original algorithm is efficient for two-component parallel concatenated turbo-codes with given constituent encoders that are optimum with regard to a cost function satisfying some mild conditions. However, it is only actually optimum if the selected set of patterns is representative of low-weight turbo-codewords. The new interleaver uses all terminating error patterns having an input weight not greater than a fixed IWX and single-coder output weight not greater than WX is proposed.
Assessment of the interpretability of data mining for the spatial modelling of water erosion using game theory
2021
Abstract This study undertook a comprehensive application of 15 data mining (DM) models, most of which have, thus far, not been commonly used in environmental sciences, to predict land susceptibility to water erosion hazard in the Kahorestan catchment, southern Iran. The DM models were BGLM, BGAM, Cforest, CITree, GAMS, LRSS, NCPQR, PLS, PLSGLM, QR, RLM, SGB, SVM, BCART and BTR. We identified 18 factors usually considered as key controls for water erosion, comprising 10 factors extracted from a digital elevation model (DEM), three indices extracted from Landsat 8 images, a sediment connectivity index (SCI) and three other intrinsic factors. Three indicators consisting of MAE, MBE, RMSE, and…
Lines on the Dwork pencil of quintic threefolds
2012
We present an explicit parametrization of the families of lines of the Dwork pencil of quintic threefolds. This gives rise to isomorphic curves which parametrize the lines. These curves are 125:1 covers of certain genus six curves. These genus six curves are first presented as curves in P^1*P^1 that have three nodes. It is natural to blow up P^1*P^1 in the three points corresponding to the nodes in order to produce smooth curves. The result of blowing up P^1*P^1 in three points is the quintic del Pezzo surface dP_5, whose automorphism group is the permutation group S_5, which is also a symmetry of the pair of genus six curves. The subgroup A_5, of even permutations, is an automorphism of ea…
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…
A branch and bound algorithm for the matrix bandwidth minimization
2008
In this article, we first review previous exact approaches as well as theoretical contributions for the problem of reducing the bandwidth of a matrix. This problem consists of finding a permutation of the rows and columns of a given matrix which keeps the non-zero elements in a band that is as close as possible to the main diagonal. This NP-complete problem can also be formulated as a labeling of vertices on a graph, where edges are the non-zero elements of the corresponding symmetrical matrix. We propose a new branch and bound algorithm and new expressions for known lower bounds for this problem. Empirical results with a collection of previously reported instances indicate that the propose…
ChemInform Abstract: Chemoenzymatic-Chemical Synthesis of a (2-3)-Sialyl T Threonine Building Block and Its Application to the Synthesis of the N-Ter…
2010
Protection of all functional groups of the carbohydrate portion of the chemoenzymatically synthesized sialyl T threonine ester 1 (R=R1 =H, R2 =tBu, Fmoc=9-fluorenylmethoxycarbonyl) and subsequent acidolysis of the tert-butyl ester afforded the building block 2 (R=Ac, R1 =Me, R2 =H). The latter is a useful tool in the solid-phase synthesis of the N-terminal sequence 3 of the leukemia-associated leukosialin.