{"id":"https://openalex.org/W2619090478","doi":"https://doi.org/10.37236/7629","title":"Powerful Sets: a Generalisation of Binary Matroids","display_name":"Powerful Sets: a Generalisation of Binary Matroids","publication_year":2018,"publication_date":"2018-09-07","ids":{"openalex":"https://openalex.org/W2619090478","doi":"https://doi.org/10.37236/7629","mag":"2619090478"},"language":"en","primary_location":{"id":"doi:10.37236/7629","is_oa":true,"landing_page_url":"https://doi.org/10.37236/7629","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":"preprint","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.37236/7629","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005637509","display_name":"Graham Farr","orcid":null},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]},{"id":"https://openalex.org/I2801239119","display_name":"Australian Regenerative Medicine Institute","ror":"https://ror.org/02qa5kg76","country_code":"AU","type":"facility","lineage":["https://openalex.org/I2801037857","https://openalex.org/I2801239119","https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Graham E. Farr","raw_affiliation_strings":["Monash University","Monash#N#        University"],"affiliations":[{"raw_affiliation_string":"Monash University","institution_ids":["https://openalex.org/I2801239119","https://openalex.org/I56590836"]},{"raw_affiliation_string":"Monash#N#        University","institution_ids":["https://openalex.org/I56590836"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052413713","display_name":"Andrew Y. Z. Wang","orcid":"https://orcid.org/0000-0001-9915-9019"},"institutions":[{"id":"https://openalex.org/I150229711","display_name":"University of Electronic Science and Technology of China","ror":"https://ror.org/04qr3zq92","country_code":"CN","type":"education","lineage":["https://openalex.org/I150229711"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Andrew Y.Z. Wang","raw_affiliation_strings":["University of Electronic Science and Technology of China","University of Electronic science and technology of China"],"affiliations":[{"raw_affiliation_string":"University of Electronic Science and Technology of China","institution_ids":["https://openalex.org/I150229711"]},{"raw_affiliation_string":"University of Electronic science and technology of China","institution_ids":["https://openalex.org/I150229711"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5005637509"],"corresponding_institution_ids":["https://openalex.org/I2801239119","https://openalex.org/I56590836"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00474841,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"25","issue":"3","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11130","display_name":"Coding theory and cryptography","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11797","display_name":"graph theory and CDMA systems","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9868999719619751,"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/matroid","display_name":"Matroid","score":0.7461508512496948},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7164825201034546},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6323661804199219},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5669904351234436},{"id":"https://openalex.org/keywords/power-set","display_name":"Power set","score":0.521037757396698},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5153507590293884},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5094166398048401},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.4973333179950714},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.46545106172561646},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.46489018201828003},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.45277905464172363},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.149727463722229},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.07740569114685059}],"concepts":[{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.7461508512496948},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7164825201034546},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6323661804199219},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5669904351234436},{"id":"https://openalex.org/C100643331","wikidata":"https://www.wikidata.org/wiki/Q205170","display_name":"Power set","level":3,"score":0.521037757396698},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5153507590293884},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5094166398048401},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.4973333179950714},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.46545106172561646},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.46489018201828003},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.45277905464172363},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.149727463722229},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.07740569114685059},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.37236/7629","is_oa":true,"landing_page_url":"https://doi.org/10.37236/7629","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:1705.07437","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1705.07437","pdf_url":"https://arxiv.org/pdf/1705.07437","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":"","raw_type":"text"},{"id":"mag:2619090478","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1705.07437.pdf","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:monash.edu:openaire/dbadeb94-bee1-4d4e-a048-0aaf3f29cac6","is_oa":true,"landing_page_url":"https://research.monash.edu/en/publications/dbadeb94-bee1-4d4e-a048-0aaf3f29cac6","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Farr, G E & Wang, A Y Z 2018, 'Powerful sets : a generalisation of binary matroids', The Electronic Journal of Combinatorics, vol. 25, no. 3, #P3.42, pp. 1-20. < https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i3p42/pdf >","raw_type":"article"},{"id":"pmh:oai:monash.edu:publications/dbadeb94-bee1-4d4e-a048-0aaf3f29cac6","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85053255076&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4306402625","display_name":"Monash University Research Portal (Monash University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I56590836","host_organization_name":"Monash University","host_organization_lineage":["https://openalex.org/I56590836"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Farr, G E & Wang, A Y Z 2018, 'Powerful sets : a generalisation of binary matroids', The Electronic Journal of Combinatorics, vol. 25, no. 3, #P3.42, pp. 1-20. < https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i3p42/pdf >","raw_type":"article"},{"id":"doi:10.48550/arxiv.1705.07437","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1705.07437","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.37236/7629","is_oa":true,"landing_page_url":"https://doi.org/10.37236/7629","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":5,"referenced_works":["https://openalex.org/W2028058166","https://openalex.org/W2047371574","https://openalex.org/W2061177592","https://openalex.org/W2503379581","https://openalex.org/W2963963730"],"related_works":["https://openalex.org/W3087666533","https://openalex.org/W3101855747","https://openalex.org/W2116950483","https://openalex.org/W2083563352","https://openalex.org/W2593798505","https://openalex.org/W3022463995","https://openalex.org/W2933218595","https://openalex.org/W2142539551","https://openalex.org/W2123152107","https://openalex.org/W2024584551","https://openalex.org/W2800830545","https://openalex.org/W2756143566","https://openalex.org/W2185382116","https://openalex.org/W1492292801","https://openalex.org/W2078696977","https://openalex.org/W2126293073","https://openalex.org/W2593961314","https://openalex.org/W229605563","https://openalex.org/W2127040598","https://openalex.org/W2140501550"],"abstract_inverted_index":{"A":[0],"set":[1,58,67,70,182],"$S\\subseteq\\{0,1\\}^E$":[2],"of":[3,25,41,50,52,60,62,71,74,88,118,139,158,163,173,188,198],"binary":[4,45,89],"vectors,":[5],"with":[6],"positions":[7,34],"indexed":[8,35],"by":[9,36,185],"$E$,":[10,53],"is":[11,38,64,78,102,109,183,201],"said":[12],"to":[13,104,167],"be":[14],"a":[15,39,57,65,79,116],"powerful":[16,66,80,106,140,165,175,181,199,209],"code":[17],"if,":[18],"for":[19],"all":[20,127,208],"$X\\subseteq":[21],"E$,":[22],"the":[23,33,69,128,136,196],"number":[24,197],"vectors":[26,46,49,73],"in":[27,32,76,124],"$S$":[28,77],"that":[29,56,179,195,206],"are":[30,211],"zero":[31],"$X$":[37],"power":[40],"2.":[42],"By":[43],"treating":[44],"as":[47],"characteristic":[48,72],"subsets":[51,61],"we":[54,134,193],"say":[55],"$S\\subseteq2^E$":[59],"$E$":[63],"if":[68],"sets":[75,83,166,200,210],"code.":[81],"Powerful":[82],"(codes)":[84],"include":[85],"cocircuit":[86],"spaces":[87],"matroids":[90],"(equivalently,":[91],"linear":[92],"codes":[93],"over":[94],"$\\mathbb{F}_2$),":[95],"but":[96],"much":[97],"more":[98],"besides.":[99],"Our":[100],"motivation":[101],"that,":[103],"each":[105],"set,":[107],"there":[108],"an":[110],"associated":[111,156],"nonnegative-integer-valued":[112],"rank":[113,130],"function":[114],"(by":[115],"construction":[117],"Farr),":[119],"although":[120],"it":[121],"does":[122],"not":[123],"general":[125],"satisfy":[126],"matroid":[129],"axioms.In":[131],"this":[132],"paper":[133],"investigate":[135],"combinatorial":[137],"properties":[138],"sets.":[141,176],"We":[142,177],"prove":[143],"fundamental":[144],"results":[145],"on":[146],"special":[147],"elements":[148],"(loops,":[149],"coloops,":[150],"frames,":[151],"near-frames,":[152],"and":[153,171,204],"stars),":[154],"their":[155],"types":[157],"single-element":[159],"extensions,":[160],"various":[161],"ways":[162],"combining":[164],"get":[168],"new":[169],"ones,":[170],"constructions":[172],"nonlinear":[174],"show":[178,194],"every":[180],"determined":[184],"its":[186],"clutter":[187],"minimal":[189],"nonzero":[190],"members.":[191],"Finally,":[192],"doubly":[202],"exponential,":[203],"hence":[205],"almost":[207],"nonlinear.":[212]},"counts_by_year":[],"updated_date":"2026-02-09T09:26:11.010843","created_date":"2025-10-10T00:00:00"}