Search results for "cyclic"

showing 10 items of 2439 documents

Hyper-abelian groups with finite co-central rank

2004

AbstractA group G has finite co-central rank s if there exists a least non-negative integer s such that every finitely generated subgroup H can be generated by at most s elements modulo the centre of H. The investigation of such groups has been started in [J.P. Sysak, A. Tresch, J. Group Theory 4 (2001) 325]. It is proved that hyper-abelian groups with finite co-central rank are locally soluble. The interplay between the Prüfer rank condition, the condition of having finite abelian section rank and the finite co-central rank condition is studied. As one result, a hyper-abelian group G with finite co-central rank has an ascending series with abelian factors of finite rank and every chief fac…

CombinatoricsAlgebra and Number TheoryTorsion subgroupRank conditionLocally finite groupPrüfer rankElementary abelian groupCyclic groupAbelian groupRank of an abelian groupMathematicsJournal of Algebra
researchProduct

Cyclic and lift closures for k…21-avoiding permutations

2011

We prove that the cyclic closure of the permutation class avoiding the pattern k(k-1)...21 is finitely based. The minimal length of a minimal permutation is 2k-1 and these basis permutations are enumerated by (2k-1).c"k where c"k is the kth Catalan number. We also define lift operations and give similar results. Finally, we consider the toric closure of a class and we propose some open problems.

CombinatoricsCatalan numberDiscrete mathematicsLift (mathematics)PermutationMathematics::CombinatoricsClosure (computer programming)Discrete Mathematics and CombinatoricsTheoretical Computer ScienceCyclic permutationMathematicsDiscrete Mathematics
researchProduct

Two Questions of L. A. Shemetkov on Critical Groups

1996

Throughout the paper we consider only finite groups. Let X be a class of groups. A group G is called s-critical for X , or simply X-critical, if G is not in X but all proper subgroups of G are in X. w Ž .x Ž . Following Doerk and Hawkes 3, VII, 6.1 , we denote Crit X the class s of all X-critical groups. Knowledge of the structure of the groups in Ž . Crit X for a class of groups X can often help one to obtain detailed s information for the structure of the groups belonging to X. Ž w Ž .x. O. J. Schmidt see 5, III, 5.2 studied the N-critical groups, where N is the formation of the nilpotent groups. These groups are also called w x Schmidt groups. In 2 , answering to a question posed by Shem…

CombinatoricsClass (set theory)NilpotentProperty (philosophy)Algebra and Number TheoryGroup (mathematics)Structure (category theory)Cyclic groupMathematicsUniverse (mathematics)Journal of Algebra
researchProduct

Two groups with isomorphic group algebras

1990

CombinatoricsClassification of Clifford algebrasGroup isomorphismDicyclic groupGeneral MathematicsSimple groupQuaternion groupCyclic groupCycle graph (algebra)MathematicsNon-abelian groupArchiv der Mathematik
researchProduct

Invariant ordering of surface groups and 3-manifolds which fibre over $S^1$

2006

CombinatoricsDicyclic groupGeneral MathematicsInvariant (mathematics)Point groups in two dimensionsCovering groups of the alternating and symmetric groupsMathematicsNon-abelian groupMathematical Proceedings of the Cambridge Philosophical Society
researchProduct

Transitive permutation groups in which all derangements are involutions

2006

AbstractLet G be a transitive permutation group in which all derangements are involutions. We prove that G is either an elementary abelian 2-group or is a Frobenius group having an elementary abelian 2-group as kernel. We also consider the analogous problem for abstract groups, and we classify groups G with a proper subgroup H such that every element of G not conjugate to an element of H is an involution.

CombinatoricsSubgroupAlgebra and Number TheorySymmetric groupPrimitive permutation groupElementary abelian groupAbelian groupFrobenius groupCyclic permutationMathematicsNon-abelian groupJournal of Pure and Applied Algebra
researchProduct

Efficacy and safety of cyclic pyranopterin monophosphate substitution in severe molybdenum cofactor deficiency type A: a prospective cohort study.

2015

