Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Restricted completion of sparse partial Latin squares
Malardalen Univ, Sweden; Mittag Leffler Inst, Sweden.
Linköping University, Department of Mathematics, Mathematics and Applied Mathematics. Linköping University, Faculty of Science & Engineering. Mittag Leffler Inst, Sweden.
Umea Univ, Sweden; Mittag Leffler Inst, Sweden.
2019 (English)In: Combinatorics, probability & computing, ISSN 0963-5483, E-ISSN 1469-2163, Vol. 28, no 5, p. 675-695Article in journal (Refereed) Published
Abstract [en]

An n x n Martial Latin square P is called dense if each row and column has at mostan non-empty cells and each symboloccurso n times in P. An x n arrayA where each cell contains subset of {1, ..., n} is a (beta n, beta n, beta n)-array if each symbol occurs at most beta n times in each row and column and each cell contains a set of size at most beta n. Combining the notions of completing partial Latin squared and avoiding arrays, we prose that there are constants alpha, beta amp;gt; 0 such that, for every positive integer n, if P is an alpha-dense n x n partial a square, A is an n x n (beta n, beta n, beta n)-array and no cell of P contains a symbol that ppears in the corresponing cell of A, then there is a completiong of P that avoids A; that is, there is a Latin square L that agrees with P on every non-empty of P, and for each i, j satisfying 1 amp;lt;= i, j, amp;lt;= n, the symbol in position (i, j) in L does not appear in the corresponding cell of A.

Place, publisher, year, edition, pages
CAMBRIDGE UNIV PRESS , 2019. Vol. 28, no 5, p. 675-695
National Category
Discrete Mathematics
Identifiers
URN: urn:nbn:se:liu:diva-162770DOI: 10.1017/S096354831800055XISI: 000500255000002OAI: oai:DiVA.org:liu-162770DiVA, id: diva2:1379756
Note

Funding Agencies|Mittag-Leffler Institute

Available from: 2019-12-17 Created: 2019-12-17 Last updated: 2020-03-11

Open Access in DiVA

fulltext(431 kB)11 downloads
File information
File name FULLTEXT01.pdfFile size 431 kBChecksum SHA-512
d322ecd09d29ea0544b96095179b2e7ed477574342b73ade7a547f31caa090514e257f16214d8bde66c4bc1027c57e2a1f1db1212954adb0059c32c923a20b81
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Casselgren, Carl Johan
By organisation
Mathematics and Applied MathematicsFaculty of Science & Engineering
In the same journal
Combinatorics, probability & computing
Discrete Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 11 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 19 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf