English
Related papers

Related papers: Geometric constructibility of polygons lying on a …

200 papers

A new class of full fans in an euclidean space - tight fans - is introduced. Such fans are defined using a property of local symmetry in a face of a tiling. Tight fans are related to the theory of parallelotopes in an euclidean space. A…

Metric Geometry · Mathematics 2016-03-08 Andrei Gavrilyuk

One proves that there exists an obstruction to an open simply connected $n$-manifold of dimension $n\geq 5$ being geometrically simply connected. In particular there exist uncountably many simply connected $n$-manifolds which are not…

Geometric Topology · Mathematics 2007-05-23 Louis Funar , Siddhartha Gadgil

Richard Guy asked the following question: can we find a triangle with rational sides, medians, and area? Such a triangle is called a \emph{perfect triangle} and no example has been found to date. It is widely believed that such a triangle…

Combinatorics · Mathematics 2019-10-16 Mehdi Makhul

As in a symmetric space of noncompact type, one can associate to an oriented geodesic segment in a Euclidean building a vector valued length in the Euclidean Weyl chamber; in addition to the metric length it contains information on the…

Metric Geometry · Mathematics 2007-05-23 Michael Kapovich , Bernhard Leeb , John J. Millson

We apply convex geometry (cones, fans) to homological input (abelian categories, hearts of bounded t-structures) to construct a new invariant of an abelian category, its heart fan. This can be viewed as a `universal phase diagram' for…

Representation Theory · Mathematics 2024-09-06 Nathan Broomhead , David Pauksztello , David Ploog , Jon Woolf

We present a self-contained proof that the number of diameter pairs among n points in Euclidean 3-space is at most 2n-2. The proof avoids the ball polytopes used in the original proofs by Grunbaum, Heppes and Straszewicz. As a corollary we…

Combinatorics · Mathematics 2008-05-13 Konrad J Swanepoel

We study the problem of construction of a triangle from the feet of its internal angle bisectors. It is proved that in general case ruler-and-compass solution of this problem is impossible.

History and Overview · Mathematics 2009-10-07 Alexey V. Ustinov

In the paper ``Lower bounds on the number of crossing-free subgraphs of $K_N$'' (Computational Geometry 16 (2000), 211-221), it is shown that a double chain of $n$ points in the plane admits at least $\Omega(4.642126305^n)$ polygonizations,…

Computational Geometry · Computer Science 2025-09-23 Javier Tejel

For each odd $n \geq 3$, we construct a closed convex hypersurface of $\mathbb{R}^{n+1}$ that contains a non-degenerate closed geodesic with Morse index zero. A classical theorem of J. L. Synge would forbid such constructions for even $n$,…

Differential Geometry · Mathematics 2024-10-30 Herng Yi Cheng

In this paper, we introduce the notion of an admissible partition of a simplicial polyhedral fan and define the category of a partitioned fan as a generalisation of the $\tau$-cluster morphism category of a finite-dimensional algebra. This…

Representation Theory · Mathematics 2025-02-26 Maximilian Kaipel

This note is devoted to a special Fano fourfold defined by a four-dimensional space of skew-symmetric forms in five variables. This fourfold appears to be closely related with the classical Segre cubic and its Cremona-Richmond configuration…

Algebraic Geometry · Mathematics 2022-11-30 Laurent Manivel

Many algorithmic problems can be solved (almost) as efficiently in metric spaces of bounded doubling dimension as in Euclidean space. Unfortunately, the metric space defined by points in a simple polygon equipped with the geodesic distance…

Computational Geometry · Computer Science 2026-04-20 Mark de Berg , Prosenjit Bose , Leonidas Theocharous

Let f(x) belong to L^p(R^n) and R>0. The transform is considered that integrates the function f over (almost) all spheres of radius R in R^n. This operator is known to be non-injective (as one can see by taking Fourier transform). However,…

Mathematical Physics · Physics 2013-02-26 Mark Agranovsky , Peter Kuchment

We report a small advance on a question raised by Robertson, Schweitzer, and Wagon in [RSW02]. They constructed a genus-13 polyhedron built from bricks without corners, and asked whether every genus-0 such polyhedron must have a corner. A…

Computational Geometry · Computer Science 2007-05-23 Mirela Damian , Joseph O'Rourke

An $\omega$-wedge is the closed set of points contained between two rays that are emanating from a single point (the apex), and are separated by an angle $\omega < \pi$. Given a convex polygon $P$, we place the $\omega$-wedge such that $P$…

Computational Geometry · Computer Science 2019-03-21 Elena Arseneva , Prosenjit Bose , Jean-Lou De Carufel , Sander Verdonschot

For any $n\geq 4$, we construct an $(n-2)$-parameter family of steady gradient Ricci solitons with non-negative curvature operator and prescribed by the eigenvalues of Ricci tensor at a critical point of the soliton potential. Among them…

Differential Geometry · Mathematics 2026-01-30 Pak-Yeung Chan , Yi Lai , Man-Chun Lee

An example of a three dimensional flat paracontact metric manifold with respect to Levi-Civita connection is constructed. It is shown that no such manifold exists for odd dimensions greater than or equal to five.

Differential Geometry · Mathematics 2009-11-02 Simeon Zamkovoy , Vassil Tzanov

A rectilinear polygon is a polygon whose edges are axis-aligned. Walking counterclockwise on the boundary of such a polygon yields a sequence of left turns and right turns. The number of left turns always equals the number of right turns…

Computational Geometry · Computer Science 2022-09-23 William S. Evans , Krzysztof Fleszar , Philipp Kindermann , Noushin Saeedi , Chan-Su Shin , Alexander Wolff

Consider a subset [1,2,...,n]x[1,2,...,n] of the plane integer lattice. Take any non self-intersecting n^2-gon built on it (straight angles are allowed). The square of a side length is a positive integer. It is thus natural to ask how large…

Combinatorics · Mathematics 2024-05-21 Oliver Mantas Ališauskas , Giedrius Alkauskas , Valdas Dičiūnas

An n-simplex is said to be n-well-centered if its circumcenter lies in its interior. We introduce several other geometric conditions and an algebraic condition that can be used to determine whether a simplex is n-well-centered. These…

Computational Geometry · Computer Science 2009-12-17 Evan VanderZee , Anil N. Hirani , Damrong Guoy , Vadim Zharnitsky , Edgar Ramos