English
Related papers

Related papers: Solution of Erd\H{o}s Problem 633

200 papers

Almost $50$ years ago Erd\H{o}s and Purdy asked the following question: Given $n$ points in the plane, how many triangles can be approximate congruent to equilateral triangles? They pointed out that by dividing the points evenly into three…

Combinatorics · Mathematics 2023-03-28 József Balogh , Felix Christian Clemen , Adrian Dumitrescu

We present a, hopefully, elementary mathematical treatment of the computational aspects of congruent numbers, such that an amateur could understand the problem and perform their own calculations.

Number Theory · Mathematics 2021-03-04 Allan J. MacLeod

We give a simple proof of T. Stehling's result, that in any normal tiling of the plane with convex polygons with number of sides not less than six, all tiles except the finite number are hexagons.

Metric Geometry · Mathematics 2018-05-07 Arseniy Akopyan

We give a computer-based proof of the following fact: If a square is divided into seven or nine convex polygons, congruent among themselves, then the tiles are rectangles.

Computational Geometry · Computer Science 2021-11-24 Gerardo L. Maldonado , Edgardo Roldán-Pensado

Given a triangulation of a closed topological cube, we show that (under some technical condition) there is an essentially unique tiling of a rectangular parallelepiped by cubes, indexed by the vertices of the triangulation. Moreover, i -…

Geometric Topology · Mathematics 2012-08-23 Sa'ar Hersonsky

We show that three dimensional cubes of any size can be tiled with trominoes and, when necessary, one or two singletons in any positions. Cubes of side length a multiple of three can always be tiled with trominoes (known), cubes of side…

Combinatorics · Mathematics 2010-11-23 Norton Starr

Tiling models are classical statistical models in which different geometric shapes, the tiles, are packed together such that they cover space completely. In this paper we discuss a class of two-dimensional tiling models in which the tiles…

Statistical Mechanics · Physics 2015-06-24 Bernard Nienhuis

Our main theorem classifies the Auslander-Reiten triangles according to properties of the morphisms involved. As a consequence, we are able to compute the mapping cone of an irreducible morphism. We finish by showing a technique for…

Representation Theory · Mathematics 2016-10-27 Edson Ribeiro Alvares , Sônia Maria Fernandes , Hernán Giraldo

It was proved by Ron Graham and the second author that for any coloring of the $N \times N$ grid using fewer than $\log \log N$ colours, one can always find a monochromatic isosceles right triangle, a triangle with vertex coordinates $(x,…

Combinatorics · Mathematics 2021-03-03 Ilya Shkredov , Jozsef Solymosi

We describe some theoretical results on triangulations of surfaces and we develop a theory on roots, decompositions and genus-surfaces. We apply this theory to describe an algorithm to list all triangulations of closed surfaces with at most…

Combinatorics · Mathematics 2019-01-30 Gennaro Amendola

On objects of a triangulated category with a stability condition, we construct a topology.

Algebraic Geometry · Mathematics 2007-05-23 So Okada

A result due to Burago and Zalgaller (1960, 1995) states that every orientable polyhedral surface, one that is obtained by gluing Euclidean polygons, has an isometric piecewise linear (PL) embedding into Euclidean space $\mathbb{E}^3$. A…

Computational Geometry · Computer Science 2024-09-02 Francis Lazarus , Florent Tallerie

Inspired by the Erd\H{o}s' problem in Ramsey theory, we propose a dynamical version of the problem and answer it positively for circle maps.

Dynamical Systems · Mathematics 2025-12-30 Enhui Shi , Hui Xu

We analyze the computational complexity of several new variants of edge-matching puzzles. First we analyze inequality (instead of equality) constraints between adjacent tiles, proving the problem NP-complete for strict inequalities but…

Turaev Viro invariants are amongst the most powerful tools to distinguish 3-manifolds: They are implemented in mathematical software, and allow practical computations. The invariants can be computed purely combinatorially by enumerating…

Computational Geometry · Computer Science 2018-10-24 Clément Maria , Jonathan Spreer

After a short summary of known results on surface-complexity of closed 3-manifolds, we will classify all closed orientable 3-manifolds with surface-complexity one.

Geometric Topology · Mathematics 2019-01-30 Gennaro Amendola

Kedlaya, Kolpakov, Poonen, and Rubinstein classified tetrahedra all of whose dihedral angles are rational multiples of $\pi$ into two one-parameter families (a Hill family and a new family) and $59$ sporadic tetrahedra. In this paper, we…

Metric Geometry · Mathematics 2023-12-05 A. Anas Chentouf , Yihang Sun

Given a collection of N rectangles such that the side ratio of each one is a quadratic irrationality, we find all rectangles which can be tiled by rectangles similar to one of the given ones. It means that each possible shape can be used…

Combinatorics · Mathematics 2016-12-06 Fyodor Sharov

We consider a certain tiling problem of a planar region in which there are no long horizontal or vertical strips consisting of copies of the same tile. Intuitively speaking, we would like to create a dappled pattern with two or more kinds…

Discrete Mathematics · Computer Science 2018-12-18 Shizuo Kaji , Alexandre Derouet-Jourdan , Hiroyuki Ochiai

We give infinite triangularization and strict triangularization results for algebras of operators on infinite dimensional vector spaces. We introduce a class of algebras we call Ore-solvable algebras: these are similar to iterated Ore…

Rings and Algebras · Mathematics 2020-07-27 Miodrag Iovanov , Jeremy Edison , Alexander Sistko
‹ Prev 1 3 4 5 6 7 10 Next ›