Related papers: Geometric constructibility of polygons lying on a …
We consider Calderon's inverse problem with partial data in dimensions $n \geq 3$. If the inaccessible part of the boundary satisfies a (conformal) flatness condition in one direction, we show that this problem reduces to the invertibility…
Let $H$ be a hypersurface in $\mathbb R^n$ and let $\pi$ be an orthogonal projection in $\mathbb R^n$ restricted to $H$. We say that $H$ satisfies the $Archimedean$ $projection$ $property$ corresponding to $\pi$ if there exists a constant…
It is well known that several classical geometry problems (e.g., angle trisection) are unsolvable by compass and straightedge constructions. But what kind of object is proven to be non-existing by usual arguments? These arguments refer to…
In this paper we prove that $\Pi$-projective spaces $\mathbb{P}^n_\Pi$ arise naturally in supergeometry upon considering a non-projected thickening of $\mathbb{P}^n$ related to the cotangent sheaf $\Omega^1_{\mathbb{P}^n}$. In particular,…
John Conway's Circle Theorem is a gem of plane geometry. The six points formed by continuing the sides of a triangle beyond every vertex by the length of its opposite side, are concyclic. The theorem has attracted several proofs. We present…
A $\textit{regular polygon surface}$ $M$ is a surface graph $(\Sigma, \Gamma)$ together with a continuous map $\psi$ from $\Sigma$ into Euclidean 3-space which maps faces to regular Euclidean polygons. When $\Sigma$ is homeomorphic to the…
We prove that there is an absolute constant $ C$ such that for every $ n \geq 2 $ and $ N\geq 10^n, $ there exists a polytope $ P_{n,N} \subset \mathbb{R}^n $ with at most $ N $ facets that satisfies…
The Pythagorean Theorem has been proved in hundreds of ways, yet it inspires fresh insights through geometry and trigonometry. In this paper, we offer a new proof based on three circles that circumscribe the sides of a right triangle.…
Given a finite Coxeter system $(W,S)$ and a Coxeter element $c$, we construct a simple polytope whose outer normal fan is N. Reading's Cambrian fan $F_c$, settling a conjecture of Reading that this is possible. We call this polytope the…
We investigate the minimum number of cycles of specified lengths in planar $n$-vertex triangulations $G$. It is proven that this number is $\Omega(n)$ for any cycle length at most $3 + \max \{ {\rm rad}(G^*), \lceil…
In the past year several constructions of non-invertible symmetries in Quantum Field Theory in $d\geq 3$ have appeared. In this paper we provide a unified perspective on these constructions. Central to this framework are so-called theta…
This paper contains examples of closed aspherical manifolds obtained as a by-product of recent work by the author [arXiv:math.GR/0509490] on the relative strict hyperbolization of polyhedra. The following is proved. (I) Any closed…
We prove the existence of a center, or continuous selection of a point, in the relative interior of $C^1$ embedded $k$-disks in Riemannian $n$-manifolds. If $k\le 3$ the center can be made equivariant with respect to the isometries of the…
An orthogonal polygon is called an ortho-unit polygon if its vertices have integer coordinates, and all of its edges have length one. In this paper we prove that any ortho-unit polygon with $n \geq 12$ vertices can be guarded with at most…
We prove, in some cases in term of kippenhahn curve, that if 5-by-5 partial isometry whose numerical range is a circular disc then its center is must be the origin. This gives a partial affirmative answer of the Conjecture 5.1. of [H. l.…
Given a convex polygon of $n$ sides, one can draw $n$ disks (called side disks) where each disk has a different side of the polygon as diameter and the midpoint of the side as its center. The intersection graph of such disks is the…
We construct a family of Riemannian 3-spheres that cannot be "swept out" by short closed curves. More precisely, for each $L > 0$ we construct a Riemannian 3-sphere $M$ with diameter and volume less than 1, so that every 2-parameter family…
We demonstrate in an elementary way how to construct a frieze pattern of width $m-3$ from a partition of a convex $m$-gon by not intersecting diagonals.
We consider a problem posed by Erd\H{o}s, Herzog and Piranian on the maximum product of distances of a point set of order $n$ with a given diameter. We prove that it is sufficient to consider convex polygons and obtain results on the…
We confirm the following conjecture of Fekete and Woeginger from 1997: for any sufficiently large even number $n$, every set of $n$ points in the plane can be connected by a spanning tour (Hamiltonian cycle) consisting of straight-line…