Search results for "combinatoric"

showing 10 items of 1776 documents

Weights, vertices and a correspondence of characters in groups of odd order

1993

CombinatoricsGeneral MathematicsOrder (group theory)MathematicsMathematische Zeitschrift
researchProduct

Products of groups with finite rank

1987

CombinatoricsGeneral MathematicsRank (graph theory)MathematicsArchiv der Mathematik
researchProduct

Comment gérer des expériences touristiques extraordinaires ? Analyse et recommandations à partir d’une immersion dans les parcs à thème

2011

Les concepteurs et managers de parcs a theme cherchent avant tout a favoriser l’immersion du visiteur au cœur d’une experience extraordinaire. Pourtant, l’acces a ce type d’experience n’est pas systematique et l’immersion du visi- teur ne semble pas permanente. L’objectif de cet article est d’approfondir la comprehension de l’experience vecue dans ces parcs. L’analyse de 41 journaux de bord de visiteurs de parcs a theme permet de mettre a jour des etats d’immersion mais egalement d’autres etats ressentis (submersion, emer- sion, rejet). Sur le plan managerial, cette demarche offre des cles de comprehension aux managers de ces parcs et plus globalement de sites touristiques proposant des off…

CombinatoricsGeneral MedicineHumanitiesMathematicsDécisions Marketing
researchProduct

Filtration de Johnson et groupe de Torelli modulo p, p premier

2008

Resume Soit S ( g , 1 ) une surface connexe, compacte, orientee, de genre g, avec une composante de bord et Mod ( g , 1 ) son groupe modulaire. Soit p un entier, ou bien egal a 0, ou bien premier ⩾2. On construit une p-filtration centrale de Mod ( g , 1 ) , notee { M ( k , p ) : k ∈ N ∗ = N − { 0 } } , generalisant la filtration de Johnson (qui correspond a p = 0 ) telle que M ( 1 , p ) = Mod ( g , 1 ) , M ( k , p ) / M ( k + 1 , p ) ( k ⩾ 2 ) est un Z / p Z -espace vectoriel de dimension finie et M ( 2 , p ) est le groupe de Torelli modulo p (e.g. le sous-groupe de Mod ( g , 1 ) des homeomorphismes induisant l'identite sur H 1 ( S ( g , 1 ) ; Z / p Z ) ) . On annonce les resultats suivants…

CombinatoricsGeneral MedicineMathematicsComptes Rendus Mathematique
researchProduct

The constant osculating rank of the Wilking manifold

2008

We prove that the osculating rank of the Wilking manifold V3 = (SO (3) × SU (3)) / U• (2), endowed with the metric over(g, )1, equals 2. The knowledge of the osculating rank allows us to solve the differential equation of the Jacobi vector fields. These results can be applied to determine the area and the volume of geodesic spheres and balls. To cite this article: E. Macias-Virgos et al., C. R. Acad. Sci. Paris, Ser. I 346 (2008). © 2007 Academie des sciences.

CombinatoricsGeodesicDifferential equationMathematical analysisMetric (mathematics)Vector fieldGeneral MedicineRank (differential topology)Constant (mathematics)ManifoldMathematicsOsculating circleComptes Rendus Mathematique
researchProduct

ℓ-distant Hamiltonian walks in Cartesian product graphs

2009

Abstract We introduce and study a generalisation of Hamiltonian cycles: an l-distant Hamiltonian walk in a graph G of order n is a cyclic ordering of its vertices in which consecutive vertices are at distance l. Conditions for a Cartesian product graph to possess such an l-distant Hamiltonian walk are given and more specific results are presented concerning toroidal grids.

CombinatoricsGray codeDiscrete mathematicssymbols.namesakeApplied MathematicssymbolsDiscrete Mathematics and CombinatoricsCartesian productHamiltonian pathGraphHypercube graphMathematicsHamiltonian path problemElectronic Notes in Discrete Mathematics
researchProduct

A Loopless Generation of Bitstrings without p Consecutive Ones

2001

Let F n (p) be the set of all n-length bitstrings such that there are no p consecutive ls. F n (p) is counted with the pth order Fibonacci numbers and it may be regarded as the subsets of {1, 2,…, n} without p consecutive elements and bitstrings in F n (p) code a particular class of trees or compositions of an integer. In this paper we give a Gray code for F n (p) which can be implemented in a recursive generating algorithm, and finally in a loopless generating algorithm.

CombinatoricsGray codeSet (abstract data type)Discrete mathematicssymbols.namesakeCode (set theory)Fibonacci numberBinary treeIntegersymbolsOrder (group theory)Hamiltonian pathMathematics
researchProduct

Group algebras whose units satisfy a group identity

1997

Let F G FG be the group algebra of a torsion group over an infinite field F F . Let U U be the group of units of F G FG . We prove that if U U satisfies a group identity, then F G FG satisfies a polynomial identity. This confirms a conjecture of Brian Hartley.

CombinatoricsGroup (mathematics)Collective identityG-moduleApplied MathematicsGeneral MathematicsMathematicsofComputing_GENERALQuaternion groupIdentity componentPermutation groupGroup objectMathematicsProceedings of the American Mathematical Society
researchProduct

Permutability in finite soluble groups

1994

Let G be a finite soluble group and let Σ be a Hall system of G. A subgroup U of G is said to be Σ-permutable if U permutes with every member of Σ. In [1; I, 4·29] it is proved that if U and V are Σ-permutable subgroups of G then so also are U ∩ V and 〈U, V〉.

CombinatoricsGroup (mathematics)General MathematicsGeometryPermutable primeMathematicsMathematical Proceedings of the Cambridge Philosophical Society
researchProduct

A note on finite groups generated by their subnormal subgroups

2001

AbstractFollowing the theory of operators created by Wielandt, we ask for what kind of formations $\mathfrak{F}$ and for what kind of subnormal subgroups $U$ and $V$ of a finite group $G$ we have that the $\mathfrak{F}$-residual of the subgroup generated by two subnormal subgroups of a group is the subgroup generated by the $\mathfrak{F}$-residuals of the subgroups.In this paper we provide an answer whenever $U$ is quasinilpotent and $\mathfrak{F}$ is either a Fitting formation or a saturated formation closed for quasinilpotent subnormal subgroups.AMS 2000 Mathematics subject classification: Primary 20F17; 20D35

CombinatoricsGroup (mathematics)Locally finite groupGeneral MathematicsComponent (group theory)Mathematics
researchProduct