dc.creator | Falcón Ganfornina, Raúl Manuel | es |
dc.creator | Stones, Rebecca J. | es |
dc.date.accessioned | 2017-12-20T10:33:08Z | |
dc.date.available | 2017-12-20T10:33:08Z | |
dc.date.issued | 2017 | |
dc.identifier.citation | Falcón Ganfornina, R.M. y Stones, R.J. (2017). Partial Latin rectangle graphs and autoparatopism groups of partial Latin rectangles with trivial autotopism groups. Discrete Mathematics, 340 (6), 1242-1260. | |
dc.identifier.issn | 0012-365X | es |
dc.identifier.uri | http://hdl.handle.net/11441/67852 | |
dc.description.abstract | An $r \times s$ partial Latin rectangle $(l_{ij})$ is an $r \times s$ matrix containing elements of $\{1,2,\ldots,n\} \cup \{\cdot\}$ such that each row and each column contain at most one copy of any symbol in $\{1,2,\ldots,n\}$. An entry is a triple $(i,j,l_{ij})$ with $l_{ij} \neq \cdot$. Partial Latin rectangles are operated on by permuting the rows, columns, and symbols, and by uniformly permuting the coordinates of the set of entries. The stabilizers under these operations are called the autotopism group and the autoparatopism group, respectively. We develop the theory of symmetries of partial Latin rectangles, introducing the concept of a partial Latin rectangle graph. We give constructions of $m$-entry partial Latin rectangles with trivial autotopism groups for all possible autoparatopism groups (up to isomorphism) when: (a) $r=s=n$, i.e., partial Latin squares, (b) $r=2$ and $s=n$, and (c) $r=2$ and $s \neq n$. | es |
dc.format | application/pdf | es |
dc.language.iso | eng | es |
dc.publisher | Elsevier | es |
dc.relation.ispartof | Discrete Mathematics, 340 (6), 1242-1260. | |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.subject | Autoparatopism | es |
dc.subject | Autotopism | es |
dc.subject | Latin square | es |
dc.subject | Partial Latin rectangle | es |
dc.subject | Partial Latin rectangle graph | es |
dc.title | Partial Latin rectangle graphs and autoparatopism groups of partial Latin rectangles with trivial autotopism groups | es |
dc.type | info:eu-repo/semantics/article | es |
dcterms.identifier | https://ror.org/03yxnpp24 | |
dc.type.version | info:eu-repo/semantics/publishedVersion | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
dc.contributor.affiliation | Universidad de Sevilla. Departamento de Matemática Aplicada I | es |
dc.relation.publisherversion | http://www.sciencedirect.com/science/article/pii/S0012365X1730002X | es |
dc.identifier.doi | 10.1016/j.disc.2017.01.002 | es |
dc.contributor.group | Universidad de Sevilla. FQM016: Códigos, diseños, criptografía y optimización | es |
idus.format.extent | 19 | es |
idus.validador.nota | Este artículo se publicó en versión open access dentro de la revista, con lo que se puede publicar sin problemas tal cual en el repositorio. | es |
dc.journaltitle | Discrete Mathematics | es |
dc.publication.volumen | 340 | es |
dc.publication.issue | 6 | es |
dc.publication.initialPage | 1242 | es |
dc.publication.endPage | 1260 | es |