Search results for "combinatoric"

showing 10 items of 1776 documents

On the number of different prime divisors of element orders

2005

We prove that the number of different prime divisors of the order of a finite group is bounded by a polynomial function of the maximum of the number of different prime divisors of the element orders. This improves a result of J. Zhang.

Practical numberFinite groupDivisorMathematics::Number TheoryApplied MathematicsGeneral MathematicsPrime numberDivisor functionPrime (order theory)CombinatoricsMathematics::Algebraic GeometryOrder (group theory)Prime powerMathematicsProceedings of the American Mathematical Society
researchProduct

Recent results on syntactic groups of prefix codes

2012

International audience; We give a simplified presentation of groups in transformation monoids. We use this presentation to describe two recent results on syntactic groups of prefix codes. The first one uses Sturmian words to build finite bifix codes with a given permutation group as syntactic group. The second one describes a class of prefix codes such that all their syntactic groups are cyclic.

Prefix codeDiscrete mathematicsClass (set theory)Group (mathematics)010102 general mathematicsComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)0102 computer and information sciencesPermutation group16. Peace & justice01 natural sciencesTransformation (music)Theoretical Computer SciencePrefixTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESComputational Theory and Mathematics[INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]010201 computation theory & mathematicsDiscrete Mathematics and CombinatoricsGeometry and Topology0101 mathematicsArithmeticComputer Science::Formal Languages and Automata Theory[INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]MathematicsEuropean Journal of Combinatorics
researchProduct

Suffix Automata and Standard Sturmian Words

2007

Blumer et al. showed (cf. [3,2]) that the suffix automaton of a word w must have at least |w|+1 states and at most 2|w|-1 states. In this paper we characterize the language L of all binary words w whose minimal suffix automaton S(w) has exactly |w| + 1 states; they are precisely all prefixes of standard Sturmian words. In particular, we give an explicit construction of suffix automaton of words that are palindromic prefixes of standard words. Moreover, we establish a necessary and sufficient condition on S(w) which ensures that if w ∈ L and a ∈ {0, 1} then wa ∈ L. By using such a condition, we show how to construct the automaton S(wa) from S(w). More generally, we provide a simple construct…

PrefixCombinatoricsSettore INF/01 - InformaticaLevenshtein automatonSimple (abstract algebra)PalindromeSuffix automatonSuffix AutomataArithmeticSuffixWord (group theory)AutomatonMathematics
researchProduct

Some Decision Results on Nonrepetitive Words

1985

The paper addresses some generalizations of the Thue Problem such as: given a word u, does there exist an infinite nonrepetitive overlap free (or square free) word having u as a prefix? A solution to this as well as to related problems is given for the case of overlap free words on a binary alphabet.

PrefixCombinatoricsTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESComputer Science::Discrete MathematicsUnique factorization domainComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Square-free integerComputer Science::Formal Languages and Automata TheoryBinary alphabetWord (computer architecture)Mathematics
researchProduct

$V$-filtrations in positive characteristic and test modules

2013

Let $R$ be a ring essentially of finite type over an $F$-finite field. Given an ideal $\mathfrak{a}$ and a principal Cartier module $M$ we introduce the notion of a $V$-filtration of $M$ along $\mathfrak{a}$. If $M$ is $F$-regular then this coincides with the test module filtration. We also show that the associated graded induces a functor $Gr^{[0,1]}$ from Cartier crystals to Cartier crystals supported on $V(\mathfrak{a})$. This functor commutes with finite pushforwards for principal ideals and with pullbacks along essentially \'etale morphisms. We also derive corresponding transformation rules for test modules generalizing previous results by Schwede and Tucker in the \'etale case (cf. ar…

Primary 13A35 Secondary 14B05General MathematicsType (model theory)Commutative Algebra (math.AC)01 natural sciencesCombinatoricsMathematics - Algebraic GeometryMathematics::Algebraic GeometryMathematics::K-Theory and HomologyMathematics::Category Theory0103 physical sciencesFiltration (mathematics)FOS: MathematicsClosed immersionIdeal (ring theory)0101 mathematicsAlgebraic Geometry (math.AG)MathematicsRing (mathematics)FunctorMathematics::Commutative AlgebraApplied Mathematics010102 general mathematicsMathematics - Commutative AlgebraHypersurface010307 mathematical physicsConstant sheaf
researchProduct

Commensurability in Artin groups of spherical type

2019

Let $A$ and $A'$ be two Artin groups of spherical type, and let $A_1,\dots,A_p$ (resp. $A'_1,\dots,A'_q$) be the irreducible components of $A$ (resp. $A'$). We show that $A$ and $A'$ are commensurable if and only if $p=q$ and, up to permutation of the indices, $A_i$ and $A'_i$ are commensurable for every $i$. We prove that, if two Artin groups of spherical type are commensurable, then they have the same rank. For a fixed $n$, we give a complete classification of the irreducible Artin groups of rank $n$ that are commensurable with the group of type $A_n$. Note that it will remain 6 pairs of groups to compare to get the complete classification of Artin groups of spherical type up to commensur…

Primary 20F36 Secondary 57M07 20B30Group (mathematics)General MathematicsSpherical typeGeometric Topology (math.GT)Group Theory (math.GR)Type (model theory)Rank (differential topology)Commensurability (mathematics)CombinatoricsPermutationMathematics - Geometric TopologyMathematics::Group TheoryFOS: MathematicsMathematics - Group TheoryMathematics
researchProduct

