Related papers: Steinhaus' problem on partition of a triangle
The {\it largest angle bisection} procedure is the operation which partitions a given triangle, $T$, into two smaller triangles by constructing the angle bisector of the largest angle of $T$. Applying the procedure to each of these two…
To generate a triangle of unit perimeter, break a stick of length 1 in two places at random, with the condition that triangle inequalities are satisfied. Is there a similarly natural method for generating triangles of unit area? Study of a…
We study the triangle inequalities for angles (with different definitions) and present inequalities concerning the entries of correlation matrices through the positivity of $3\times 3$ matrices. We extend our discussions to the inequalities…
In this paper, we consider the Dirichlet problem associated to an elliptic Kirchhoff-type equation depending on two parameters. Under rather general and natural assumptions, we prove that, for certain values of the parameters, the problem…
R. Nandakumar asked whether there is a tiling of the plane by pairwise incongruent triangles of equal area and equal perimeter. Recently a negative answer was given by Kupavskii, Pach and Tardos. Still one may ask for weaker versions of the…
Let a stick be broken at random at n-1 points to form n pieces. We consider three problems on forming k-gons with k out of these n pieces, and show how a statistical approach, through a linear transformation of variables, yields simple…
Matrix partition problems generalize a number of natural graph partition problems, and have been studied for several standard graph classes. We prove that each matrix partition problem has only finitely many minimal obstructions for split…
If $P$ is a point inside $\triangle ABC$, then the cevians through $P$ divide $\triangle ABC$ into smaller triangles of various sizes. We give theorems about the relationship between the radii of certain excircles of some of these…
We introduce and solve a two-matrix model for the tri-coloring problem of the vertices of a random triangulation. We present three different solutions: (i) by orthogonal polynomial techniques (ii) by use of a discrete Hirota bilinear…
The main result of this paper, is the complete parametric description of the family of triangles which have integer sidelengths and with one angle being sixty degrees.
We briefly introduce several problems: (1) a generalization of the convex fair partition conjecture, (2) on non-trivial invariants among polyhedrons that can be formed from the same set of face polygons, (3) two questions on assembling…
In this paper, we use a branch of polyhedral geometry, Ehrhart theory, to expand our combinatorial understanding of congruences for partition functions. Ehrhart theory allows us to give a new decomposition of partitions, which in turn…
Triangulation of a three-dimensional point from at least two noisy 2-D images can be formulated as a quadratically constrained quadratic program. We propose an algorithm to extract candidate solutions to this problem from its semidefinite…
The n-way number partitioning problem, a fundamental challenge in combinatorial optimization, has significant implications for applications such as fair division and machine scheduling. Despite these problems being NP-hard, many…
J. J. Sylvester's four-point problem asks for the probability that four points chosen uniformly at random in the plane have a triangle as their convex hull. Using a combinatorial classification of points in the plane due to Goodman and…
Consider a $2\times n$ rectangular grid composed of $1\times 1$ squares. Cutting only along the edges between squares, how many ways are there to divide the board into $k$ pieces? Building off the work of Durham and Richmond, who found the…
The Steiner tree problem aims to determine a minimum edge-weighted tree that spans a given set of terminal vertices from a given graph. In the past decade, a considerable number of algorithms have been developed to solve this…
Both the USA TST 2008 and the ELMO Shortlist 2013 suggested two issues that are connected to fixed points. These problems provide a strong linkage between the various attributes of specific points in a triangle. In this article, we will…
We study the balanced $k$-way hypergraph partitioning problem, with a special focus on its practical applications to manycore scheduling. Given a hypergraph on $n$ nodes, our goal is to partition the node set into $k$ parts of size at most…
More than two centuries ago Malfatti (see \cite{malfatti}) raised and solved the following problem (the so-called Malfatti's construction problem):Construct three circles into a triangle so that each of them touches the two others from…