Related papers: Lognormality and Triangles of Unit Area
By defining the dimension of natural numbers as the number of prime factors, all natural numbers smaller than 2^(n+1) (n is a natural number) can be classified by their dimensions, and the count of numbers of each dimension gives a…
Percolation on a plane is usually associated with clusters spanning two opposite sides of a rectangular system. Here we investigate three-leg clusters generated on a square lattice and spanning the three sides of equilateral triangles. If…
In this article we provide several exact formulae to calculate the probability that a random triangle chosen within a planar region (any Lebesgue measurable set of finite measure) contains a given fixed point $O$. These formulae are in…
We present a new and simple randomized algorithm for constructing the Delaunay triangulation using nearest neighbor graphs for point location. Under suitable assumptions, it runs in linear expected time for points in the plane with…
We present a, hopefully, elementary mathematical treatment of the computational aspects of congruent numbers, such that an amateur could understand the problem and perform their own calculations.
A generalization of the random geometric graph (RGG) model is proposed by considering a set of points uniformly and independently distributed on a rectangle of unit area instead of on a unit square [0,1]^2. The topological properties of the…
In this work, we define a triangle area number to be the area number of a triangle whose sides have integer lengths, and whose area is a rational number. In Result 3, on page 17, we prove that every triangle area number is in fact an…
We consider the problem of random uniform generation of traces (the elements of a free partially commutative monoid) in light of the uniform measure on the boundary at infinity of the associated monoid. We obtain a product decomposition of…
The logarithmic-normal (lognormal) distribution is one of the most frequently observed distributions in nature and describes a large number of physical, biological and even sociological phenomena. The origin of this distribution is…
A variable line through the centroid G of a triangle divides the triangle into two parts each of whose lengths as a fraction of the perimeter fills a closed interval [m,1-m], with m between 0 and 1/2. We show that the range of m taken over…
Graphs are used in many disciplines to model the relationships that exist between objects in a complex discrete system. Researchers may wish to compare a network of interest to a "typical" graph from a family (or ensemble) of graphs which…
One of the best things about geometry is that it's cool! Geometry enables us to create incredible designs and astounding patterns. This article shows how to use a simple technique (iteration) to create designs that are both cool and…
In this paper we discuss the number of regions in a unit circle after drawing $n$ i.i.d. random chords in the circle according to a particular family of distribution. We find that as $n$ goes to infinity, the distribution of the number of…
It is well known that the area $U$ of the triangle formed by three tangents to a parabola $X$ is half of the area $T$ of the triangle formed by joining their points of contact. In this article, we study some properties of $U$ and $T$ for…
Given a subset of size $k$ of a very large universe a randomized way to find this subset could consist of deleting half of the universe and then searching the remaining part. With a probability of $2^{-k}$ one will succeed. By probability…
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…
In Euclidean space, one can use the dot product to give a formula for the area of a triangle in terms of the coordinates of each vertex. Since this formula involves only addition, subtraction, and multiplication, it can be used as a…
We improve the estimates of the subgraph probabilities in a random regular graph. Using the improved results, we further improve the limiting distribution of the number of triangles in random regular graphs.
The minimum linear arrangement problem on a network consists of finding the minimum sum of edge lengths that can be achieved when the vertices are arranged linearly. Although there are algorithms to solve this problem on trees in polynomial…
In this paper, we derive the exact formula for the probability that three randomly and uniformly selected points from the interior of the unit cube form vertices of an obtuse triangle.