Related papers: Characteristic polynomials of p-adic matrices

This paper establishes new upper bounds for the right eigenvalues of monic matrix polynomials over the quaternion division algebra. The noncommutative nature of quaternion multiplication presents fundamental challenges in eigenvalue…

We propose a novel estimation framework for quadratic functionals of precision matrices in high-dimensional settings, particularly in regimes where the feature dimension $p$ exceeds the sample size $n$. Traditional moment-based estimators…

We study the roots of a random polynomial over the field of p-adic numbers. For a random monic polynomial with coefficients in $\mathbb{Z}_p$, we obtain an asymptotic formula for the factorial moments of the number of roots of this…

Let $\mathcal A$ be an $\mathbb F$-algebra and $\omega \in \mathcal A\langle x_1, \ldots, x_m \rangle$ which defines a map $\mathcal A^m \rightarrow \mathcal A$ by evaluation, called a polynomial map with constant. We consider $\mathcal {A}…

In this paper we consider pentadiagonal $(n+1)\times(n+1)$ matrices with two subdiagonals and two superdiagonals at distances $k$ and $2k$ from the main diagonal where $1\le k<2k\le n$. We give an explicit formula for their determinants and…

We present an algorithm computing the determinant of an integer matrix A. The algorithm is introspective in the sense that it uses several distinct algorithms that run in a concurrent manner. During the course of the algorithm partial…

An efficient technique to solve precision problems consists in using exact computations. For geometric predicates, using systematically expensive exact computations can be avoided by the use of filters. The predicate is first evaluated…

A unified theory of orthogonal polynomials of a discrete variable is presented through the eigenvalue problem of hermitian matrices of finite or infinite dimensions. It can be considered as a matrix version of exactly solvable Schr\"odinger…

We give an algorithm for properly learning Poisson binomial distributions. A Poisson binomial distribution (PBD) of order $n$ is the discrete probability distribution of the sum of $n$ mutually independent Bernoulli random variables. Given…

We lay the geometric foundations for the study of the characteristic polynomial of tensors. For symmetric tensors of order $d \geq 3$ and dimension $2$ and symmetric tensors of order $3$ and dimension $3$, we prove that only finitely many…

Osborne's iteration is a method for balancing $n\times n$ matrices which is widely used in linear algebra packages, as balancing preserves eigenvalues and stabilizes their numeral computation. The iteration can be implemented in any norm…

We present efficient algorithms for detecting central and mirror symmetry for the case of algebraic curves defined by means of polynomial parametrizations. The algorithms are based on the existence of a linear relationship between two…

Symmetric polynomials of the roots of a polynomial can be written as polynomials of the coefficients, and by applying this to the characteristic polynomial we can write a symmetric polynomial of the eigenvalues $a_{i}$ of an $n\times n$…

This work concerns the distance in 2-norm from a matrix polynomial to a nearest polynomial with a specified number of its eigenvalues at specified locations in the complex plane. Perturbations are allowed only on the constant coefficient…

We show that for every subset $E$ of positive density in the set of integer square-matrices with zero traces, there exists an integer $k \geq 1$ such that the set of characteristic polynomials of matrices in $E-E$ contains the set of…

We make a detailed investigation of the generic properties that polynomial mappings possess. An important starting point is the work by Farnik, Jelonek and Ruas in 2019, where they prove some of those properties in the context of…

We investigate the local integrability and linearizability of a family of three-dimensional polynomial systems with the matrix of the linear approximation having the eigenvalues $1, \zeta, \zeta^2 $, where $\zeta$ is a primitive cubic root…

Let $\mathbb{F}$ be a field. We show that given any $n$th degree monic polynomial $q(x)\in \mathbb{F}[x]$ and any matrix $A\in\mathbb{M}_n(\mathbb{F})$ whose trace coincides with the trace of $q(x)$ and consisting in its main diagonal of…

Optimal designs are required to make efficient statistical experiments. D-optimal designs for some models are calculated by using canonical moments. On the other hand, integrable systems are dynamical systems whose solutions can be written…

Many applications, including rank aggregation and crowd-labeling, can be modeled in terms of a bivariate isotonic matrix with unknown permutations acting on its rows and columns. We consider the problem of estimating such a matrix based on…