Search results for "Polynomial"

showing 10 items of 566 documents

Polynomial growth of the codimensions: a characterization

2009

Let A A be a not necessarily associative algebra over a field of characteristic zero. Here we characterize the T-ideal of identities of A A in case the corresponding sequence of codimensions is polynomially bounded.

Discrete mathematicsPure mathematicsSequencePolynomialApplied MathematicsGeneral MathematicsMathematicsofComputing_GENERALZero (complex analysis)Field (mathematics)Characterization (mathematics)codimensions polynomial identityBounded functionAssociative algebraGeneralLiterature_REFERENCE(e.g.dictionariesencyclopediasglossaries)Mathematics
researchProduct

The maximal coefficient of ternary cyclotomic polynomials with one free prime

2014

A cyclotomic polynomial Φn(x) is said to be ternary if n = pqr, with p, q and r distinct odd primes. Let M(p, q) be the maximum (in absolute value) coefficient appearing in the polynomial family Φpqr(x) with p < q < r, p and q fixed. Here a stronger version of the main conjecture of Gallot, Moree and Wilms regarding M(p, q) is established. Furthermore it is shown that there is an algorithm to compute M(p): = max {M(p, q): q > p}. Our methods are the most geometric used so far in the study of ternary cyclotomic polynomials.

Discrete mathematicsReciprocal polynomialPolynomialAlgebra and Number TheoryAbsolute value (algebra)Ternary operationCyclotomic polynomialPrime (order theory)Mathematics
researchProduct

On a representation theorem for finitely exchangeable random vectors

2016

