{"id":"https://openalex.org/W2140644794","doi":"https://doi.org/10.1017/s0963548302005242","title":"Constructing Large Set Systems with Given Intersection Sizes Modulo Composite Numbers","display_name":"Constructing Large Set Systems with Given Intersection Sizes Modulo Composite Numbers","publication_year":2002,"publication_date":"2002-09-01","ids":{"openalex":"https://openalex.org/W2140644794","doi":"https://doi.org/10.1017/s0963548302005242","mag":"2140644794"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548302005242","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548302005242","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071285569","display_name":"Samuel Kutin","orcid":null},"institutions":[{"id":"https://openalex.org/I55279860","display_name":"L-3 Communications (United States)","ror":"https://ror.org/000nwmh60","country_code":"US","type":"company","lineage":["https://openalex.org/I55279860"]},{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"SAMUEL KUTIN","raw_affiliation_strings":["Center for Communications Research, 805 Bunn Drive, Princeton, NJ 08540, USA (e-mail:","Center for Communications Research, 805 Bunn Drive, Princeton, NJ 08540, USA (e-mail: kutin@idaccr.org)#TAB#"],"affiliations":[{"raw_affiliation_string":"Center for Communications Research, 805 Bunn Drive, Princeton, NJ 08540, USA (e-mail:","institution_ids":["https://openalex.org/I55279860"]},{"raw_affiliation_string":"Center for Communications Research, 805 Bunn Drive, Princeton, NJ 08540, USA (e-mail: kutin@idaccr.org)#TAB#","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5071285569"],"corresponding_institution_ids":["https://openalex.org/I20089843","https://openalex.org/I55279860"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.22336957,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"11","issue":"5","first_page":"475","last_page":"486"},"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.9998999834060669,"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.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9984999895095825,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9983000159263611,"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/modulo","display_name":"Modulo","score":0.7564389109611511},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7130424976348877},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.6938413381576538},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.5928127765655518},{"id":"https://openalex.org/keywords/moduli","display_name":"Moduli","score":0.5401292443275452},{"id":"https://openalex.org/keywords/prime","display_name":"Prime (order theory)","score":0.5274848341941833},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5250850915908813},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4895270764827728},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4411618113517761},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1134164035320282},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07773527503013611}],"concepts":[{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.7564389109611511},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7130424976348877},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.6938413381576538},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.5928127765655518},{"id":"https://openalex.org/C121089165","wikidata":"https://www.wikidata.org/wiki/Q6889796","display_name":"Moduli","level":2,"score":0.5401292443275452},{"id":"https://openalex.org/C184992742","wikidata":"https://www.wikidata.org/wiki/Q7243229","display_name":"Prime (order theory)","level":2,"score":0.5274848341941833},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5250850915908813},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4895270764827728},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4411618113517761},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1134164035320282},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07773527503013611},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"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/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s0963548302005242","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548302005242","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.118.3478","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.118.3478","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uchicago.edu/~kutin/publications/kutin.cpc.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W136017465","https://openalex.org/W1587009930","https://openalex.org/W1986908956","https://openalex.org/W2000118462","https://openalex.org/W2024073594","https://openalex.org/W2030052209","https://openalex.org/W2039991502","https://openalex.org/W2043057494","https://openalex.org/W2054996571","https://openalex.org/W2061684553","https://openalex.org/W2064197162","https://openalex.org/W2069582894","https://openalex.org/W2570179138","https://openalex.org/W2972131259","https://openalex.org/W3175367423"],"related_works":["https://openalex.org/W2117548279","https://openalex.org/W2807449856","https://openalex.org/W2530574867","https://openalex.org/W2177966018","https://openalex.org/W4302423208","https://openalex.org/W3087194925","https://openalex.org/W2467357782","https://openalex.org/W3152691454","https://openalex.org/W4288118777","https://openalex.org/W4324098889"],"abstract_inverted_index":{"We":[0,95,133],"consider":[1],"k":[2,33],"-uniform":[3],"set":[4,55,77,118],"systems":[5,78,150],"over":[6],"a":[7,70,97,102,109,170],"universe":[8],"of":[9,16,20,25,39,46,79,111,114,123,151],"size":[10,15,58,81,152],"n":[11,62,86,89,153],"such":[12,54],"that":[13,52],"the":[14],"each":[17],"pairwise":[18],"intersection":[19],"sets":[21],"lies":[22],"in":[23,37],"one":[24],"s":[26,41,63,159,163],"residue":[27],"classes":[28],"mod":[29],"q":[30,66,92],",":[31,155],"but":[32],"does":[34],"not":[35],"lie":[36],"any":[38,53,144],"these":[40],"classes.":[42],"A":[43],"celebrated":[44],"theorem":[45],"Frankl":[47,112],"and":[48,130],"Wilson":[49],"[8]":[50],"states":[51],"system":[56],"has":[57],"at":[59],"most":[60],"(":[61,158],")":[64,160],"when":[65,91],"is":[67],"prime.":[68],"In":[69],"remarkable":[71],"recent":[72,172],"paper,":[73],"Grolmusz":[74,176],"[9]":[75],"constructed":[76],"superpolynomial":[80],"\u03a9(exp(":[82],"c":[83],"log":[84,88],"2":[85],"/log":[87],"))":[90],"=":[93,161],"6.":[94],"give":[96],"new,":[98],"simpler":[99],"construction":[100,107],"achieving":[101],"slightly":[103],"improved":[104],"bound.":[105],"Our":[106,166],"combines":[108],"technique":[110],"[6]":[113],"\u2018applying":[115],"polynomials":[116,125],"to":[117,139],"systems\u2019":[119],"with":[120,169],"Grolmusz's":[121],"idea":[122],"employing":[124],"introduced":[126],"by":[127,175],"Barrington,":[128],"Beigel":[129],"Rudich":[131],"[5].":[132],"also":[134],"extend":[135],"Frankl's":[136],"original":[137],"argument":[138],"arbitrary":[140],"prime-power":[141],"moduli:":[142],"for":[143],"\u03b5":[145],">":[146],"0,":[147],"we":[148],"construct":[149],"s+g(s)":[154],"where":[156],"g":[157],"\u03a9(":[162],"1\u2212\u03b5":[164],").":[165],"work":[167],"overlaps":[168],"very":[171],"technical":[173],"report":[174],"[10].":[177]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}