A corollary that provides seat arrangements for even numbers of seats

Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/76865

Full metadata record

DC Field	Value	Language
dc.contributor.author	H. Yingtaweesittikul	en_US
dc.contributor.author	V. Longani	en_US
dc.date.accessioned	2022-10-16T07:19:25Z	-
dc.date.available	2022-10-16T07:19:25Z	-
dc.date.issued	2021-02-01	en_US
dc.identifier.issn	22390227	en_US
dc.identifier.issn	11268042	en_US
dc.identifier.other	2-s2.0-85105111372	en_US
dc.identifier.uri	https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85105111372&origin=inward	en_US
dc.identifier.uri	http://cmuir.cmu.ac.th/jspui/handle/6653943832/76865	-
dc.description.abstract	Let 1, 2, 3,..., n be n students and s1, s2, s3,..., sn be n row seats. A seat is arranged for each student on each day of the following n days. It is required that each student shall have different seat every day of the n days. Also, it is required that for these n day every student shall have a chance to sit next to every other student on one of his side and shall have another chance to sit next to every other student on the other of his side. In this paper, it is shown that such arrangements are possible when the number of students is even. Also, an algorithm for such arrangements is provided.	en_US
dc.subject	Mathematics	en_US
dc.title	A corollary that provides seat arrangements for even numbers of seats	en_US
dc.type	Journal	en_US
article.title.sourcetitle	Italian Journal of Pure and Applied Mathematics	en_US
article.stream.affiliations	Chiang Mai University	en_US
Appears in Collections:	CMUL: Journal Articles

Files in This Item:

There are no files associated with this item.