Seat Arrangement Problems

Vites Longani, Hatairat Yingtaweesittikul

Abstract


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.

Full Text: PDF

Refbacks

  • There are currently no refbacks.


The Thai Journal of Mathematics organized and supported by The Mathematical Association of Thailand and Thailand Research Council and the Center for Promotion of Mathematical Research of Thailand (CEPMART).

Copyright 2020 by the Mathematical Association of Thailand.

All rights reserve. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, without the prior permission of the Mathematical Association of Thailand.

|ISSN 1686-0209|