Related papers: Median Area for Broken Sticks
Monsky's theorem from 1970 states that a square cannot be dissected into an odd number of triangles of the same area, but it does not give a lower bound for the area differences that must occur. We extend Monsky's theorem to "constrained…
Given a triangle, a trio of circumellipses can be defined, each centered on an excenter. Over the family of Poncelet 3-periodics (triangles) in a concentric ellipse pair (axis-aligned or not), the trio resembles a rotating propeller, where…
A method of truncating the large shell model basis is outlined. It relies on the order given by the unperturbed energies of the basis states and on the constancy of their spreading widths. Both quantities can be calculated by a simple…
The paper is split in two parts: in the first part, we construct the exact likelihood for a discretely observed rough differential equation, driven by a piecewise linear path. In the second part, we use this likelihood in order to construct…
This paper derives the exact cumulative density function of the distance between a randomly located node and any arbitrary reference point inside a regular $\el$-sided polygon. Using this result, we obtain the closed-form probability…
Let P be a d-dimensional n-point set. A Tverberg-partition of P is a partition of P into r sets P_1, ..., P_r such that the convex hulls conv(P_1), ..., conv(P_r) have non-empty intersection. A point in the intersection of the conv(P_i)'s…
We approximate the uniform measure on an equilateral triangle by a measure supported on $n$ points. We find the optimal sets of points ($n$-means) and corresponding approximation (quantization) error for $n\leq4$, give numerical…
We estimate from below the number of lines meeting each of given 4 disjoint smooth closed curves in a given cyclic order in the real projective 3-space and in a given linear order in the Euclidean 3-space. Similarly, we estimate the number…
Consider a string of $n$ positions, i.e. a discrete string of length $n$. Units of length $k$ are placed at random on this string in such a way that they do not overlap, and as often as possible, i.e. until all spacings between neighboring…
Given independent normally distributed points A,B,C,D in Euclidean 3-space, let Q denote the plane determined by A,B,C and D^ denote the orthogonal projection of D onto Q. The probability that the tetrahedron ABCD is acute remains…
Consider the Delaunay triangulation T of a set P of points in the plane as a Euclidean graph, in which the weight of every edge is its length. It has long been conjectured that the dilation in T of any pair p, p \in P, which is the ratio of…
In a frame of quasi-crystal approximation the dispersion equations are obtained for the wave vector of a coherent electromagnetic wave propagating in a media which contains a random set of parallel dielectric cylinders with possible…
In this review article we present the calculation of the splitting rate in flat space of a macroscopic fundamental string either intersecting at a generic angle a Dp-brane or lying on it. The result is then applied, in the context of the…
An interesting problem that determine a triangle of smallest area which circumscribes a semicircle is solved. Then a generalized golden right triangles sequence $T_n$ is obtained, and an interesting construction of the maximum generalized…
We prove a number of double-sided estimates relating discrete counterparts of several classical conformal invariants of a quadrilateral: cross-ratios, extremal lengths and random walk partition functions. The results hold true for any…
The hypothesis that high dimensional data tend to lie in the vicinity of a low dimensional manifold is the basis of manifold learning. The goal of this paper is to develop an algorithm (with accompanying complexity guarantees) for fitting a…
For an arbitrary convex quadrilateral $ABCD$ with area ${\cal A}$ and perimeter $p$, we define two points $I_1, I_2$ on its Newton line that serve as incenters. These points are the centers of two circles with radii $r_1, r_2$ that are…
The challenges of examining random partitions of space are a significant class of problems in the theory of geometric transformations. Richard Miles calculated moments of areas and perimeters of any order (including expectation) of the…
An approach to modelling random sets with locally finite perimeter as random elements in the corresponding subspace of $L^1$ functions is suggested. A Crofton formula for flat sections of the perimeter is shown. Finally, random processes of…
We consider the problem of estimating the number of triangles in a graph. This problem has been extensively studied in both theory and practice, but all existing algorithms read the entire graph. In this work we design a {\em…