English
Related papers

Related papers: With what probability does an inscribed triangle c…

200 papers

Within classical optics, one may add microscopic "roughness" to a macroscopically flat mirror so that parallel rays of a given angle are reflected at different outgoing angles. Taking the limit (as the roughness becomes increasingly…

Probability · Mathematics 2012-04-12 Omer Angel , Krzysztof Burdzy , Scott Sheffield

The probability distribution for the number of top to bottom spanning clusters in Directed percolation in two and three dimensions appears to be universal and is of the form $P(n) \sim \exp(-\alpha n^2)$. We argue that $\alpha$ is a new…

Statistical Mechanics · Physics 2007-05-23 Parongama Sen , Somendra M. Bhattacharjee

Two planar sets are circularly separable if there exists a circle enclosing one of the sets and whose open interior disk does not intersect the other set. This paper studies two problems related to circular separability. A linear-time…

Computational Geometry · Computer Science 2016-08-31 Jean-Daniel Boissonnat , Jurek Czyzowicz , Olivier Devillers , Mariette Yvinec

Given a closed Riemann surface $\Sigma$ equipped with a volume form $\omega$, we construct a natural probability measure on the space $\mathcal{M}_d(\Sigma)$ of degree $d$ branched coverings from $\Sigma$ to the Riemann sphere…

Algebraic Geometry · Mathematics 2020-04-07 Michele Ancona

Suppose $f : [0,1]^2 \rightarrow \mathbb{R}$ is a $(c,\alpha)$-mixed H\"older function that we sample at $l$ points $X_1,\ldots,X_l$ chosen uniformly at random from the unit square. Let the location of these points and the function values…

Classical Analysis and ODEs · Mathematics 2022-03-03 Nicholas F. Marshall

We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…

Computational Geometry · Computer Science 2007-05-23 Jeff Danciger , Satyan L. Devadoss , Don Sheehy

Chirotopes are a common combinatorial abstraction of (planar) point sets. In this paper we investigate decomposition methods for chirotopes, and their application to the problem of counting the number of triangulations supported by a given…

Computational Geometry · Computer Science 2026-03-12 Mathilde Bouvel , Valentin Féray , Xavier Goaoc , Florent Koechlin

Generalizing the well-known relations on characteristic functions on a plane to the case of a one-dimensional regular surface (curve) with compact support, we establish implicit equations for these functions. Introducing an approximation,…

Probability · Mathematics 2007-05-23 D. S. Grebenkov

This report presents a new, algorithmic approach to the distributions of the distance between two points distributed uniformly at random in various polygons, based on the extended Kinematic Measure (KM) from integral geometry. We first…

Computational Geometry · Computer Science 2016-02-11 Fei Tong , Jianping Pan

In this paper we partially resolve Hall's conjecture about the distribution of random triangles. We consider the probability that three points chosen uniformly at random, in a bounded convex region of the plane, form an acute triangle.…

Probability · Mathematics 2019-06-21 Gabriel Khan

An oriented graph is a directed graph which can be obtained from a simple undirected graph by orienting its edges. In this paper we show that any oriented graph G on n vertices with minimum indegree and outdegree at least (1/2-o(1))n…

Combinatorics · Mathematics 2008-06-13 Peter Keevash , Benny Sudakov

We study first-passage percolation on random simple triangulations and their dual maps with independent identically distributed link weights. Our main result shows that the first-passage percolation distance concentrates in an…

Probability · Mathematics 2022-03-15 Benedikt Stufler

For any integers $n\geq 2$ and $1\leq r\leq n-1$ satisfying $3r\geq 2n-1$, we show that the expected volume fraction of a random degree $d$ complex submanifold of $\C\mathbb{P}^n$ of codimension $r$ where the bisectional holomorphic…

Probability · Mathematics 2024-12-04 Michele Ancona , Damien Gayet

We prove that for every smooth Jordan curve $\gamma$, if $X$ is the set of all $r \in [0,1]$ so that there is an inscribed rectangle in $\gamma$ of aspect ratio $\tan(r\cdot \pi/4)$, then the Lebesgue measure of $X$ is at least $1/3$. To do…

Metric Geometry · Mathematics 2022-07-19 Cole Hugelmeyer

Let $\mathbb{P}_{\kappa}(n)$ be the probability that $n$ points $z_1,\ldots,z_n$ picked uniformly and independently in $\mathfrak{C}_\kappa$, a regular $\kappa$-gon with area $1$, are in convex position, that is, form the vertex set of a…

Probability · Mathematics 2024-10-16 Ludovic Morin

We offer a reader-friendly introduction to the attracting edge problem (also known as the "triangle conjecture") and its most general current solution of Limic and Tarr\`es (2007). Little original research is reported; rather this article…

Probability · Mathematics 2008-05-20 V. Limic , P. Tarres

We show that the triangulations of a finite point set form a flip graph that can be embedded isometrically into a hypercube, if and only if the point set has no empty convex pentagon. Point sets of this type include convex subsets of…

Computational Geometry · Computer Science 2016-08-12 David Eppstein

We proposed a purely 3-D geometrical solution to Mathematics Magazine Problem 2065. Let $\mathcal{Q}$ be a cube centered at the origin of $\mathbb{R}^3$. Choose a unit vector $(a,b,c)$ uniformly at random on the surface of the unit sphere…

History and Overview · Mathematics 2020-10-26 Yawen Zhang

We consider loci of points such that their sum of distances or sum of squared distances to each of the sides of a given triangle is constant. These loci are inspired by Viviani's theorem and its extension. The former locus is a line segment…

History and Overview · Mathematics 2017-01-26 Elias Abboud

Let $(\{1,2,\ldots,n\},d)$ be a metric space. We analyze the expected value and the variance of $\sum_{i=1}^{\lfloor n/2\rfloor}\,d({\boldsymbol{\pi}}(2i-1),{\boldsymbol{\pi}}(2i))$ for a uniformly random permutation ${\boldsymbol{\pi}}$ of…

Data Structures and Algorithms · Computer Science 2017-03-27 Ching-Lueh Chang
‹ Prev 1 8 9 10 Next ›