相关论文: Hedgehog Reconstruction of Polygons: Non-Central S…
The boundary rigidity problem is a classical question from Riemannian geometry: if $(M, g)$ is a Riemannian manifold with smooth boundary, is the geometry of $M$ determined up to isometry by the metric $d_g$ induced on the boundary…
We study the dissection of a square into congruent convex polygons. Yuan \emph{et al.} [Dissecting the square into five congruent parts, Discrete Math. \textbf{339} (2016) 288-298] asked whether, if the number of tiles is a prime number…
Spatial data about individuals or businesses is often aggregated over polygonal regions to preserve privacy, provide useful insight and support decision making. Given a particular aggregation of data (say into local government areas), the…
We introduce and discuss (local) symmetries of geometric structures. These symmetries generalize the classical (locally) symmetric spaces to various other geometries. Our main tools are homogeneous Cartan geometries and their explicit…
For any cluster algebra whose underlying combinatorial data can be encoded by a bordered surface with marked points, we construct a geometric realization in terms of suitable decorated Teichmueller space of the surface. On the geometric…
It is well known that there exist non-isomorphic compact groups with isomorphic representation rings (fusion rules). Nevertheless, considerable structural information about the group can be reconstructed from its representation ring. We…
Symmetric edge polytopes are a recent and well-studied family of centrally symmetric polytopes arising from graphs. In this paper, we introduce a generalization of this family to arbitrary simplicial complexes. We show how topological…
We present an improved algorithm for {\em quasi-properly} learning convex polyhedra in the realizable PAC setting from data with a margin. Our learning algorithm constructs a consistent polyhedron as an intersection of about $t \log t$…
We study symplectic groups and indefinite orthogonal groups over involutive, possibly noncommutative, algebras $(A, \sigma)$. In the case when the algebra $(A, \sigma)$ is Hermitian, or the complexification $(A_{\mathbb{C}},…
We extend Ahlbrandt and Ziegler's reconstruction results to the metric setting: we show that separably categorical metric structures are determined, up to bi-interpretability, by their automorphism groups.
Skeletal polyhedra and polygonal complexes are finite or infinite periodic structures in 3-space with interesting geometric, combinatorial, and algebraic properties. These structures can be viewed as finite or infinite periodic graphs…
In this paper we use an elementary approach by using numerical semigroups (specifically, those with two generators) to give a formula for the number of integral points inside a right-angled triangle with rational vertices. This is the basic…
A rhombus tiling of a hexagon is said to be centered if it contains the central lozenge. We compute the number of vertically symmetric rhombus tilings of a hexagon with side lengths $a, b, a, a, b, a$ which are centered. When $a$ is odd and…
This paper addresses the problem of determining the symmetries of a plane or space curve defined by a rational parametrization. We provide effective methods to compute the involution and rotation symmetries for the planar case. As for space…
The purpose of this paper is to study the reflections of a convex body. In particular, we are interested in orthogonal reflections of its sections that can be extended to reflections of the whole body. For this reason, we need to study the…
In this paper, we show that the $L_1$ geodesic diameter and center of a simple polygon can be computed in linear time. For the purpose, we focus on revealing basic geometric properties of the $L_1$ geodesic balls, that is, the metric balls…
This paper concerns the reconstruction of a complex-valued anisotropic tensor $\gamma=\sigma+\i\omega\varepsilon$ from knowledge of several internal magnetic fields $H$, where $H$ satisfies the anisotropic Maxwell system on a bounded domain…
Given a semisimple group over a complete non-Archimedean field, it is well known that techniques from non-Archimedean analytic geometry provide an embedding of the corresponding Bruhat-Tits builidng into the analytic space associated to the…
For any positive integers $a$ and $b$, we enumerate all colored partitions made by noncrossing diagonals of a convex polygon into polygons whose number of sides is congruent to $b$ modulo $a$. For the number of such partitions made by a…
We show that packing axis-aligned unit squares into a simple polygon $P$ is NP-hard, even when $P$ is an orthogonal and orthogonally convex polygon with half-integer coordinates. It has been known since the early 80s that packing unit…