Yayın:
Coincident Rigidity of 2-Dimensional Frameworks

Basit Görünüm
dc.contributor.authorGuler, Hakan
dc.contributor.authorJackson, Bill
dc.date.accessioned2026-01-04T17:05:29Z
dc.date.issued2022-07-30
dc.description.abstractFekete, Jordán and Kaszanitzky [4] characterised the graphs which can be realised as 2-dimensional, infinitesimally rigid, bar-joint frameworks in which two given vertices are coincident. We formulate a conjecture which would extend their characterisation to an arbitrary set T of vertices and verify our conjecture when |T| = 3.
dc.description.urihttps://doi.org/10.1007/s00373-022-02540-9
dc.description.urihttps://dx.doi.org/10.48550/arxiv.2106.06767
dc.description.urihttp://arxiv.org/abs/2106.06767
dc.description.urihttps://zbmath.org/7566017
dc.description.urihttps://doi.org/https://doi.org/10.1007/s00373-022-02540-9
dc.identifier.doi10.1007/s00373-022-02540-9
dc.identifier.eissn1435-5914
dc.identifier.issn0911-0119
dc.identifier.openairedoi_dedup___::a01e011d22a72b4721a943490c963994
dc.identifier.orcid0000-0003-3300-860x
dc.identifier.scopus2-s2.0-105003031225
dc.identifier.urihttps://hdl.handle.net/20.500.12597/39889
dc.identifier.volume38
dc.identifier.wos000833516200001
dc.language.isoeng
dc.publisherSpringer Science and Business Media LLC
dc.relation.ispartofGraphs and Combinatorics
dc.rightsOPEN
dc.subjectInfinitesimal rigidity
dc.subjectCombinatorial aspects of matroids and geometric lattices
dc.subjectcount matroid
dc.subjectCount matroid
dc.subjectPlanar graphs
dc.subjectgeometric and topological aspects of graph theory
dc.subjectC25
dc.subjectinfinitesimal rigidity
dc.subjectRigidity and flexibility of structures (aspects of discrete geometry)
dc.subjectCoincident points
dc.subjectFOS: Mathematics
dc.subjectMathematics - Combinatorics
dc.subjectcoincident points
dc.subjectCombinatorics (math.CO)
dc.titleCoincident Rigidity of 2-Dimensional Frameworks
dc.typeArticle
dspace.entity.typePublication
local.api.response{"authors":[{"fullName":"Hakan Guler","name":"Hakan","surname":"Guler","rank":1,"pid":{"id":{"scheme":"orcid","value":"0000-0003-3300-860x"},"provenance":null}},{"fullName":"Bill Jackson","name":"Bill","surname":"Jackson","rank":2,"pid":null}],"openAccessColor":null,"publiclyFunded":false,"type":"publication","language":{"code":"eng","label":"English"},"countries":null,"subjects":[{"subject":{"scheme":"FOS","value":"0102 computer and information sciences"},"provenance":null},{"subject":{"scheme":"keyword","value":"Infinitesimal rigidity"},"provenance":null},{"subject":{"scheme":"keyword","value":"Combinatorial aspects of matroids and geometric lattices"},"provenance":null},{"subject":{"scheme":"keyword","value":"count matroid"},"provenance":null},{"subject":{"scheme":"FOS","value":"01 natural sciences"},"provenance":null},{"subject":{"scheme":"keyword","value":"Count matroid"},"provenance":null},{"subject":{"scheme":"keyword","value":"Planar graphs; geometric and topological aspects of graph theory"},"provenance":null},{"subject":{"scheme":"keyword","value":"52C25"},"provenance":null},{"subject":{"scheme":"keyword","value":"infinitesimal rigidity"},"provenance":null},{"subject":{"scheme":"keyword","value":"Rigidity and flexibility of structures (aspects of discrete geometry)"},"provenance":null},{"subject":{"scheme":"keyword","value":"Coincident points"},"provenance":null},{"subject":{"scheme":"keyword","value":"FOS: Mathematics"},"provenance":null},{"subject":{"scheme":"keyword","value":"Mathematics - Combinatorics"},"provenance":null},{"subject":{"scheme":"keyword","value":"coincident points"},"provenance":null},{"subject":{"scheme":"keyword","value":"Combinatorics (math.CO)"},"provenance":null},{"subject":{"scheme":"FOS","value":"0101 mathematics"},"provenance":null}],"mainTitle":"Coincident Rigidity of 2-Dimensional Frameworks","subTitle":null,"descriptions":["Fekete, Jordán and Kaszanitzky [4] characterised the graphs which can be realised as 2-dimensional, infinitesimally rigid, bar-joint frameworks in which two given vertices are coincident. We formulate a conjecture which would extend their characterisation to an arbitrary set T of vertices and verify our conjecture when |T| = 3."],"publicationDate":"2022-07-30","publisher":"Springer Science and Business Media LLC","embargoEndDate":"2021-01-01","sources":["Crossref"],"formats":["application/xml"],"contributors":null,"coverages":null,"bestAccessRight":{"code":"c_abf2","label":"OPEN","scheme":"http://vocabularies.coar-repositories.org/documentation/access_rights/"},"container":{"name":"Graphs and Combinatorics","issnPrinted":"0911-0119","issnOnline":"1435-5914","issnLinking":null,"ep":null,"iss":null,"sp":null,"vol":"38","edition":null,"conferencePlace":null,"conferenceDate":null},"documentationUrls":null,"codeRepositoryUrl":null,"programmingLanguage":null,"contactPeople":null,"contactGroups":null,"tools":null,"size":null,"version":null,"geoLocations":null,"id":"doi_dedup___::a01e011d22a72b4721a943490c963994","originalIds":["2540","10.1007/s00373-022-02540-9","50|doiboost____|a01e011d22a72b4721a943490c963994","50|datacite____::15df97012ba9f67d6195aad80ab3e720","10.48550/arxiv.2106.06767","oai:arXiv.org:2106.06767","50|od________18::7f23ab814e478d6c1127924bbb8e6593","50|c2b0b933574d::69e7dc9eb35da985e212ef5ee33c04f3","oai:zbmath.org:7566017","50|base_oa_____::e7c490476d56af039ec0bd3385a6f64d","ftqueenmaryuniv:oai:qmro.qmul.ac.uk:123456789/85465"],"pids":[{"scheme":"doi","value":"10.1007/s00373-022-02540-9"},{"scheme":"doi","value":"10.48550/arxiv.2106.06767"},{"scheme":"arXiv","value":"2106.06767"}],"dateOfCollection":null,"lastUpdateTimeStamp":null,"indicators":{"citationImpact":{"citationCount":1,"influence":2.624027e-9,"popularity":2.6557359e-9,"impulse":1,"citationClass":"C5","influenceClass":"C5","impulseClass":"C5","popularityClass":"C5"}},"instances":[{"pids":[{"scheme":"doi","value":"10.1007/s00373-022-02540-9"}],"license":"Springer TDM","type":"Article","urls":["https://doi.org/10.1007/s00373-022-02540-9"],"publicationDate":"2022-07-30","refereed":"peerReviewed"},{"pids":[{"scheme":"doi","value":"10.48550/arxiv.2106.06767"}],"license":"CC BY","type":"Article","urls":["https://dx.doi.org/10.48550/arxiv.2106.06767"],"publicationDate":"2021-01-01","refereed":"nonPeerReviewed"},{"pids":[{"scheme":"arXiv","value":"2106.06767"}],"alternateIdentifiers":[{"scheme":"doi","value":"10.1007/s00373-022-02540-9"}],"type":"Preprint","urls":["http://arxiv.org/abs/2106.06767"],"publicationDate":"2021-06-12","refereed":"nonPeerReviewed"},{"alternateIdentifiers":[{"scheme":"doi","value":"10.1007/s00373-022-02540-9"}],"type":"Article","urls":["https://doi.org/10.1007/s00373-022-02540-9","https://zbmath.org/7566017"],"publicationDate":"2022-01-01","refereed":"nonPeerReviewed"},{"alternateIdentifiers":[{"scheme":"doi","value":"10.1007/s00373-022-02540-9"}],"type":"Article","urls":["https://doi.org/https://doi.org/10.1007/s00373-022-02540-9"],"publicationDate":"2022-01-01","refereed":"nonPeerReviewed"}],"isGreen":true,"isInDiamondJournal":false}
local.import.sourceOpenAire
local.indexed.atWOS
local.indexed.atScopus

Dosyalar

Koleksiyonlar

Publications