Related papers: Partition structure and the A-hypergeometric distr…

Gaussian distributions can be generalized from Euclidean space to a wide class of Riemannian manifolds. Gaussian distributions on manifolds are harder to make use of in applications since the normalisation factors, which we will refer to as…

One considers a system on $\mathbb{C}^2$ close to an invariant curve which can be viewed as a generalization of the semi-standard map to a trigonometric polynomial with many Fourier modes. The radius of convergence of an analytic…

Interactions and relations between objects may be pairwise or higher-order in nature, and so network-valued data are ubiquitous in the real world. The "space of networks", however, has a complex structure that cannot be adequately described…

A fast and weakly stable method for computing the zeros of a particular class of hypergeometric polynomials is presented. The studied hypergeometric polynomials satisfy a higher order differential equation and generalize Laguerre…

Distributions, i.e., subsets of tangent bundles formed by piecing together subspaces of tangent spaces, are commonly encountered in the theory and application of differential geometry. Indeed, the theory of distributions is a fundamental…

The large $N$ asymptotic expansion of the partition function for the normal matrix model is predicted to have special features inherited from its interpretation as a two-dimensional Coulomb gas. However for the latter, it is most natural to…

Matrix congruence can be used to mimic linear maps between homogeneous quadratic polynomials in $n$ variables. We introduce a generalization, called standard-form congruence, which mimics affine maps between non-homogeneous quadratic…

Random geometric graphs are widely used in modeling geometry and dependence structure in networks. In a random geometric graph, nodes are independently generated from some probability distribution $F$ over a metric space, and edges link…

An arithmetical structure on a graph is given by a labeling of the vertices which satisfies certain divisibility properties. In this note, we look at several families of graphs and attempt to give counts on the number of arithmetical…

A graph $H$ is said to be common if the number of monochromatic labelled copies of $H$ in a red/blue edge colouring of a large complete graph is asymptotically minimized by a random colouring with an equal proportion of each colour. We…

We show that the class of conditional distributions satisfying the coarsening at Random (CAR) property for discrete data has a simple and robust algorithmic description based on randomized uniform multicovers: combinatorial objects…

Let $L$ be a very ample line bundle on a smooth curve $C$ of genus $g$ with $\frac{3g+3}{2}<\deg L\le 2g-5$. Then $L$ is normally generated if $\deg L>\max\{2g+2-4h^1(C,L), 2g-\frac{g-1}{6}-2h^1(C,L)\}$. Let $C$ be a triple covering of…

Let $p_n$ be the number of partitions of an integer $n$. For each of the partition statistics of counting their parts, ranks, or cranks, there is a natural family of integer polynomials. We investigate their asymptotics and the limiting…

One of the most common types of functions in mathematics, physics, and engineering is a sum of products, sometimes called a partition function. After "normalization," a sum of products has a natural graphical representation, called a normal…

The full distribution of the conductance $P(G)$ in quasi-one-dimensional wires with rough surfaces is analyzed from the diffusive to the localization regime. In the crossover region, where the statistics is dominated by only one or two…

Let $M \subset X$ be a submanifold of a rational homogeneous space $X$ such that the normal sequence splits. We prove that $M$ is also rational homogeneous.

This paper presents a quantum generalization of the multinomial distribution for the transition probabilities of $m$ identical photons in a $k$-port linear optical interferometer: two multinomial coefficients (one for the input…

A new parameterization and algorithm are proposed for seeking the primary relative maximum of the likelihood function in the three-parameter lognormal distribution. The parameterization yields the dimension reduction of the three-parameter…

A special type of binomial splitting process is studied. Such a process can be used to model a high-dimensional corner parking problem, as well as the depth of random PATRICIA tries (a special class of digital tree data structures). The…

This paper presents a regularization theory for numerical computation of polynomial greatest common divisors and a convergence analysis, along with a detailed description of a blackbox-type algorithm. The root of the ill-posedness in…