EuDML | Browse

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 2 Next

Displaying 21 – 40 of 43

Maximum line-free set geometry in $ℤ_{3}^{d}$ .

Delorme, Charles, Márquez, Isabel, Ordaz, Oscar, Quiroz, Domingo (2007)

Divulgaciones Matemáticas

Maximum packings of Kn with copies of K4-e.

C.C. Lindner, D.G. Hoffman, M. Sharry (1996)

Aequationes mathematicae

Medial quasigroups of type $(n, k)$

Alena Vanžurová (2010)

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

Our aim is to demonstrate how the apparatus of groupoid terms (on two variables) might be employed for studying properties of parallelism in the so called $(n, k)$ -quasigroups. We show that an incidence structure associated with a medial quasigroup of type $(n, k)$ , $n > k \geq 3$ , is either an affine space of dimension at least three, or a desarguesian plane. Conversely, if we start either with an affine space of order $k > 2$ and dimension $m$ , or with a desarguesian affine plane of order $k > 2$ then there is a medial quasigroup of...

Metastability of the three dimensional Ising model on a torus at very low temperatures.

Ben Arous, Gérard, Cerf, Raphaël (1996)

Electronic Journal of Probability [electronic only]

Minimal and minimum size latin bitrades of each genus

James Lefevre, Diane Donovan, Nicholas J. Cavenagh, Aleš Drápal (2007)

Commentationes Mathematicae Universitatis Carolinae

Suppose that $T^{\circ}$ and $T^{☆}$ are partial latin squares of order $n$ , with the property that each row and each column of $T^{\circ}$ contains the same set of entries as the corresponding row or column of $T^{☆}$ . In addition, suppose that each cell in $T^{\circ}$ contains an entry if and only if the corresponding cell in $T^{☆}$ contains an entry, and these entries (if they exist) are different. Then the pair $T = (T^{\circ}, T^{☆})$ forms a latin bitrade. The size of $T$ is the total number of filled cells in $T^{\circ}$ (equivalently $T^{☆}$ ). The latin bitrade is minimal if...

Minimal cycle bases of the lexicographic product of graphs

M.M.M. Jaradat (2008)

Discussiones Mathematicae Graph Theory

A construction of minimum cycle bases of the lexicographic product of graphs is presented. Moreover, the length of a longest cycle of a minimal cycle basis is determined.

Minimality of toric arrangements

Giacomo d'Antonio, Emanuele Delucchi (2015)

Journal of the European Mathematical Society

We prove that the complement of a toric arrangement has the homotopy type of a minimal CW-complex. As a corollary we deduce that the integer cohomology of these spaces is torsionfree. We apply discrete Morse theory to the toric Salvetti complex, providing a sequence of cellular collapses that leads to a minimal complex.