Search results for "Crete"

showing 10 items of 2495 documents

A matrix of combinatorial numbers related to the symmetric groups

1979

For permutation groups G of finite degree we define numbers t"B(G)=|G|^-^[email protected]?"R"@?"[email protected]?"1(1a"1(g))^b^"^i, where B=(b"1,...,b"1) is a tuple of non-negative integers and a"1(g) denotes the number of i cycles in the element g. We show that t"B(G) is the number of orbits of G, acting on a set @D"B(G) of tuples of matrices. In the case G=S"n we get a natural interpretation for combinatorial numbers connected with the Stiring numbers of the second kind.

Discrete mathematicsCombinatoricsMatrix (mathematics)Degree (graph theory)Symmetric groupDiscrete Mathematics and CombinatoricsFunction compositionPermutation groupTupleElement (category theory)Theoretical Computer ScienceInterpretation (model theory)MathematicsDiscrete Mathematics
researchProduct

On lazy representations and Sturmian graphs

2011

In this paper we establish a strong relationship between the set of lazy representations and the set of paths in a Sturmian graph associated with a real number α. We prove that for any non-negative integer i the unique path weighted i in the Sturmian graph associated with α represents the lazy representation of i in the Ostrowski numeration system associated with α. Moreover, we provide several properties of the representations of the natural integers in this numeration system.

Discrete mathematicsCombinatoricsOstrowski numerationIntegernumeration systems Sturmian graphs continued fractionsSettore INF/01 - InformaticaGraphMathematicsReal number
researchProduct

Symmetric identities in graded algebras

1997

Let P k be the symmetric polynomial of degree k i.e., the full linearization of the polynomial x k . Let G be a cancellation semigroup with 1 and R a G-graded ring with finite support of order n. We prove that if R 1 satisfies $ P_k \equiv 0 $ then R satisfies $ P_{kn} \equiv 0 $ .

Discrete mathematicsCombinatoricsPolynomial (hyperelastic model)Cancellative semigroupRing (mathematics)Symmetric polynomialDegree (graph theory)LinearizationGeneral MathematicsOrder (ring theory)Elementary symmetric polynomialMathematicsArchiv der Mathematik
researchProduct

Subvarieties of the Varieties Generated by the SuperalgebraM1, 1(E) orM2(𝒦)

2003

Abstract Let 𝒦 be a field of characteristic zero, and let us consider the matrix algebra M 2(𝒦) endowed with the ℤ2-grading (𝒦e 11 ⊕ 𝒦e 22) ⊕ (𝒦e 12 ⊕ 𝒦e 21). We define two superalgebras, ℛ p and 𝒮 q , where p and q are positive integers. We show that if 𝒰 is a proper subvariety of the variety generated by the superalgebra M 2(𝒦), then the even-proper part of the T 2-ideal of graded polynomial identities of 𝒰 asymptotically coincides with the even-proper part of the graded polynomial identities of the variety generated by the superalgebra ℛ p  ⊕ 𝒮 q . This description also affords an even-asymptotic desc…

Discrete mathematicsCombinatoricsPolynomialAlgebra and Number TheorySubvarietyMatrix algebraZero (complex analysis)Field (mathematics)Variety (universal algebra)SuperalgebraMathematicsCommunications in Algebra
researchProduct

Graphes connexes représentation des entiers et équirépartition

1983

Abstract Let q be an integer ≥2 and Ω a suitable subset of {0,…,q − 1}2; C (q; Ω) denotes the set of natural integers, the pairs of successive q-adic digits of which are in Ω. If P is an irrational polynomial, the sequence (P(n): n ∈ C (q; Ω)) is uniformly distributed modulo one.

Discrete mathematicsCombinatoricsPolynomialSequenceAlgebra and Number TheoryIntegerModuloMathematics::Number TheoryMathematicsJournal of Number Theory
researchProduct

On the Distribution ofB3-Sequences

1996

Abstract An infinite set of natural numbers is called aB3-sequence if all sumsa1+a2+a3withaj∈Aanda1⩽a2⩽a3are distinct. LetA(n) be the number of positive elements ⩽ninA. P. Erdos conjectures that everyB3-sequenceAsatisfies lim infn→∞ A(n) n−1/3=0. In this paper we prove that no sequence satisfyingA(n)∼αn1/3can be aB3-sequence. We also give other necessary conditions for aB3-sequence.

Discrete mathematicsCombinatoricsSequenceInfinite setAlgebra and Number TheoryDistribution (number theory)Natural numberMathematicsJournal of Number Theory
researchProduct

Degree sequences of highly irregular graphs

1997

AbstractWe call a simple graph highly irregular if each of its vertices is adjacent only to vertices with distinct degrees. In this paper we examine the degree sequences of highly irregular graphs. We give necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a highly irregular graph.

Discrete mathematicsCombinatoricsSequenceLoop (graph theory)Simple graphDegree (graph theory)Frequency partition of a graphHighly irregular graphBiregular graphDiscrete Mathematics and CombinatoricsTheoretical Computer ScienceMathematicsMathematicsofComputing_DISCRETEMATHEMATICSDiscrete Mathematics
researchProduct

Codimension growth of two-dimensional non-associative algebras

2007

Let F be a field of characteristic zero and let A be a two-dimensional non-associative algebra over F. We prove that the sequence c n (A), n =1,2,..., of codimensions of A is either bounded by n + 1 or grows exponentially as 2 n . We also construct a family of two-dimensional algebras indexed by rational numbers with distinct T-ideals of polynomial identities and whose codimension sequence is n + 1, n > 2.

Discrete mathematicsCombinatoricsSequencePolynomialRational numberApplied MathematicsGeneral MathematicsBounded functionZero (complex analysis)Field (mathematics)CodimensionIdeal (ring theory)MathematicsProceedings of the American Mathematical Society
researchProduct

Symmetric units and group identities

1998

In this paper we study rings R with an involution whose symmetric units satisfy a group identity. An important example is given by FG, the group algebra of a group G over a field F; in fact FG has a natural involution induced by setting g?g −1 for all group elements g∈G. In case of group algebras if F is infinite, charF≠ 2 and G is a torsion group we give a characterization by proving the following: the symmetric units satisfy a group identity if and only if either the group of units satisfies a group identity (and a characterization is known in this case) or char F=p >0 and 1) FG satisfies a polynomial identity, 2) the p-elements of G form a (normal) subgroup P of G and G/P is a Hamiltonia…

Discrete mathematicsCombinatoricsSubgroupG-moduleMetabelian groupGeneral MathematicsQuaternion groupPerfect groupAlternating groupIdentity componentPermutation groupMathematicsmanuscripta mathematica
researchProduct

Incremental termination proofs and the length of derivations

1991

Incremental termination proofs, a concept similar to termination proofs by quasi-commuting orderings, are investigated. In particular, we show how an incremental termination proof for a term rewriting system T can be used to derive upper bounds on the length of derivations in T. A number of examples show that our results can be applied to yield (sharp) low-degree polynomial complexity bounds.

Discrete mathematicsCombinatoricsTermination proofPolynomial complexityRewriting systemWord problem (mathematics)Mathematical proofComputer Science::DatabasesMathematics
researchProduct