Related papers: Union of n Disks: Remote Centers, Common Origin
The purpose of this paper is to present an addition formula for so-called $q$-disk polynomials, using some quantum group theory. This result is a $q$-analogue of a result which was proved around 1970 by ${\breve{\text S}}$apiro [S] and…
In this paper we give a formula for the probability that $n$ random points chosen under the uniform distribution in a disk are in convex position. While close, the formula is recursive and is totally explicit only for the first values of…
We provide a new analysis of the irreducible loop integrals first considered in a 2003 paper of Wu. Using convergence ideas from probability, we produce conditions on the regulator masses so that the integrals have well-defined limits in…
An exponential-time exact algorithm is provided for the task of clustering n items of data into k clusters. Instead of seeking one partition, posterior probabilities are computed for summary statistics: the number of clusters, and pairwise…
In [3], algorithms to compute the density of the distance to a random variable uniformly distributed in (a) a ball, (b) a disk, (c) a line segment, or (d) a polygone were introduced. For case (d), the algorithm, based on Green's theorem,…
We combine infinite-dimensional integration by parts procedures with a recursive relation on moments (reminiscent of a formula by Barbour (1986)), and deduce explicit expressions for cumulants of functionals of a general Gaussian field.…
An integral representation of the partition function for general $n$-dimensional Ising models with nearest or non-nearest neighbours interactions is given. The representation is used to derive some properties of the partition function. An…
In this paper we review different expansions for neutrino oscillation probabilities in matter in the context of long-baseline neutrino experiments. We examine the accuracy and computational efficiency of different exact and approximate…
We show that dimensional recurrence relation and analytical properties of the loop integrals as functions of complex variable $\mathcal{D}$ (space-time dimensionality) provide a regular way to derive analytical representations of loop…
Two discrete dynamical systems are discussed and analyzed whose trajectories encode significant explicit information about a number of problems in combinatorial probability, including graphical enumeration on Riemann surfaces and random…
The recent paper by I. Weissman, "Sum of squares of uniform random variables",[Statist. Probab. Lett. 129 (2017), 147-154] is compared to earlier work of B. Tibken and D. Constales relating to the area of the intersection of a centred ball…
Two closely related discrete probability distributions are introduced. In each case the support is a set of vectors in $\mathbb{R}^n$ obtained from the partitions of the fixed positive integer $n$. These distributions arise naturally when…
Consider a complex random $n\times n$ matrix ${\bf X}_n=(x_{ij})_{n\times n}$, whose entries $x_{ij}$ are independent random variables with zero means and unit variances. It is well-known that Tao and Vu (Ann Probab 38: 2023-2065, 2010)…
Let $X_1, \ldots, X_n$ be some i.i.d. observations from a heavy tailed distribution $F$, i.e. such that the common distribution of the excesses over a high threshold $u_n$ can be approximated by a Generalized Pareto Distribution…
The paper contains an exposition of part of topology using partitions of unity. The main idea is to create variants of the Tietze Extension Theorem and use them to derive classical theorems. This idea leads to a new result generalizing…
Kohn introduced in 1979 the algorithm of multipliers to study the subelliptc estimate of the $\bar\partial$-Neumann problem for a smooth weakly pseudoconvex domain in a complex Euclidean space which satisfies D'Angelo's finite type…
Let $N_n$ be an $n\times n$ complex random matrix, each of whose entries is an independent copy of a centered complex random variable $z$ with finite non-zero variance $\sigma^{2}$. The strong circular law, proved by Tao and Vu, states that…
The evaluation of the probability of union of a large number of independent events requires several combinations involving the factorial and the use of high performance computers with several hours of processing. Bounds and simplifications…
The derivative expansion approach to the calculation of the interaction between two surfaces, is a generalization of the proximity force approximation, a technique of widespread use in different areas of physics. The derivative expansion…
In this paper, we prove a complex version of the incidence estimate of Guth, Solomon and Wang for tubes obeying certain strong spacing conditions, and we use one of our new estimates to resolve a discretized variant of Falconer's distance…