Related papers: Flexible polyhedral nets in isotropic geometry
We identify the restricted class of attainable effective deformations in a model of reinforced composites with parallel, long, and fully rigid fibers embedded in an elastic body. In mathematical terms, we characterize the weak limits of…
Various characterizations of finite convex geometries are well known. This note provides similar characterizations for possibly infinite convex geometries whose lattice of closed sets is strongly coatomic and lower continuous. Some classes…
While the notion of isometric deformations of surfaces is straightforward for surfaces with Euclidean metric, a corresponding notion in isotropic space has been missing. By making Gauss' Theorema Egregium a necessary condition we develop a…
The paper is devoted to classification problem of finite dimensional complex none Lie filiform Leibniz algebras. The motivation to write this paper is an unpublished yet result of J.R.Gomez, B.A.Omirov on necessary and sufficient conditions…
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…
Predicting the large-amplitude deformations of thin elastic sheets is difficult due to the complications of self-contact, geometric nonlinearities, and a multitude of low-lying energy states. We study a simple two-dimensional setting where…
The symmetry group structures of two dimensional coupled nonlinear Shr\"{o}dinger equations are considered. We first show that the equations admit infinite dimensional symmetry algebra as well as the corresponding symmetry group depending…
A complete classification of isotropic vector equations of the geometric type that possess higher symmetries is proposed. New examples of integrable multi-component systems of the geometric type and their auto-Backlund transformations are…
The aim of this paper is to study finite orthogonal polynomials on a cone of revolution and its surface. We define two classes of finite orthogonal polynomials on the solid cone and derive their corresponding differential equations and…
The space of shapes of a polyhedron with given total angles less than 2\pi at each of its n vertices has a Kaehler metric, locally isometric to complex hyperbolic space CH^{n-3}. The metric is not complete: collisions between vertices take…
Geometric hitting set problems, in which we seek a smallest set of points that collectively hit a given set of ranges, are ubiquitous in computational geometry. Most often, the set is discrete and is given explicitly. We propose new…
In the discretization of differential problems on complex geometrical domains, discretization methods based on polygonal and polyhedral elements are powerful tools. Adaptive mesh refinement for such kind of problems is very useful as well…
Kokotsakis studied the following problem in 1932: Given is a rigid closed polygonal line (planar or non-planar), which is surrounded by a polyhedral strip, where at each polygon vertex three faces meet. Determine the geometries of these…
Entangled embedded periodic nets and crystal frameworks are defined, along with their dimension type, homogeneity type, adjacency depth and periodic isotopy type. We obtain periodic isotopy classifications for various families of embedded…
We present a fast algorithm for global rigid symmetry detection with approximation guarantees. The algorithm is guaranteed to find the best approximate symmetry of a given shape, to within a user-specified threshold, with very high…
We study the problem of binary classification from the point of view of learning convex polyhedra in Hilbert spaces, to which one can reduce any binary classification problem. The problem of learning convex polyhedra in finite-dimensional…
In this paper we consider flat metrics (semi-translation structures) on surfaces of finite type. There are two main results. The first is a complete description of when a set of simple closed curves is spectrally rigid, that is, when the…
Phylogenetic networks are generalizations of trees that allow for the modeling of non-tree like evolutionary processes. Split networks give a useful way to construct networks with intuitive distance structures induced from the associated…
We consider real isotropic geodesics on manifolds endowed with a pseudoconformal structure and their applications to the theory of lightlike hypersurfaces on such manifolds, the geometry of four-dimensional conformal structures of…
We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a…