Related papers: A magic determinant formula for symmetric polynomi…
We establish a new class of examples of the multivariate Bateman-Horn conjecture by using tools from dynamics. These cases include the determinant polynomial on the space of $n\times n$ matrices, the Pfaffian on the space of skew-symmetric…
This paper defines and investigates nonsymmetric Macdonald polynomials with values in an irreducible module of the Hecke algebra of type $A_{N-1}$. These polynomials appear as simultaneous eigenfunctions of Cherednik operators. Several…
The derivation of zonal polynomials involves evaluating the integral \[ \exp\left( - \frac{1}{2} \operatorname{tr} D_{\beta} Q D_{l} Q \right) \] with respect to orthogonal matrices \(Q\), where \(D_{\beta}\) and \(D_{l}\) are diagonal…
The Ap\'ery polynomials are given by $$A_n(x)=\sum_{k=0}^n\binom nk^2\binom{n+k}k^2x^k\ \ (n=0,1,2,\ldots).$$ (Those $A_n=A_n(1)$ are Ap\'ery numbers.) Let $p$ be an odd prime. We show that…
Permutation matrices play an important role in understand the structure of magic squares. In this work, we use a class of symmetric permutation matrices than can be used to categorize magic squares. Many magic squares with a high degree of…
We describe an algorithm to compute the extremal eigenvalues and corresponding eigenvectors of a symmetric matrix by solving a sequence of Quadratic Binary Optimization problems. This algorithm is robust across many different classes of…
In this paper some algorithms will be presented which can be used for the calculation of zeros of polynomials and eigenvalues of polynomial matrices with a multiplicity larger than one. The numerical values calculated with MATLAB are used…
We compute two parametric determinants in which rows and columns are indexed by compositions, where in one determinant the entries are products of binomial coefficients, while in the other the entries are products of powers. These results…
An explicit formula for the $A$-polynomial of the knot having Conway's notation $C(2n,4)$ is computed up to repeated factors. Our polynomial contains exactly the same irreducible factors as the $A$-polynomial defined in~\cite{CCGLS1}.
We present an algorithm for computing a Smith form with multipliers of a regular matrix polynomial over a field. This algorithm differs from previous ones in that it computes a local Smith form for each irreducible factor in the determinant…
We show that the sequence of moduli of the eigenvalues of a matrix polynomial is log-majorized, up to universal constants, by a sequence of "tropical roots" depending only on the norms of the matrix coefficients. These tropical roots are…
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a function to compute its matrix-vector product. The methods apply to…
A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palindromic. In this paper we enumerate self-reciprocal irreducible monic polynomials over a finite field with prescribed leading coefficients.…
We study the problem of computing the isolated regular solutions of a system \((f_1,\ldots,f_n)\) of \(n\) polynomial equations in \(n\) variables \((X_1, \dots, X_n)\) over a field of characteristic zero \(k\). We focus on systems with a…
Eigenvectors of tensors, as studied recently in numerical multilinear algebra, correspond to fixed points of self-maps of a projective space. We determine the number of eigenvectors and eigenvalues of a generic tensor, and we show that the…
In this paper, we study properties of polynomials over division rings. Moreover, we present formulas for finding roots of some polynomials
Ilse Fischer and the second author introduced in [Algebr. Comb. 7 (2024), no. 5, 1319-1345] a two parameter family of polynomials defined as sums over totally symmetric plane partitions and connected to alternating sign matrices and…
Ouroboros functions have shown some interesting properties when subjected to conventional operations. The aim of this paper is to continue our investigation and prove some additional properties of these functions. Using algebraic methods,…
We take advantage of the combinatorial interpretations of many sequences of polynomials of binomial type to define a sequence of symmetric functions corresponding to each sequence of polynomials of binomial type. We derive many of the…
We show that if a real trigonometric polynomial has few real roots, then the trigonometric polynomial obtained by writing the coefficients in reverse order must have many real roots. This is used to show that a class of random trigonometric…