AbstractWe use an upper bound on the number of zeros of sparse polynomials over a finite field Fq to estimate the number of singular matrices of the form (λiuj)i,j=1m, where λ1,…,λm∈Fq* are fixed nonzero elements, taken over all (q-1)m integer m-tuples (u1,…,um)∈[0,q-2]m
3 pages, 1 article*A Simplification of the Factoring Argument for Proving the Non-Singularity of a M...
We obtain new lower bounds on the number of non zeros of sparse polynomials and give a fully polynom...
AbstractWe discuss a conjecture concerning the enumeration of nonsingular matrices over a finite fie...
AbstractWe show that for any subset E⊆Fqd with |E|≫qd−1+2d, the number of singular matrices whose ro...
AbstractWe derive an explicit count for the number of singular n×n Hankel (Toeplitz) matrices whose ...
AbstractLet Fn be the ring of n × n matrices over the finite field F; let o(Fn) be the number of ele...
AbstractWe show that for any subset E⊆Fqd with |E|≫qd−1+2d, the number of singular matrices whose ro...
AbstractLet K be a field and t⩾0. Denote by Bm(t,K) the supremum of the number of roots in K⁎, count...
Helmke et al. have recently given a formula for the number of reachable pairs of matrices over a fin...
Submitted by V. Mehrmann For an N × N Vandermonde matrix VN = (αi−1j)1ijN with translated Chebyshev ...
We consider the problem of finding a sparse multiple of a polynomial. Given f ∈ F[x] of degree d ove...
AbstractLet Fn be the ring of n × n matrices over the finite field F; let o(Fn) be the number of ele...
Supported,in part, by the National Science Foundation under grant CCR-8704404SIGLEITItal
In this work we examine the behavior of the minimum singular value of random Vandermonde matrices. I...
AbstractWe obtain new lower bounds on the number of non-zeros of sparse polynomials and give a fully...
3 pages, 1 article*A Simplification of the Factoring Argument for Proving the Non-Singularity of a M...
We obtain new lower bounds on the number of non zeros of sparse polynomials and give a fully polynom...
AbstractWe discuss a conjecture concerning the enumeration of nonsingular matrices over a finite fie...
AbstractWe show that for any subset E⊆Fqd with |E|≫qd−1+2d, the number of singular matrices whose ro...
AbstractWe derive an explicit count for the number of singular n×n Hankel (Toeplitz) matrices whose ...
AbstractLet Fn be the ring of n × n matrices over the finite field F; let o(Fn) be the number of ele...
AbstractWe show that for any subset E⊆Fqd with |E|≫qd−1+2d, the number of singular matrices whose ro...
AbstractLet K be a field and t⩾0. Denote by Bm(t,K) the supremum of the number of roots in K⁎, count...
Helmke et al. have recently given a formula for the number of reachable pairs of matrices over a fin...
Submitted by V. Mehrmann For an N × N Vandermonde matrix VN = (αi−1j)1ijN with translated Chebyshev ...
We consider the problem of finding a sparse multiple of a polynomial. Given f ∈ F[x] of degree d ove...
AbstractLet Fn be the ring of n × n matrices over the finite field F; let o(Fn) be the number of ele...
Supported,in part, by the National Science Foundation under grant CCR-8704404SIGLEITItal
In this work we examine the behavior of the minimum singular value of random Vandermonde matrices. I...
AbstractWe obtain new lower bounds on the number of non-zeros of sparse polynomials and give a fully...
3 pages, 1 article*A Simplification of the Factoring Argument for Proving the Non-Singularity of a M...
We obtain new lower bounds on the number of non zeros of sparse polynomials and give a fully polynom...
AbstractWe discuss a conjecture concerning the enumeration of nonsingular matrices over a finite fie...
DOI
Add to ORKG