Related papers: A parametrization of equilateral triangles having …
A fixed set of vertices in the plane may have multiple planar straight-line triangulations in which the degree of each vertex is the same. As such, the degree information does not completely determine the triangulation. We show that even if…
An equilateral triangle cannot be dissected into finitely many mutually incongruent equilateral triangles [Tutte 1948]. Therefore Tuza [Tuza 1991] asked for the largest number $s=s(n)$ such that there is a tiling of an equilateral triangle…
In this paper, we investigate the existence of self-dual MRD codes $C\subset L^n$, where $L/F$ is an arbitrary field extension of degree $m\geq n$. We then apply our results to the case of finite fields, and prove that if $m=n$ and…
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two trees). Our…
In this work, we show the geometric properties of a family of polyhedra obtained by folding a regular tetrahedron along regular triangular grids. Each polyhedron is identified by a pair of nonnegative integers. The polyhedron can be cut…
We prove a theorem on the relationships between the lengths of sides of a spherical quadrilateral with three right angles. They are analogous to the relationships in the Lambert quadrilateral in the hyperbolic plane. We apply this theorem…
The triangulations of a regular convex polygon are enumerated according to the number of diagonals parallel to a fixed edge. The enumeration uses the Shapiro convolution identity, as well as an interpretation of this identity in terms of…
A polyhedral surface~$\mathcal{C}$ in $\mathbb{R}^3$ with convex polygons as faces is a side-contact representation of a graph~$G$ if there is a bijection between the vertices of $G$ and the faces of~$\mathcal{C}$ such that the polygons of…
We obtain new upper and lower bounds on the number of unit perimeter triangles spanned by points in the plane. We also establish improved bounds in the special case where the point set is a section of the integer grid.
We develop the basic and new tools for classifying non-side-to-side tilings of the sphere by congruent triangles. Then we prove that, if the triangle has any irrational angle in degree, such tilings are: a sequence of 1-parameter families…
The dimension of a block design is the maximum positive integer $d$ such that any $d$ of its points are contained in a proper subdesign. Pairwise balanced designs PBD$(v,K)$ have dimension at least two as long as not all points are on the…
A graph drawing in the plane is called an almost embedding if images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. We introduce integer invariants of almost embeddings: winding number, cyclic and triodic Wu…
In view of solving problems of geometric realizability of polyhedra with given geometric constraints, we describe the space of geometric realizations of a simply-connected triangulated euclidean polyhedron in $\mathbb{R}^3$ up to similarity…
The aim of this work is a systematic investigation of the possible parameters of quasi-perfect (QP) binary and ternary linear codes of small dimensions and preparing a complete classification of all such codes. First we give a list of…
Eberhard proved that for every sequence $(p_k), 3\le k\le r, k\ne 5,7$ of non-negative integers satisfying Euler's formula $\sum_{k\ge3} (6-k) p_k = 12$, there are infinitely many values $p_6$ such that there exists a simple convex…
Tightness of a triangulated manifold is a topological condition, roughly meaning that any simplexwise linear embedding of the triangulation into euclidean space is "as convex as possible". It can thus be understood as a generalization of…
We consider quadrangles of perimeter $2$ in the plane with marked directed edge. To such quadrangle $Q$ a two-dimensional plane $\Pi\in\mathbb{R}^4$ with orthonormal base is corresponded. Orthogonal plane $\Pi^\bot$ defines a plane…
Magic squares are well-known arrangements of integers with common row, column, and diagonal sums. Various other magic shapes have been proposed, but triangles have been somewhat overlooked. We introduce certain triangular arrangements of…
Paul Erd\H{o}s and R. Daniel Mauldin asked a series of questions on certain types of polygons of area $1$, the vertices of which can be found in every planar set of infinite Lebesgue measure. We address two of these questions, one on cyclic…
We prove the following Theorem: Given any three distinct points on a straight line r, there exist an equilateral triangle, whose circumcenter lies on r, such that the projections of its vertices on r are exactly the three given points.