AMNE:(NATURVETENSKAP) AMNE:(Matematik) AMNE:(Diskret matematik)
Search: AMNE:(NATURVETENSKAP) AMNE:(Matematik) AMNE:(Diskret matematik) > Avoidability by Lat...
- 8 of 918
- Previous record
- Next record
- To hitlist
- Andrén, Lina J.,1980-Umeå universitet,Institutionen för matematik och matematisk statistik,Diskret matematik (author)
Avoidability by Latin squares of arrays of even order
- BookEnglish
Publisher, publication year, extent ...
- printrdacarrier
Numbers
- LIBRIS-ID:oai:DiVA.org:umu-36025
- https://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-36025URI
Supplementary language notes
- Language:English
- Summary in:English
Part of subdatabase
- SwePubSwePub
Classification
Notes
- We prove that for any k and any 2k × 2k array A such that no cell in A contains more than k/2550 symbols, and no symbol occurs more than k/2550 times in any row or column, there is a Latin square such that no 2550cell in the Latin square contains a symbol that occurs in the corresponding cell in A. This proves a conjecture of Häggkvist [8] in the special case of arrays with even side.
Subject headings and genre
- NATURVETENSKAP Matematik Diskret matematik hsv//swe
- NATURAL SCIENCES Mathematics Discrete Mathematics hsv//eng
- Latin square
- avoidability
- avoidable array
- Discrete mathematics
- Diskret matematik
- Mathematics
- matematik
Added entries (persons, corporate bodies, meetings, titles ...)
- Umeå universitetInstitutionen för matematik och matematisk statistik (creator_code:org_t)
Internet link
To the university's database
- 8 of 918
- Previous record
- Next record
- To hitlist
Find more in SwePub
- By the author/editor
- Andrén, Lina J., ...
- About the subject
-
- NATURAL SCIENCES
- NATURAL SCIENCES
- and Mathematics
- and Discrete Mathema ...
- By the university
- Umeå University
Search outside SwePub
- Extend your search to:
- Google Book Search
- Google Scholar
Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.
- Copyright © LIBRIS - National Library Systems
- LIBRIS.kb.se
