A nowhere-zero point in linear mappings

DOI10.1007/BF02125351MaRDI QIDQ753822zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Noga Alon, Michael Tarsi

Publication date 1989

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02125351

zbMATH Keywords

vectormatrix over the finite field

Mathematics Subject Classification ID

Matrices over special rings (quaternions, finite fields, etc.) (15B33) Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Linear transformations, semilinear transformations (15A04)

Recommendations

• On the number of nowhere zero points in linear mappings
• Publication:4724651
• Jaeger's Conjecture
• On inequivalent representations of matroids over finite fields
• A short proof of non-GF(5)-representability of matroids

Cites work

• Balancing sets of vectors
• The blocking number of an affine space

Cited in

(37)

• Weight choosability of graphs
• Minimal primes over permanental ideals
• The permanent rank of a matrix
• Graphs are \((1, \varDelta + 1)\)-choosable
• The polynomial method in the study of zero-sum theorems
• Coverings of Abelian groups and vector spaces.
• Every nice graph is (1,5)-choosable
• Matrix choosability
• Total weight choosability of cone graphs
• Total weight choosability for Halin graphs
• Total weight choosability of graphs
• On two generalizations of the Alon-Tarsi polynomial method
• Total weight choosability of Cartesian product of graphs
• Permanent index of matrices associated with graphs
• 2-connected chordal graphs and line graphs are \((1,5)\)-choosable
• Every graph is \((2,3)\)-choosable
• Permanent Polya problem for additive surjective maps
• Total Weight Choosability of Trees
• Generalizations and applications of the nowhere zero linear mappings in network coding
• Dense Eulerian graphs are (1, 3)-choosable
• Nowhere-zero eigenvectors of graphs
• Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable
• On various restricted sumsets
• scientific article; zbMATH DE number 1513187 (Why is no real title available?)
• Additive bases of vector spaces over prime fields
• Colorings and orientations of graphs
• On the number of nowhere zero points in linear mappings
• On linear preservers of permanental rank
• The hat guessing number of graphs
• Improved bounds for the sunflower lemma
• Total weight choosability of graphs: towards the 1-2-3-conjecture
• On the existence of nowhere-zero vectors for linear transformations
• scientific article; zbMATH DE number 7770027 (Why is no real title available?)
• Combinatorics. Abstracts from the workshop held January 1--7, 2023
• Unification of zero-sum problems, subset sums and covers of ℤ
• Transformation invariance in the combinatorial Nullstellensatz and nowhere-zero points of non-singular matrices
• Linear extension of the Erdős-Heilbronn conjecture

This page was built for publication: A nowhere-zero point in linear mappings

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