A random vector $X=(X_1,\ldots,X_n)$ with the $X_i$ taking values in an arbitrary measurable space $(S, \mathscr{S})$ is exchangeable if its law is the same as that of $(X_{\sigma(1)}, \ldots, X_{\sigma(n)})$ for any permutation $\sigma$. We give an alternative and shorter proof of the representation result (Jaynes \cite{Jay86} and Kerns and Sz\'ekely \cite{KS06}) stating that the law of $X$ is a mixture of product probability measures with respect to a signed mixing measure. The result is "finitistic" in nature meaning that it is a matter of linear algebra for finite $S$. The passing from finite $S$ to an arbitrary one may pose some measure-theoretic difficulties which are avoided by our p…

Discrete mathematicsRepresentation theoremMultivariate random variableApplied MathematicsSigned measureProbability (math.PR)010102 general mathematicsSpace (mathematics)01 natural sciencesMeasure (mathematics)60G09 (Primary) 60G55 62E99 (Secondary)010104 statistics & probabilityHomogeneous polynomialFOS: Mathematics0101 mathematicsMathematics - ProbabilityAnalysisMixing (physics)MathematicsProbability measureJournal of Mathematical Analysis and Applications
researchProduct

On almost nilpotent varieties of subexponential growth

2015

Abstract Let N 2 be the variety of left-nilpotent algebras of index two, that is the variety of algebras satisfying the identity x ( y z ) ≡ 0 . We introduce two new varieties, denoted by V sym and V alt , contained in the variety N 2 and we prove that V sym and V alt are the only two varieties almost nilpotent of subexponential growth.

Discrete mathematicsSecondaryAlgebra and Number TheoryCodimensionPolynomial identityCombinatoricsSettore MAT/02 - AlgebraMathematics::Group TheoryIdentity (mathematics)NilpotentCodimensionVarietyVariety (universal algebra)Nilpotent groupAlmost nilpotentPrimaryPolinomial identities. Variety Codimensions Growth.MathematicsJournal of Algebra
researchProduct

Characterizing varieties of colength ≤4

2009

Let A be an associative algebra over a field F of characteristic zero, and let χ n (A), n = 1,2,…, be the sequence of cocharacters of A. For every n ≥ 1, let l n (A) denote the nth colength of A, counting the number of S n -irreducibles appearing in χ n (A). In this article, we classify the algebras A such that the sequence of colengths l n (A), n = 1,2,…, is bounded by four. Moreover we construct a finite number of algebras A 1,…, A d , such that l n (A) ≤ 4 if and only if A 1,…, A d  ∉ var(A).

Discrete mathematicsSequenceAlgebra and Number TheoryZero (complex analysis)Field (mathematics)Codimensions; Colengths; Polynomial identity; VarietyPolynomial identitySettore MAT/02 - AlgebraBounded functionCodimensionAssociative algebraVarietyColengthVariety (universal algebra)Finite setMathematics
researchProduct

Varieties of superalgebras of almost polynomial growth

2011

Abstract Let V gr be a variety of superalgebras and let c n gr ( V gr ) , n = 1 , 2 , …  , be its sequence of graded codimensions. Such a sequence is polynomially bounded if and only if V gr does not contain a list of five superalgebras consisting of a commutative superalgebra, the infinite dimensional Grassmann algebra and the algebra of 2 × 2 upper triangular matrices with trivial and natural Z 2 -gradings. In this paper we completely classify all subvarieties of the varieties generated by these five superalgebras, by giving a complete list of finite dimensional generating superalgebras.

Discrete mathematicsSequencePolynomialPure mathematicsAlgebra and Number TheoryMathematics::Rings and AlgebrasTriangular matrixGrowthPolynomial identitySuperalgebrasuperalgebra growthBounded functionMathematics::Quantum AlgebraVarietyVariety (universal algebra)Mathematics::Representation TheoryExterior algebraCommutative propertyMathematicsJournal of Algebra
researchProduct

Polynomial identities on superalgebras and exponential growth

2003

Abstract Let A be a finitely generated superalgebra over a field F of characteristic 0. To the graded polynomial identities of A one associates a numerical sequence {cnsup(A)}n⩾1 called the sequence of graded codimensions of A. In case A satisfies an ordinary polynomial identity, such sequence is exponentially bounded and we capture its exponential growth by proving that for any such algebra lim n→∞ c n sup (A) n exists and is a non-negative integer; we denote such integer by supexp(A) and we give an effective way for computing it. As an application, we construct eight superalgebras Ai, i=1,…,8, characterizing the identities of any finitely generated superalgebra A with supexp(A)>2 in the f…

Discrete mathematicsSequencePolynomialSuperalgebrasAlgebra and Number TheoryMathematics::Rings and AlgebrasField (mathematics)GrowthSuperalgebraCodimensionsPolynomial identitiesIdentity (mathematics)IntegerBounded functionIdeal (ring theory)MathematicsJournal of Algebra
researchProduct

Proper identities, Lie identities and exponential codimension growth

2008

Abstract The exponent exp ( A ) of a PI-algebra A in characteristic zero is an integer and measures the exponential rate of growth of the sequence of codimensions of A [A. Giambruno, M. Zaicev, On codimension growth of finitely generated associative algebras, Adv. Math. 140 (1998) 145–155; A. Giambruno, M. Zaicev, Exponential codimension growth of P.I. algebras: An exact estimate, Adv. Math. 142 (1999) 221–243]. In this paper we study the exponential rate of growth of the sequences of proper codimensions and Lie codimensions of an associative PI-algebra. We prove that the corresponding proper exponent exists for all PI-algebras, except for some algebras of exponent two strictly related to t…

Discrete mathematicsSequencePure mathematicsAlgebra and Number TheoryZero (complex analysis)CodimensionExponential functionPolynomial identitiesIntegerpolynomial identity codimensionsExponentCodimension growthExterior algebraAssociative propertyMathematics
researchProduct

Polynomial Smoothing Splines

2014

Interpolating splines is a perfect tool for approximation of a continuous-time signal \(f(t)\) in the case when samples \(x[k]=f(k),\;k\in \mathbb {Z}\) are available. However, frequently, the samples are corrupted by random noise. In such case, the so-called smoothing splines provide better approximation. In this chapter we describe periodic smoothing splines in one and two dimensions. The SHA technique provides explicit expression of such splines and enables us to derive optimal values of the regularization parameters.

Discrete mathematicsSmoothing splinePolynomial smoothingSubdivision methodBox splineRandom noiseExpression (computer science)Regularization (mathematics)Sampling gridMathematics
researchProduct

QUANTITATIVE CONVERGENCE RATES FOR SUBGEOMETRIC MARKOV CHAINS

2015

We provide explicit expressions for the constants involved in the characterisation of ergodicity of subgeometric Markov chains. The constants are determined in terms of those appearing in the assumed drift and one-step minorisation conditions. The results are fundamental for the study of some algorithms where uniform bounds for these constants are needed for a family of Markov kernels. Our results accommodate also some classes of inhomogeneous chains.

Discrete mathematicsStatistics and ProbabilityMarkov chain mixing timeMarkov chainVariable-order Markov modelGeneral Mathematicsta111Markov chain010102 general mathematicsErgodicity01 natural sciencesInhomogeneous010104 statistics & probability60J05Polynomial ergodicitySubgeometric ergodicityConvergence (routing)60J22Examples of Markov chainsStatistical physics0101 mathematicsStatistics Probability and UncertaintyMathematics
researchProduct