{"id":"https://openalex.org/W7160914626","doi":"https://doi.org/10.48550/arxiv.2605.10778","title":"When Does Sparsity Help for k-Independent Set in Hypergraphs and Other Boolean CSPs?","display_name":"When Does Sparsity Help for k-Independent Set in Hypergraphs and Other Boolean CSPs?","publication_year":2026,"publication_date":"2026-05-11","ids":{"openalex":"https://openalex.org/W7160914626","doi":"https://doi.org/10.48550/arxiv.2605.10778"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.10778","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.10778","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.10778","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5135955772","display_name":"Timo Fritsch","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fritsch, Timo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135920320","display_name":"Marvin K\u00fcnnemann","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"K\u00fcnnemann, Marvin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135942580","display_name":"Mirza Redzic","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Redzic, Mirza","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5045141472","display_name":"Julian Stie\u00df","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stie\u00df, Julian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"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":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.4860999882221222,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.4860999882221222,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.4219000041484833,"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"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.04830000177025795,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/arity","display_name":"Arity","score":0.8870000243186951},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5638999938964844},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5465999841690063},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5458999872207642},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4950999915599823},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.46209999918937683},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.45159998536109924},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4447000026702881},{"id":"https://openalex.org/keywords/logical-matrix","display_name":"Logical matrix","score":0.39489999413490295},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.3935000002384186}],"concepts":[{"id":"https://openalex.org/C110546421","wikidata":"https://www.wikidata.org/wiki/Q1315869","display_name":"Arity","level":2,"score":0.8870000243186951},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6844000220298767},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5638999938964844},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5533999800682068},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5465999841690063},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5458999872207642},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4950999915599823},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.491100013256073},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.46209999918937683},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.45159998536109924},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4447000026702881},{"id":"https://openalex.org/C163561899","wikidata":"https://www.wikidata.org/wiki/Q1994977","display_name":"Logical matrix","level":3,"score":0.39489999413490295},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.3935000002384186},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.36730000376701355},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3671000003814697},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.35269999504089355},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34779998660087585},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.3418999910354614},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.3273000121116638},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.323199987411499},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.30489999055862427},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.29109999537467957},{"id":"https://openalex.org/C136726353","wikidata":"https://www.wikidata.org/wiki/Q903789","display_name":"Disjunctive normal form","level":2,"score":0.28949999809265137},{"id":"https://openalex.org/C4926405","wikidata":"https://www.wikidata.org/wiki/Q3269980","display_name":"Boolean domain","level":5,"score":0.2881999909877777},{"id":"https://openalex.org/C134444547","wikidata":"https://www.wikidata.org/wiki/Q585230","display_name":"Boolean network","level":3,"score":0.2775000035762787},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2768999934196472},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.2736999988555908},{"id":"https://openalex.org/C2780595030","wikidata":"https://www.wikidata.org/wiki/Q3860309","display_name":"Multiplication (music)","level":2,"score":0.27239999175071716},{"id":"https://openalex.org/C55508974","wikidata":"https://www.wikidata.org/wiki/Q190763","display_name":"Venn diagram","level":2,"score":0.26919999718666077},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.2597000002861023},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2538999915122986},{"id":"https://openalex.org/C79772020","wikidata":"https://www.wikidata.org/wiki/Q5159264","display_name":"Conditional independence","level":2,"score":0.2531999945640564},{"id":"https://openalex.org/C184992742","wikidata":"https://www.wikidata.org/wiki/Q7243229","display_name":"Prime (order theory)","level":2,"score":0.2506999969482422},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.25049999356269836}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.10778","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.10778","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.10778","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.10778","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Consider":[0],"the":[1,19,24,27,30,39,87,96,111,115,126,149,163,184,188,225,242,250],"fundamental":[2],"task":[3],"of":[4,8,26,32,114,129,132,139,151,162,165,171,187,198,208,252],"finding":[5,130],"independent":[6],"sets":[7],"(constant)":[9,133],"size":[10,134],"$k$":[11,73,135],"in":[12,121,136,247],"a":[13,61,104,179,195,205,214,220],"given":[14],"$n$-node":[15],"hypergraph.":[16],"How":[17],"is":[18,41,78,178,219,227],"time":[20,67,107,127,197,236,256],"complexity":[21,128,257],"affected":[22],"by":[23,75],"sparsity":[25,166],"input,":[28],"i.e.,":[29],"number":[31,150],"hyperedges":[33],"$m$?":[34],"Tur\u00e1n's":[35],"theorem":[36],"implies":[37],"that":[38,50,212,224],"problem":[40,226],"trivial":[42,228],"if":[43,53],"$m=O(n^{2-\u03b5})$":[44],"for":[45,55,82,167,183,229,239],"some":[46,56],"$\u03b5>":[47],"0$.":[48],"Above":[49],"threshold":[51,221],"(i.e.,":[52],"$m=\u0398(n^\u03b3)$":[54],"$\u03b3\\ge":[57,84],"2$),":[58],"we":[59,102,124,203],"give":[60],"perhaps":[62],"surprising":[63],"algorithm":[64,182],"with":[65,194],"running":[66,196,235],"$O\\left(\\min\\left\\{n^{\\frac\u03c9{3}k}":[68],"+":[69],"m^{k/3},":[70],"n^k\\right\\}\\right)$":[71],"(for":[72],"divisible":[74],"3),":[76],"which":[77],"essentially":[79,159,233],"conditionally":[80,180],"optimal":[81],"all":[83],"2$,":[85],"assuming":[86,241],"$k$-clique":[88],"and":[89,146,153,191],"3-uniform":[90,243],"hyperclique":[91,244],"hypotheses":[92],"(here,":[93],"$\u03c9<2.372$":[94],"denotes":[95],"matrix":[97],"multiplication":[98],"exponent).":[99],"In":[100],"fact,":[101],"obtain":[103],"more":[105,122],"detailed":[106],"complexity,":[108],"sensitive":[109],"to":[110],"arity":[112],"distribution":[113],"hyperedges.":[116],"To":[117],"study":[118,125],"such":[119,223],"phenomena":[120],"generality,":[123],"solutions":[131],"sparse":[137],"instances":[138],"Boolean":[140,168],"constraint":[141,169,209,260],"satisfaction":[142],"problems,":[143],"where":[144],"$n$":[145],"$m$":[147],"denote":[148],"variables":[152],"constraints.":[154],"Our":[155],"results":[156],"include":[157],"an":[158],"full":[160],"classification":[161],"influence":[164],"families":[170,210],"binary":[172,189],"arity.":[173],"Of":[174],"particular":[175],"technical":[176],"interest":[177],"tight":[181],"family":[185],"consisting":[186],"NAND":[190],"Implication":[192],"constraints,":[193],"$\u0398(m^{\u03c9k/6":[199],"\\pm":[200],"c})$.":[201],"Further,":[202],"identify":[204],"large":[206],"class":[207],"$F$":[211],"exhibits":[213],"sharp":[215],"phase":[216],"transition:":[217],"there":[218],"$\u03b3_F$":[222],"$m=O(n^{\u03b3_F-\u03b5})$,":[230],"but":[231],"requires":[232],"brute-force":[234],"$\u0398(n^{k\\pm":[237],"c})$":[238],"$m=\u03a9(n^{\u03b3_F})$,":[240],"hypothesis.":[245],"Notably,":[246],"many":[248],"cases":[249],"combination":[251],"constraints":[253],"display":[254],"higher":[255],"than":[258],"either":[259],"alone.":[261]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-05-13T00:00:00"}