Related papers: The images of multilinear polynomials on strictly …
The purpose of this note is to extend in a simple and unified way the known results on interlacing of zeros of paraorthogonal polynomials on the unit circle. These polynomials can be regarded as the characteristic polynomials of any matrix…
We explicitly describe the Lie algebras $M_L$ of ladder matrices in $M_n$ associate with dominant upper triangular ladders $L$, and completely characterize the derivations of these $M_L$ over a field $F$ with $char(F) \neq 2$. We also…
The notion of the weighted degree of a polynomial is a basic tool in Affine Algebraic Geometry. In this paper, we study the properties of the weighted multidegrees of polynomial automorphisms by a new approach which focuses on stable…
In this paper, we consider higher-order Frobenius-Euler polynomi- als associated with poly-Bernoulli polynomials which are derived from polylogarithmic function. These polynomials are called higher-order Frobenius-Euler and poly-Bernoulli…
In this paper we consider images of (ordinary) noncommutative polynomials on matrix algebras endowed with a graded structure. We give necessary and sufficient conditions to verify that some multilinear polynomial is a central polynomial, or…
Over an arbitrary field, we conduct a comprehensive study of the polynomial identities and codimensions of two- and three-dimensional metabelian non-Lie Leibniz algebras. In addition, we compute the images of multihomogeneous polynomials on…
We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…
We show upper and lower bounds for angles in iterations of trisections of certain triangulations.
The aim of this paper is to show that there exists a deterministic algorithm that can be applied to compute the factors of a polynomial of degree 2, defined over a finite field, given certain conditions.
Let ${\mathcal N}$ be the Lie algebra of all $n\times n$ strictly block upper triangular matrices over a field ${\mathbb F}$ relative to a given partition. In this paper, we give an explicit description of all derivations of ${\mathcal N}$.
A hypergeometric type equation satisfying certain conditions defines either a finite or an infinite system of orthogonal polynomials. We present in a unified and explicit way all these systems of orthogonal polynomials, the associated…
The purpose of this work is to analyse a family of mutually orthogonal polynomials on the unit ball with respect to an inner product which includes an additional term on the sphere. First, we will get connection formulas relating classical…
Matrix-valued polynomials in any finite number of freely noncommuting variables that enjoy certain canonical partial convexity properties are characterized, via an algebraic certificate, in terms of Linear Matrix Inequalities and Bilinear…
We investigate the group gradings on the algebra of upper triangular matrices over an arbitrary field, viewed as a Lie algebra. These results were obtained a few years early by the same authors. We provide streamlined proofs, and present a…
Let $K$ be an algebraically closed field of characteristic $0$ and let $M_n(K)$, $n \ge 3$, be the matrix ring over $K$. We will show that the image of any multilinear polynomial in four variables evaluated on $M_n(K)$ contains all matrices…
This article provides an overview of our joint work on binary polynomial optimization over the past decade. We define the multilinear polytope as the convex hull of the feasible region of a linearized binary polynomial optimization problem.…
In this paper, a new triangular decomposition algorithm is proposed for ordinary differential polynomial systems, which has triple exponential computational complexity. The key idea is to eliminate one algebraic variable from a set of…
We characterize unitary representations of braid groups $B_n$ of degree linear in $n$ and finite images of such representations of degree exponential in $n$.
In the paper we provide some polynomial identities for finite-dimensional algebras. A list of well known single polynomial identities is exposed and the classification of all $2$-dimensional algebras with respect to these identities is…
In~\cite{algorithmic} was given an algorithm that computes arithmetical structures on matrices. We use some of the ideas contained there to get an algorithm that computes arithmetical structures over dominated polynomials. A dominated…