Related papers: Median Area for Broken Sticks
We revisit the method of Carleman linearization for systems of ordinary differential equations with polynomial right-hand sides. This transformation provides an approximate linearization in a higher-dimensional space through the exact…
We prove that any oblivious algorithm using space $S$ to find the median of a list of $n$ integers from $\{1,...,2n\}$ requires time $\Omega(n \log\log_S n)$. This bound also applies to the problem of determining whether the median is odd…
The total diameter of a closed planar curve $C\subset R^2$ is the integral of its antipodal chord lengths. We show that this quantity is bounded below by twice the area of $C$. Furthermore, when $C$ is convex or centrally symmetric, the…
To any combinatorial triangulation $T$ of a square, there is an associated polynomial relation $p_T$ among the areas of the triangles of $T$. With the goal of understanding this polynomial, we consider polynomials obtained from $p_T$ by…
Given a finite metric, one can construct its tight span, a geometric object representing the metric. The dimension of a tight span encodes, among other things, the size of the space of explanatory trees for that metric; for instance, if the…
Distribution estimation under error-prone or non-ideal sampling modelled as "sticky" channels have been studied recently motivated by applications such as DNA computing. Missing mass, the sum of probabilities of missing letters, is an…
We enumerate all dissections of an equilateral triangle into smaller equilateral triangles up to size 20, where each triangle has integer side lengths. A perfect dissection has no two triangles of the same side, counting up- and…
We study the fundamental task of estimating the median of an underlying distribution from a finite number of samples, under pure differential privacy constraints. We focus on distributions satisfying the minimal assumption that they have a…
The leading and next to leading terms of the average arithmetic area $< S(m)>$ enclosed by $m\to\infty$ independent closed Brownian planar paths, with a given length $t$ and starting from and ending at the same point, is calculated. The…
The setting for this brief paper is R^3. Distance between two spheres is understood as distance delta between spherical centers. For instance, a Reuleaux tetrahedron T is the intersection of four unit balls satisfying delta=1 pairwise.…
We investigate the statistical properties of a randomly branched 3--functional $N$--link polymer chain without excluded volume, whose one point is fixed at the distance $d$ from the impenetrable surface in a 3--dimensional space. Exactly…
We give a new proof of the formula expressing the area of the triangle whose vertices are the projections of an arbitrary point in the plane onto the sides of a given triangle, in terms of the geometry of the given triangle and the location…
Given any set of points $S$ in the unit square that contains the origin, does a set of axis aligned rectangles, one for each point in $S$, exist, such that each of them has a point in $S$ as its lower-left corner, they are pairwise interior…
We formulate the statistics of the discrete multicomponent fragmentation event using a methodology borrowed from statistical mechanics. We generate the ensemble of all feasible distributions that can be formed when a single integer…
Let T be a triangulation of a simple polygon. A flip in T is the operation of removing one diagonal of T and adding a different one such that the resulting graph is again a triangulation. The flip distance between two triangulations is the…
Consider a 2-plane $P \subset \mathbb{C}^n$ and let $D$ be a bounded region in $P$ with a piecewise-smooth boundary. Let $I(D)$ be the infimum of areas of all piecewise-smooth isotropic surfaces in $\mathbb{C}^n$ with the same boundary as…
Given an increasing sequence of integers a(n), it is known (due to Weyl) that for almost all reals t, the fractional parts of the dilated sequence t*a(n) are uniformly distributed in the unit interval. Some effort has been made recently to…
The distribution function of the end-to-end distance of a semiflexible polymer, G(R;L) (where R denotes the end-to-end distance and L the contour length), is calculated using a meanfield-like approach. The theory yields an extremely simple…
For arbitrary two probability measures on real d-space with given means and variances (covariance matrices), we provide lower bounds for their total variation distance. In the one-dimensional case, a tight bound is given.
Finding hidden/lost targets in a broad region costs strenuous effort and takes a long time. From a practical view, it is convenient to analyze the available data to exclude some parts of the search region. This paper discusses the…