Search results for "Crete"

showing 10 items of 2495 documents

ON THE STAR HEIGHT OF RATIONAL LANGUAGES

1994

Two problems concerning the star height of a rational language are investigated: the star height one problem and the relationships between the unambiguity of an expression and its star height. For this purpose we consider the class of factorial, transitive and rational (FTR) languages. From the algebraic point of view a FTR language is the set of factors of a rational submonoid M. Two subclasses of FTR languages are introduced: renewal languages, corresponding to the case of M finitely generated, and unambiguous renewal languages, corresponding to the case of M finitely generated and free. We prove that a FTR language has star height one if and only if it is renewal. This gives a simple de…

Discrete mathematicsFactorialTransitive relationStar heightGeneral Mathematicsmedia_common.quotation_subjectComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)AmbiguityRegular languageIf and only ifComputer Science::Programming LanguagesEntropy (information theory)Algebraic numberMathematicsmedia_commonInternational Journal of Algebra and Computation
researchProduct

Representation and factorization theorems for almost-Lp-spaces

2019

The first and fourth authors gratefully acknowledge the support of Ministerio de Ciencia, Innovacibn y Universidades (Spain), Agencia Estatal de Investigaciones, and FEDER, under projects MTM2014-53009-P (J.M. Calabuig) and MTM2016-77054-C2-1-P (E.A. Sanchez Perez).

Discrete mathematicsFactorizationGeneral MathematicsBanach lattice010102 general mathematicsRepresentation (systemics)010103 numerical & computational mathematics0101 mathematics01 natural sciencesMathematicsIndagationes Mathematicae
researchProduct

Classical sequences revisited with permutations avoiding dotted pattern

2011

International audience; Inspired by the definition of the barred pattern-avoiding permutation, we introduce the new concept of dotted pattern for permutations. We investigate permutations classes avoiding dotted patterns of length at most 3, possibly along with other classical patterns. We deduce some enumerating results which allow us to exhibit new families of permutations counted by the classical sequences: 2^n, Catalan, Motzkin, Pell, Fibonacci, Fine, Riordan, Padovan, Eulerian.

Discrete mathematicsFibonacci numberMathematics::CombinatoricsApplied Mathematics010102 general mathematicsEulerian path[ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM]0102 computer and information sciences[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM][ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO]01 natural sciencesTheoretical Computer ScienceCombinatorics[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]symbols.namesakePermutation[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]Computational Theory and Mathematics010201 computation theory & mathematics[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]symbolsDiscrete Mathematics and CombinatoricsGeometry and Topology0101 mathematicsMathematics
researchProduct

p-Length andp′-Degree Irreducible Characters Having Values in ℚp

2013

Let G be a p-solvable group of p-length l, where p is any prime. We show that G has at least 2 l irreducible characters of degree coprime to p and having values inside ℚ p . This generalizes a previous result for p = 2 [6] to arbitrary primes. With the same notation, we prove that if p is odd then G has at least 2 l Galois orbits of conjugacy classes of p-elements having values in ℚ p .

Discrete mathematicsFinite groupAlgebra and Number TheoryConjugacy classDegree (graph theory)Coprime integersGroup (mathematics)Mathematics::Number TheoryPrime (order theory)MathematicsCommunications in Algebra
researchProduct

Character sums and double cosets

2008

Abstract If G is a p-solvable finite group, P is a self-normalizing Sylow p-subgroup of G with derived subgroup P ′ , and Ψ is the sum of all the irreducible characters of G of degree not divisible by p, then we prove that the integer Ψ ( P ′ z P ′ ) is divisible by | P | for all z ∈ G . This answers a question of J. Alperin.

Discrete mathematicsFinite groupAlgebra and Number TheoryDegree (graph theory)Character theorySylow theoremsCommutator subgroupFinite groupsCombinatoricsCharacter (mathematics)IntegerDouble cosetsCosetCharacter theoryMcKay conjectureMathematicsJournal of Algebra
researchProduct

McKay natural correspondences on characters

2014

Let [math] be a finite group, let [math] be an odd prime, and let [math] . If [math] , then there is a canonical correspondence between the irreducible complex characters of [math] of degree not divisible by [math] belonging to the principal block of [math] and the linear characters of [math] . As a consequence, we give a characterization of finite groups that possess a self-normalizing Sylow [math] -subgroup or a [math] -decomposable Sylow normalizer.

