Related papers: The image of multilinear polynomials evaluated on …

In this paper, we define some new notions of triangular Banach algebras and we investigate the derivations on these algebras.

We find explicitly the multiplicities in the (mixed) trace cocharacter sequence of two $3\times 3$ matrices over a field of characteristic 0 and show that asymptotically they behave as polynomials of seventh degree. As a consequence we…

We use the theory of resultants of polynomials to study the stability of an arbitrary polynomial over a finite field, that is, the property of having all its iterates irreducible. This result partially generalises the quadratic polynomial…

In this article, we give the most genaral form of the quaternions algebra depending on 3-parameters. We define 3-parameter generalized quaternions (3PGQs) and study on various properties and applications. Firstly we present the definiton,…

We construct the quaternion algebra [10] "geometrically" by a three dimensional analogue of the classic two dimensional geometric description of the complex field. The algebraic description of the multiplication operation in three…

Given a combinatorial triangulation of an $n$-gon, we study (a) the space of all possible drawings in the plane such the edges are straight line segments and the boundary has a fixed shape, and (b) the algebraic variety of possibilities for…

We give a survey of the analytic theory of matrix orthogonal polynomials.

We introduce and study the problem of optimizing arbitrary functions over degree sequences of hypergraphs and multihypergraphs. We show that over multihypergraphs the problem can be solved in polynomial time. For hypergraphs, we show that…

We give an easy algorithm which calculates the generating function of the cocharacter sequence of the T-ideal of the polynomial identities of the algebra of upper triangular matrices over a field of characteristic zero. Applying this…

We obtain new upper and lower bounds on the number of unit perimeter triangles spanned by points in the plane. We also establish improved bounds in the special case where the point set is a section of the integer grid.

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.…

We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the…

We study multivariate polynomials over `structured' grids. We begin by proposing an interpretation as to what it means for a finite subset of a field to be structured; we do so by means of a numerical parameter, the nullity. We then extend…

Permutation polynomials over finite fields play important roles in finite fields theory. They also have wide applications in many areas of science and engineering such as coding theory, cryptography, combinatorial design, communication…

This article begins the study of irreducible maps involving finite-dimensional uniserial modules over finite-dimensional associative algebras. We work on the classification of irreducible maps between two uniserials over triangular…

In this note, we initiate a study of the finite-dimensional representation theory of a class of algebras that correspond to noncommutative deformations of compact surfaces of arbitrary genus. Low dimensional representations are investigated…

Let $ F $ be a finite field and consider $ UT_n $ the algebra of $ n\times n $ upper triangular matrices over $ F $. In [1], it was proved that every $ G $-grading is elementary. In [2], the authors classified all nonisomorphic elementary $…

Let $p$ be a multilinear polynomial in several non-commuting variables with coefficients in an arbitrary field $K$. Kaplansky conjectured that for any $n$, the image of $p$ evaluated on the set $M_n(K)$ of $n$ by $n$ matrices is either…

The moduli space of degree $d$ morphisms on $\mathbb{P}^1$ has received much study. McMullen showed that, except for certain families of Latt\`es maps, there is a finite-to-one correspondence (over $\mathbb{C}$) between classes of morphisms…

Let $p$ be a multilinear polynomial in several non-commuting variables with coefficients in an arbitrary field $K$. Kaplansky conjectured that for any $n$, the image of $p$ evaluated on the set $M_n(K)$ of $n$ by $n$ matrices is a vector…