A SAT-based Resolution of Lam's Problem
In 1989, computer searches by Lam, Thiel, and Swiercz experimentally resolved Lam's problem from projective geometry\(\unicode{x2014}\)the long-standing problem of determining if a projective plane of order ten exists. Both the original search and an independent verification in 2011 discovered...
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2020-12 |
|---|---|
| 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 | Bright, Curtis Cheung, Kevin K H Stevens, Brett Kotsireas, Ilias Ganesh, Vijay |
| description | In 1989, computer searches by Lam, Thiel, and Swiercz experimentally resolved Lam's problem from projective geometry\(\unicode{x2014}\)the long-standing problem of determining if a projective plane of order ten exists. Both the original search and an independent verification in 2011 discovered no such projective plane. However, these searches were each performed using highly specialized custom-written code and did not produce nonexistence certificates. In this paper, we resolve Lam's problem by translating the problem into Boolean logic and use satisfiability (SAT) solvers to produce nonexistence certificates that can be verified by a third party. Our work uncovered consistency issues in both previous searches\(\unicode{x2014}\)highlighting the difficulty of relying on special-purpose search code for nonexistence results. |
| doi_str_mv | 10.48550/arxiv.2012.04715 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_2012_04715</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2468819422</sourcerecordid><originalsourceid>FETCH-LOGICAL-a955-a18507704ce2b14c8259dc3d98951d2cd3129a21d4fe2e403d83848ad768052b3</originalsourceid><addsrcrecordid>eNotz19LwzAUBfAgCI65D-CTBR_21Jrc5LY3j2X4DwqK9r2kTQod7TKTVfTbOzefzsvhcH6M3QieKULk9yZ8D18ZcAEZV4XAC7YAKUVKCuCKrWLccs4hLwBRLti6TD7KOm1NdDZ5d9GP82Hwu8T3SWWmdUzegm9HN12zy96M0a3-c8nqx4d685xWr08vm7JKjUZMjSDkRcFV56AVqiNAbTtpNWkUFjorBWgDwqregVNcWpKkyNgiJ47QyiW7Pc-eFM0-DJMJP82fpjlpjo27c2Mf_Ofs4qHZ-jnsjp8aUDmR0Een_AUmJUlI</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2468819422</pqid></control><display><type>article</type><title>A SAT-based Resolution of Lam's Problem</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Bright, Curtis ; Cheung, Kevin K H ; Stevens, Brett ; Kotsireas, Ilias ; Ganesh, Vijay</creator><creatorcontrib>Bright, Curtis ; Cheung, Kevin K H ; Stevens, Brett ; Kotsireas, Ilias ; Ganesh, Vijay</creatorcontrib><description>In 1989, computer searches by Lam, Thiel, and Swiercz experimentally resolved Lam's problem from projective geometry\(\unicode{x2014}\)the long-standing problem of determining if a projective plane of order ten exists. Both the original search and an independent verification in 2011 discovered no such projective plane. However, these searches were each performed using highly specialized custom-written code and did not produce nonexistence certificates. In this paper, we resolve Lam's problem by translating the problem into Boolean logic and use satisfiability (SAT) solvers to produce nonexistence certificates that can be verified by a third party. Our work uncovered consistency issues in both previous searches\(\unicode{x2014}\)highlighting the difficulty of relying on special-purpose search code for nonexistence results.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.2012.04715</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Boolean algebra ; Certificates ; Computer Science - Artificial Intelligence ; Computer Science - Discrete Mathematics ; Computer Science - Logic in Computer Science ; Computer Science - Symbolic Computation ; Mathematics - Combinatorics ; Projective geometry ; Searching</subject><ispartof>arXiv.org, 2020-12</ispartof><rights>2020. 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><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</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>228,230,776,780,881,27904</link.rule.ids><backlink>$$Uhttps://doi.org/10.48550/arXiv.2012.04715$$DView paper in arXiv$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.1609/aaai.v35i5.16483$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink></links><search><creatorcontrib>Bright, Curtis</creatorcontrib><creatorcontrib>Cheung, Kevin K H</creatorcontrib><creatorcontrib>Stevens, Brett</creatorcontrib><creatorcontrib>Kotsireas, Ilias</creatorcontrib><creatorcontrib>Ganesh, Vijay</creatorcontrib><title>A SAT-based Resolution of Lam's Problem</title><title>arXiv.org</title><description>In 1989, computer searches by Lam, Thiel, and Swiercz experimentally resolved Lam's problem from projective geometry\(\unicode{x2014}\)the long-standing problem of determining if a projective plane of order ten exists. Both the original search and an independent verification in 2011 discovered no such projective plane. However, these searches were each performed using highly specialized custom-written code and did not produce nonexistence certificates. In this paper, we resolve Lam's problem by translating the problem into Boolean logic and use satisfiability (SAT) solvers to produce nonexistence certificates that can be verified by a third party. Our work uncovered consistency issues in both previous searches\(\unicode{x2014}\)highlighting the difficulty of relying on special-purpose search code for nonexistence results.</description><subject>Boolean algebra</subject><subject>Certificates</subject><subject>Computer Science - Artificial Intelligence</subject><subject>Computer Science - Discrete Mathematics</subject><subject>Computer Science - Logic in Computer Science</subject><subject>Computer Science - Symbolic Computation</subject><subject>Mathematics - Combinatorics</subject><subject>Projective geometry</subject><subject>Searching</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><sourceid>GOX</sourceid><recordid>eNotz19LwzAUBfAgCI65D-CTBR_21Jrc5LY3j2X4DwqK9r2kTQod7TKTVfTbOzefzsvhcH6M3QieKULk9yZ8D18ZcAEZV4XAC7YAKUVKCuCKrWLccs4hLwBRLti6TD7KOm1NdDZ5d9GP82Hwu8T3SWWmdUzegm9HN12zy96M0a3-c8nqx4d685xWr08vm7JKjUZMjSDkRcFV56AVqiNAbTtpNWkUFjorBWgDwqregVNcWpKkyNgiJ47QyiW7Pc-eFM0-DJMJP82fpjlpjo27c2Mf_Ofs4qHZ-jnsjp8aUDmR0Een_AUmJUlI</recordid><startdate>20201208</startdate><enddate>20201208</enddate><creator>Bright, Curtis</creator><creator>Cheung, Kevin K H</creator><creator>Stevens, Brett</creator><creator>Kotsireas, Ilias</creator><creator>Ganesh, Vijay</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><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20201208</creationdate><title>A SAT-based Resolution of Lam's Problem</title><author>Bright, Curtis ; Cheung, Kevin K H ; Stevens, Brett ; Kotsireas, Ilias ; Ganesh, Vijay</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a955-a18507704ce2b14c8259dc3d98951d2cd3129a21d4fe2e403d83848ad768052b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Boolean algebra</topic><topic>Certificates</topic><topic>Computer Science - Artificial Intelligence</topic><topic>Computer Science - Discrete Mathematics</topic><topic>Computer Science - Logic in Computer Science</topic><topic>Computer Science - Symbolic Computation</topic><topic>Mathematics - Combinatorics</topic><topic>Projective geometry</topic><topic>Searching</topic><toplevel>online_resources</toplevel><creatorcontrib>Bright, Curtis</creatorcontrib><creatorcontrib>Cheung, Kevin K H</creatorcontrib><creatorcontrib>Stevens, Brett</creatorcontrib><creatorcontrib>Kotsireas, Ilias</creatorcontrib><creatorcontrib>Ganesh, Vijay</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</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><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Bright, Curtis</au><au>Cheung, Kevin K H</au><au>Stevens, Brett</au><au>Kotsireas, Ilias</au><au>Ganesh, Vijay</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A SAT-based Resolution of Lam's Problem</atitle><jtitle>arXiv.org</jtitle><date>2020-12-08</date><risdate>2020</risdate><eissn>2331-8422</eissn><abstract>In 1989, computer searches by Lam, Thiel, and Swiercz experimentally resolved Lam's problem from projective geometry\(\unicode{x2014}\)the long-standing problem of determining if a projective plane of order ten exists. Both the original search and an independent verification in 2011 discovered no such projective plane. However, these searches were each performed using highly specialized custom-written code and did not produce nonexistence certificates. In this paper, we resolve Lam's problem by translating the problem into Boolean logic and use satisfiability (SAT) solvers to produce nonexistence certificates that can be verified by a third party. Our work uncovered consistency issues in both previous searches\(\unicode{x2014}\)highlighting the difficulty of relying on special-purpose search code for nonexistence results.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.2012.04715</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2020-12 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_arxiv_primary_2012_04715 |
| source | arXiv.org; Free E- Journals |
| subjects | Boolean algebra Certificates Computer Science - Artificial Intelligence Computer Science - Discrete Mathematics Computer Science - Logic in Computer Science Computer Science - Symbolic Computation Mathematics - Combinatorics Projective geometry Searching |
| title | A SAT-based Resolution of Lam's Problem |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-28T07%3A37%3A29IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20SAT-based%20Resolution%20of%20Lam's%20Problem&rft.jtitle=arXiv.org&rft.au=Bright,%20Curtis&rft.date=2020-12-08&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.2012.04715&rft_dat=%3Cproquest_arxiv%3E2468819422%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2468819422&rft_id=info:pmid/&rfr_iscdi=true |