Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Jónás, Béla"'
Autor:
Jónás, Béla
A partial Latin square of order $n$ can be represented by a $3$-dimensional chess-board of size $n\times n\times n$ with at most $n^2$ non-attacking rooks. Based on this representation, we apply a uniform method to prove the M. Hall's, Ryser's and Cr
Externí odkaz:
http://arxiv.org/abs/2208.08414
Autor:
Jónás, Béla
A partial Latin square of order $n$ can be represented by a $3$-dimensional chess-board of size $n\times n\times n$ with at most $n^2$ non-attacking rooks. In Latin squares, a subsystem and its most distant mate together have as many rooks as their c
Externí odkaz:
http://arxiv.org/abs/2208.06166
Autor:
Jónás, Béla
A $d$-dimensional generalization of a Latin square of order $n$ can be considered as a chess-board of size $n\times n\times \ldots\times n$ ($d$ times), containing $n^d$ cells with $n^{d-1}$ non-attacking rooks. Each cell is identified by a $d$-tuple
Externí odkaz:
http://arxiv.org/abs/2208.04113
Autor:
Jonas Béla Diebel
For the first time, this work deals in detail with the requirements of Section 4 (1a) FinDAG, which is important for supervisory practice. The work not only outlines the regulatory objective in the first sentence of the provision, but also examines t