Related papers: The largest angle bisection procedure
The paper is devoted to the description of family of scalene triangles for which the triangle formed by the intersection points of bisectors with opposite sides is isosceles. We call them Sharygin triangles. It turns out that they are…
A regular polygon circumscribing another regular polygon (with a different side number) may be tightened to minimize the difference of both areas. The manuscripts computes the optimum result under the restriction that both polygons are…
The MAX BISECTION problem seeks a maximum-size cut that evenly divides the vertices of a given undirected graph. An open problem raised by Austrin, Benabbas, and Georgiou is whether MAX BISECTION can be approximated as well as MAX CUT,…
The graph bisection problem is the problem of partitioning the vertex set of a graph into two sets of given sizes such that the sum of weights of edges joining these two sets is optimized. We present a semidefinite programming relaxation…
Algorithms that decompose a manifold into simple pieces reveal the geometric and topological structure of the manifold, showing how complicated structures are constructed from simple building blocks. This note describes a way to…
In this paper we study the bisections of a centrally symmetric planar convex body which minimize the maximum relative diameter functional. We give necessary and sufficient conditions for being a minimizing bisection, as well as analyzing…
Tensor diagonalization means transforming a given tensor to an exactly or nearly diagonal form through multiplying the tensor by non-orthogonal invertible matrices along selected dimensions of the tensor. It is generalization of approximate…
Given a triangle $\Delta$, we study the problem of determining the smallest enclosing and largest embedded isosceles triangles of $\Delta$ with respect to area and perimeter. This problem was initially posed by Nandakumar and was first…
In this paper, we introduce a natural geometric extension of the partition function. More precisely, we investigate the problem of counting partitions of a rectangle into rectangular blocks with integer sides. Here, two partitions of a…
An elementary geometric construction known as Napoleon's theorem produces an equilateral triangle built on the sides of any initial triangle: the centroids of each equilateral triangle meeting the original sides, all outward or all inward,…
In this paper, the operation of totally asymmetric simple exclusion process with one or two shortcuts under open boundary conditions is discussed. Using both mathematical analysis and numerical simulations, we have found that, according to…
Given any convex $n$-gon, in this article, we: (i) prove that its vertices can form at most $n^2/2 + \Theta(n\log n)$ isosceles trianges with two sides of unit length and show that this bound is optimal in the first order, (ii) conjecture…
We compute the number of triangulations of a convex $k$-gon each of whose sides is subdivided by $r-1$ points. We find explicit formulas and generating functions, and we determine the asymptotic behaviour of these numbers as $k$ and/or $r$…
It is well known that a triangle with side lengths 3, 4 and 5 is right-angled. Euclid was the first to give a formula for generating other right-angled triangles with integer side lengths. In this text, I present a novel algorithm to…
A Poisson line tessellation is observed within a window. With each cell of the tessellation, we associate the inradius, which is the radius of the largest ball contained in the cell. Using Poisson approximation, we compute the limit…
In this note, we provide a generalization for the definition of a trisection of a 4-manifold with boundary. We demonstrate the utility of this more general definition by finding a trisection diagram for the Cacime Surface, and also by…
A triangle $T'$ is $\varepsilon$-similar to another triangle $T$ if their angles pairwise differ by at most $\varepsilon$. Given a triangle $T$, $\varepsilon>0$ and $n\in\mathbb{N}$, B\'ar\'any and F\"uredi asked to determine the maximum…
We prove that, for sufficiently large $n$, every graph of order $n$ with minimum degree at least $0.852n$ has a fractional edge-decomposition into triangles. We do this by refining a method used by Dross to establish a bound of $0.9n$. By a…
We study the problem of construction of a triangle from the feet of its internal angle bisectors. It is proved that in general case ruler-and-compass solution of this problem is impossible.
Recutting is an operation on planar polygons defined by cutting a polygon along a diagonal to remove a triangle, and then reattaching the triangle along the same diagonal but with opposite orientation. Recuttings along different diagonals…