Related papers: Integer powers of certain complex tridiagonal matr…
We consider real non-symmetric matrices and their factorisation as a product of real symmetric matrices. The number of complex eigenvalues of the original matrix reveals restrictions on such factorisations as we shall prove.
We show that the effective factorization of Ore polynomials over $\mathbb{F}_q(t)$ is still an open problem. This is so because the known algorithm in [1] presents two gaps, and therefore it does not cover all the examples. We amend one of…
In this paper, we exploit the r-Stirling numbers of both kinds in order to give explicit formulae for the values of the high order Bernoulli numbers and polynomials of both kinds at integers. We give also some identities linked the…
An integral polytope is a polytope whose vertices have integer coordinates. A unimodular triangulation of an integral polytope in $\mathbb{R}^d$ is a triangulation in which all simplices are integral with volume $1/d!$. A classic result of…
We consider $m$-th order linear recurrences that can be thought of as generalizations of the Lucas sequence. We exploit some interplay with matrices that again can be considered generalizations of the Fibonacci matrix. We introduce the…
We introduce a variation of the Ziv-Lempel and Crochemore factorizations of words by requiring each factor to be a palindrome. We compute these factorizations for the Fibonacci word, and more generally, for all $m$-bonacci words.
We define tensors, corresponding to cubic polynomials, which have the same exponent $\omega$ as the matrix multiplication tensor. In particular, we study the symmetrized matrix multiplication tensor $sM_n$ defined on an $n\times n$ matrix…
We present an integral formula for the universal R-matrix of quantum affine algebra with 'Drinfeld comultiplication'. We show that the properties of the universal R-matrix follow from the factorization properties of the cycles in proper…
We establish necessary and sufficient conditions for a quadratic polynomial to be irreducible in the ring $Z[[x]]$ of formal power series with integer coefficients. For $n,m\ge 1$ and $p$ prime, we show that $p^n+p^m\beta x+\alpha x^2$ is…
Let $A$ be a subset of $\mathbb{Z} / N\mathbb{Z}$ and let $\mathcal{R}$ be the set of large Fourier coefficients of $A$. Properties of $\mathcal{R}$ have been studied in works of M.-- C. Chang, B. Green and the author. In the paper we…
Using appropriate power series evaluations, we determine all moments of arbitrary positive powers of the arcsine. As consequences we evaluate several doubly infinite classes of power series involving central binomial coefficients and…
The wonderful formulas by I.Dumitriu and A.Edelman rewrite $\beta$-ensemble, with eigenvalue integrals containing Vandermonde factors in the power $2\beta$, through integrals over tridiagonal matrices, where $\beta$-dependent are the powers…
We consider the Tutte polynomial of three classes of greedoids: those arising from rooted graphs, rooted digraphs and binary matrices. We establish the computational complexity of evaluating each of these polynomials at each fixed rational…
In this paper we classify all monic, quartic, polynomials $d(x)\in\mathbb{Z}[x]$ for which the Pell equation $$f(x)^2-d(x)g(x)^2=1$$ has a non-trivial solution with $f(x),g(x)\in\mathbb{Z}[x]$.
We study the number of factorizations of a positive integer, where the parts of the factorization are of l different colors (or kinds). Recursive or explicit formulas are derived for the case of unordered and ordered, distinct and…
In this paper, we obtain some factorization results on formal power series over principle ideal domains with sharp bounds on number of irreducible factors. These factorization results correspondingly lead to irreducibility criteria for…
Polar commutative n-complex numbers of the form u=x_0+h_1x_1+h_2x_2+...+h_{n-1}x_{n-1} are introduced in n dimensions, the variables x_0,...,x_{n-1} being real numbers. The polar n-complex number can be represented, in an even number of…
The aim of this paper is the introduction of a new method for the numerical computation of the rank of a three-way array. We show that the rank of a three-way array over R is intimately related to the real solution set of a system of…
We give an efficient algorithm to enumerate all sets of $r\ge 1$ quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.
We bound the tensor ranks of elementary symmetric polynomials, and we give explicit decompositions into powers of linear forms. The bound is attained when the degree is odd.