Non-Crossing Frameworks with Non-Crossing Reciprocals

被引:0
|
作者
David Orden
Günter Rote
Francisco Santos
Brigitte Servatius
Herman Servatius
Walter Whiteley
机构
[1] Departamento de Matemáticas,
[2] Estadística y Computación,undefined
[3] Universidad de Cantabria,undefined
[4] E-39005 Santander ,undefined
[5] Institut für Informatik,undefined
[6] Freie Universität Berlin,undefined
[7] Takustraße 9,undefined
[8] D-14195 Berlin,undefined
[9] Department of Mathematical Sciences,undefined
[10] Worcester Polytechnic Institute,undefined
[11] Worcester,undefined
[12] MA 01609,undefined
[13] Department of Mathematics and Statistics,undefined
[14] York University,undefined
[15] Toronto,undefined
[16] Ontario,undefined
[17] M3J 1P3,undefined
来源
关键词
Computational Mathematic; Special Interest; Geometric Property; Planar Graph; Sign Pattern;
D O I
暂无
中图分类号
学科分类号
摘要
We study non-crossing frameworks in the plane for which the classical reciprocal on the dual graph is also non-crossing. We give a complete description of the self-stresses on non-crossing frameworks G whose reciprocals are non-crossing, in terms of: the types of faces (only pseudo-triangles and pseudo-quadrangles are allowed); the sign patterns in the stress on G; and a geometric condition on the stress vectors at some of the vertices. As in other recent papers where the interplay of non-crossingness and rigidity of straight-line plane graphs is studied, pseudo-triangulations show up as objects of special interest. For example, it is known that all planar Laman circuits can be embedded as a pseudo-triangulation with one non-pointed vertex. We show that for such pseudo-triangulation embeddings of planar Laman circuits which are sufficiently generic, the reciprocal is non-crossing and again a pseudo-triangulation embedding of a planar Laman circuit. For a singular (non-generic) pseudo-triangulation embedding of a planar Laman circuit, the reciprocal is still non-crossing and a pseudo-triangulation, but its underlying graph may not be a Laman circuit. Moreover, all the pseudo-triangulations which admit a non-crossing reciprocal arise as the reciprocals of such, possibly singular, stresses on pseudo-triangulation Laman circuits. All self-stresses on a planar graph correspond to liftings to piecewise linear surfaces in 3-space. We prove characteristic geometric properties of the lifts of such non-crossing reciprocal pairs.
引用
收藏
页码:567 / 600
页数:33
相关论文
共 50 条
  • [31] A VIOLATION OF CHEMICAL NON-CROSSING RULE
    HASELBAC.E
    [J]. TETRAHEDRON LETTERS, 1970, (18) : 1543 - &
  • [32] Crane scheduling with non-crossing constraint
    Zhu, Y.
    Lim, A.
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2006, 57 (12) : 1464 - 1471
  • [33] ORDERED TREES AND NON-CROSSING PARTITIONS
    DERSHOWITZ, N
    ZAKS, S
    [J]. DISCRETE MATHEMATICS, 1986, 62 (02) : 215 - 218
  • [34] Analytic combinatorics of non-crossing configurations
    Flajolet, P
    Noy, M
    [J]. DISCRETE MATHEMATICS, 1999, 204 (1-3) : 203 - 229
  • [35] Non-crossing convex quantile regression
    Dai, Sheng
    Kuosmanen, Timo
    Zhou, Xun
    [J]. ECONOMICS LETTERS, 2023, 233
  • [36] Extremal statistics on non-crossing configurations
    Drmota, Michael
    de Mier, Anna
    Noy, Marc
    [J]. DISCRETE MATHEMATICS, 2014, 327 : 103 - 117
  • [37] Graphs of non-crossing perfect matchings
    Hernando, C
    Furtado, F
    Noy, M
    [J]. GRAPHS AND COMBINATORICS, 2002, 18 (03) : 517 - 532
  • [38] Simply Generated Non-Crossing Partitions
    Kortchemski, Igor
    Marzouk, Cyril
    [J]. COMBINATORICS PROBABILITY & COMPUTING, 2017, 26 (04): : 560 - 592
  • [39] Non-crossing paths with geographic constraints
    Silveira, Rodrigo, I
    Speckmann, Bettina
    Verbeek, Kevin
    [J]. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2019, 21 (03):
  • [40] A non-crossing standard monomial theory
    Petersen, T. Kyle
    Pylyavskyy, Pavlo
    Speyer, David E.
    [J]. JOURNAL OF ALGEBRA, 2010, 324 (05) : 951 - 969