Related papers: A characterization of the algebraic degree in semi…

Given a univariate polynomial, its abscissa is the maximum real part of its roots. The abscissa arises naturally when controlling linear differential equations. As a function of the polynomial coefficients, the abscissa is H{\"o}lder…

Let A be a finite dimensional algebra over a field of characteristic zero graded by a finite abelian group G. Here we study a growth function related to the graded polynomial identities satisfied by A by computing the exponential rate of…

In this note we prove that any affine algebraic monoid can be obtained as the endomorphisms' monoid of a finite-dimensional (nonassociative) algebra.

The aim of this paper is to continue the study of asymptotic expansions and summability in a monomial in any number of variables. In particular we characterize these expansions in terms of bounded derivatives and we develop tauberian…

In this note we aim to give a new, elementary proof of a statement that was first proved by Timofte. It says that a symmetric real polynomial $F$ of degree $d$ in $n$ variables is positive on $\R^n$ (on $\R^{n}_{\geq 0}$) if and only if it…

We consider a generalization of polynomial programs: algebraic programs, which are optimization or feasibility problems with algebraic objectives or constraints. Algebraic functions are defined as zeros of multivariate polynomials. They are…

The paper is devoted to classification problem of finite dimensional complex none Lie filiform Leibniz algebras. The motivation to write this paper is an unpublished yet result of J.R.Gomez, B.A.Omirov on necessary and sufficient conditions…

The parametric degree of a rational surface is the degree of the polynomials in the smallest possible proper parametrization. An example shows that the parametric degree is not a geometric but an arithmetic concept, in the sense that it…

Given a finite connected bipartite graph, finite-dimensional indecomposable semisimple Leibniz algebras are constructed. Furthermore, any finite-dimensional indecomposable semisimple Leibniz algebra admits a similar construction.

We study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of first-order functional programs. We explain their semantics and prove that they form a…

Symmetry plays a central role in accelerating symbolic computation involving polynomials. This chapter surveys recent developments and foundational methods that leverage the inherent symmetries of polynomial systems to reduce complexity,…

We provide $\mathbb{N}$-filtrations on the negative part $U_q(\mathfrak{n}^-)$ of the quantum group associated to a finite-dimensional simple Lie algebra $\mathfrak{g}$, such that the associated graded algebra is a skew-polynomial algebra…

This paper concerns the notion of a symmetric algebra and its generalization to a quasi-symmetric algebra. We study the structure of these algebras in respect to their hull-kernel regularity and existence of some ideals, especially the…

We produce algorithms to detect whether a complex affine variety computed and presented numerically by the machinery of numerical algebraic geometry corresponds to an associated component of a polynomial ideal.

In this paper we present several formulae for computing the partial degrees of the defining polynomial of the offset curve to an irreducible affine plane curve given implicitly, and we see how these formulae particularize to the case of…

All finite-dimensional Leibniz algebra bimodules of a Lie algebra $\mathfrak{sl}_2$ over a field of characteristic zero are described.

Let G be a finite group and A a finite dimensional G-graded algebra over a field of characteristic zero. When A is simple as a G-graded algebra, by mean of Regev central polynomials we construct multialternating graded polynomials of…

We study some elementary properties of the quantum enveloping algebra associated to a parabolic subalgebra $\mathfrak{p}$ of a semisimple Lie algebra $\mathfrak{g}$. In particular we prove an explicit formula for the degree of this algebra,…

We establish a criterion for a complex number to be algebraic over Q of degree at most two. It requires that, for any sufficiently large real number X, there exists a non-zero polynomial with integral coefficients, of degree at most two and…

For any finitely generated abelian group $Q$, we reduce the problem of classification of $Q$-graded simple Lie algebras over an algebraically closed field of "good" characteristic to the problem of classification of gradings on simple Lie…