Related papers: The generalized characteristic polynomial, corresp…

In this work we provide a novel approach for computing the coefficients of the characteristic polynomial of a square matrix. We demonstrate that each coefficient can be efficiently represented by a set of circle graphs. Thus, one can employ…

In this paper, we study the regularity of solutions to uniformly degenerate elliptic equations in bounded domains under the condition that the characteristic polynomials have varying characteristic exponents.

We study determinants of matrices whose entries are powers of Fibonacci numbers. We then extend the results to include entries that are powers of generalized Fibonacci numbers defined as a second-order linear recurrence relation. These…

We show that for every pair of matrices (S,P), having the closed symmetrized bidisc $\Gamma$ as a spectral set, there is a one dimensional complex algebraic variety $\Lambda$ in $\Gamma$ such that for every matrix valued polynomial f, the…

In this paper, we describe the structure of the Laplace characteristic polynomial $\chi_n(\lambda)$ for the infinite family of graphs $H_n=H_n(G_1,\,G_2,\ldots,G_m)$ obtained as a circulant foliation over a graph $H$ on $m$ vertices with…

We use the Darboux coordinate representation found by two of the authors (L.Ch. and M.Sh.) for entries of general symplectic leaves of the $\mathcal A_n$-groupoid of upper-triangular matrices to express roots of the characteristic equation…

We distinguish a class of random point processes which we call Giambelli compatible point processes. Our definition was partly inspired by determinantal identities for averages of products and ratios of characteristic polynomials for random…

We present an explicit formula for the resolvent of the discrete Laplacian on the square lattice, and compute its asymptotic expansions around thresholds in low dimensions. As a by-product we obtain a closed formula for the fundamental…

We show how the knowledge of the Fourier coefficients of the Cherednik kernel leads to combinatorial formulas for generalized exponents. We recover known formulas for generalized exponents of irreducible representations parameterized by…

For the family $P:=x^n+a_1x^{n-1}+\cdots +a_n$ of complex polynomials in the variable $x$ we study its {\em discriminant} $R:=$Res$(P,P',x)$, $R\in \mathbb{C}[a]$, $a=(a_1,\ldots ,a_n)$. When $R$ is regarded as a polynomial in $a_k$, one…

Using a probabilistic approach, we derive some interesting combinatorial identities involving gamma and beta functions. These results generalize certain well-known combinatorial identities involving binomial coefficients and special…

We consider the problem of defining polynomials over function fields of positive characteristic. Among other results, we show that the following assertions are true. 1. Let $\G_p$ be an algebraic extension of a field of $p$ elements and…

For the solvable polynomial algebras introduced and studied by Kandri-Rody and Weispfenning [J. Symbolic Comput., 9(1990)], a constructive characterization is given in terms of Gr\"obner bases for ideals of free algebras, thereby solvable…

We generalize Carlitz' result on the number of self reciprocal monic irreducible polynomials over finite fields by showing that similar explicit formula hold for the number of irreducible polynomials obtained by a fixed quadratic…

We introduce a generalization $\pounds_{d}^{(\alpha)}(X)$ of the finite polylogarithms $\pounds_{d}^{(0)}(X)=\pounds_d(X)=\sum_{k=1}^{p-1}X^k/k^d$, in characteristic $p$, which depends on a parameter $\alpha$. The special case…

In this paper, we solve the problem of computing the inverse in Clifford algebras of arbitrary dimension. We present basis-free formulas of different types (explicit and recursive) for the determinant, other characteristic polynomial…

The aim of this work is to extend the study of super-coinvariant polynomials, to the case of the generalized symmetric group $G_{n,m}$, defined as the wreath product $C_m\wr\S_n$ of the symmetric group by the cyclic group. We define a…

We define Ptolemy coordinates for representations that are not necessarily boundary-unipotent. This gives rise to a new algorithm for computing the SL(2,C) A-polynomial, and more generally the SL(n,C) A-varieties. We also give a formula for…

By polynomial (or extended binomial) coefficients, we mean the coefficients in the expansion of integral powers, positive and negative, of the polynomial $1+t +\cdots +t^{m}$; $m\geq 1$ being a fixed integer. We will establish several…

We consider parametrized systems of generalized polynomial equations (with real exponents) in $n$ positive variables, involving $m$ monomials with positive parameters; that is, $x\in\mathbb{R}^n_>$ such that ${A \, (c \circ x^B)=0}$ with…