{"id":"https://openalex.org/W7166806687","doi":"https://doi.org/10.4230/lipics.icalp.2026.145","title":"Inapproximability of Counting Permutation Patterns","display_name":"Inapproximability of Counting Permutation Patterns","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7166806687","doi":"https://doi.org/10.4230/lipics.icalp.2026.145"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26534","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.145","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.145/LIPIcs.ICALP.2026.145.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","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":"conference-paper","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.145/LIPIcs.ICALP.2026.145.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006649123","display_name":"Michal Opler","orcid":"https://orcid.org/0000-0002-4389-5807"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Opler, Michal","raw_affiliation_strings":["Faculty of Information Technology, Czech Technical University in Prague, Czech Republic"],"raw_orcid":"https://orcid.org/0000-0002-4389-5807","affiliations":[{"raw_affiliation_string":"Faculty of Information Technology, Czech Technical University in Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5006649123"],"corresponding_institution_ids":["https://openalex.org/I44504214"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"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":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.659500002861023},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.6299999952316284},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5795000195503235},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.5127000212669373},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.506600022315979},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4438999891281128},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.396699994802475},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.3910999894142151},{"id":"https://openalex.org/keywords/independence","display_name":"Independence (probability theory)","score":0.36480000615119934}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7821999788284302},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.659500002861023},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6414999961853027},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.6299999952316284},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5795000195503235},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.5127000212669373},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.506600022315979},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49889999628067017},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4438999891281128},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4146000146865845},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.396699994802475},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.3910999894142151},{"id":"https://openalex.org/C35651441","wikidata":"https://www.wikidata.org/wiki/Q625303","display_name":"Independence (probability theory)","level":2,"score":0.36480000615119934},{"id":"https://openalex.org/C200985842","wikidata":"https://www.wikidata.org/wiki/Q3375503","display_name":"Random permutation","level":3,"score":0.3643999993801117},{"id":"https://openalex.org/C64731005","wikidata":"https://www.wikidata.org/wiki/Q333464","display_name":"Analysis of algorithms","level":2,"score":0.35109999775886536},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.32499998807907104},{"id":"https://openalex.org/C102366305","wikidata":"https://www.wikidata.org/wiki/Q1097688","display_name":"Nonparametric statistics","level":2,"score":0.319599986076355},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.31439998745918274},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.31150001287460327},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.2944999933242798},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.2815999984741211},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.27950000762939453},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.26899999380111694},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.265500009059906},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.2581000030040741}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26534","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.145","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.145/LIPIcs.ICALP.2026.145.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","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.icalp.2026.145","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2026.145","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"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:26534","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.145","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.145/LIPIcs.ICALP.2026.145.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","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":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7166806687.pdf","grobid_xml":"https://content.openalex.org/works/W7166806687.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Detecting":[0],"and":[1,20,27,43,66,90,116,122,151,157,217],"counting":[2,44,102,153,161,167],"copies":[3,46,193],"of":[4,16,47,98,129,136,192,194],"permutation":[5],"patterns":[6,97,128],"are":[7],"fundamental":[8],"algorithmic":[9,32],"problems,":[10],"with":[11],"applications":[12],"in":[13,39,52,75,143,168,183,235],"the":[14,45,70,82,137,190,209,218,222],"analysis":[15],"rankings,":[17],"nonparametric":[18],"statistics,":[19],"property":[21],"testing":[22],"tasks":[23],"such":[24],"as":[25,229],"independence":[26],"quasirandomness":[28],"testing.":[29],"From":[30],"an":[31,230,241],"perspective,":[33],"there":[34],"is":[35,103,162,226],"a":[36,48,53,59,134,147,195,199],"sharp":[37],"difference":[38],"complexity":[40,113],"between":[41,149],"detecting":[42],"given":[49],"length-k":[50,196],"pattern":[51,138,197,215,244],"length-n":[54],"permutation.":[55],"The":[56,203],"former":[57],"admits":[58],"2^\ud835\udcaa(k\u00b2)":[60,236],"\u22c5":[61,78,237],"n":[62,238],"time":[63,76,108,184,239],"algorithm":[64,181,242],"(Guillemot":[65],"Marx,":[67,91],"2014)":[68],"while":[69],"latter":[71],"cannot":[72],"be":[73,141,233],"solved":[74],"f(k)":[77],"n^o(k/log":[79,186],"k)":[80,187],"unless":[81],"Exponential":[83],"Time":[84],"Hypothesis":[85],"(ETH)":[86],"fails":[87],"(Berendsohn,":[88],"Kozma,":[89],"2021).":[92],"In":[93],"fact":[94],"already":[95],"for":[96,127,154,213,243],"length":[99,130],"4,":[100],"exact":[101,150,166,214],"unlikely":[104],"to":[105,132],"admit":[106],"near-linear":[107,144],"algorithms":[109],"under":[110,178],"standard":[111],"fine-grained":[112],"assumptions":[114],"(Dudek":[115],"Gawrychowski,":[117],"2020).":[118],"Recently,":[119],"Ben-Eliezer,":[120],"Mitrovi\u0107":[121],"Srivastava":[123],"(2026)":[124],"showed":[125],"that":[126,159],"up":[131],"5,":[133],"(1+\u03b5)-approximation":[135],"count":[139],"can":[140,188,232],"computed":[142,234],"time,":[145],"yielding":[146],"separation":[148],"approximate":[152,160,189],"small":[155],"patterns,":[156],"conjectured":[158],"asymptotically":[163],"easier":[164],"than":[165],"general.":[169],"We":[170],"strongly":[171],"refute":[172],"their":[173],"conjecture":[174],"by":[175],"showing":[176],"that,":[177],"ETH,":[179],"no":[180],"running":[182],"f(k)\u22c5":[185],"number":[191],"within":[198],"multiplicative":[200,223],"factor":[201,225],"n^(1/2-\u03b5)k.":[202],"lower":[204,211],"bound":[205,212,220],"on":[206,221],"runtime":[207],"matches":[208],"conditional":[210],"counting,":[216],"obtained":[219],"error":[224],"essentially":[227],"tight,":[228],"n^{k/2}-approximation":[231],"using":[240],"detection.":[245]},"counts_by_year":[],"updated_date":"2026-07-04T07:58:01.006859","created_date":"2026-07-02T00:00:00"}