Summary Background Molybdenum cofactor deficiency (MoCD) is characterised by early, rapidly progressive postnatal encephalopathy and intractable seizures, leading to severe disability and early death. Previous treatment attempts have been unsuccessful. After a pioneering single treatment we now report the outcome of the complete first cohort of patients receiving substitution treatment with cyclic pyranopterin monophosphate (cPMP), a biosynthetic precursor of the cofactor. Methods In this observational prospective cohort study, newborn babies with clinical and biochemical evidence of MoCD were admitted to a compassionate-use programme at the request of their treating physicians. Intravenous…

Compassionate Use TrialsMalePediatricsmedicine.medical_specialtyGENOMIC STRUCTUREFEATURESEncephalopathyMolybdopterin synthaseCyclic pyranopterin monophosphateDrug Administration ScheduleCohort Studieschemistry.chemical_compoundOrganophosphorus CompoundsmedicineURINEHumansBIOSYNTHESISProspective cohort studyAdverse effectMolybdenum cofactor deficiencyPRECURSORMetal Metabolism Inborn ErrorsMetal metabolismbusiness.industryMUTATIONSInfant NewbornGENES MOCS1CPMPMOLYBDOPTERIN SYNTHASEGeneral Medicinemedicine.diseasePterinsTreatment OutcomechemistryFemalebusinessCohort studyLancet (London, England)
researchProduct

Complexes de métaux de transition avec des ligands carbènes N-hétérocycliques : synthèses et réactivité

2015

The purpose of this work is the synthesis of complexes containing imine-functionalized protic NHC ligands in order to further develop synthetic methodologies giving access to pNHC, C-bound ‘anionic’ imidazolide, and homo- and heterodinuclear complexes. In the case of imidazoles without functional group, deprotonation with n-butyl lithium afforded (1-aryl-1H-imidazol-2-yl)lithium in good yield. Reaction of (1-aryl-1H-imidazol-2-yl)lithium with [Ir(cod)(μ-Cl)]2 or [Rh(cod)(μ-Cl)]2 yielded a doubly C2,N3-bridged dinuclear complex. In the case of imine-functionalized imidazole, the Ir(I) N-bound imidazole complex can tautomerize to Ir(I) imine-functionalized pNHC complex chloride abstraction at…

Complexes du rhodiumIridium complexesFonctionnalité-imine[CHIM.OTHE] Chemical Sciences/OtherProtic N-heterocyclic carbenesRhodium complexesCarbènes N-hétérocyclique protiqueImine-functionalizationsComplexes de l'iridiumC-H activationActivation C-H
researchProduct

An Analysis of the Influence of Noneffective Instructions in Linear Genetic Programming

2020

Abstract Linear Genetic Programming (LGP) represents programs as sequences of instructions and has a Directed Acyclic Graph (DAG) dataflow. The results of instructions are stored in registers that can be used as arguments by other instructions. Instructions that are disconnected from the main part of the program are called noneffective instructions, or structural introns. They also appear in other DAG-based GP approaches like Cartesian Genetic Programming (CGP). This article studies four hypotheses on the role of structural introns: noneffective instructions (1) serve as evolutionary memory, where evolved information is stored and later used in search, (2) preserve population diversity, (3)…

Computational MathematicsTheoretical computer scienceDataflowComputer scienceLinear genetic programmingPopulation diversitySymbolic regressionCartesian genetic programmingDirected acyclic graphBiological EvolutionAlgorithmsNeutral mutationEvolutionary Computation
researchProduct

An Improved Detection Technique for Cyclic-Prefixed OFDM

2010

A novel Orthogonal Frequency Division Multiplexing detection technique compatible to standard (e.g. Wireless LAN) transmitters is proposed. It features enhanced error-rate performance with flexible computational complexity and robustness to imperfect channel estimation. It is based on exploitation of the redundancy available in the cyclic prefix after cancellation of interference from the preceding block. In order to show the effectiveness of our proposal, an analysis of computational complexity and a number of comparisons to the standard per-subcarrier receiver and a previously existing method in terms of error rates are reported.

Computational complexity theoryLinear DetectionComputer Networks and CommunicationsOrthogonal frequency-division multiplexingComputer scienceSettore ING-INF/03 - TelecomunicazioniFrequency-selective channelCyclic prefixMaximum likelihood detectionSingle antenna interference cancellationRobustness (computer science)Maximum-Likelihood DetectionWireless lanStatisticsOrthogonal Frequency Division MultiplexingInterference CancellationAlgorithmComputer Science::Information Theory
researchProduct