Search results for "polynomial"

showing 10 items of 566 documents

Determinantal sets, singularities and application to optimal control in medical imagery

2016

International audience; Control theory has recently been involved in the field of nuclear magnetic resonance imagery. The goal is to control the magnetic field optimally in order to improve the contrast between two biological matters on the pictures. Geometric optimal control leads us here to analyze mero-morphic vector fields depending upon physical parameters , and having their singularities defined by a deter-minantal variety. The involved matrix has polynomial entries with respect to both the state variables and the parameters. Taking into account the physical constraints of the problem, one needs to classify, with respect to the parameters, the number of real singularities lying in som…

FOS: Computer and information sciences[INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC]Computer Science - Symbolic Computation0209 industrial biotechnologyPolynomialRank (linear algebra)010102 general mathematicsBoundary (topology)Field (mathematics)02 engineering and technologySymbolic Computation (cs.SC)Optimal control01 natural sciencesPolynomial system solvingReal geometryPolynomial matrix[ INFO.INFO-SC ] Computer Science [cs]/Symbolic Computation [cs.SC]Set (abstract data type)Matrix (mathematics)020901 industrial engineering & automationApplications0101 mathematicsAlgorithmMathematics
researchProduct

The graded identities of upper triangular matrices of size two

2002

AbstractLet UT2 be the algebra of 2×2 upper triangular matrices over a field F. We first classify all possible gradings on UT2 by a group G. It turns out that, up to isomorphism, there is only one non-trivial grading and we study all the graded polynomial identities for such algebra. In case F is of characteristic zero we give a complete description of the space of multilinear graded identities in the language of Young diagrams through the representation theory of the hyperoctahedral group. We finally establish a result concerning the rate of growth of the identities for such algebra by proving that its sequence of graded codimensions has almost polynomial growth.

Filtered algebraCombinatoricsPolynomialAlgebra and Number TheoryMathematics::Commutative AlgebraDifferential graded algebraGraded ringTriangular matrixHyperoctahedral groupRepresentation theoryMathematicsGraded Lie algebraJournal of Pure and Applied Algebra
researchProduct

POLYNOMIAL IDENTITIES ON SUPERALGEBRAS AND ALMOST POLYNOMIAL GROWTH

2001

Let A be a superalgebra over a field of characteristic zero. In this paper we investigate the graded polynomial identities of A through the asymptotic behavior of a numerical sequence called the sequence of graded codimensions of A. Our main result says that such sequence is polynomially bounded if and only if the variety of superalgebras generated by A does not contain a list of five superalgebras consisting of a 2-dimensional algebra, the infinite dimensional Grassmann algebra and the algebra of 2 × 2 upper triangular matrices with trivial and nontrivial gradings. Our main tool is the representation theory of the symmetric group.

Filtered algebraDiscrete mathematicsPolynomialPure mathematicsAlgebra and Number TheoryAlternating polynomialDifferential graded algebraMathematics::Rings and AlgebrasTriangular matrixLie superalgebraSuperalgebraSuper-Poincaré algebraMathematicsCommunications in Algebra
researchProduct

Almost polynomial growth: Classifying varieties of graded algebras

2015

Let G be a finite group, V a variety of associative G-graded algebras and c (V), n = 1, 2, …, its sequence of graded codimensions. It was recently shown by Valenti that such a sequence is polynomially bounded if and only if V does not contain a finite list of G-graded algebras. The list consists of group algebras of groups of order a prime number, the infinite-dimensional Grassmann algebra and the algebra of 2 × 2 upper triangular matrices with suitable gradings. Such algebras generate the only varieties of G-graded algebras of almost polynomial growth, i.e., varieties of exponential growth such that any proper subvariety is polynomially bounded. In this paper we completely classify all sub…

Finite groupJordan algebraMathematics::Commutative AlgebraGeneral MathematicsNon-associative algebrapolynomial identity growth varietyQuadratic algebraCombinatoricsSettore MAT/02 - AlgebraInterior algebraAlgebra representationNest algebraVariety (universal algebra)Mathematics
researchProduct

Gradings on the algebra of upper triangular matrices and their graded identities

2004

Abstract Let K be an infinite field and let UT n ( K ) denote the algebra of n × n upper triangular matrices over  K . We describe all elementary gradings on this algebra. Further we describe the generators of the ideals of graded polynomial identities of UT n ( K ) and we produce linear bases of the corresponding relatively free graded algebras. We prove that one can distinguish the elementary gradings by their graded identities. We describe bases of the graded polynomial identities in several “typical” cases. Although in these cases we consider elementary gradings by cyclic groups, the same methods serve for elementary gradings by any finite group.

Finite groupPolynomialPure mathematicsAlgebra and Number TheoryMathematics::Commutative AlgebraGraded identitiesMathematics::Rings and AlgebrasTriangular matrixGraded ringCyclic groupElementary gradingGraded Lie algebraUpper triangular matricesAlgebraDifferential graded algebraAlgebra over a fieldMathematics
researchProduct

Using the Hermite Regression Formula to Design a Neural Architecture with Automatic Learning of the “Hidden” Activation Functions

