Search results for "LYN"

showing 10 items of 910 documents

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

The cup product of Hilbert schemes for K3 surfaces

2003

To any graded Frobenius algebra A we associate a sequence of graded Frobenius algebras A [n] so that there is canonical isomorphism of rings (H *(X;ℚ)[2]) [n] ≅H *(X [n] ;ℚ)[2n] for the Hilbert scheme X [n] of generalised n-tuples of any smooth projective surface X with numerically trivial canonical bundle.

Discrete mathematicsSurface (mathematics)Hilbert series and Hilbert polynomialSequencePure mathematicsMathematics::Commutative AlgebraGeneral Mathematics010102 general mathematics01 natural sciencesCanonical bundlesymbols.namesakeHilbert schemeCup product0103 physical sciencesFrobenius algebrasymbols[MATH.MATH-AG]Mathematics [math]/Algebraic Geometry [math.AG]010307 mathematical physicsIsomorphism0101 mathematicsComputingMilieux_MISCELLANEOUSMathematicsInventiones Mathematicae
researchProduct

Polynomial identities for the Jordan algebra of a degenerate symmetric bilinear form

2013

Let J(n) be the Jordan algebra of a degenerate symmetric bilinear form. In the first section we classify all possible G-gradings on J(n) where G is any group, while in the second part we restrict our attention to a degenerate symmetric bilinear form of rank n - 1, where n is the dimension of the vector space V defining J(n). We prove that in this case the algebra J(n) is PI-equivalent to the Jordan algebra of a nondegenerate bilinear form.

Discrete mathematicsSymmetric algebraNumerical AnalysisPure mathematicsAlgebra and Number TheoryJordan algebraRank (linear algebra)Symmetric bilinear formPolynomial identities gradings Jordan algebraOrthogonal complementBilinear formSettore MAT/02 - AlgebraDiscrete Mathematics and CombinatoricsGeometry and TopologyAlgebra over a fieldMathematicsVector spaceLinear Algebra and its Applications
researchProduct

New Encodings of Pseudo-Boolean Constraints into CNF

2009

International audience; This paper answers affirmatively the open question of the existence of a polynomial size CNF encoding of pseudo-Boolean (PB) constraints such that generalized arc consistency (GAC) is maintained through unit propagation (UP). All previous encodings of PB constraints either did not allow UP to maintain GAC, or were of exponential size in the worst case. This paper presents an encoding that realizes both of the desired properties. From a theoretical point of view, this narrows the gap between the expressive power of clauses and the one of pseudo-Boolean constraints.

Discrete mathematics[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]Polynomial021103 operations researchUnit propagation[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]0211 other engineering and technologies[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS]02 engineering and technologyComputer Science::Computational ComplexityExpressive powerExponential functionCombinatorics[ INFO.INFO-CC ] Computer Science [cs]/Computational Complexity [cs.CC]Encoding (memory)0202 electrical engineering electronic engineering information engineeringLocal consistency020201 artificial intelligence & image processingPoint (geometry)[INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC][ INFO.INFO-DS ] Computer Science [cs]/Data Structures and Algorithms [cs.DS]Mathematics
researchProduct

Biorthogonal Wavelet Transforms

2015

Wavelets in the polynomial and discrete spline spaces were introduced in Chaps. 8 and 10, respectively. In both cases, the wavelets’ design and implementation of the transforms were associated with perfect reconstruction (PR) filter banks. In this chapter, those associations are discussed in more detail. Biorthogonal wavelet bases generated by PR filter banks are investigated and a few examples of compactly supported biorthogonal wavelets are presented. Conditions for filters to restore and annihilate sampled polynomials are established (discrete vanishing moment property). In a sense, the material of this chapter is introductory to Chap. 12, where splines are used as a source for (non-spli…

Discrete wavelet transformPolynomialSpline (mathematics)Pure mathematicsWaveletBiorthogonal systemFilter bankBiorthogonal waveletMathematicsWavelet packet decomposition
researchProduct