{"id":"https://openalex.org/W2742527365","doi":"https://doi.org/10.37236/7210","title":"A New Upper Bound for Cancellative Pairs","display_name":"A New Upper Bound for Cancellative Pairs","publication_year":2018,"publication_date":"2018-04-27","ids":{"openalex":"https://openalex.org/W2742527365","doi":"https://doi.org/10.37236/7210","mag":"2742527365"},"language":"en","primary_location":{"id":"doi:10.37236/7210","is_oa":true,"landing_page_url":"https://doi.org/10.37236/7210","pdf_url":null,"source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.37236/7210","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039637925","display_name":"Barnab\u00e1s Janzer","orcid":"https://orcid.org/0000-0002-9904-7188"},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Barnab\u00e1s Janzer","raw_affiliation_strings":["University of Cambridge"],"affiliations":[{"raw_affiliation_string":"University of Cambridge","institution_ids":["https://openalex.org/I241749"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5039637925"],"corresponding_institution_ids":["https://openalex.org/I241749"],"apc_list":null,"apc_paid":null,"fwci":2.2379,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.85415365,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"25","issue":"2","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.9997000098228455,"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.9997000098228455,"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/T11151","display_name":"Advanced Topology and Set Theory","score":0.9843999743461609,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"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/T10588","display_name":"Mathematical Dynamics and Fractals","score":0.9819999933242798,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7955194115638733},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7745065689086914},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5913481116294861},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5278912782669067},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5059768557548523},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.354897141456604},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10614174604415894},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.082817941904068}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7955194115638733},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7745065689086914},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5913481116294861},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5278912782669067},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5059768557548523},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.354897141456604},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10614174604415894},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.082817941904068},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.37236/7210","is_oa":true,"landing_page_url":"https://doi.org/10.37236/7210","pdf_url":null,"source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1708.02833","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1708.02833","pdf_url":"https://arxiv.org/pdf/1708.02833","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:www.repository.cam.ac.uk:1810/357573","is_oa":true,"landing_page_url":"https://www.repository.cam.ac.uk/handle/1810/357573","pdf_url":"https://www.repository.cam.ac.uk/bitstreams/df3dfcc6-7511-4e34-9d27-eaf98b1eb736/download","source":{"id":"https://openalex.org/S4306401777","display_name":"Apollo (University of Cambridge)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I241749","host_organization_name":"University of Cambridge","host_organization_lineage":["https://openalex.org/I241749"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"}],"best_oa_location":{"id":"doi:10.37236/7210","is_oa":true,"landing_page_url":"https://doi.org/10.37236/7210","pdf_url":null,"source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1583642092","https://openalex.org/W1888933272","https://openalex.org/W1987305997","https://openalex.org/W2077246013","https://openalex.org/W2106100363","https://openalex.org/W2146586570","https://openalex.org/W2993775463"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W4300899577","https://openalex.org/W3194471551","https://openalex.org/W4375956809","https://openalex.org/W1581373162","https://openalex.org/W1973978937","https://openalex.org/W121594594","https://openalex.org/W2784911598","https://openalex.org/W4287023968","https://openalex.org/W4297950433"],"abstract_inverted_index":{"A":[0],"pair":[1],"$(\\mathcal{A},\\mathcal{B})$":[2],"of":[3,5,7],"families":[4],"subsets":[6],"an":[8],"$n$-element":[9],"set":[10,83],"is":[11,37,57],"called":[12],"cancellative":[13,42],"if":[14],"whenever":[15,26],"$A,A'\\in\\mathcal{A}$":[16],"and":[17,25,28],"$B\\in\\mathcal{B}$":[18],"satisfy":[19,30],"$A\\cup":[20,31],"B=A'\\cup":[21],"B$,":[22],"then":[23,34],"$A=A'$,":[24],"$A\\in\\mathcal{A}$":[27],"$B,B'\\in\\mathcal{B}$":[29],"B=A\\cup":[32],"B'$,":[33],"$B=B'$.":[35],"It":[36],"known":[38,51,75],"that":[39],"there":[40],"exist":[41],"pairs":[43],"with":[44],"$|\\mathcal{A}||\\mathcal{B}|$":[45],"about":[46],"$2.25^n$,":[47],"whereas":[48],"the":[49,73],"best":[50,74],"upper":[52,65,76],"bound":[53,66,77],"on":[54],"this":[55,60,64],"quantity":[56],"$2.3264^n$.":[58],"In":[59],"paper":[61],"we":[62],"improve":[63],"to":[67],"$2.2682^n$.":[68],"Our":[69],"result":[70],"also":[71],"improves":[72],"for":[78,82],"Simonyi's":[79],"sandglass":[80],"conjecture":[81],"systems.":[84]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}