Related papers: The Perimeter Winternitz Theorem in a Triangle

The study of the graph diameter of polytopes is a classical open problem in polyhedral geometry and the theory of linear optimization. In this paper we continue the investigation initiated in [4] by introducing a vast hierarchy of…

In this paper, we investigate the polynomial integrand of an integral formula that yields the expected length of the minimal spanning tree of a graph whose edges are uniformly distributed over the interval [0, 1]. In particular, we derive a…

NOTE: Unfortunately, most of the results mentioned here were already known under the name of "d-separated interval piercing". The result that T_d(m) exists was first proved by Gya\'rfa\'s and Lehel in 1970, see [5]. Later, the result was…

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 consider the distances between a line and a set of points in the plane defined by the L^p-norms of the vector consisting of the euclidian distance between the single points and the line. We determine lines with minimal geometric…

Let S be a set of n points in the plane, and let T be a set of m triangles with vertices in S. Then there exists a point in the plane contained in Omega(m^3 / (n^6 log^2 n)) triangles of T. Eppstein (1993) gave a proof of this claim, but…

The central limit theorem, the invariance principle and the Poisson limit theorem for the hierarchy of freeness are studied. We show that for given natural m the limit laws can be expressed in terms of non-crossing partitions of depth…

A triangle with rational sides and rational area is called a rational triangle. In this paper we consider three problems of finding pairs of rational triangles which have a common circumradius as well as either a common perimeter or a…

One dimensional metrical geometry may be developed in either an affine or projective setting over a general field using only algebraic ideas and quadratic forms. Some basic results of universal geometry are already present in this…

The book number $b(G)$ of a graph $G$ is the maximum number of triangles sharing a common edge. A strengthening of Mantel's theorem due to Rademacher states that every $n$-vertex graph with more than $\lfloor n^2/4\rfloor$ edges contains at…

We obtain a sub-Riemannian version of the classical Gauss-Bonnet theorem. We consider subsurfaces of a three dimensional contact sub-Riemannian manifolds, and using a family of taming Riemannian metric, we obtain a pure sub-Riemannian…

We study 3-random-like graphs, that is, sequences of graphs in which the densities of triangles and anti-triangles converge to 1/8. Since the random graph ${\mathcal G}_{n,1/2}$ is, in particular, 3-random-like, this can be viewed as a weak…

We study the perimeter inequality under circular symmetrisation, and we provide a full geometric characterisation of equality cases. A careful inspection of the proof shows that a similar characterisation holds true also for the perimeter…

The diameter of a graph is the maximum distance among all pairs of vertices. Thus a graph $G$ has diameter $d$ if any two vertices are at distance at most $d$ and there are two vertices at distance $d$. We are interested in studying the…

Given $n$ non-vertical lines in 3-space, their vertical depth (above/below) relation can contain cycles. We show that the lines can be cut into $O(n^{3/2}\mathop{\mathrm{polylog}} n)$ pieces, such that the depth relation among these pieces…

We consider random Hermitian matrices with independent upper triangular entries. Wigner's semicircle law says that under certain additional assumptions, the empirical spectral distribution converges to the semicircle distribution. We…

We deal with the distribution of N points placed consecutively around the circle by a fixed angle of a. From the proof of Tony van Ravenstein, we propose a detailed proof of the Steinhaus conjecture whose result is the following: the N…

We prove that if $(M,g)$ is a topological 3-ball with a $C^4$-smooth Riemannian metric $g$, and mean-convex boundary $\partial M$ then knowledge of least areas circumscribed by simple closed curves $\gamma \subset \partial M$ uniquely…

In the moduli space of polynomials of degree 3 with marked critical points c_1 and c_2, let C_{1,n} be the locus of maps for which c_1 has period n and let C_{2,m} be the locus of maps for which c_2 has period m. A consequence of Thurston's…

A finite set of real numbers is called convex if the differences between consecutive elements form a strictly increasing sequence. We show that, for any pair of convex sets $A, B\subset\mathbb R$, each of size $n^{1/2}$, the convex grid…