{"id":"https://openalex.org/W2123754181","doi":"https://doi.org/10.1109/isit.2010.5513542","title":"Existence of new inequalities for representable polymatroids","display_name":"Existence of new inequalities for representable polymatroids","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W2123754181","doi":"https://doi.org/10.1109/isit.2010.5513542","mag":"2123754181"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2010.5513542","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513542","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Information Theory","raw_type":"proceedings-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/A5010336848","display_name":"Terence Chan","orcid":"https://orcid.org/0000-0002-6550-7203"},"institutions":[{"id":"https://openalex.org/I170239107","display_name":"University of South Australia","ror":"https://ror.org/01p93h210","country_code":"AU","type":"education","lineage":["https://openalex.org/I170239107"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Terence Chan","raw_affiliation_strings":["University of South Australia, Australia","Univ. of South Australia, Australia"],"affiliations":[{"raw_affiliation_string":"University of South Australia, Australia","institution_ids":["https://openalex.org/I170239107"]},{"raw_affiliation_string":"Univ. of South Australia, Australia","institution_ids":["https://openalex.org/I170239107"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072485708","display_name":"Alex Grant","orcid":"https://orcid.org/0000-0002-5345-7771"},"institutions":[{"id":"https://openalex.org/I170239107","display_name":"University of South Australia","ror":"https://ror.org/01p93h210","country_code":"AU","type":"education","lineage":["https://openalex.org/I170239107"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Alex Grant","raw_affiliation_strings":["University of South Australia, Australia","Univ. of South Australia, Australia"],"affiliations":[{"raw_affiliation_string":"University of South Australia, Australia","institution_ids":["https://openalex.org/I170239107"]},{"raw_affiliation_string":"Univ. of South Australia, Australia","institution_ids":["https://openalex.org/I170239107"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001425042","display_name":"Doris Kern","orcid":null},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Doris Kern","raw_affiliation_strings":["Technical University Berlin, Germany","Technical University of Berlin, Germany,"],"affiliations":[{"raw_affiliation_string":"Technical University Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]},{"raw_affiliation_string":"Technical University of Berlin, Germany,","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5010336848"],"corresponding_institution_ids":["https://openalex.org/I170239107"],"apc_list":null,"apc_paid":null,"fwci":1.8596,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.86970089,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"abs 910 284","issue":null,"first_page":"1364","last_page":"1368"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9865999817848206,"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.9684000015258789,"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/mathematics","display_name":"Mathematics","score":0.7410129308700562},{"id":"https://openalex.org/keywords/axiom","display_name":"Axiom","score":0.6024186611175537},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5345377922058105},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.5305158495903015},{"id":"https://openalex.org/keywords/inequality","display_name":"Inequality","score":0.5018155574798584},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4910919666290283},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47014978528022766},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.41503196954727173},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1579221785068512},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08065629005432129}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7410129308700562},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.6024186611175537},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5345377922058105},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.5305158495903015},{"id":"https://openalex.org/C45555294","wikidata":"https://www.wikidata.org/wiki/Q28113351","display_name":"Inequality","level":2,"score":0.5018155574798584},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4910919666290283},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47014978528022766},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.41503196954727173},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1579221785068512},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08065629005432129},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isit.2010.5513542","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513542","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.313.3898","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.313.3898","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/0907.5030v2.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.313.6019","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.313.6019","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/0907.5030v1.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.7300000190734863}],"awards":[],"funders":[{"id":"https://openalex.org/F4320315885","display_name":"Australian Government","ror":"https://ror.org/0314h5y94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1515040589","https://openalex.org/W1588284605","https://openalex.org/W1965124840","https://openalex.org/W1995875735","https://openalex.org/W2026482663","https://openalex.org/W2067298912","https://openalex.org/W2103320637","https://openalex.org/W2105831729","https://openalex.org/W2106403318","https://openalex.org/W2113940092","https://openalex.org/W2114325434","https://openalex.org/W2122093339","https://openalex.org/W2123754181","https://openalex.org/W2132219316","https://openalex.org/W2143203964","https://openalex.org/W2147681281","https://openalex.org/W2953189047","https://openalex.org/W4297802579","https://openalex.org/W6641412959","https://openalex.org/W6678284995","https://openalex.org/W6678583385","https://openalex.org/W6813918715"],"related_works":["https://openalex.org/W587735977","https://openalex.org/W1978142926","https://openalex.org/W3157395178","https://openalex.org/W2212571888","https://openalex.org/W178365807","https://openalex.org/W2139379087","https://openalex.org/W2020805386","https://openalex.org/W184455116","https://openalex.org/W2285288187","https://openalex.org/W2058473748"],"abstract_inverted_index":{"An":[0],"Ingletonian":[1],"polymatroid":[2,8,20,103,119],"satisfies,":[3],"in":[4,43],"addition":[5],"to":[6,21,31,53,70,86,91,122,150],"the":[7,10,58,62,71,108,126,131],"axioms,":[9],"inequalities":[11,15,34,134,146],"of":[12,41,60,73,135],"Ingleton.":[13],"These":[14],"are":[16,35,40,147],"required":[17],"for":[18],"a":[19,50,83,93,102],"be":[22],"representable.":[23],"It":[24],"has":[25],"been":[26],"an":[27],"open":[28],"question":[29],"as":[30],"whether":[32],"these":[33,145],"also":[36,48,130],"sufficient.":[37],"Representable":[38],"polymatroids":[39,89],"interest":[42],"their":[44],"own":[45],"right.":[46],"They":[47],"have":[49],"strong":[51],"connection":[52],"network":[54,64],"coding.":[55],"In":[56,78],"particular,":[57],"problem":[59],"finding":[61],"linear":[63],"coding":[65],"capacity":[66],"region":[67],"is":[68,105,120,143],"equivalent":[69],"characterization":[72],"all":[74,115],"representable,":[75],"entropic":[76],"polymatroids.":[77,117,153],"this":[79,97],"paper,":[80],"we":[81,99],"describe":[82],"new":[84,94],"approach":[85],"adhere":[87],"two":[88],"together":[90],"produce":[92],"polymatroid.":[95],"Using":[96],"approach,":[98],"can":[100],"construct":[101],"that":[104,144],"not":[106,124,148],"inside":[107],"minimal":[109],"closed":[110],"and":[111,138],"convex":[112],"cone":[113],"containing":[114],"representable":[116,152],"This":[118],"proved":[121],"satisfy":[123],"only":[125],"Ingleton":[127],"inequalities,":[128],"but":[129],"recently":[132],"reported":[133],"Dougherty,":[136],"Freiling":[137],"Zeger.":[139],"A":[140],"direct":[141],"consequence":[142],"sufficient":[149],"characterize":[151]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}