相关论文: Hedgehog Reconstruction of Polygons: Non-Central S…

This paper aims to develop the mathematical representation of a surface generated by elliptical arcs joining the sides of a regular polygon to a point lying vertically upward on the central axis of the polygon. The volume of the…

Let G be a connected reductive group over a non-archimedean local field. We say that an irreducible depth-zero (complex) G-representation is non-singular if its cuspidal support is non-singular. We establish a Local Langlands Correspondence…

Certain topics on polygons are extended from Euclidean to hyperbolic geometry. This first part deals with uniqueness and existence of cocyclic polygons with prescribed sidelengths. The non-Euclidean versions are more difficult due to the…

It is well-known that plane partitions, lozenge tilings of a hexagon, perfect matchings on a honeycomb graph, and families of non-intersecting lattice paths in a hexagon are all in bijection. In this work we consider regions that are more…

The medial axis of a closed set is well established tool in pattern recognition, cherished for its power of reconstruction of domains. In this article we fill this gap answering the question which sets precisely are reconstructible from the…

We propose a method to reconstruct the metric and its arbitrary-order derivatives at the horizon for any static, planar-symmetric black hole, using an infinite set of discrete pole-skipping points in momentum space where the boundary…

We construct symmetric convex bodies that are not intersection bodies, but all of their central hyperplane sections are intersection bodies. This result extends the studies by Weil in the case of zonoids and by Neyman in the case of…

This paper proposed a method to judge whether the point is inside or outside of the simple convex polygon by the intersection of the vertical line. It determined the point to an area enclosed by two straight lines, then convert the problem…

An analytic reversible Hamiltonian system with two degrees of freedom is studied in a neighborhood of its symmetric heteroclinic connection made up of a symmetric saddle-center, a symmetric orientable saddle periodic orbit lying in the same…

We construct embeddings of simplicial complexes into a (surface of a) simplicial ball whose triangulation has bounded degrees and low volume. This construction can be used either to efficiently "simplify a complicated space" by realizing it…

Given a set of disjoint simple polygons $\sigma_1, \ldots, \sigma_n$, of total complexity $N$, consider a convexification process that repeatedly replaces a polygon by its convex hull, and any two (by now convex) polygons that intersect by…

We consider the numerical reconstruction of the spatially dependent conductivity coefficient and the source term in elliptic partial differential equations in a two-dimensional convex polygonal domain, with the homogeneous Dirichlet…

A small polygon is a polygon of unit diameter. The maximal area of a small polygon with $n=2m$ vertices is not known when $m\ge 7$. Finding the largest small $n$-gon for a given number $n\ge 3$ can be formulated as a nonconvex quadratically…

In this work we study inside-out dissections of polygons and polyhedra. We first show that an arbitrary polygon can be inside-out dissected with $2n+1$ pieces, thereby improving the best previous upper bound of $4(n-2)$ pieces.…

In this paper, we propose a distributed algorithm for solving large-scale separable convex problems using Lagrangian dual decomposition and the interior-point framework. By adding self-concordant barrier terms to the ordinary Lagrangian, we…

This paper studies the configuration spaces of linkages whose underlying graph is a single cycle. Assume that the edge lengths are such that there are no configurations in which all the edges lie along a line. The main results are that,…

We address some conjectures and open problems in "analysis of symmetries" which include the study of non-commutative harmonic analysis and discontinuous groups for reductive homogeneous spaces beyond the classical framework: (1) discrete…

We show that a Hitchin representation is determined by the spectral radii of the images of simple, non-separating closed curves. As a consequence, we classify isometries of the intersection function on Hitchin components of dimension 3 and…

We study the hyperk\"ahler analogues of moduli spaces of semistable n-gons in complex projective space. We prove that the hyperk\"ahler Kirwan map is surjective and produce a formula that recursively calculates the Betti numbers of these…

Recutting is an operation on planar polygons defined by cutting a polygon along a diagonal to remove a triangle, and then reattaching the triangle along the same diagonal but with opposite orientation. Recuttings along different diagonals…