Impartial avoidance and achievement games for generating symmetric and alternating groups
We study two impartial games introduced by Anderson and Harary. Both games are played by two players who alternately select previously-unselected elements of a finite group. The first player who builds a generating set from the jointly-selected elements wins the first game. The first player who cann...
Gespeichert in:
Veröffentlicht in: | arXiv.org 2016-07 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | arXiv.org |
container_volume | |
creator | Benesh, Bret J Ernst, Dana C Sieben, Nandor |
description | We study two impartial games introduced by Anderson and Harary. Both games are played by two players who alternately select previously-unselected elements of a finite group. The first player who builds a generating set from the jointly-selected elements wins the first game. The first player who cannot select an element without building a generating set loses the second game. We determine the nim-numbers, and therefore the outcomes, of these games for symmetric and alternating groups. |
format | Article |
fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2078969830</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2078969830</sourcerecordid><originalsourceid>FETCH-proquest_journals_20789698303</originalsourceid><addsrcrecordid>eNqNi0sKwjAUAIMgWLR3CLguxMT-1qLo3o2r8mhfY0o-NUkL3l6hHsDVLGZmRRIuxCGrjpxvSBrCwBjjRcnzXCTkcTMj-KhAU5id6sC2SMF2FNqnwhkN2kglGAy0d55KtOghKitpeBuD0at2yXVEbxcjvZvGsCPrHnTA9Mct2V_O99M1G717TRhiM7jpu-jQcFZWdVFXgon_qg9aYUNQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2078969830</pqid></control><display><type>article</type><title>Impartial avoidance and achievement games for generating symmetric and alternating groups</title><source>Free E- Journals</source><creator>Benesh, Bret J ; Ernst, Dana C ; Sieben, Nandor</creator><creatorcontrib>Benesh, Bret J ; Ernst, Dana C ; Sieben, Nandor</creatorcontrib><description>We study two impartial games introduced by Anderson and Harary. Both games are played by two players who alternately select previously-unselected elements of a finite group. The first player who builds a generating set from the jointly-selected elements wins the first game. The first player who cannot select an element without building a generating set loses the second game. We determine the nim-numbers, and therefore the outcomes, of these games for symmetric and alternating groups.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Games</subject><ispartof>arXiv.org, 2016-07</ispartof><rights>2016. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>776,780</link.rule.ids></links><search><creatorcontrib>Benesh, Bret J</creatorcontrib><creatorcontrib>Ernst, Dana C</creatorcontrib><creatorcontrib>Sieben, Nandor</creatorcontrib><title>Impartial avoidance and achievement games for generating symmetric and alternating groups</title><title>arXiv.org</title><description>We study two impartial games introduced by Anderson and Harary. Both games are played by two players who alternately select previously-unselected elements of a finite group. The first player who builds a generating set from the jointly-selected elements wins the first game. The first player who cannot select an element without building a generating set loses the second game. We determine the nim-numbers, and therefore the outcomes, of these games for symmetric and alternating groups.</description><subject>Games</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNqNi0sKwjAUAIMgWLR3CLguxMT-1qLo3o2r8mhfY0o-NUkL3l6hHsDVLGZmRRIuxCGrjpxvSBrCwBjjRcnzXCTkcTMj-KhAU5id6sC2SMF2FNqnwhkN2kglGAy0d55KtOghKitpeBuD0at2yXVEbxcjvZvGsCPrHnTA9Mct2V_O99M1G717TRhiM7jpu-jQcFZWdVFXgon_qg9aYUNQ</recordid><startdate>20160714</startdate><enddate>20160714</enddate><creator>Benesh, Bret J</creator><creator>Ernst, Dana C</creator><creator>Sieben, Nandor</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20160714</creationdate><title>Impartial avoidance and achievement games for generating symmetric and alternating groups</title><author>Benesh, Bret J ; Ernst, Dana C ; Sieben, Nandor</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_20789698303</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Games</topic><toplevel>online_resources</toplevel><creatorcontrib>Benesh, Bret J</creatorcontrib><creatorcontrib>Ernst, Dana C</creatorcontrib><creatorcontrib>Sieben, Nandor</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Benesh, Bret J</au><au>Ernst, Dana C</au><au>Sieben, Nandor</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Impartial avoidance and achievement games for generating symmetric and alternating groups</atitle><jtitle>arXiv.org</jtitle><date>2016-07-14</date><risdate>2016</risdate><eissn>2331-8422</eissn><abstract>We study two impartial games introduced by Anderson and Harary. Both games are played by two players who alternately select previously-unselected elements of a finite group. The first player who builds a generating set from the jointly-selected elements wins the first game. The first player who cannot select an element without building a generating set loses the second game. We determine the nim-numbers, and therefore the outcomes, of these games for symmetric and alternating groups.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | EISSN: 2331-8422 |
ispartof | arXiv.org, 2016-07 |
issn | 2331-8422 |
language | eng |
recordid | cdi_proquest_journals_2078969830 |
source | Free E- Journals |
subjects | Games |
title | Impartial avoidance and achievement games for generating symmetric and alternating groups |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T21%3A29%3A16IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Impartial%20avoidance%20and%20achievement%20games%20for%20generating%20symmetric%20and%20alternating%20groups&rft.jtitle=arXiv.org&rft.au=Benesh,%20Bret%20J&rft.date=2016-07-14&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2078969830%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2078969830&rft_id=info:pmid/&rfr_iscdi=true |