Related papers: Bounds of sub-triangles

In the paper, some lower bounds for polygamma functions are refined.

We suggest a geometric visualization of the process of constructing a triangle with prescribed bisectors that makes the existence of such a triangle geometrically evident.

In this work we count the number of satisfying states of triangulations of a convex n-gon using the transfer matrix method. We show an exponential (in n) lower bound. We also give the exact formula for the number of satisfying states of a…

We study the crossing number of links that are formed by edges of a triangulation T of the 3-sphere with n tetrahedra. We show that the crossing number is bounded from above by an exponential function of n^2. In general, this bound can not…

We generalize the notions of flippable and simultaneously flippable edges in a triangulation of a set S of points in the plane to so-called \emph{pseudo-simultaneously flippable edges}. Such edges are related to the notion of convex…

We prove existence of thick geodesic triangulations of hyperbolic 3-manifolds and use this to prove existence of universal bounds on the principal curvatures of surfaces embedded in hyperbolic 3-manifolds.

A widely investigated subject in combinatorial geometry, originated from Erd\H{o}s, is the following. Given a point set $P$ of cardinality $n$ in the plane, how can we describe the distribution of the determined distances? This has been…

We give a procedure to construct (quasi-)trisection diagrams for closed (pseudo-)manifolds generated by colored tensor models without restrictions on the number of simplices in the triangulation, therefore generalizing previous works in the…

We enumerate rooted triangulations of a sphere with multiple holes by the total number of edges and the length of each boundary component. The proof relies on a combinatorial identity due to W.T. Tutte.

We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…

In this paper, a theorem about similar triangles is proved. It shows that two small and four large triangles similar to the original triangle can appear if we choose well among several intersections of the perpendicular bisectors of the…

We describe the images of multilinear polynomials of arbitrary degree evaluated on the $3\times 3$ upper triangular matrix algebra over an infinite field.

The intersection matrix of a simplicial complex has entries equal to the rank of the intersection of its facets. In [1] the authors prove the intersection matrix is enough to determine a triangulation of a surface up to isomorphism. In this…

We give a formula for counting the triangles in a picture consisting of the three sides of a triangle and some cevians. This lets us prove statements that are claimed without proof in the Online Encyclopedia of Integer Sequences and some…

A tripartite-circle drawing of a tripartite graph is a drawing in the plane, where each part of a vertex partition is placed on one of three disjoint circles, and the edges do not cross the circles. We present upper and lower bounds on the…

Lower bounds for some explicit decision problems over the complex numbers are given.

We consider the problem of minimising the number of edges that are contained in triangles, among $n$-vertex graphs with a given number of edges. We prove a conjecture of F\"uredi and Maleki that gives an exact formula for this minimum, for…

A mostly expository account of old questions about the relationship between polyhedra and topological manifolds. Topics are old topological results, new gauge theory results (with speculations about next directions), and history of the…

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…

We obtain universal affine type estimates for the location of the geometric medians of triangle perimeters and for the location of the geometric medians of triangular domains. At the end, some alternative implementations of the triangle…