English
Related papers

Related papers: Angle sums of random polytopes

200 papers

Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…

Combinatorics · Mathematics 2025-06-30 Jean Cardinal , Vincent Pilaud

It has been known that the distribution of the random distances between two uniformly distributed points within a convex polygon can be obtained based on its chord length distribution (CLD). In this report, we first verify the existing…

General Mathematics · Mathematics 2013-12-10 Fei Tong , Maryam Ahmadi , Jianping Pan

We compute averages of products and ratios of characteristic polynomials associated with Orthogonal, Unitary, and Symplectic Ensembles of Random Matrix Theory. The pfaffian/determinantal formulas for these averages are obtained, and the…

Mathematical Physics · Physics 2007-05-23 A. Borodin , E. Strahov

Let a random simplex in a d-dimensional convex body be the convex hull of d+1 random points from the body. We study the following question: As a function of the convex body, is the expected volume of a random simplex monotone non-decreasing…

Probability · Mathematics 2014-01-14 Luis Rademacher

An equidistant polytope is a special equidistant set in the space $\mathbb{R}^n$ all of whose boundary points have equal distances from two finite systems of points. Since one of the finite systems of the given points is required to be in…

Metric Geometry · Mathematics 2021-12-16 Csaba Vincze , Márk Oláh , Letícia Lengyel

We prove some "high probability" results on the expected value of the mean width for random perturbations of random polytopes. The random perturbations are considered for Gaussian and $p$-stable random vectors, as well as uniform…

Functional Analysis · Mathematics 2013-03-25 David Alonso-Gutierrez , Joscha Prochno

The objective of this paper is to present two types of results on Minkowski sums of convex polytopes. The first is about a special class of polytopes we call perfectly centered and the combinatorial properties of the Minkowski sum with…

Combinatorics · Mathematics 2009-02-14 Komei Fukuda , Christophe Weibel

In this paper we study the statistical properties of convex hulls of $N$ random points in a plane chosen according to a given distribution. The points may be chosen independently or they may be correlated. After a non-exhaustive survey of…

Statistical Mechanics · Physics 2010-03-31 Satya N. Majumdar , Alain Comtet , Julien Randon-Furling

In this paper, we will explicitly calculate Gauss sums for the general linear groups and the special linear groups over $\Bbb Z_n$, where $\Bbb Z_n=\Bbb Z/n \Bbb Z$ and $n>0$ is an integer. For $r$ being a positive integer, the formulae of…

Number Theory · Mathematics 2018-11-27 Su Hu , Guoxing He , Yingtong Meng , Yan Li

In the first part of the paper, we give an explicit algorithm to compute the (genus zero) Gromov-Witten invariants of blow-ups of an arbitrary convex projective variety in some points if one knows the Gromov-Witten invariants of the…

Algebraic Geometry · Mathematics 2009-09-25 Andreas Gathmann

In the first part we study deviation of a polynomial from its mathematical expectation. This deviation can be estimated from above by Carbery--Wright inequality, so we investigate estimates of the deviation from below. We obtain such…

Probability · Mathematics 2016-03-18 Lavrentin M. Arutyunyan , Egor D. Kosov

In this paper we consider three arithmetic families of isospectral non-isometric Riemannian orbifolds and in each case derive an upper bound for the size of the family which is polynomial as a function of the volume of the orbifolds. The…

Spectral Theory · Mathematics 2015-06-12 Benjamin Linowitz

We study the regularity of densities of distributions that are polynomial images of the standard Gaussian measure on $\mathbb{R}^n$. We assume that the degree of a polynomial is fixed and that each variable enters to a power bounded by…

Probability · Mathematics 2020-07-28 Egor Kosov

We give a new combinatorial proof for the number of convex polyominoes whose minimum enclosing rectangle has given dimensions. We also count the subclass of these polyominoes that contain the lower left corner of the enclosing rectangle…

Combinatorics · Mathematics 2019-03-05 Kevin Buchin , Man-Kwun Chiu , Stefan Felsner , Günter Rote , André Schulz

This paper contains some estimates for the {\it integral-uniform} norm and the uniform norm of a wide class of random polynomials. The family of integral-uniform norms introduced by Kasin and Tzafriri is a natural generalization of the…

Probability · Mathematics 2007-05-23 Pavel Grigoriev

We consider consecutive random subdivision of polygons described as follows. Given an initial convex polygon with $d\ge 3$ edges, we choose a point at random on each edge, such that the proportions in which these points divide edges are…

Probability · Mathematics 2017-08-23 Nguyen Tuan Minh , Stanislav Volkov

We address the problem of constructing elliptic polytopes in R^d, which are convex hulls of finitely many two-dimensional ellipses with a common center. Such sets arise in the study of spectral properties of matrices, asymptotics of long…

Numerical Analysis · Mathematics 2021-07-07 Thomas Mejstrik , Vladimir Yu. Protasov

Building on the one-to-one relationship between generalized FGM copulas and multivariate Bernoulli distributions, we prove that the class of multivariate distributions with generalized FGM copulas is a convex polytope. Therefore, we find…

Mathematical Finance · Quantitative Finance 2024-10-10 Hélène Cossette , Etienne Marceau , Alessandro Mutti , Patrizia Semeraro

A random spherical polytope $P_n$ in a spherically convex set $K \subset S^d$ as considered here is the spherical convex hull of $n$ independent, uniformly distributed random points in $K$. The behaviour of $P_n$ for a spherically convex…

Probability · Mathematics 2015-05-19 Imre Bárány , Daniel Hug , Matthias Reitzner , Rolf Schneider

We experimentally study the fundamental problem of computing the volume of a convex polytope given as an intersection of linear inequalities. We implement and evaluate practical randomized algorithms for accurately approximating the…

Computational Geometry · Computer Science 2021-04-26 Ioannis Z. Emiris , Vissarion Fisikopoulos