2000

The value of the output function gradient of a neural network, calculated in the training points, plays an essential role for its generalization capability. In this paper a feed forward neural architecture (αNet) that can learn the activation function of its hidden units during the training phase is presented. The automatic learning is obtained through the joint use of the Hermite regression formula and the CGD optimization algorithm with the Powell restart conditions. This technique leads to a smooth output function of αNet in the nearby of the training points, achieving an improvement of the generalization capability and the flexibility of the neural architecture. Experimental results, ob…

Flexibility (engineering)Hermite polynomialsArtificial neural networkComputer scienceGeneralizationbusiness.industryActivation functionFunction (mathematics)Sigmoid functionArtificial intelligencebusinessAlgorithmRegression
researchProduct

New Flexible Probability Distributions for Ranking Data

2015

Recently, several models have been proposed in literature for analyzing ranks assigned by people to some object. These models summarize the liking feeling for this object, possibly also with respect to a set of explanatory variables. Some recent works have suggested the use of the Shifted Binomial and of the Inverse Hypergeometric distribution for modelling the approval rate, while mixture models have been developed for taking into account the uncertainty of the ranking process. We propose two new probabilistic models, based on the Discrete Beta and the Shifted-Beta Binomial distributions, that ensure much flexibility and allow the joint modelling of the scale (approval rate) and the shape …

Flexibility (engineering)RankingBinomial (polynomial)Computer scienceRank (computer programming)EconometricsProbability distributionScale (descriptive set theory)Discrete Beta Ranking data Shifted-Beta BinomialRanking data Discrete Beta Shifted-Beta BinomialMixture modelSettore SECS-S/01 - StatisticaHypergeometric distribution
researchProduct

Classifying G-graded algebras of exponent two

2019

Let F be a field of characteristic zero and let $$\mathcal{V}$$ be a variety of associative F-algebras graded by a finite abelian group G. If $$\mathcal{V}$$ satisfies an ordinary non-trivial identity, then the sequence $$c_n^G(\mathcal{V})$$ of G-codimensions is exponentially bounded. In [2, 3, 8], the authors captured such exponential growth by proving that the limit $$^G(\mathcal{V}) = {\rm{lim}}_{n \to \infty} \sqrt[n]{{c_n^G(\mathcal{V})}}$$ exists and it is an integer, called the G-exponent of $$\mathcal{V}$$ . The purpose of this paper is to characterize the varieties of G-graded algebras of exponent greater than 2. As a consequence, we find a characterization for the varieties with …

General Mathematics010102 general mathematicsZero (complex analysis)Field (mathematics)0102 computer and information sciencesGraded algebras Exponent GrowthCharacterization (mathematics)01 natural sciencesCombinatoricsSettore MAT/02 - AlgebraInteger010201 computation theory & mathematicsBounded functionExponentPolynomial identity exponent codimension graded algebra0101 mathematicsVariety (universal algebra)Abelian groupMathematics
researchProduct

Anomalies on codimension growth of algebras

2015

Abstract This paper deals with the asymptotic behavior of the sequence of codimensions c n ⁢ ( A ) ${c_{n}(A)}$ , n = 1 , 2 , … , ${n=1,2,\ldots,}$ of an algebra A over a field of characteristic zero. It is shown that when such sequence is polynomially bounded, then lim sup n → ∞ ⁡ log n ⁡ c n ⁢ ( A ) ${\limsup_{n\to\infty}\log_{n}c_{n}(A)}$ and lim inf n → ∞ ⁡ log n ⁡ c n ⁢ ( A ) ${\liminf_{n\to\infty}\log_{n}c_{n}(A)}$ can be arbitrarily distant. Also, in case the codimensions are exponentially bounded, we can construct an algebra A such that exp ⁡ ( A ) = 2 ${\exp(A)=2}$ and, for any q ≥ 1 ${q\geq 1}$ , there are infinitely many integers n such that c n ⁢ ( A ) > n q ⁢ 2 n ${c_{n}(A)&…

General MathematicsApplied Mathematics010102 general mathematicsCodimensionPolynomial identity01 natural sciencesExponential growth010101 applied mathematicsAlgebraExponential growthCodimensionMathematics (all)0101 mathematicsMathematics
researchProduct

Differential Identities and Varieties of Almost Polynomial Growth

2022

Let V be an L-variety of associative L-algebras, i.e., algebras where a Lie algebra L acts on them by derivations, and let c(n)(L) (V), n >= 1, be its Lcodimension sequence. If V is generated by a finite-dimensional L-algebra, then such a sequence is polynomially bounded only if V does not contain UT2, the 2 x 2 upper triangular matrix algebra with trivial L-action, and UT2 epsilon where L acts on UT2 as the 1-dimensional Lie algebra spanned by the inner derivation epsilon induced by e11. In this paper we completely classify all the L-subvarieties of var(L)(UT2) and var(L)(UT2 epsilon) by giving a complete list of finite-dimensional L-algebras generating them.

General Mathematicspolynomial identity differential identity variety of algebras codimension growth
researchProduct