English
Related papers

Related papers: Integer matrices with a given characteristic polyn…

200 papers

We look at Bohemians, specifically those with population $\{-1, 0, {+1}\}$ and sometimes $\{0,1,i,-1,-i\}$. More, we specialize the matrices to be upper Hessenberg Bohemian. From there, focusing on only those matrices whose characteristic…

Symbolic Computation · Computer Science 2019-07-26 Eunice Y. S. Chan , Robert M. Corless , Laureano Gonzalez-Vega , J. Rafael Sendra , Juana Sendra

We study the maximal number of pairwise distinct columns in a $\Delta$-modular integer matrix with $m$ rows. Recent results by Lee et al. provide an asymptotically tight upper bound of $O(m^2)$ for fixed $\Delta$. We complement this and…

Combinatorics · Mathematics 2022-07-12 Gennadiy Averkov , Matthias Schymura

Motivated by the fundamental lower bounds questions in proof complexity, we initiate the study of matrix identities as hard instances for strong proof systems. A matrix identity of $d \times d$ matrices over a field $\mathbb{F}$, is a…

Computational Complexity · Computer Science 2014-09-04 Fu Li , Iddo Tzameret

In this paper, the determinants of $n\times n$ matrices over commutative finite chain rings and over commutative finite principal ideal rings are studied. The number of $n\times n$ matrices over a commutative finite chain ring ${R}$ of a…

Rings and Algebras · Mathematics 2017-02-02 Parinyawat Choosuwan , Somphong Jitman , Patanee Udomkavanich

We obtain effective bounds on the heights of algebraic integers whose orbits contain multiplicatively dependent values modulo S-integers. Our method is based on a new upper bound on the so-called S-height of polynomial values over the ring…

Number Theory · Mathematics 2020-01-28 Ray Li , Igor E. Shparlinski

Form an $n \times n$ matrix by drawing entries independently from $\{\pm1\}$ (or another fixed nontrivial finitely supported distribution in $\mathbf{Z}$) and let $\phi$ be the characteristic polynomial. Conditionally on the extended…

Number Theory · Mathematics 2022-03-16 Sean Eberhard

Let $M$ be a random matrix chosen according to Haar measure from the unitary group $\mathrm{U}(n,\mathbb{C})$. Diaconis and Shahshahani proved that the traces of $M,M^2,\ldots,M^k$ converge in distribution to independent normal variables as…

Group Theory · Mathematics 2024-10-15 Ofir Gorodetsky , Brad Rodgers

Given a set $X$ of $n\times n$ matrices and a positive integer $m$, we consider the problem of estimating the cardinalities of the product sets $A_1 \dotsc A_m$, where $A_i\in X$. When $X=\mathcal M_n(\mathbb{Z};H)$, the set of $n\times n$…

Number Theory · Mathematics 2024-11-20 Muhammad Afifurrahman

The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this…

Commutative Algebra · Mathematics 2023-09-18 Ada Boralevi , Jasper van Doornmalen , Jan Draisma , Michiel E. Hochstenbach , Bor Plestenjak

A number $\lambda \in \mathbb C $ is called an {\it eigenvalue} of the matrix polynomial $P(z)$ if there exists a nonzero vector $x \in \mathbb C^n$ such that $P(\lambda)x = 0$. Note that each finite eigenvalue of $P(z)$ is a zero of the…

Spectral Theory · Mathematics 2019-02-19 Công-Trình Lê , Thi-Hoa-Binh Du , Tran-Duc Nguyen

Recently there has been several works estimating the number of $n\times n$ matrices with elements from some finite sets $\mathcal X$ of arithmetic interest and of a given determinant. Typically such results are compared with the trivial…

Number Theory · Mathematics 2024-08-09 Ilya D. Shkredov , Igor E. Shparlinski

Given any polynomial $p$ in $C[X]$, we show that the set of irreducible matrices satisfying $p(A)=0$ is finite. In the specific case $p(X)=X^2-nX$, we count the number of irreducible matrices in this set and analyze the arising sequences…

Combinatorics · Mathematics 2018-05-11 Erik Thörnblad , Jakob Zimmermann

This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise…

Symbolic Computation · Computer Science 2011-11-10 Jean-Guillaume Dumas

We look at Bohemian matrices, specifically those with entries from $\{-1, 0, {+1}\}$. More, we specialize the matrices to be upper Hessenberg, with subdiagonal entries $\pm1$. Many properties remain after these specializations, some of…

Symbolic Computation · Computer Science 2018-09-28 Eunice Y. S. Chan , Robert M. Corless , Laureano Gonzalez-Vega , J. Rafael Sendra , Juana Sendra , Steven E. Thornton

We consider the group M of all polynomial matrices U(z) = U0 + U1*z + U2*z*z +...+Uk*z*...*z, k=0,1,... that satisfy equation U(z)*D*U(z)" = D with the diagonal n*n matrix D=diag{-1,1,1,...1}. Here n > 1, U(z)" = U0" + U1"*z + U2"*z*z +…

Group Theory · Mathematics 2007-05-23 Boris D. Lubachevsky

We investigate spectral conditions on Hermitian matrices of roots of unity. Our main results are conjecturally sharp upper bounds on the number of residue classes of the characteristic polynomial of such matrices modulo ideals generated by…

Combinatorics · Mathematics 2023-07-18 Gary R. W. Greaves , Chin Jian Woo

We consider a tuple $\Phi = (\phi_1,\ldots,\phi_m)$ of commuting maps on a finitary matroid $X$. We show that if $\Phi$ satisfies certain conditions, then for any finite set $A\subseteq X$, the rank of $\{\phi_1^{r_1}\cdots\phi_m^{r_m}(a):a…

Combinatorics · Mathematics 2025-02-06 Antongiulio Fornasiero , Elliot Kaplan

In this paper, for positive integers $H$ and $k \leq n$, we obtain some estimates on the cardinality of the set of monic integer polynomials of degree $n$ and height bounded by $H$ with exactly $k$ roots of maximal modulus. These include…

Number Theory · Mathematics 2024-09-16 Artūras Dubickas , Min Sha

It is well known that many problems in interval computation are intractable, which restricts our attempts to solve large problems in reasonable time. This does not mean, however, that all problems are computationally hard. Identifying…

Numerical Analysis · Computer Science 2022-11-07 Milan Hladík

The variety of principal minors of $n\times n$ symmetric matrices, denoted $Z_{n}$, is invariant under the action of a group $G\subset \GL(2^{n})$ isomorphic to $\G$. We describe an irreducible $G$-module of degree $4$ polynomials…

Algebraic Geometry · Mathematics 2011-08-25 Luke Oeding