Related papers: Random Polygon to Ellipse: A Generalization
We study the problem of counting lattice points of a polytope that are weighted by an Ehrhart quasi-polynomial of a family of parametric polytopes. As applications one can compute integrals and maximum values of such quasi-polynomials, as…
The ellipsoid fitting conjecture of Saunderson, Chandrasekaran, Parrilo and Willsky considers the maximum number $n$ random Gaussian points in $\mathbb{R}^d$, such that with high probability, there exists an origin-symmetric ellipsoid…
In the generalized Legendre approach, the equation describing an asymptotically locally Euclidean space of type $D_n$ is found to admit an algebraic formulation in terms of the group law on a Weierstrass cubic. This curve has the structure…
We study the problem of rotating a simple polygon to contain the maximum number of elements from a given point set in the plane. We consider variations of this problem where the rotation center is a given point or lies on a line segment, a…
Let $\lambda$ be a dominant weight of a finite dimensional simple Lie algebra and $W$ the Weyl group. The convex hull of $W\lambda$ is defined as the weight polytope of $\lambda$. We provide a new proof that there is a natural bijection…
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…
Following work of Mazur-Tate and Satoh, we extend the definition of division polynomials to arbitrary isogenies of elliptic curves, including those whose kernels do not sum to the identity. In analogy to the classical case of division…
This study presents a generalised least squares based method for fitting polygons and ellipses to data points. The method is based on a trigonometric fitness function that approximates a unit shape accurately, making it applicable to…
We introduce Fregier ellipses which generalize the Fregier point in euclidean geometry. Subject is related to Dynamical Systems and Poncelet's closure theorem aka Poncelet porism and displaying geometric invariants (area,angles). Special…
We define a random zonotope in Euclidean space, by adding finitely many random segments, which are independently and identically distributed. For this random polytope, we determine, under a mild assumption on the distribution, the…
Zernike polynomials are commonly used to represent the wavefront phase on circular optical apertures, since they form a complete and orthonormal basis on the unit circle. Here, we present a generalization of this Zernike basis for a variety…
We introduce weak barycenters of a family of probability distributions, based on the recently developed notion of optimal weak transport of mass by Gozlanet al. (2017) and Backhoff-Veraguas et al. (2020). We provide a theoretical analysis…
This paper studies sparse elliptic random matrix models which generalize both the classical elliptic ensembles and sparse i.i.d. matrix models by incorporating correlated entries and a tunable sparsity parameter $p_n$. Each $n\times n$…
We consider a linearly elastic composite medium, which consists of a homogeneous matrix containing statistically inhomogeneous random set of heterogeneities and loaded by inhomogeneous remote loading. The new general integral equation is…
While the contents of Euclid's Elements are well-known these days, some characters of the original text have been overlooked due to interpretation by modern mathematical languages. The lens of modern mathematics once anachronistically…
Sometimes, it is possible to represent a complicated polytope as a projection of a much simpler polytope. To quantify this phenomenon, the extension complexity of a polytope $P$ is defined to be the minimum number of facets of a (possibly…
We consider a possible generalization of the random matrix theory, which involves the maximization of Tsallis' $q$-parametrized entropy. We discuss the dependence of the spacing distribution on $q$ using a non-extensive generalization of…
This paper provides a self-contained exploration of subdivisions of simplicial complexes, with emphasis on barycentric subdivision. We present formal definitions of subdivisions, show how the realization of a complex is preserved under…
This work sets the statistical affine shape theory in the context of real normed division algebras. The general densities apply for every field: real, complex, quaternion, octonion, and for any noncentral and non-isotropic elliptical…
A branch and bound algorithm is developed for global optimization. Branching in the algorithm is accomplished by subdividing the feasible set using ellipses. Lower bounds are obtained by replacing the concave part of the objective function…