Packing unit squares in a rectangle.
Nagamochi, Hiroshi (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Expressing a number as the sum of two coprime squares.”
Packing unit squares in a rectangle.
The Regge symmetry is a scissors congruence in hyperbolic space.
Mohanty, Yana (2003)
Algebraic & Geometric Topology
Similarity:
Divisible tilings in the hyperbolic plane.
Broughton, S.Allen, Haney, Dawn M., McKeough, Lori T., Smith Mayfield, Brandy (2000)
The New York Journal of Mathematics [electronic only]
Similarity:
Efficient packing of unit squares in a square.
Kearney, Michael J., Shiu, Peter (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Discrepancies of point sequences on the Sierpiński carpet
Ligia-Loretta Cristea, Robert Franz Tichy (2003)
Mathematica Slovaca
Similarity:
On biembeddings of Latin squares.
Grannell, M.J., Griggs, T.S., Knor, M. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Properties of triangulations obtained by the longest-edge bisection
Francisco Perdomo, Ángel Plaza (2014)
Open Mathematics
Similarity:
The Longest-Edge (LE) bisection of a triangle is obtained by joining the midpoint of its longest edge with the opposite vertex. Here two properties of the longest-edge bisection scheme for triangles are proved. For any triangle, the number of distinct triangles (up to similarity) generated by longest-edge bisection is finite. In addition, if LE-bisection is iteratively applied to an initial triangle, then minimum angle of the resulting triangles is greater or equal than a half of the...
Classification of unilateral and equitransitive tilings by squares pf three sizes.
Bölcskei, Attila (2000)
Beiträge zur Algebra und Geometrie
Similarity:
Andreev’s Theorem on hyperbolic polyhedra
Roland K.W. Roeder, John H. Hubbard, William D. Dunbar (2007)
Annales de l’institut Fourier
Similarity:
In 1970, E.M.Andreev published a classification of all three-dimensional compact hyperbolic polyhedra (other than tetrahedra) having non-obtuse dihedral angles. Given a combinatorial description of a polyhedron, , Andreev’s Theorem provides five classes of linear inequalities, depending on , for the dihedral angles, which are necessary and sufficient conditions for the existence of a hyperbolic polyhedron realizing with the assigned dihedral angles. Andreev’s Theorem also shows that...
Unit rectangle visibility graphs.
Dean, Alice M., Ellis-Monaghan, Joanna A., Hamilton, Sarah, Pangborn, Greta (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity: