{"id":"https://openalex.org/W1925430667","doi":"https://doi.org/10.37236/1540","title":"An Infinite Antichain of Permutations","display_name":"An Infinite Antichain of Permutations","publication_year":2000,"publication_date":"2000-03-02","ids":{"openalex":"https://openalex.org/W1925430667","doi":"https://doi.org/10.37236/1540","mag":"1925430667"},"language":"en","primary_location":{"id":"doi:10.37236/1540","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1540","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v7i1n2/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v7i1n2/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5061644327","display_name":"Daniel A. Spielman","orcid":"https://orcid.org/0000-0002-8958-879X"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Daniel A. Spielman","raw_affiliation_strings":["Department of Mathematics Massachusetts Institute of Technology Cambridge, MA 02139"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics Massachusetts Institute of Technology Cambridge, MA 02139","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083131960","display_name":"Mikl\u00f3s B\u00f3na","orcid":"https://orcid.org/0000-0002-8711-7281"},"institutions":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mikl\u00f3s B\u00f3na","raw_affiliation_strings":["Department of Mathematics University of Florida Gainesville FL 32605"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics University of Florida Gainesville FL 32605","institution_ids":["https://openalex.org/I33213144"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5061644327"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":3.9851,"has_fulltext":true,"cited_by_count":42,"citation_normalized_percentile":{"value":0.93370857,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"7","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9944000244140625,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/antichain","display_name":"Antichain","score":0.9963726997375488},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8451265096664429},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7905405759811401},{"id":"https://openalex.org/keywords/partially-ordered-set","display_name":"Partially ordered set","score":0.5743175745010376},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4976976215839386},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4580182135105133},{"id":"https://openalex.org/keywords/existential-quantification","display_name":"Existential quantification","score":0.44064202904701233},{"id":"https://openalex.org/keywords/infinite-set","display_name":"Infinite set","score":0.41674867272377014},{"id":"https://openalex.org/keywords/finite-set","display_name":"Finite set","score":0.41244810819625854},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.08463945984840393}],"concepts":[{"id":"https://openalex.org/C136134351","wikidata":"https://www.wikidata.org/wiki/Q431937","display_name":"Antichain","level":3,"score":0.9963726997375488},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8451265096664429},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7905405759811401},{"id":"https://openalex.org/C180645754","wikidata":"https://www.wikidata.org/wiki/Q474715","display_name":"Partially ordered set","level":2,"score":0.5743175745010376},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4976976215839386},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4580182135105133},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.44064202904701233},{"id":"https://openalex.org/C199879729","wikidata":"https://www.wikidata.org/wiki/Q205140","display_name":"Infinite set","level":3,"score":0.41674867272377014},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.41244810819625854},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.08463945984840393},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.37236/1540","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1540","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v7i1n2/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.81.9342","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.81.9342","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.combinatorics.org/Volume_7/PDF/v7i1n2.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.37236/1540","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1540","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v7i1n2/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.5,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1925430667.pdf","grobid_xml":"https://content.openalex.org/works/W1925430667.grobid-xml"},"referenced_works_count":11,"referenced_works":["https://openalex.org/W403078265","https://openalex.org/W1514324498","https://openalex.org/W1965142549","https://openalex.org/W1990217961","https://openalex.org/W1998009555","https://openalex.org/W2036952529","https://openalex.org/W2039565992","https://openalex.org/W2067016370","https://openalex.org/W2121231889","https://openalex.org/W2145952441","https://openalex.org/W6630746003"],"related_works":["https://openalex.org/W2013313833","https://openalex.org/W28336341","https://openalex.org/W2111205855","https://openalex.org/W2015816871","https://openalex.org/W1854642140","https://openalex.org/W2056881277","https://openalex.org/W2065333210","https://openalex.org/W1504624230","https://openalex.org/W3213974985","https://openalex.org/W145688658"],"abstract_inverted_index":{"We":[0],"constructively":[1],"prove":[2],"that":[3],"the":[4],"partially":[5],"ordered":[6,11],"set":[7],"of":[8,14,28,32],"finite":[9],"permutations":[10,29],"by":[12],"deletion":[13],"entries":[15],"contains":[16,34],"an":[17,25],"infinite":[18,26],"antichain.":[19],"In":[20],"other":[21],"words,":[22],"there":[23],"exists":[24],"collection":[27],"no":[30],"one":[31],"which":[33],"another":[35],"as":[36],"a":[37],"pattern.":[38]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}