Related papers: Median Area for Broken Sticks
When a pair of non-incident edges of a tetrahedron is chosen, the midpoints of the remaining 4 edges are the vertices of a planar parallelogram. A formula is given in terms of the six edge lengths for the area of this parallelogram. It is…
Three linearly dependent and pairwise linearly independent vectors of an euclidian space uniquely determine a planar quadric with symmetry centre in the origin. A rather simple formula for the area of an arbitrary sector at centre of such a…
Let ${\cal T}$ be a triangulation of a set ${\cal P}$ of $n$ points in the plane, and let $e$ be an edge shared by two triangles in ${\cal T}$ such that the quadrilateral $Q$ formed by these two triangles is convex. A {\em flip} of $e$ is…
If an n-side unit regular polygon is divided into m equal sized parts, then what is the minimum length of the split line ${l_{m,n}}$? This problem has its practical application in real world. This paper proved that ${l_{2,3}} = \sqrt…
We present a general algorithm for finding the overlap area between two ellipses. The algorithm is based on finding a segment area (the area between an ellipse and a secant line) given two points on the ellipse. The Gauss-Green formula is…
The study of "random segments" is a classic issue in geometrical probability, whose complexity depends on how it is defined. But in apparently simple models, the random behavior is not immediate. In the present manuscript the following…
We study the problem of finding a triangulation T of a planar point set S such as to minimize the expected distance between two points x and y chosen uniformly at random from S. By distance we mean the length of the shortest path between x…
The roughness exponent is reported in numerical simulations with a three-dimensional elastic beam lattice. Two different types of disorder have been used to generate the breaking thresholds, i.e., distributions with a tail towards either…
We compute a minimum degree threshold sufficient for 3-partite graphs to admit a fractional triangle decomposition. Together with recent work of Barber, K\"uhn, Lo, Osthus and Taylor, this leads to bounds for exact decompositions and in…
We consider mixed integer linear sets defined by two equations involving two integer variables and any number of non-negative continuous variables. The non-trivial valid inequalities of such sets can be classified into split, type 1, type…
We develop a multifractal random tilling that fills the square. The multifractal is formed by an arrangement of rectangular blocks of different sizes, areas and number of neighbors. The overall feature of the tilling is an heterogeneous and…
Given a probability distribution on an open book (a metric space obtained by gluing a disjoint union of copies of a half-space along their boundary hyperplanes), we define a precise concept of when the Fr\'{e}chet mean (barycenter) is…
Construction of tight confidence regions and intervals is central to statistical inference and decision making. This paper develops new theory showing minimum average volume confidence regions for categorical data. More precisely, consider…
We study numerically the growth of a crack in an elastic medium under the influence of a travelling shockwave. We describe the implementation of a fast algorithm which is perfectly suited for a data parallel computer. Using large scale…
In recent paper (Goloveshkin and Myagkov 2014) we proposed a two-dimensional energy-based model of fragmentation of rapidly expanding cylinder under plane strain conditions. The model allowed one to estimate the average fragment length and…
Consider n unit intervals, say [1,2], [3,4], ..., [2n-1,2n]. Identify their endpoints in pairs at random, with all (2n-1)!! = (2n-1) (2n-3) ... 3 1 pairings being equally likely. The result is a collection of cycles of various lengths, and…
Any permutation-invariant function of data points $\vec{r}_i$ can be written in the form $\rho(\sum_i\phi(\vec{r}_i))$ for suitable functions $\rho$ and $\phi$. This form - known in the machine-learning literature as Deep Sets - also…
We compute exactly the mean perimeter <L(T)> and the mean area <A(T)> of the convex hull of a random acceleration process of duration T in two dimensions. We use an exact mapping that relates, via Cauchy's formulae, the computation of the…
Robust estimators, like the median of a point set, are important for data analysis in the presence of outliers. We study robust estimators for locationally uncertain points with discrete distributions. That is, each point in a data set has…
In this paper we obtain the density function and the distribution function of the distance between two uniformly and independently distributed random points in any right-angled triangle. The density function is derived from the chord length…