English
Related papers

Related papers: Polyhedral Characterization of Reversible Hinged D…

200 papers

To a given nonsingular triangular matrix A with entries from a ring, we associate a weighted bipartite graph G(A) and give a combinatorial description of the inverse of A by employing paths in G(A). Under a certain condition, nonsingular…

Combinatorics · Mathematics 2013-03-12 Ravindra Bapat , Ebrahim Ghorbani

We study orthogonal decompositions of symmetric and ordinary tensors using methods from linear algebra. For the field of real numbers we show that the sets of decomposable tensors can be defined be equations of degree 2. This gives a new…

Rings and Algebras · Mathematics 2019-10-01 Pascal Koiran

Consider a compact Riemannian manifold in dimension $n\geq 3$ with strictly convex boundary. We show that the transverse ray transform of $1$ tensors and the mixed ray transform of $1+1$ tensors are invertible, up to natural obstructions,…

Differential Geometry · Mathematics 2024-01-18 Gunther Uhlmann , Jian Zhai

Tensor diagonalization means transforming a given tensor to an exactly or nearly diagonal form through multiplying the tensor by non-orthogonal invertible matrices along selected dimensions of the tensor. It is generalization of approximate…

Numerical Analysis · Computer Science 2016-07-04 Petr Tichavsky , Anh Huy Phan , Andrzej Cichocki

A regular polygon circumscribing another regular polygon (with a different side number) may be tightened to minimize the difference of both areas. The manuscripts computes the optimum result under the restriction that both polygons are…

Metric Geometry · Mathematics 2013-01-29 Richard J. Mathar

An element of a group is \emph{reversible} if it is conjugate to its own inverse, and it is \emph{strongly reversible} if it is conjugate to its inverse by an involution. A group element is strongly reversible if and only if it can be…

Group Theory · Mathematics 2009-09-29 Nick Gill , Ian Short

We study the fracture of reversible double transient networks, constituted of water suspensions of entangled surfactant wormlike micelles reversibly linked by various amounts of telechelic polymers. We provide a state diagram that…

Soft Condensed Matter · Physics 2017-11-17 S. Arora , A. Shabbir , O. Hassager , C. Ligoure , L. Ramos

An unzipping of a polyhedron P is a cut-path through its vertices that unfolds P to a non-overlapping shape in the plane. It is an open problem to decide if every convex P has an unzipping. Here we show that there are nearly flat convex…

Computational Geometry · Computer Science 2018-02-07 Joseph O'Rourke

We exhibit two instances of the cyclic sieving phenomenon - one on dissections of a polygon of a fixed type and one on triangulations of a once-punctured polygon. We use these results to give refined enumerations of certain families of…

Combinatorics · Mathematics 2025-11-25 Ashleigh Adams , Esther Banaian

The reverse split rank of an integral polyhedron P is defined as the supremum of the split ranks of all rational polyhedra whose integer hull is P. Already in R^3 there exist polyhedra with infinite reverse split rank. We give a geometric…

Optimization and Control · Mathematics 2014-10-14 Michele Conforti , Alberto Del Pia , Marco Di Summa , Yuri Faenza

We consider whether any two triangulations of a polygon or a point set on a non-planar surface with a given metric can be transformed into each other by a sequence of edge flips. The answer is negative in general with some remarkable…

Metric Geometry · Mathematics 2010-08-02 C. Cortes , C. I. Grima , F. Hurtado , A. Marquez , F. Santos , J. Valenzuela

Let T be a triangulation of a simple polygon. A flip in T is the operation of removing one diagonal of T and adding a different one such that the resulting graph is again a triangulation. The flip distance between two triangulations is the…

Computational Geometry · Computer Science 2017-11-21 Oswin Aichholzer , Wolfgang Mulzer , Alexander Pilz

We deal with germs of diffeomorphisms that are reversible under an involution. We establish that this condition implies that, in general, both the family of reversing symmetries and the group of symmetries are not finite, in contrast with…

Dynamical Systems · Mathematics 2020-07-14 Patrícia H. Baptistelli , Isabel S. Labouriau , Miriam Manoel

We show that every orthogonal polyhedron of genus at most 2 can be unfolded without overlap while using only a linear number of orthogonal cuts (parallel to the polyhedron edges). This is the first result on unfolding general orthogonal…

Computational Geometry · Computer Science 2016-11-02 Mirela Damian , Erik Demaine , Robin Flatland , Joseph O'Rourke

Motivated by the hinge structure present in protein chains and other molecular conformations, we study the singularities of certain maps associated to body-and-hinge and panel-and-hinge chains. These are sequentially articulated systems…

Differential Geometry · Mathematics 2008-12-09 Ciprian S. Borcea , Ileana Streinu

We establish sufficient conditions for finite convergence of the alternating projections method for two non-intersecting and potentially nonconvex sets. Our results are based on a generalization of the concept of intrinsic transversality,…

Optimization and Control · Mathematics 2021-02-18 Hoa T. Bui , Ryan Loxton , Asghar Moeini

Bing doubling is an operation which produces a 2-component boundary link B(K) from a knot K. If K is slice, then B(K) is easily seen to be boundary slice. In this paper, we investigate whether the converse holds. Our main result is that if…

Geometric Topology · Mathematics 2009-07-06 David Cimasoni

We study a class of mechanisms known as Kokotsakis polyhedra with a quadrangular base. These are $3\times3$ quadrilateral meshes whose faces are rigid bodies and joined by hinges at the common edges. In contrast to existing work, the…

Algebraic Geometry · Mathematics 2026-03-09 Yang Liu

A topologically minimal surface may be isotoped into a normal form with respect to a fixed triangulation. If the intersection with each tetrahedron is simply connected, then the pieces of this normal form are triangles, quadrilaterals, and…

Geometric Topology · Mathematics 2018-03-16 David Bachman , Ryan Derby-Talbot , Eric Sedgwick

Deciding whether a family of disjoint line segments in the plane can be linked into a simple polygon (or a simple polygonal chain) by adding segments between their endpoints is NP-hard.

Computational Geometry · Computer Science 2021-09-03 Rain Jiang , Kai Jiang , Minghui Jiang