Related papers: The image of multilinear polynomials evaluated on …
We consider the multiplier ideals of the ideal of a reduced union of lines through the origin in C^3. For general arrangements of lines, we calculate the multiplier ideals.
The extremal values of multivariate trigonometric polynomials are of interest in fields ranging from control theory to filter design, but finding the extremal values of such a polynomial is generally NP-Hard. In this paper, we develop…
The image of a polynomial map is a constructible set. While computing its closure is standard in computer algebra systems, a procedure for computing the constructible set itself is not. We provide a new algorithm, based on algebro-geometric…
Several notions of multiplicativity are introduced for forms of degree $d\geq 3$ over a field of characteristic 0 or greater than d. Examples of multiplicative and strongly multiplicative forms of higher degree are given. Conditions…
An efficient evaluation method is described for polynomials in finite fields. Its complexity is shown to be lower than that of standard techniques when the degree of the polynomial is large enough. Applications to the syndrome computation…
A triangular form is defined to be an integer-valued quadratic polynomial of the form $a_1P_3(x_1)+a_2P_3(x_2)+\cdots+a_kP_3(x_k)$ where $a_i's$ are positive integers and $P_3(x)=x(x+1)/2$. A triangular form is called regular if it…
In this paper we study sequences of vector orthogonal polynomials. The vector orthogonality presented here provides a reinterpretation of what is known in the literature as matrix orthogonality. These systems of orthogonal polynomials…
In this paper, we study metric completions of triangulated categories in a representation-theoretic context. We provide a concrete description of completions of bounded derived categories of hereditary finite dimensional algebras of finite…
In our previous paper, Real Polynomials with a Complex Twist [see http://archives.math.utk.edu/ICTCM/VOL28/A040/paper.pdf], we used advancements in computer graphics that allow us to easily illustrate more complete graphs of polynomial…
A hyperoval in the projective plane $\mathbb{P}^2(\mathbb{F}_q)$ is a set of $q+2$ points no three of which are collinear. Hyperovals have been studied extensively since the 1950s with the ultimate goal of establishing a complete…
A polynomial triangle is an array whose inputs are the coefficients in integral powers of a polynomial. Although polynomial coefficients have appeared in several works, there is no systematic treatise on this topic. In this paper we plan to…
We classify singularities at infinity of polynomials of degree 3 in 3 variables, $ f (x_0, x_1, x_2) = f_1 (x_0, x_1, x_2) + f_2 (x_0, x_1, x_2) + f_3 (x_0, x_1, x_2) $, $ f_i $ homogeneous polynomial of degree $ i $, $ i = 1,2,3 $. Based…
The L'vov-Kaplansky conjecture states that the image of a multilinear noncommutative polynomial $f$ in the matrix algebra $M_n(K)$ is a vector space for every $n \in {\mathbb N}$. We prove this conjecture for the case where $f$ has degree…
Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we develop general theorems on permutation polynomials over finite fields. As a…
We present here algorithms for efficient computation of linear algebra problems over finite fields.
For each 3-dimensional non-Lie Leibniz algebra over the complex numbers, we describe the algebra of polynomial invariants and determine its group of automorphisms. As a consequence, we establish that any two non-nilpotent 3-dimensional…
Motivated by investigations of the tridiagonal pairs of linear transformations, we introduce the augmented tridiagonal algebra ${\mathcal T}_q$. This is an infinite-dimensional associative ${\mathbb C}$-algebra with 1. We classify the…
Binet formulae for three versions of third-order Pell polynomials are derived.
Counting Euclidean triangulations with vertices in a finite set $\C$ of the convex hull $\conv(\C)$ of $\C$ is difficult in general, both algorithmically and theoretically. The aim of this paper is to describe nearly convex polygons, a…
A graded-division algebra is an algebra graded by a group such that all nonzero homogeneous elements are invertible. This includes division algebras equipped with an arbitrary group grading (including the trivial grading). We show that a…