Related papers: The complete characterization of tangram pentagons
There exist pairs of orthogonal Latin squares of any order n except if n=2 or n=6 [Bose, Shrikhande and Parker, 1960]. In particular, the problem of Euler's thirty-six officers does not have a solution. However, it has a "quantum solution":…
We study the following family of problems: Given a set of $n$ points in convex position, what is the maximum number triangles one can create having these points as vertices while avoiding certain sets of forbidden configurations. As…
A census is presented of all closed non-orientable 3-manifold triangulations formed from at most seven tetrahedra satisfying the additional constraints of minimality and P^2-irreducibility. The eight different 3-manifolds represented by…
An equilateral pentagon is a polygon in the plane with five sides of equal length. In this paper we classify the central configurations of the $5$-body problem having the five bodies at the vertices of an equilateral pentagon with an axis…
We present a simplified proof of a forty-year-old result concerning the tiling of the plane with equilateral convex polygons. Our approach is based on a theorem by M. Rao, who used an exhaustive computer search to confirm the completeness…
This is an exhaustive study of the seventeen elements of Pythagorean triangles, from the point of view of when such an element is an irrational number, a rational number, or an integer. For each of these 17 elements,precice conditions for…
Triangular algebras, and maximal triangular algebras in particular, have been objects of interest for over fifty years. Rich families of examples have been studied in the context of many w$^*$- and C$^*$-algebras, but there remains a dearth…
In this paper we develop an integer-affine classification of three-dimensional multistory completely empty convex marked pyramids. We apply it to obtain the complete lists of compact two-dimensional faces of multidimensional continued…
A triangulation of a punctured or pinched surface is irreducible if no edge can be shrunk without producing multiple edges or changing the topological type of the surface. The finiteness of the set of (non-isomorphic) irreducible…
We study the dissection of a square into congruent convex polygons. Yuan \emph{et al.} [Dissecting the square into five congruent parts, Discrete Math. \textbf{339} (2016) 288-298] asked whether, if the number of tiles is a prime number…
Over the past decade, we have designed six typefaces based on mathematical theorems and open problems, specifically computational geometry. These typefaces expose the general public in a unique way to intriguing results and hard problems in…
We propose a specific class of matrices which participate in factorization problems that turn to be equivalent to constant and entwining (non-constant) pentagon, reverse-pentagon or Yang-Baxter maps, expressed in non-commutative variables.…
It is well known that there are totally 130 deformation families of quasi-smooth terminal weighted hypersurface Fano threefolds and all members belonging to 95 families of Fano indices one are birationally rigid. Among remaining $35$…
A tiling of the sphere by triangles, squares, or hexagons is convex if every vertex has at most 6, 4, or 3 polygons adjacent to it, respectively. Assigning an appropriate weight to any tiling, our main result is explicit formulas for the…
In this paper we have discussed different possible orthogonalities in matrices, namely orthogonal, quasi-orthogonal, semi-orthogonal and non-orthogonal matrices including completely positive matrices, while giving some of their…
A tangram is a word in which every letter occurs an even number of times. Thus it can be cut into parts that can be arranged into two identical words. The \emph{cut number} of a tangram is the minimum number of required cuts in this…
For a family $\mathcal{F}$ of graphs, let $ex(n,\mathcal{F})$ denote the maximum number of edges in an $n$-vertex graph which contains none of the members of $\mathcal{F}$ as a subgraph. A longstanding problem in extremal graph theory asks…
We prove that for each odd integer $k \geq 7$, every graph on $n$ vertices without odd cycles of length less than $k$ contains at most $(n/k)^k$ cycles of length $k$. This generalizes the previous results on the maximum number of pentagons…
Which surfaces can be realized with two-dimensional faces of the five-dimensional cube (the penteract)? How can we visualize them? In recent work, Aveni, Govc, and Roldan, show that there exist 2690 connected closed cubical surfaces up to…
Some idea, which leads to a non-trivial solution of the quantum four-simplex equation, is exposed in this paper. We call this idea "pentagonal algebra". Few examples of the realisation of this idea are given here, and thus few examples of…