{"id":"https://openalex.org/W4386977929","doi":"https://doi.org/10.48550/arxiv.2309.12248","title":"Enumerating combinatorial resultant decompositions of 2-connected rigidity circuits","display_name":"Enumerating combinatorial resultant decompositions of 2-connected rigidity circuits","publication_year":2023,"publication_date":"2023-09-21","ids":{"openalex":"https://openalex.org/W4386977929","doi":"https://doi.org/10.48550/arxiv.2309.12248"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2309.12248","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2309.12248","pdf_url":"https://arxiv.org/pdf/2309.12248","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2309.12248","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5069811200","display_name":"Goran Mali\u0107","orcid":"https://orcid.org/0000-0001-9340-7827","observed_orcids":["https://orcid.org/0000-0001-9340-7827"]},"institutions":[{"id":"https://openalex.org/I202524275","display_name":"Smith College","ror":"https://ror.org/0497crr92","country_code":"US","type":"education","lineage":["https://openalex.org/I202524275"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Malic, Goran","raw_affiliation_strings":["Department of Computer Science , Smith College , Northampton , MA , USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science , Smith College , Northampton , MA , USA","institution_ids":["https://openalex.org/I202524275"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008565320","display_name":"Ileana Streinu","orcid":"https://orcid.org/0000-0003-2663-2615","observed_orcids":["https://orcid.org/0000-0003-2663-2615"]},"institutions":[{"id":"https://openalex.org/I202524275","display_name":"Smith College","ror":"https://ror.org/0497crr92","country_code":"US","type":"education","lineage":["https://openalex.org/I202524275"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Streinu, Ileana","raw_affiliation_strings":["Department of Computer Science , Smith College , Northampton , MA , USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science , Smith College , Northampton , MA , USA","institution_ids":["https://openalex.org/I202524275"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I202524275"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":1,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.47530001401901245,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.47530001401901245,"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.19869999587535858,"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.1817999929189682,"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/biconnected-graphs","display_name":"2-connected graphs","score":0.890999972820282},{"id":"https://openalex.org/keywords/sylvester-resultant","display_name":"Sylvester resultant","score":0.6019999980926514},{"id":"https://openalex.org/keywords/elimination-strategy","display_name":"elimination strategy","score":0.8579999804496765},{"id":"https://openalex.org/keywords/enumeration-algorithms","display_name":"enumeration algorithms","score":0.765999972820282},{"id":"https://openalex.org/keywords/graph-rigidity","display_name":"graph rigidity","score":0.44600000977516174}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7143406867980957},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6541856527328491},{"id":"https://openalex.org/C160343418","wikidata":"https://www.wikidata.org/wiki/Q185256","display_name":"Rigidity (electromagnetism)","level":2,"score":0.5994782447814941},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5533581972122192},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.5441111922264099},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.5305602550506592},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4898059070110321},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4850417971611023},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.46817392110824585},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.42567190527915955},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.4122408330440521},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4115191400051117},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.367593914270401},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2309.12248","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2309.12248","pdf_url":"https://arxiv.org/pdf/2309.12248","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2309.12248","doi":"https://doi.org/10.48550/arxiv.2309.12248","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2309.12248","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2309.12248","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2309.12248","pdf_url":"https://arxiv.org/pdf/2309.12248","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G4791078907","display_name":"AF:Medium:RUI:Algorithmic Problems in Kinematic Distance Geometry","funder_award_id":"2212309","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7430259102","display_name":"AF:Medium:Collaborative:RUI:Structure in Motion:Algorithms for Kinematic Design","funder_award_id":"1703765","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4386977929.pdf","grobid_xml":"https://content.openalex.org/works/W4386977929.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4388037315","https://openalex.org/W3136072051","https://openalex.org/W4367060540","https://openalex.org/W7099081203","https://openalex.org/W2097374444","https://openalex.org/W4417123617","https://openalex.org/W2029837432","https://openalex.org/W2076896026","https://openalex.org/W2443315899","https://openalex.org/W2050728700"],"abstract_inverted_index":{"A":[0,107],"rigidity":[1,12,33,43,69,176,254],"circuit":[2,34,70,115],"(in":[3],"2D)":[4],"is":[5,61,136,228],"a":[6,15,19,46,63,97,207,258,272],"minimal":[7,16],"dependent":[8],"set":[9],"in":[10,22,29,130,178,231,280,289],"the":[11,53,83,94,102,171,217,221,232],"matroid,":[13],"i.e.":[14],"graph":[17],"supporting":[18],"non-trivial":[20],"stress":[21],"any":[23],"generic":[24],"placement":[25],"of":[26,49,91,96,203,223,252,275,291],"its":[27],"vertices":[28,38,50,74],"$\\mathbb":[30],"R^2$.":[31],"Any":[32,68],"on":[35,45,71,186],"$n\\geq":[36,72],"5$":[37,73],"can":[39,75,127,277],"be":[40,76,214,278],"obtained":[41],"from":[42],"circuits":[44,177,188,205,255],"fewer":[47],"number":[48],"by":[51,220],"applying":[52],"combinatorial":[54,64,103],"resultant":[55,65,104],"(CR)":[56],"operation.":[57],"The":[58],"inverse":[59],"operation":[60],"called":[62,101],"decomposition":[66],"(CR-decomp).":[67],"successively":[77],"decomposed":[78],"into":[79],"smaller":[80],"circuits,":[81],"until":[82],"complete":[84],"graphs":[85],"$K_4$":[86],"are":[87,190,271],"reached.":[88],"This":[89,225],"sequence":[90],"CR-decomps":[92,202,251,269],"has":[93,212],"structure":[95],"rooted":[98],"binary":[99],"tree":[100,105],"(CR-tree).":[106],"CR-tree":[108],"encodes":[109],"an":[110,137,163],"elimination":[111,124,157,260],"strategy":[112],"for":[113,143,165,173,248,267],"computing":[114],"polynomials":[116],"via":[117],"Sylvester":[118],"resultants.":[119],"Different":[120],"CR-trees":[121,152,167],"lead":[122,154],"to":[123,140,149,155,200,213,246,256,265],"strategies":[125],"that":[126,153,189,241,270],"vary":[128],"greatly":[129],"time":[131],"and":[132,286],"memory":[133],"consumption.":[134],"It":[135],"open":[138],"problem":[139],"establish":[141],"criteria":[142],"optimal":[144],"CR-trees,":[145],"or":[146],"at":[147],"least":[148],"characterize":[150],"those":[151,187,268],"good":[156,259],"strategies.":[158],"In":[159,181,198,235],"[12]":[160],"we":[161,169,184,194,238,242,262],"presented":[162],"algorithm":[164],"enumerating":[166],"where":[168],"give":[170],"algorithms":[172,285],"decomposing":[174],"3-connected":[175,233],"polynomial":[179,281],"time.":[180,282],"this":[182,236,292],"paper":[183,237],"focus":[185],"not":[191,229,244],"3-connected,":[192],"which":[193,276],"simply":[195],"call":[196],"2-connected.":[197],"order":[199],"enumerate":[201],"2-connected":[204,253],"$G$,":[206],"brute":[208],"force":[209],"exp-time":[210,226],"search":[211],"performed":[215],"among":[216],"subgraphs":[218],"induced":[219],"subsets":[222],"$V(G)$.":[224],"bottleneck":[227],"present":[230,284],"case.":[234],"will":[239],"argue":[240],"do":[243],"have":[245,264],"account":[247,266],"all":[249,274],"possible":[250],"find":[257],"strategy;":[261],"only":[263],"2-split,":[273],"enumerated":[279],"We":[283],"computational":[287],"evidence":[288],"support":[290],"heuristic.":[293]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-11-01T11:40:01.658920","created_date":"2023-09-23T00:00:00"}