Seat arrangement problems
© 2016 by the Mathematical Association of Thailand. All rights reserved. Let there be n students, and n row seats. For n days, a seat is arranged for each student on each day, and each student is required to sit on different seat on each of the n days. Also for these n days, it is required that each...
Saved in:
Main Authors: | , |
---|---|
Format: | Journal |
Published: |
2018
|
Subjects: | |
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84985905527&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/55941 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
id |
th-cmuir.6653943832-55941 |
---|---|
record_format |
dspace |
spelling |
th-cmuir.6653943832-559412018-09-05T03:06:13Z Seat arrangement problems Vites Longani Hatairat Yingtaweesittikul Mathematics © 2016 by the Mathematical Association of Thailand. All rights reserved. Let there be n students, and n row seats. For n days, a seat is arranged for each student on each day, and each student is required to sit on different seat on each of the n days. Also for these n days, it is required that each student shall has one chance to sit next to every other (n-1) students on one of his side, and shall has one chance to sit next to every other (n-1) students on the other one of his side. In this paper, we provide sufficient conditions and an algorithm for the arrangements. 2018-09-05T03:06:13Z 2018-09-05T03:06:13Z 2016-08-01 Journal 16860209 2-s2.0-84985905527 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84985905527&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/55941 |
institution |
Chiang Mai University |
building |
Chiang Mai University Library |
country |
Thailand |
collection |
CMU Intellectual Repository |
topic |
Mathematics |
spellingShingle |
Mathematics Vites Longani Hatairat Yingtaweesittikul Seat arrangement problems |
description |
© 2016 by the Mathematical Association of Thailand. All rights reserved. Let there be n students, and n row seats. For n days, a seat is arranged for each student on each day, and each student is required to sit on different seat on each of the n days. Also for these n days, it is required that each student shall has one chance to sit next to every other (n-1) students on one of his side, and shall has one chance to sit next to every other (n-1) students on the other one of his side. In this paper, we provide sufficient conditions and an algorithm for the arrangements. |
format |
Journal |
author |
Vites Longani Hatairat Yingtaweesittikul |
author_facet |
Vites Longani Hatairat Yingtaweesittikul |
author_sort |
Vites Longani |
title |
Seat arrangement problems |
title_short |
Seat arrangement problems |
title_full |
Seat arrangement problems |
title_fullStr |
Seat arrangement problems |
title_full_unstemmed |
Seat arrangement problems |
title_sort |
seat arrangement problems |
publishDate |
2018 |
url |
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84985905527&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/55941 |
_version_ |
1681424599315644416 |