Related papers: Foldings and Meanders
We determine the maximum number of edges that a planar graph can have as a function of its maximum degree and matching number.
Enumeration of tilings is the mathematical study concerning the total number of coverings of regions by similar pieces without gaps or overlaps. Enumeration of tilings has become a vibrant subfield of combinatorics with connections and…
In this paper we study underlying graphs corresponding to a set of halving lines. We establish many properties of such graphs. In addition, we tighten the upper bound for the number of halving lines.
Box folding represents a crucial challenge for automated packaging systems. This work bridges the gap between existing methods for folding sequence extraction and approaches focused on the adaptability of automated systems to specific box…
We provide a solution to the problem of simultaneous $diagonalization$ $via$ $congruence$ of a given set of $m$ complex symmetric $n\times n$ matrices $\{A_{1},\ldots,A_{m}\}$, by showing that it can be reduced to a possibly…
We study smooth maps between smooth manifolds with only fold points as their singularities, and clarify the obstructions to the existence of such a map in a given homotopy class for certain dimensions. The obstructions are described in…
Graph is an abstract representation commonly used to model networked systems and structure. In problems across various fields, including computer vision and pattern recognition, and neuroscience, graphs are often brought into comparison (a…
Point-set embeddings and large-angle crossings are two areas of graph drawing that independently have received a lot of attention in the past few years. In this paper, we consider problems in the intersection of these two areas. Given the…
A meander can be seen as a pair of transversally intersecting simple closed curves on a 2-sphere. We consider pairs of transversally intersecting simple closed curves on a closed oriented surface of arbitrary genus g. The number of such…
We study relationships between permutation statistics and pattern-functions, counting the number of times particular patterns occur in a permutation. This allows us to write several familiar statistics as linear combinations of pattern…
We generalize the notions of flippable and simultaneously flippable edges in a triangulation of a set S of points in the plane to so-called \emph{pseudo-simultaneously flippable edges}. Such edges are related to the notion of convex…
A variational framework is introduced to describe how a surface bends when it is subject to local constraints on its geometry. This framework is applied to describe the patterns of a folded sheet of paper. The unstretchability of paper…
A parallelogram is conformally inscribed in four lines in the plane if it is inscribed in a scaled copy of the configuration of four lines. We describe the geometry of the three-dimensional Euclidean space whose points are the…
We introduced concept of meander knots, 2-component meander links and multi-component meander links and derived different families of meander knots and links from open meanders with at most 16 crossings. We also defined semi-meander knots…
To study a noncompact Riemannian manifold, it is often useful to find a compactification. We discuss several common compactifications and survey some recent results.
In the present paper we give a historical account -ranging from classical to modern results- of the problem of rolling two Riemannian manifolds one on the other, with the restrictions that they cannot instantaneously slip or spin one with…
We study the order of tangency between two manifolds of same dimension and give that notion three quite different geometric interpretations. Related aspects of the order of tangency, e.g., regular separation exponents, are also discussed.
We study the existence of an $n$-fold rotationally symmetric placement of a symmetric graph in the plane allowing a continuous deformation that preserves the symmetry and the distances between adjacent vertices. We show that such a flexible…
The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.
We introduce the notion of symplectic microfolds and symplectic micromorphisms between them. They form a monoidal category, which is a version of the "category" of symplectic manifolds and canonical relations obtained by localizing them…