English
Related papers

Related papers: Random Polygon to Ellipse: A Generalization

200 papers

We develop a general theory to address a consensus-based combination of estimations in a parallelized or distributed estimation setting. Taking into account the possibility of very discrepant estimations, instead of a full consensus we…

Methodology · Statistics 2017-05-12 P. C. Álvarez-Esteban , E. del Barrio , J. A. Cuesta-Albertos , C. Matrán

The Laplace transform of partial sums of the square of a non-centered Gauss-Markov process, conditioning on its starting point, is explicitly computed. The parameters of multiplicative ergodicity are deduced.

Probability · Mathematics 2014-01-30 Marina Kleptsyna , Alain Le Breton , Bernard Ycart

The paper concerns lattice triangulations, that is, triangulations of the integer points in a polygon in $\mathbb{R}^2$ whose vertices are also integer points. Lattice triangulations have been studied extensively both as geometric objects…

Probability · Mathematics 2015-06-03 Pietro Caputo , Fabio Martinelli , Alistair Sinclair , Alexandre Stauffer

Consider a discrete uniformly elliptic divergence form equation on the $d$ dimensional lattice $\Z^d$ with random coefficients. It has previously been shown that if the random environment is translational invariant, then the averaged…

Analysis of PDEs · Mathematics 2011-01-26 Joseph G. Conlon , Thomas Spencer

We consider the problem of obtaining higher order in regularization parameter $\epsilon$ analytical results for master integrals with elliptics. The two commonly employed methods are provided by the use of differential equations and direct…

High Energy Physics - Phenomenology · Physics 2022-09-07 M. A. Bezuglov , A. I. Onishchenko

A polyellipse is a curve in the Euclidean plane all of whose points have the same sum of distances from finitely many given points (focuses). The classical version of Erd\H{o}s-Vincze's theorem states that regular triangles can not be…

Metric Geometry · Mathematics 2018-01-09 Csaba Vincze , Zoltán Kovács , Zsófia Fruzsina Csorvássy

The problem of fitting concentric ellipses is a vital problem in image processing, pattern recognition, and astronomy. Several methods have been developed but all address very special cases. In this paper, this problem has been investigated…

Computation · Statistics 2024-02-16 Ali Al-Sharadqah , Giulano Piga

In this paper we consider ensemble of random matrices $\X_n$ with independent identically distributed vectors $(X_{ij}, X_{ji})_{i \neq j}$ of entries. Under assumption of finite fourth moment of matrix entries it is proved that empirical…

Probability · Mathematics 2012-08-07 Alexey Naumov

We recall the concept of Baxterisation of an R-matrix, or of a monodromy matrix, which corresponds to build, from one point in the $ R$-matrix parameter space, the algebraic variety where the spectral parameter(s) live. We show that the…

High Energy Physics - Theory · Physics 2015-06-25 S. Boukraa , J-M. Maillard

A split of a polytope $P$ is a (regular) subdivision with exactly two maximal cells. It turns out that each weight function on the vertices of $P$ admits a unique decomposition as a linear combination of weight functions corresponding to…

Combinatorics · Mathematics 2008-07-02 Sven Herrmann , Michael Joswig

The random geometric graph is obtained by sampling $n$ points from the unit square (uniformly at random and independently), and connecting two points whenever their distance is at most $r$, for some given $r=r(n)$. We consider the following…

Probability · Mathematics 2015-10-27 Tobias Müller , Reto Spöhel

We build a new probability measure on closed space and plane polygons. The key construction is a map, given by Knutson and Hausmann using the Hopf map on quaternions, from the complex Stiefel manifold of 2-frames in n-space to the space of…

Differential Geometry · Mathematics 2019-10-23 Jason Cantarella , Tetsuo Deguchi , Clayton Shonkwiler

This paper is devoted to the proof of uniform H\"older and Lipschitz estimates close to oscillating boundaries, for divergence form elliptic systems with periodically oscillating coefficients. Our main point is that no structure is assumed…

Analysis of PDEs · Mathematics 2015-06-19 Carlos Kenig , Christophe Prange

We study admissible transformations and Lie symmetries for a class of variable-coefficient Burgers equations. We combine the advanced methods of splitting into normalized subclasses and of mappings between classes that are generated by…

Mathematical Physics · Physics 2020-05-19 Stanislav Opanasenko , Alexander Bihlo , Roman O. Popovych

We investigate the impact of an external pressure on the structure of self-gravitating polytropes for axially symmetric ellipsoids and rings. The confinement of the fluid by photons is accounted for through a boundary condition on the…

Solar and Stellar Astrophysics · Physics 2017-11-15 J. -M. Huré , F. Hersant , G. Nasello

The Eynard-Orantin topological recursion relies on the geometry of a Riemann surface S and two meromorphic functions x and y on S. To formulate the recursion, one must assume that x has only simple ramification points. In this paper we…

Mathematical Physics · Physics 2014-08-12 Vincent Bouchard , Joel Hutchinson , Prachi Loliencar , Michael Meiers , Matthew Rupert

The $k$-ellipse is the plane algebraic curve consisting of all points whose sum of distances from $k$ given points is a fixed number. The polynomial equation defining the $k$-ellipse has degree $2^k$ if $k$ is odd and degree…

Algebraic Geometry · Mathematics 2011-09-27 Jiawang Nie , Pablo A. Parrilo , Bernd Sturmfels

We extend Elitzur's theorem to systems with symmetries intermediate between global and local. In general, our theorem formalizes the idea of {\it dimensional reduction}. We apply the results of this generalization to many systems that are…

Statistical Mechanics · Physics 2009-11-10 Cristian D. Batista , Zohar Nussinov

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

Let $P$ and $Q$ be two simple polygons in the plane of total complexity $n$, each of which can be decomposed into at most $k$ convex parts. We present an $(1-\varepsilon)$-approximation algorithm, for finding the translation of $Q$, which…

Computational Geometry · Computer Science 2014-06-24 Sariel Har-Peled , Subhro Roy
‹ Prev 1 8 9 10 Next ›