Unirationality of Hurwitz spaces of coverings of degree <= 5

2011

Let $Y$ be a smooth, projective curve of genus $g\geq 1$ over the complex numbers. Let $H^0_{d,A}(Y)$ be the Hurwitz space which parametrizes coverings $p:X \to Y$ of degree $d$, simply branched in $n=2e$ points, with monodromy group equal to $S_d$, and $det(p_{*}O_X/O_Y)$ isomorphic to a fixed line bundle $A^{-1}$ of degree $-e$. We prove that, when $d=3, 4$ or $5$ and $n$ is sufficiently large (precise bounds are given), these Hurwitz spaces are unirational. If in addition $(e,2)=1$ (when $d=3$), $(e,6)=1$ (when $d=4$) and $(e,10)=1$ (when $d=5$), then these Hurwitz spaces are rational.

Projective curveHurwitz spaceDegree (graph theory)Group (mathematics)General MathematicsSpace (mathematics)unirationalitycoveringvector bundles.CombinatoricsMathematics - Algebraic GeometryMonodromyLine bundle14H10 (Primary) 14H30 (Secondary)Genus (mathematics)Settore MAT/03 - GeometriaComplex numberMathematics
researchProduct

Singular quasisymmetric mappings in dimensions two and greater

2018

For all $n \geq 2$, we construct a metric space $(X,d)$ and a quasisymmetric mapping $f\colon [0,1]^n \rightarrow X$ with the property that $f^{-1}$ is not absolutely continuous with respect to the Hausdorff $n$-measure on $X$. That is, there exists a Borel set $E \subset [0,1]^n$ with Lebesgue measure $|E|&gt;0$ such that $f(E)$ has Hausdorff $n$-measure zero. The construction may be carried out so that $X$ has finite Hausdorff $n$-measure and $|E|$ is arbitrarily close to 1, or so that $|E| = 1$. This gives a negative answer to a question of Heinonen and Semmes.

Property (philosophy)General MathematicsExistential quantificationMathematics::General Topology01 natural sciencesfunktioteoriaCombinatoricsMathematics - Metric Geometry0103 physical sciences30L10FOS: MathematicsMathematics::Metric Geometry0101 mathematicsMathematicsLebesgue measuremetric space010102 general mathematicsHausdorff spaceZero (complex analysis)quasiconformal mappingMetric Geometry (math.MG)Absolute continuity16. Peace & justicemetriset avaruudetMetric spaceabsolute continuity010307 mathematical physicsBorel set
researchProduct

On the arithmetically Cohen-Macaulay property for sets of points in multiprojective spaces

2017

We study the arithmetically Cohen-Macaulay (ACM) property for finite sets of points in multiprojective spaces, especially ( P 1 ) n (\mathbb P^1)^n . A combinatorial characterization, the ( ⋆ ) (\star ) -property, is known in P 1 × P 1 \mathbb P^1 \times \mathbb P^1 . We propose a combinatorial property, ( ⋆ s ) (\star _s) with 2 ≤ s ≤ n 2\leq s\leq n , that directly generalizes the ( ⋆ ) (\star ) -property to ( P 1 ) n (\mathbb P^1)^n for larger n n . We show that X X is ACM if and only if it satisfies the ( ⋆ n ) (\star _n) -property. The main tool for several of our results is an extension to the multiprojective setting of certain liaison methods in projective space.

Property (philosophy)General MathematicsStar (game theory)Arithmetically Cohen-Macaulay; Linkage; Points in multiprojective spacescohen- macaulayCharacterization (mathematics)Commutative Algebra (math.AC)01 natural sciencesCombinatoricsMathematics - Algebraic GeometryPoints in multiprojective spaces0103 physical sciencesFOS: MathematicsProjective space0101 mathematicsFinite setAlgebraic Geometry (math.AG)multiprojective spacesMathematicsDiscrete mathematicsMathematics::Commutative AlgebraLinkageArithmetically Cohen-Macaulay Linkage Points in multiprojective spacesApplied Mathematics010102 general mathematicsExtension (predicate logic)Mathematics - Commutative AlgebraArithmetically Cohen-MacaulaypointsSettore MAT/02 - Algebracohen- macaulay multiprojective spaces points010307 mathematical physicsSettore MAT/03 - Geometria
researchProduct

PreGarside monoids and groups, parabolicity, amalgamation, and FC property

2012

We define the notion of preGarside group slightly lightening the definition of Garside group so that all Artin–Tits groups are preGarside groups. This paper intends to give a first basic study on these groups. Firstly, we introduce the notion of parabolic subgroup, we prove that any preGarside group has a (partial) complemented presentation, and we characterize the parabolic subgroups in terms of these presentations. Afterwards we prove that the amalgamated product of two preGarside groups along a common parabolic subgroup is again a preGarside group. This enables us to define the family of preGarside groups of FC type as the smallest family of preGarside groups that contains the Garside g…

Property (philosophy)[ MATH.MATH-GR ] Mathematics [math]/Group Theory [math.GR]Group (mathematics)General Mathematics010102 general mathematics20F36Group Theory (math.GR)Type (model theory)01 natural sciences[MATH.MATH-GR]Mathematics [math]/Group Theory [math.GR]CombinatoricsMathematics::Group TheoryProduct (mathematics)0103 physical sciencesFOS: Mathematics010307 mathematical physicsWord problem (mathematics)0101 mathematicsAlgebraic numberMathematics - Group TheoryMathematics
researchProduct