Counting problems and ranks of matrices

DOI10.1016/J.LAA.2014.09.020MaRDI QIDQ471924zbMATH OpenOpenAlexFDO

Authors Norichika Matsuki

Publication date 17 November 2014

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2014.09.020

zbMATH Keywords

polynomialcounting problemrank of matrix

Mathematics Subject Classification ID

Vector spaces, linear dependence, rank, lineability (15A03) Counting solutions of Diophantine equations (11D45)

Recommendations

• The linear representations of decision problems
• On the number of zero-patterns of a sequence of polynomials
• On the number of nowhere zero points in linear mappings
• Counting polynomials with zeros of given multiplicities in finite fields
• Counting Matrices with Coordinates in Finite Fields and of Fixed Rank.

Cites work

• The Complexity of Enumeration and Reliability Problems
• The complexity of computing the permanent
• The linear representations of decision problems

Cited in

(6)

• The linear representations of decision problems
• Counting zero kernel pairs over a finite field
• Counting dope matrices
• Combinatorial ranks of matrices
• Biwhitening Reveals the Rank of a Count Matrix
• Counting on matrices

This page was built for publication: Counting problems and ranks of matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q471924)