Relatively prime polynomials and nonsingular Hankel matrices over finite fields
From MaRDI portal
Publication:2431247
Abstract: The probability for two monic polynomials of a positive degree n with coefficients in the finite field F_q to be relatively prime turns out to be identical with the probability for an n x n Hankel matrix over F_q to be nonsingular. Motivated by this, we give an explicit map from pairs of coprime polynomials to nonsingular Hankel matrices that explains this connection. A basic tool used here is the classical notion of Bezoutian of two polynomials. Moreover, we give simpler and direct proofs of the general formulae for the number of m-tuples of relatively prime polynomials over F_q of given degrees and for the number of n x n Hankel matrices over F_q of a given rank
Recommendations
- On the rank of Hankel matrices over finite fields
- The probability of relatively prime polynomials in \(\mathbb Z_{p^k}[x]\)
- The Probability of Relatively Prime Polynomials
- Hankel matrices of finite rank with applications to signal processing and polynomials
- scientific article; zbMATH DE number 6439000
Cites work
- scientific article; zbMATH DE number 1254299 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- A pentagonal number sieve
- Analysis of Euclidean algorithms for polynomials over finite fields
- Block companion singer cycles, primitive recursive vector sequences, and coprime polynomial pairs over finite fields
- Bézoutians
- Degree distribution of the greatest common divisor of polynomials over 𝔽q
- Distribution of Bordered Persymmetric Matrices in a Finite Field.
- Number of irreducible polynomials and pairs of relatively prime polynomials in several variables over finite fields
- On an involution concerning pairs of polynomials over \(\mathbb{F}_2\)
- Precise Analyses of the Right- and Left-Shift Greatest Common Divisor Algorithms for $GF(q)[x]$
- The Probability of Relatively Prime Polynomials
Cited in
(14)- Probability estimates for reachability of linear systems defined over finite fields
- On the Berlekamp/Massey algorithm and counting singular Hankel matrices over a finite field
- Carleman estimates for elliptic operators with complex coefficients. I: Boundary value problems
- Finding linearly generated subsequences
- Applications of coprime polynomials to ranks of matrices
- Polynomial matrices, splitting subspaces and Krylov subspaces over finite fields
- On the rank of Hankel matrices over finite fields
- Reachability of random linear systems over finite fields
- Tuples of polynomials over finite fields with pairwise coprimality conditions
- The probability of primeness for specially structured polynomial matrices over finite fields with applications to linear systems and convolutional codes
- The variance and correlations of the divisor function in \(\mathbb{F}_q[T]\), and Hankel matrices
- Unimodular polynomial matrices over finite fields
- Uniform probability and natural density of mutually left coprime polynomial matrices over finite fields
- Block companion singer cycles, primitive recursive vector sequences, and coprime polynomial pairs over finite fields
This page was built for publication: Relatively prime polynomials and nonsingular Hankel matrices over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2431247)
