{"id":"https://openalex.org/W7162506486","doi":"https://doi.org/10.4230/lipics.socg.2026.2","title":"On the Maximum Number of Tangencies Among 1-Intersecting Curves","display_name":"On the Maximum Number of Tangencies Among 1-Intersecting Curves","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7162506486","doi":"https://doi.org/10.4230/lipics.socg.2026.2"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25808","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.2","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.2/LIPIcs.SoCG.2026.2.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.2/LIPIcs.SoCG.2026.2.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073351768","display_name":"Eyal Ackerman","orcid":"https://orcid.org/0000-0002-2912-7772"},"institutions":[{"id":"https://openalex.org/I107326029","display_name":"Oranim Academic College of Education","ror":"https://ror.org/01539v588","country_code":"IL","type":"education","lineage":["https://openalex.org/I107326029"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Ackerman, Eyal","raw_affiliation_strings":["Department of Mathematics, Physics and Computer Science, University of Haifa at Oranim, Israel"],"raw_orcid":"https://orcid.org/0000-0002-2912-7772","affiliations":[{"raw_affiliation_string":"Department of Mathematics, Physics and Computer Science, University of Haifa at Oranim, Israel","institution_ids":["https://openalex.org/I107326029"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077727901","display_name":"Bal\u00e1zs Keszegh","orcid":"https://orcid.org/0000-0002-3839-5103"},"institutions":[{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]},{"id":"https://openalex.org/I127817813","display_name":"Alfr\u00e9d R\u00e9nyi Institute of Mathematics","ror":"https://ror.org/03vw74f64","country_code":"HU","type":"facility","lineage":["https://openalex.org/I127817813","https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Keszegh, Bal\u00e1zs","raw_affiliation_strings":["HUN-REN Alfr\u00e9d R\u00e9nyi Institute of Mathematics, Budapest, Hungary","ELTE E\u00f6tv\u00f6s Lor\u00e1nd University, Budapest, Hungary"],"raw_orcid":"https://orcid.org/0000-0002-3839-5103","affiliations":[{"raw_affiliation_string":"HUN-REN Alfr\u00e9d R\u00e9nyi Institute of Mathematics, Budapest, Hungary","institution_ids":["https://openalex.org/I127817813"]},{"raw_affiliation_string":"ELTE E\u00f6tv\u00f6s Lor\u00e1nd University, Budapest, Hungary","institution_ids":["https://openalex.org/I106118109"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.70607287,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"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.4472000002861023,"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.4472000002861023,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.13210000097751617,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12069","display_name":"Commutative Algebra and Its Applications","score":0.0697999969124794,"subfield":{"id":"https://openalex.org/subfields/2602","display_name":"Algebra and Number Theory"},"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/conjecture","display_name":"Conjecture","score":0.7509999871253967},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.704200029373169},{"id":"https://openalex.org/keywords/tangent","display_name":"Tangent","score":0.5823000073432922},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4887999892234802},{"id":"https://openalex.org/keywords/zero","display_name":"Zero (linguistics)","score":0.257999986410141}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.753600001335144},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.7509999871253967},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.704200029373169},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.647599995136261},{"id":"https://openalex.org/C138187205","wikidata":"https://www.wikidata.org/wiki/Q131251","display_name":"Tangent","level":2,"score":0.5823000073432922},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4887999892234802},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.29159998893737793},{"id":"https://openalex.org/C2780813799","wikidata":"https://www.wikidata.org/wiki/Q3274237","display_name":"Zero (linguistics)","level":2,"score":0.257999986410141},{"id":"https://openalex.org/C2992444157","wikidata":"https://www.wikidata.org/wiki/Q775079","display_name":"Single point","level":3,"score":0.24089999496936798},{"id":"https://openalex.org/C126875415","wikidata":"https://www.wikidata.org/wiki/Q203425","display_name":"Unit circle","level":2,"score":0.23010000586509705}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25808","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.2","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.2/LIPIcs.SoCG.2026.2.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.socg.2026.2","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.socg.2026.2","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25808","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.2","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.2/LIPIcs.SoCG.2026.2.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7162506486.pdf","grobid_xml":"https://content.openalex.org/works/W7162506486.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"According":[0],"to":[1,95],"a":[2,34,103,132,156,168,173],"conjecture":[3,38],"of":[4,14,22,68,77,107,140,150,159,175,182],"Pach,":[5],"there":[6],"are":[7,118],"O(n)":[8],"tangent":[9],"pairs":[10],"among":[11],"any":[12],"family":[13],"n":[15],"Jordan":[16],"arcs":[17,23,32,78,117],"in":[18,70],"which":[19,171],"every":[20,75],"pair":[21,76,121],"has":[24,79],"precisely":[25],"one":[26,82],"common":[27,35,83,133],"point":[28],"and":[29,92,97,126,161,177,179],"no":[30],"three":[31],"share":[33],"point.":[36,84],"This":[37,58],"was":[39],"proved":[40],"for":[41,46,89,110],"two":[42],"special":[43],"cases,":[44],"however,":[45],"the":[47,50,61,66,71,87,90,116,137,148,164],"general":[48],"case":[49,73],"currently":[51],"best":[52,62],"upper":[53],"bound":[54,64,158],"is":[55,59,142,152],"only":[56],"O(n^{7/4}).":[57],"also":[60,101],"known":[63],"on":[65,131],"number":[67,139,149],"tangencies":[69,141,151],"relaxed":[72],"where":[74],"at":[80,123],"most":[81,124],"We":[85,100],"improve":[86],"bounds":[88],"latter":[91],"former":[93],"cases":[94],"O(n^{5/3})":[96],"O(n^{3/2}),":[98],"respectively.":[99],"consider":[102],"few":[104],"other":[105],"variants":[106],"these":[108],"questions,":[109],"example,":[111],"we":[112,166],"show":[113],"that":[114],"if":[115],"x-monotone,":[119],"each":[120],"intersects":[122],"once":[125],"their":[127],"left":[128],"endpoints":[129],"lie":[130],"vertical":[134],"line,":[135],"then":[136],"maximum":[138],"\u0398(n^{4/3}).":[143],"Without":[144],"this":[145],"last":[146],"condition":[147],"O(n^{4/3}(log":[153],"n)^{1/3}),":[154],"improving":[155],"previous":[157],"Pach":[160],"Sharir.":[162],"Along":[163],"way":[165],"prove":[167],"graph-theoretic":[169],"theorem":[170],"extends":[172],"result":[174],"Erd\u0151s":[176],"Simonovits":[178],"may":[180],"be":[181],"independent":[183],"interest.":[184]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-28T00:00:00"}