Search results for "Automorphism"

showing 10 items of 88 documents

Words and forbidden factors

2002

AbstractGiven a finite or infinite word v, we consider the set M(v) of minimal forbidden factors of v. We show that the set M(v) is of fundamental importance in determining the structure of the word v. In the case of a finite word w we consider two parameters that are related to the size of M(w): the first counts the minimal forbidden factors of w and the second gives the length of the longest minimal forbidden factor of w. We derive sharp upper and lower bounds for both parameters. We prove also that the second parameter is related to the minimal period of the word w. We are further interested to the algorithmic point of view. Indeed, we design linear time algorithm for the following two p…

CombinatoricsGeneral Computer ScienceGeneral problemFree monoidFormal languageSturmian wordWord problem (mathematics)AutomorphismTime complexityUpper and lower boundsMathematicsTheoretical Computer ScienceComputer Science(all)Theoretical Computer Science
researchProduct

Extensions of cocycles for hyperfinite actions and applications

1997

Given a countable, hyperfinite, ergodic and measure-preserving equivalence relationR on a standard probability space (X, ℬ, μ) and an elementW of the normalizerN (R) ofR, we investigate the problem of extendingR-cocycles to\(\bar R\), where\(\bar R\) is the relation generated byR andW. As an application, we obtain that for a Bernoulli automorphism the smallest family of natural factors in sense of [6] consists of all factors. Given an automorphism which is embeddable in a measurable flow and a compact, metric group, we show that for a typical cocycle we cannot lift the whole flow to the centralizer of the corresponding group extension.

CombinatoricsGroup extensionGeneral MathematicsErgodic theoryCountable setStandard probability spaceAutomorphismEquivalence (measure theory)Hyperfinite setCentralizer and normalizerMathematicsMonatshefte für Mathematik
researchProduct

Characterization of chain geometries of finite dimension by their automorphism group

1990

A large class of chain geometries of finite dimension is characterized as strong chain spaces possessing a distinguished group of automorphisms fixing two distant points.

CombinatoricsInner automorphismChain (algebraic topology)HolomorphSymmetric groupSO(8)Alternating groupOuter automorphism groupGeometry and TopologyAutomorphismMathematicsGeometriae Dedicata
researchProduct

Divisible Designs Admitting, as an Automorphism Group, an Orthogonal Group or a Unitary Group

2001

We construct some divisible designs starting from a projective space. These divisible designs admit an orthogonal group or a unitary group as an automorphism group.

CombinatoricsInner automorphismProjective unitary groupUnitary groupQuaternion groupOuter automorphism groupAlternating groupGeneral linear groupMathematicsCircle group
researchProduct

Injective Fitting sets in automorphism groups

1993

CombinatoricsInner automorphismQuasisimple groupHolomorphGeneral MathematicsSO(8)Alternating groupOuter automorphism groupAutomorphismDivisible groupMathematicsArchiv der Mathematik
researchProduct

Gaussian Groups and Garside Groups, Two Generalisations of Artin Groups

1999

It is known that a number of algebraic properties of the braid groups extend to arbitrary finite Coxeter-type Artin groups. Here we show how to extend the results to more general groups that we call Garside groups. Define a Gaussian monoid to be a finitely generated cancellative monoid where the expressions of a given element have bounded lengths, and where left and right lowest common multiples exist. A Garside monoid is a Gaussian monoid in which the left and right lowest common multiples satisfy an additional symmetry condition. A Gaussian group is the group of fractions of a Gaussian monoid, and a Garside group is the group of fractions of a Garside monoid. Braid groups and, more genera…

CombinatoricsMonoidMathematics::Group TheoryCoxeter graphGeneral MathematicsArtin L-functionBraid groupArtin groupArtin reciprocity lawWord problem (mathematics)AutomorphismMathematicsProceedings of the London Mathematical Society
researchProduct

Self-normalizing Sylow subgroups

2003

Using the classification of finite simple groups we prove the following statement: Let p > 3 p>3 be a prime, Q Q a group of automorphisms of p p -power order of a finite group G G , and P P a Q Q -invariant Sylow p p -subgroup of G G . If C N G ( P ) / P ( Q ) \mathbf {C}_{\mathbf {N}_G(P)/P}(Q) is trivial, then G G is solvable. An equivalent formulation is that if G G has a self-normalizing Sylow p p -subgroup with p > 3 p >3 a prime, then G G is solvable. We also investigate the possibilities when p = 3 p=3 .

CombinatoricsNormal p-complementFinite groupLocally finite groupApplied MathematicsGeneral MathematicsSylow theoremsClassification of finite simple groupsAutomorphismMathematics
researchProduct

Automorphisms of simplicial complexes and their Stanley-Reisner rings

1997

CombinatoricsSimplicial complexMathematics(all)General MathematicsAutomorphismh-vectorSimplicial homologyMathematicsIndagationes Mathematicae
researchProduct

A series of finite groups and related symmetric designs

2007

For any odd prime power q = pe we study a certain solvable group G of order q2 · ((q-1)/2)2 · 2 and construct from its internal structure a symmetric design D with parameters (2q2+1, q2, (q2-1)/2) on which G acts as an automorphism group. As a consequence we find that the full automorphism group of D contains a subgroup of order |G| · e2.

CombinatoricsSymmetric design; automorphism groupSeries (mathematics)Solvable groupSymmetric groupGeneral MathematicsStructure (category theory)Order (group theory)Alternating groupSymmetric designPrime powerMathematicsGlasnik matematički
researchProduct

On permutations of class sums of alternating groups

1997

We prove a result concerning the class sums of the alternating group An; as a consequence we deduce that if θ is a normalized automorphism of the integral group ring then there exists such that is the identity on , where Sn:is the symmetric group and is the center of

Combinatoricsp-groupAlgebra and Number TheoryInner automorphismSymmetric groupOuter automorphism groupAlternating groupPermutation groupDihedral group of order 6Covering groups of the alternating and symmetric groupsMathematicsCommunications in Algebra
researchProduct