Related papers: Fully Packed O(n=1) Model on Random Eulerian Trian…

We review critically the main assumptions on which the standard theory of neutrino oscillations is based. We show that all assumptions are realistic, except the so-called "equal momentum assumption", which however is irrelevant. We briefly…

The attitude of a rigid-body in the three dimensional space has a unique and global definition on the Special Orthogonal Group SO (3). This paper gives an overview of the rotation matrix, attitude kinematics and parameterization. The four…

We discuss the rigidity (or lack thereof) imposed by different notions of having an abundance of zero curvature planes on a complete Riemannian 3-manifold. We prove a rank rigidity theorem for complete 3-manifolds, showing that having…

We study the conformal bootstrap for 3D CFTs with O(N) global symmetry. We obtain rigorous upper bounds on the scaling dimensions of the first O(N) singlet and symmetric tensor operators appearing in the $\phi_i \times \phi_j$ OPE, where…

The rotation of multi-dimensional arrays, or tensors, is a fundamental operation in computer science with applications ranging from data processing to scientific computing. While various methods exist, achieving this rotation in-place…

We present a random matrix model suitable for the quantum mechanical description of a particle confined to move inside a two-dimensional domain. Here, the ensemble average corresponds to an average over domain shapes. Although this approach…

Multiple orthogonal polynomials are a generalization of orthogonal polynomials in which the orthogonality is distributed among a number of orthogonality weights. They appear in random matrix theory in the form of special determinantal point…

We study a connection between random tensors and random matrices through $U(\tau)$ matrix models which generate fully packed, oriented loops on random surfaces. The latter are found to be in bijection with a set of regular edge-colored…

We consider two ensembles of nxn matrices. The first is the set of all nxn matrices with entries zeroes and ones such that all column sums and all row sums equal r, uniformly weighted. The second is the set of nxn matrices with zero and one…

This paper studies Gaussian random fields with Mat\'ern covariance functions with smooth parameter $\nu>2$. Two cases of parameter spaces, the Euclidean space and $N$-dimensional sphere, are considered. For such smooth Gaussian fields, we…

We study a model of dilute oriented loops on the square lattice, where each loop is compatible with a fixed, alternating orientation of the lattice edges. This implies that loop strands are not allowed to go straight at vertices, and…

We solve exactly the 6-vertex model on a dynamical random lattice, using its representation as a large N matrix model. The model describes a gas of dense nonintersecting oriented loops coupled to the local curvature defects on the lattice.…

Latent Gaussian models have a rich history in statistics and machine learning, with applications ranging from factor analysis to compressed sensing to time series analysis. The classical method for maximizing the likelihood of these models…

We calculate connected correlators in Gaussian orthogonal, unitary and symplectic random matrix ensembles by the replica method in the 1/N-expansion. We obtain averaged one-point Green's functions up to the next-to-leading order O(1/N) and…

We report on the implementation of an algorithm for computing the set of all regular triangulations of finitely many points in Euclidean space. This algorithm, which we call down-flip reverse search, can be restricted, e.g., to computing…

We prove that properly rescaled large planar Eulerian triangulations converge to the Brownian map. This result requires more than a standard application of the methods that have been used to obtain the convergence of other families of…

In this paper, we generalize the simple Euclidean 1-center approximation algorithm of Badoiu and Clarkson (2003) to Riemannian geometries and study accordingly the convergence rate. We then show how to instantiate this generic algorithm to…

Motivated by the classical Eulerian number, descent and excedance numbers in the hyperoctahedral groups, an triangular array from staircase tableaux and so on, we study a triangular array $[\mathcal {T}_{n,k}]_{n,k\ge 0}$ satisfying the…

We propose a Monte Carlo method to efficiently find, count, and sample abstract triangulations of a given manifold M. The method is based on a biased random walk through all possible triangulations of M (in the Pachner graph), constructed…

The longstanding Nash-Williams conjecture asserts that every $K_3$-divisible graph $G$ with $\delta(G)\ge 3n/4$ admits a triangle decomposition. In the random setting, Frankl and R\"odl showed that, with high probability, $G(n,p)$ contains…