Desargues theorem, its configurations, and the solution to a long-standing enumeration problem

Desargues theorem, its configurations, and the solution to a long-standing enumeration problem

We solve a long-standing problem by enumerating the number of non-degenerate Desargues configurations. We extend the result to the more difficult case involving Desargues blockline structures in Section 8. A transparent proof of Desargues theorem in the plane and in space is presented as a by-produc...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Bruen, Aiden A, Bruen, Trevor C, McQuillan, James M
Format: Artikel
Sprache:eng
Schlagworte:
Mathematics - Combinatorics
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Bruen, Aiden A
Bruen, Trevor C
McQuillan, James M
description We solve a long-standing problem by enumerating the number of non-degenerate Desargues configurations. We extend the result to the more difficult case involving Desargues blockline structures in Section 8. A transparent proof of Desargues theorem in the plane and in space is presented as a by-product of our methods.
doi_str_mv 10.48550/arxiv.2007.09175
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2007_09175</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2007_09175</sourcerecordid><originalsourceid>FETCH-LOGICAL-a675-e4078fde0bfa54942528583188c161008685835f9f06a8eef9c6a93c53f93f6a3</originalsourceid><addsrcrecordid>eNotj8tOwzAQRb1hgQofwAp_QBPGcezYS1SeUqVuuiaapuNgKbErO0Hw95CW1dV9zEiHsTsBZW2UggdM3_6rrACaEqxo1DX7eKKMqZ8p8-mTYqJxzf2UeReD8_2ccPIx5DXHcFwGPMdhXiI-RY58iKEv8vRX-tBzCvNIlwt-SvEw0HjDrhwOmW7_dcX2L8_7zVux3b2-bx63BepGFVRDY9yR4OBQ1bauVGWUkcKYTmgBYPRilbMONBoiZzuNVnZKOiudRrli95e3Z8D2lPyI6addQNszqPwFddlO2Q</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Desargues theorem, its configurations, and the solution to a long-standing enumeration problem</title><source>arXiv.org</source><creator>Bruen, Aiden A ; Bruen, Trevor C ; McQuillan, James M</creator><creatorcontrib>Bruen, Aiden A ; Bruen, Trevor C ; McQuillan, James M</creatorcontrib><description>We solve a long-standing problem by enumerating the number of non-degenerate Desargues configurations. We extend the result to the more difficult case involving Desargues blockline structures in Section 8. A transparent proof of Desargues theorem in the plane and in space is presented as a by-product of our methods.</description><identifier>DOI: 10.48550/arxiv.2007.09175</identifier><language>eng</language><subject>Mathematics - Combinatorics</subject><creationdate>2020-07</creationdate><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,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2007.09175$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2007.09175$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Bruen, Aiden A</creatorcontrib><creatorcontrib>Bruen, Trevor C</creatorcontrib><creatorcontrib>McQuillan, James M</creatorcontrib><title>Desargues theorem, its configurations, and the solution to a long-standing enumeration problem</title><description>We solve a long-standing problem by enumerating the number of non-degenerate Desargues configurations. We extend the result to the more difficult case involving Desargues blockline structures in Section 8. A transparent proof of Desargues theorem in the plane and in space is presented as a by-product of our methods.</description><subject>Mathematics - Combinatorics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj8tOwzAQRb1hgQofwAp_QBPGcezYS1SeUqVuuiaapuNgKbErO0Hw95CW1dV9zEiHsTsBZW2UggdM3_6rrACaEqxo1DX7eKKMqZ8p8-mTYqJxzf2UeReD8_2ccPIx5DXHcFwGPMdhXiI-RY58iKEv8vRX-tBzCvNIlwt-SvEw0HjDrhwOmW7_dcX2L8_7zVux3b2-bx63BepGFVRDY9yR4OBQ1bauVGWUkcKYTmgBYPRilbMONBoiZzuNVnZKOiudRrli95e3Z8D2lPyI6addQNszqPwFddlO2Q</recordid><startdate>20200717</startdate><enddate>20200717</enddate><creator>Bruen, Aiden A</creator><creator>Bruen, Trevor C</creator><creator>McQuillan, James M</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20200717</creationdate><title>Desargues theorem, its configurations, and the solution to a long-standing enumeration problem</title><author>Bruen, Aiden A ; Bruen, Trevor C ; McQuillan, James M</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a675-e4078fde0bfa54942528583188c161008685835f9f06a8eef9c6a93c53f93f6a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Mathematics - Combinatorics</topic><toplevel>online_resources</toplevel><creatorcontrib>Bruen, Aiden A</creatorcontrib><creatorcontrib>Bruen, Trevor C</creatorcontrib><creatorcontrib>McQuillan, James M</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Bruen, Aiden A</au><au>Bruen, Trevor C</au><au>McQuillan, James M</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Desargues theorem, its configurations, and the solution to a long-standing enumeration problem</atitle><date>2020-07-17</date><risdate>2020</risdate><abstract>We solve a long-standing problem by enumerating the number of non-degenerate Desargues configurations. We extend the result to the more difficult case involving Desargues blockline structures in Section 8. A transparent proof of Desargues theorem in the plane and in space is presented as a by-product of our methods.</abstract><doi>10.48550/arxiv.2007.09175</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2007.09175
ispartof
issn
language eng
recordid cdi_arxiv_primary_2007_09175
source arXiv.org
subjects Mathematics - Combinatorics
title Desargues theorem, its configurations, and the solution to a long-standing enumeration 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-04T02%3A33%3A59IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Desargues%20theorem,%20its%20configurations,%20and%20the%20solution%20to%20a%20long-standing%20enumeration%20problem&rft.au=Bruen,%20Aiden%20A&rft.date=2020-07-17&rft_id=info:doi/10.48550/arxiv.2007.09175&rft_dat=%3Carxiv_GOX%3E2007_09175%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true