Abstract
We study linear spaces of n×n matrices in which every matrix is singular. Examples are given to illustrate that a characterization of such subspaces would solve various open problems in combinatorics and in computational algebra. Several important special cases of the problem are solved, although often in disguise.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Björner andL. Lovász (1987),Pseudomodular lattices and continuous matroids, Acta Sci. Math. Szeged51, 295–308.
L. Csánsky (1976),Fast parallel matrix inversion algorithms, SIAM J. Comput.5, 618–623.
A. Dress, L. Lovász (1987),On some combinatorial properties of algebraic matroids, Combinatorica7, 39–48.
J. Edmonds (1967),Systems of distinct representatives and linear algebra, J. Res. Nat. Bur. Standards Sect.B 71B, 241–247.
J. Edmonds (1970),Submodular functions, matroids, and certain polyhedra, in: Combinatorial Structures and their Appl. (ed. R. K. Guy, H. Hanani, N. Sauer and J. Schönheim), Gordon and Breach, New York, 69–87.
G. Frobenius (1982),Über zerlegbare Determinanten, Sitzungsber. Königl. Preuss. Akad. Wiss., XVIII, 1917, 274–277.
P. M. Jensen andB. Korte (1982),Complexity of matroid property algorithms, SIAM J. Comput.,11, 184–190.
R. M. Karp, E. Upfal andA. Wigderson (1986),Constructing a perfect matching is in random NC, Combinatorica6, 35–48.
D. König (1916),Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre, Math. Annalen77, 453–465.
G. Laman (1970),On graphs and rigidity of plane skeletal structures, J. Engrg. Math.4, 331–340.
N. Linial, L. Lovász andA. Wigderson (1988),Rubber bands, convex embeddings, and graph connectivity, Combintorica8, 91–102.
L. Lovász (1979),Flats in matroids and geometric graphs, in: Combinatorial Surveys, Proc. 6th Britsh Comb. Conf., Academic Press, 45–86.
L. Lovász (1979),Determinants, matchings, and random algorithms, in: Fundamentals of Computation theory, FCT'79 (ed. L. Budach), Akademie-Verlag, Berlin, 565–574.
L. Lovász (1980a),Selecting independent lines from a family of lines in a space, Acta Sci. Math. Szeged42, 121–131.
L. Lovász (1980b),Matroid matching and some applications, J. Comb. TheoryB 28, 208–236.
L. Lovász (1980c),The matroid matching problem, in: Algebraic Methods in Graph Theory (ed. L. Lovász and V. T. Sós), Coll. Math. Soc. J. Bolyai 25, North-Holland, 495–517.
L. Lovász andM. D. Plummer (1986),Matching Theory, Akadémiai Kiadó, Budapest-North-Holland, Amsterdam.
L. Lovász, Y. Yemini (1982),On generic rigidity in the plane, SIAM J. Alg. Discr. Methods1, 91–98.
J. H. Mason (1977),Matroids as the study of geometric configurations, in: Higher Combinatorics (ed. M. Aigner), Reidel, 133–176.
J. H. Mason (1981),Glueing matroids together: a stude of Dilworth truncations and matroid analogues of exterior and symmetric powers, in: Algebraic Methods in Graph Theory (ed. L. Lovász and V. T. Sós), Coll. Math. Soc. J. Bolyai25, North-Holland, 519–561.
K. Mulmuley, U. Vazirani andV. Vazirani (1987),Matching is as easy as matrix inversion, Combinatorica7, 105–113.
T. G. Room (1938),The geometry of determinatal loci, Cambridge Univ. Press.
J. T. Schwartz (1980),Fast probabilistic algorithms for verification of polynomial identities, J. ACM27, 701–717.
W. T. Tutte (1947),The factorization of linear graphs, J. London Math. Soc.22, 107–111.
L. G. Valiant (1979),The complexity of computing the permanent, Theor. Comp. Sci.,8, 189–201.
Author information
Authors and Affiliations
Additional information
Research supported by Hungarian National Research fund No. 1812.
About this article
Cite this article
Lovász, L. Singular spaces of matrices and their application in combinatorics. Bol. Soc. Bras. Mat 20, 87–99 (1989). https://doi.org/10.1007/BF02585470
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02585470