On the probability of generating a primitive matrix
From MaRDI portal
Publication:6595060
Recommendations
Cites work
- scientific article; zbMATH DE number 3908520 (Why is no real title available?)
- A hierarchy of polynomial time lattice basis reduction algorithms
- A note on discrete Gaussian combinations of lattice vectors
- Certified dense linear system solving
- Completion of a partial integral matrix to a unimodular matrix
- Factoring polynomials with rational coefficients
- Generic pole assignability, structurally constrained controllers and unimodular completion
- High-order lifting and integrality certification
- Natural density of integral matrices that can be extended to invertible integral matrices
- Natural density of rectangular unimodular integer matrices
- On the completion of a partial integral matrix to a unimodular matrix
- On the existence of unimodular matrices with a prescribed submatrix
- On the probability of generating a lattice
- On the smoothing parameter and last minimum of random orthogonal lattices
- The shifted number system for fast linear algebra on integer matrices
- Unimodular Complements
- Unimodular completion of polynomial matrices
This page was built for publication: On the probability of generating a primitive matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6595060)