Discrete mathematicsFinite groupAlgebra and Number TheoryDegree (graph theory)self-normalizing Sylow subgroup20C15Sylow theoremsBlock (permutation group theory)Characterization (mathematics)Centralizer and normalizerPrime (order theory)$p$-decomposable Sylow normalizerCombinatoricsMathematics::Group TheoryMcKay conjecture20C20MathematicsAlgebra & Number Theory
researchProduct

Quadratic rational solvable groups

2012

Abstract A finite group G is quadratic rational if all its irreducible characters are either rational or quadratic. If G is a quadratic rational solvable group, we show that the prime divisors of | G | lie in { 2 , 3 , 5 , 7 , 13 } , and no prime can be removed from this list. More generally, if G is solvable and the field Q ( χ ) generated by the values of χ over Q satisfies | Q ( χ ) : Q | ⩽ k , for all χ ∈ Irr ( G ) , then the set of prime divisors of | G | is bounded in terms of k . Also, we prove that the degree of the field generated by the values of all characters of a semi-rational solvable group (see Chillag and Dolfi, 2010 [1] ) or a quadratic rational solvable group over Q is bou…

Discrete mathematicsFinite groupAlgebra and Number TheoryField (mathematics)Isotropic quadratic formPrime (order theory)CombinatoricsQuadratic equationSolvable groupSolvable groupRational characterBounded functionQuadratic fieldQuadratic fieldMathematicsJournal of Algebra
researchProduct

Finite groups with some C-normal minimal subgroups

2000

Abstract Let G be a finite group. The question of how the properties of its minimal subgroups influence the structure of G is of considerable interest for some scholars. Several authors have investigated this question by using normal or quasinormal conditions. In this paper we use c -normal condition on minimal subgroups to characterize the structure of G through the theory of formations.

Discrete mathematicsFinite groupAlgebra and Number TheoryLocally finite groupStructure (category theory)MathematicsJournal of Pure and Applied Algebra
researchProduct

A reduction theorem for a conjecture on products of two π -decomposable groups

2013

[EN] For a set of primes pi, a group X is said to be pi-decomposable if X = X-pi x X-pi' is the direct product of a pi-subgroup X-pi and a pi'-subgroup X-pi', where pi' is the complementary of pi in the set of all prime numbers. The main result of this paper is a reduction theorem for the following conjecture: "Let pi be a set of odd primes. If the finite group G = AB is a product of two pi-decomposable subgroups A = A(pi) x A(pi') and B = B-pi x B-pi', then A(pi)B(pi) = B(pi)A(pi) and this is a Hall pi-subgroup of G." We establish that a minimal counterexample to this conjecture is an almost simple group. The conjecture is then achieved in a forthcoming paper. (C) 2013 Elsevier Inc. All ri…

Discrete mathematicsFinite groupConjectureAlgebra and Number TheoryGroup (mathematics)Prime numberProducts of subgroupsFinite groupsHall subgroupsCombinatoricsLocally finite groupSimple grouppi-structureMATEMATICA APLICADAMinimal counterexampleDirect productpi-decomposable groupsMathematicsJournal of Algebra
researchProduct

A note on a result of Guo and Isaacs about p-supersolubility of finite groups

2016

In this note, global information about a finite group is obtained by assuming that certain subgroups of some given order are S-semipermutable. Recall that a subgroup H of a finite group G is said to be S-semipermutable if H permutes with all Sylow subgroups of G of order coprime to . We prove that for a fixed prime p, a given Sylow p-subgroup P of a finite group G, and a power d of p dividing such that , if is S-semipermutable in for all normal subgroups H of P with , then either G is p-supersoluble or else . This extends the main result of Guo and Isaacs in (Arch. Math. 105:215-222 2015). We derive some theorems that extend some known results concerning S-semipermutable subgroups.

Discrete mathematicsFinite groupCoprime integersP-supersoluble groupGeneral MathematicsS-semipermutable subgroup010102 general mathematicsSylow theoremsGrups Teoria deOrder (ring theory)01 natural sciencesPrime (order theory)CombinatoricsGlobal informationLocally finite group0103 physical sciences010307 mathematical physicsFinite group0101 mathematicsMATEMATICA APLICADAMatemàticaMathematicsArchiv der Mathematik
researchProduct