English
Related papers

Related papers: On a Conjecture on Sharygin Triangles

200 papers

We prove that any sufficiently small perturbation of an isosceles triangle has a periodic billiard path. Our proof involves the analysis of certain infinite families of Fourier series that arise in connection with triangular billiards, and…

Dynamical Systems · Mathematics 2013-06-05 W. Patrick Hooper , Richard Evan Schwartz

In this paper we give a simple, short, and self-contained proof for a non-trivial upper bound on the probability that a random $\pm 1$ symmetric matrix is singular.

Probability · Mathematics 2020-06-16 Asaf Ferber

We determine the symmetrized topological complexity of the circle, using primarily just general topology.

Algebraic Topology · Mathematics 2017-03-17 Donald M Davis

Trisecting an angle has been proved to be impossible by Euclidean Geometry, using only straight edge and compass. However, there is a method using Origami (paper folding) procedure to trisect an angle. The algebraic analysis of the same…

General Mathematics · Mathematics 2021-02-22 Ramachandra Bhat

We define spherical Heron triangles (spherical triangles with "rational" side-lengths and angles) and parametrize them via rational points of certain families of elliptic curves. We show that the congruent number problem has infinitely many…

Number Theory · Mathematics 2021-12-15 Tinghao Huang , Matilde Lalín , Olivier Mila

The purpose of this paper is to investigate the properties of spectral and tiling subsets of cyclic groups, with an eye towards the spectral set conjecture in one dimension, which states that a bounded measurable subset of $\mathbb{R}$…

Classical Analysis and ODEs · Mathematics 2023-01-02 Romanos Diogenes Malikiosis

A spherical n-gon is a bordered surface homeomorphic to a closed disk, with n distinguished boundary points called corners, equipped with a Riemannian metric of constant curvature 1, except at the corners, and such that the boundary arcs…

Complex Variables · Mathematics 2015-12-18 Alexandre Eremenko , Andrei Gabrielov , Vitaly Tarasov

We consider the problem of finding integer-sided triangles with R/r an integer, where R and r are the radii of the circumcircle and incircle respectively. We show that such triangles are relatively rare.

History and Overview · Mathematics 2007-05-23 Allan J. MacLeod

Given a set of radii measured from a fixed point, the existence of a convex configuration with respect to the set of distinct radii in the two-dimensional case is proved when radii are distinct or repeated at most four points. However, we…

Computational Geometry · Computer Science 2025-08-22 Supanut Chaidee , Kokichi Sugihara

For a triangle $\Delta$, let (P) denote the problem of the existence of points in the plane of $\Delta$, that are at rational distance to the 3 vertices of $\Delta$. Answer to (P) is known to be positive in the following situation: $\Delta$…

Number Theory · Mathematics 2013-01-29 Roy Barbara , Antoine Karam

We classify triangles that can be tiled only into a square number of congruent triangles, settling Erd\H{o}s Problem 633.

Combinatorics · Mathematics 2026-05-06 Michael Beeson , Miklos Laczkovich , Yan X. Zhang

A spherical polyhedron surface is a triangulated surface obtained by isometric gluing of spherical triangles. For instance, the boundary of a generic convex polytope in the 3-sphere is a spherical polyhedron surface. This paper investigates…

Geometric Topology · Mathematics 2016-09-07 Feng Luo

There is an old conjecture by Shermer \cite{sher} that in a polygon with $n$ vertices and $h$ holes, $\lfloor \dfrac{n+h}{3} \rfloor$ vertex guards are sufficient to guard the entire polygon. The conjecture is proved for $h=1$ by Shermer…

Computational Geometry · Computer Science 2021-02-23 Sharareh Alipour

Both Cuckler and Yuster independently conjectured that when $n$ is an odd positive multiple of $3$ every regular tournament on $n$ vertices contains a collection of $n/3$ vertex-disjoint copies of the cyclic triangle. Soon after, Keevash…

Combinatorics · Mathematics 2018-06-20 Lina Li , Theodore Molla

It is shown that every simple polygon in general position with $n$ walls can be illuminated from a single point light source $s$ after at most $\lfloor (n-2)/4\rfloor$ diffuse reflections, and this bound is the best possible. A point $s$…

Computational Geometry · Computer Science 2015-05-19 Eli Fox-Epstein , Csaba Tóth , Andrew Winslow

A famous conjecture of Caccetta and H\"aggkvist is that in a digraph on $n$ vertices and minimum out-degree at least $\frac{n}{r}$ there is a directed cycle of length $r$ or less. We consider the following generalization: in an undirected…

Combinatorics · Mathematics 2018-04-05 Ron Aharoni , Ron Holzman , Matthew DeVos

We consider the set of points chosen randomly, independently and uniformly in the $d$-dimensional spherical layer. A set of points is called $1$-convex if all its points are vertices of the convex hull of this set. In \cite{3} an estimate…

Combinatorics · Mathematics 2018-06-14 Sergey Sidorov

Constructions of regular heptagon and triskaidecagon by trisection of an angle are well known. An elegant construction of the heptagon by S. Adlaj shows a 3-fold symmetry related to a Galois group. Based on the latter construction, in this…

History and Overview · Mathematics 2025-07-18 Helmut Ruhland

The Cramer-Castillon problem (CCP) consists in finding one or more polygons inscribed in a circle such that their sides pass cyclically through a list of $N$ points. We study this problem where the points are the vertices of a triangle and…

Metric Geometry · Mathematics 2024-12-05 Dominique Laurain , Peter Moses , Dan Reznik

We examine a class of geometric theorems on cyclic 2n-gons. We prove that if we take n disjoint pairs of sides, each pair separated by an even number of polygon sides, then there is a linear combination of the angles between those sides…

Computational Geometry · Computer Science 2024-01-25 Philip Todd
‹ Prev 1 8 9 10 Next ›