Latin Cubes Orthogonal to Their Transposes - A Ternary Analogue of Stein Quasigroups
Latin -parallelepipeds not completing to a Latin cube
Latin parallelepipeds not completing to a cube
Latin squares and partial groupoids [Abstract of thesis]
Latin squares of order 10.
Latin squares with forbidden entries.
Latin squars, -Quasigroups and graph decompositions
Latinské čtverce a genetický kód
Le semi-groupe libre des carrés magiques
Nous étudions une loi de composition sur les carrés magiques, qui a déjà été introduite dans la littérature, qui munit l'ensemble de tous les carrés magiques d'une structure de semi-groupe (monoïde). Nous prouvons ensuite une conjecture de Adler et Li, ce semi-groupe est libre.
Leaves, excesses and neighborhoods
Les arrangements d'hyperplans : un chapitre de géométrie combinatoire
Linear discrepancy of basic totally unimodular matrices.
Linear independences in bottleneck algebra and their coherences with matroids.
Linear preserver of Ferrers vectors
Let be an matrix of zeros and ones. The matrix is said to be a Ferrers matrix if it has decreasing row sums and it is row and column dense with nonzero -entry. We characterize all linear maps perserving the set of Ferrers vectors over the binary Boolean semiring and over the Boolean ring . Also, we have achieved the number of these linear maps in each case.
Linear programming duality and morphisms
In this paper we investigate a class of problems permitting a good characterisation from the point of view of morphisms of oriented matroids. We prove several morphism-duality theorems for oriented matroids. These generalize LP-duality (in form of Farkas' Lemma) and Minty's Painting Lemma. Moreover, we characterize all morphism duality theorems, thus proving the essential unicity of Farkas' Lemma. This research helped to isolate perhaps the most natural definition of strong maps for oriented matroids....
Local equivalence of transversals in matroids.
Locally toroidal regular polytopes of rank 4.
Locally Truncated Buildings and M.... .
Location of polygon vertices on circles and its application in transport studies
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...
MacWilliams identities and matroid polynomials.