Related papers: Random Polygon to Ellipse: A Generalization
We study values of generalized polylogarithms at various points and relationships among them. Polylogarithms of small weight at the points 1/2 and -1 are completely investigated. We formulate a conjecture about the structure of the linear…
This work contributes to the analysis of linear geometric polygon transformations with the aim to force a desired shape by an iterative procedure.
In recent work by L. Levine and Y. Peres, it was observed that three models for particle aggregation on the lattice - the divisible sandpile, rotor-router aggregation, and internal diffusion limited aggregation - share a common scaling…
Marginal polytopes are important geometric objects that arise in statistics as the polytopes underlying hierarchical log-linear models. These polytopes can be used to answer geometric questions about these models, such as determining the…
We are interested in the naive problem whether we can move a solid object in a solid box or not. We restrict move to rotation. In the case we can, the centre and the ``direction'' of rotation may be restricted. Simplifying, we consider…
We are interested in easy geometric transformations which regularize n-polygons in the non-euclidean plane. A transformation is called easy if it can be easily implemented into an algorithm. This article is motivated by preceding work on…
We study the probability distribution of the area and the number of vertices of random polygons in a convex set $K\subset\mathbb{R}^2$. The novel aspect of our approach is that it yields uniform estimates for all convex sets…
We generalize Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n+1 rational vertices, we use its description as the intersection of n+1 halfspaces,…
The logarithmic potential is of great interest and relevance in the study of the dynamics of galaxies. Some small corrections to the work of Contopoulos & Seimenis (1990) who used the method of Prendergast (1982) to find periodic orbits and…
This article investigates, by probabilistic methods, various geometric questions on B_p^n, the unit ball of \ell_p^n. We propose realizations in terms of independent random variables of several distributions on B_p^n, including the…
For a given elliptic curve $E$ over a finite local ring, we denote by $E^{\infty}$ its subgroup at infinity. Every point $P \in E^{\infty}$ can be described solely in terms of its $x$-coordinate $P_x$, which can be therefore used to…
In this paper, we introduce a generalization of the Wasserstein barycenter, to a case where the initial probability measures live on different subspaces of R^d. We study the existence and uniqueness of this barycenter, we show how it is…
Hilbert space frames generalize orthonormal bases to allow redundancy in representations of vectors while keeping good reconstruction properties. A frame comes with an associated frame operator encoding essential properties of the frame. We…
For any delta > 1 we construct a periodic and locally finite packing of the plane with ellipses whose delta-enlargement covers the whole plane. This answers a question of Imre B\'ar\'any. On the other hand, we show that if C is a packing in…
Translate the positive-integer lattice points in the first quadrant by some amount in the horizontal and vertical directions. Take a decreasing concave (or convex) curve in the first quadrant and construct a family of curves by rescaling in…
Let X be randomly chosen from {-1,1}^n, and let Y be randomly chosen from the standard spherical Gaussian on R^n. For any (possibly unbounded) polytope P formed by the intersection of k halfspaces, we prove that |Pr [X belongs to P] - Pr [Y…
This paper derives the elliptical matrix variate version of the well known univariate Birnbaum and Saunders distribution. A generalisation based on a matrix transformation is proposed, instead of the independent element by element…
The problem of packing ellipsoids of different sizes and shapes into an ellipsoidal container so as to minimize a measure of overlap between ellipsoids is considered. A bilevel optimization formulation is given, together with an algorithm…
We study the asymptotic behaviour of the maximum interpoint distance of random points in a planar bounded set with an unique major axis and a boundary behaving like an ellipse at the endpoints. Our main result covers the case of uniformly…
We shall consider sections of an elliptic scheme $\mathcal{E}$ over a(n affine) base curve $B$, and study the points of $B$ where the section takes a torsion value. In particular, we shall relate the distribution in $B$ of these points with…