A graphical way to solve the Boolean matrix equations and
Page 1 Next
U. J. Nieminen (1974)
Kybernetika
Hanlon, Phil (1996)
The Electronic Journal of Combinatorics [electronic only]
L. Carlitz (1976)
Collectanea Mathematica
J.P. Roudneff (1988)
Discrete & computational geometry
Potapov, V.N., Krotov, D.S. (2006)
Sibirskij Matematicheskij Zhurnal
Peter J. Cameron (1977)
Mathematische Zeitschrift
Tobias Boege, Thomas Kahle (2020)
Kybernetika
The number of -gaussoids is shown to be a double exponential function in . The necessary bounds are achieved by studying construction methods for gaussoids that rely on prescribing -minors and encoding the resulting combinatorial constraints in a suitable transitive graph. Various special classes of gaussoids arise from restricting the allowed -minors.
W.D. Wallis (1974)
Aequationes mathematicae
Jones, G. (1995)
Séminaire Lotharingien de Combinatoire [electronic only]
D. Haussler, Emo Welzl (1987)
Discrete & computational geometry
Schattscheider, Doris (1997)
The Electronic Journal of Combinatorics [electronic only]
A. Panayotopoulos (1968)
Δελτίο της Ελληνικής Μαθηματικής Εταιρίας
Propp, James (1997)
The Electronic Journal of Combinatorics [electronic only]
P. Bovet (1975)
Mathématiques et Sciences Humaines
Marianne Morillon (2022)
Commentationes Mathematicae Universitatis Carolinae
We show that in set theory without the axiom of choice ZF, the statement sH: “Every proper closed subset of a finitary matroid is the intersection of hyperplanes including it” implies AC, the axiom of choice for (nonempty) finite sets. We also provide an equivalent of the statement AC in terms of “graphic” matroids. Several open questions stay open in ZF, for example: does sH imply the axiom of choice?
M. Jeger (1973)
Elemente der Mathematik
Bohdan Zelinka (1983)
Aplikace matematiky
The paper studies the diagrams of woven fabrics consisting of white and black squares as geometrical objects and described their symmetries. The concepts of isonemality and mononemality due to B. Grünbaum and G. C. Shephard are used. A conjecture of these authors is proved in a particular case.
Martin Kochol (1989)
Mathematica Slovaca
Martin Kochol (1991)
Mathematica Slovaca
Ján Černý, Filip Guldan (1987)
Aplikace matematiky
The paper deals with the problem how to locate a set of polygon vertices on given circles fulfilling some criteria of "regularity" of individual and composed polygons. Specifying the conditions we can obtain a lot of particular versions of this general problem. Some of them are already solved, the others are not. Applications of this theory can be found in scheduling of periodically repeating processes, e.g. in coordination of several urban lines on a common leg, in optimization of the rhythm of...
Page 1 Next