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

We consider the expected value for the total curvature of a random closed polygon. Numerical experiments have suggested that as the number of edges becomes large, the difference between the expected total curvature of a random closed…

We study the class of neutrino mass matrices with a dominant block but unspecified O(1) coefficients, and scan the possible models by the help of random number generators. We discuss which are the most common expectations in dependence of…

We propose an Euler transformation that transforms a given $d$-dimensional cell complex $K$ for $d=2,3$ into a new $d$-complex $\hat{K}$ in which every vertex is part of a uniform even number of edges. Hence every vertex in the graph…

We establish a relationship between the two important central lines of the triangle, the Euler line and the Brocard axis, in a configuration with an arbitrary rectangle and a random point. The classical Cartesian coordinate system method…

Let $n\ge 2$ be an integer. Let $R_n$ denote the $n\times n$ tridiagonal matrix with -1's on the sub-diagonal, 1's on the super-diagonal, -1 in the (1,1) entry, 1 in the (n,n) entry and zeros elsewhere. This paper shows that $R_n$ is…

We propose a geometric hypothesis for neutrino mixing: twice the sum of the three mixing angles equals $180^\circ$, forming a Euclidean triangle. This condition leads to a predictive relation among the mixing angles and, through…

Topological integral transforms have found many applications in shape analysis, from prediction of clinical outcomes in brain cancer to analysis of barley seeds. Using Euler characteristic as a measure, these objects record rich geometric…

The dynamically triangulated random surface (DTRS) approach to Euclidean quantum gravity in two dimensions is considered for the case of the elemental building blocks being quadrangles instead of the usually used triangles. The well-known…

We introduce Eulerian maps with blocked edges as a general way to implement statistical matter models on random maps by a modification of intrinsic distances. We show how to code these dressed maps by means of mobiles, i.e. decorated trees…

We show that the large-charge formalism can be successfully applied to models that go beyond the vector models discussed so far in the literature. We study the explicit example of a conformal $SU(3)$ matrix model in 2+1 space-time…

Recently, a two-matrix-model with a new type of interaction [1] has been introduced and analyzed using bi-orthogonal polynomial techniques. Here we present the complete 1/N^2 expansion for the formal version of this model, following the…

We consider the adjacency matrix of the ensemble of Erd\H{o}s-R\'enyi random graphs which consists of graphs on $N$ vertices in which each edge occurs independently with probability $p$. We prove that in the regime $pN \gg 1$ these matrices…

In N=1 supersymmetric SO(N)/USp(2N) gauge theories with the tree-level superpotential W(\Phi) that is an arbitrary polynomial of the adjoint matter \Phi, the massless fluctuations about each quantum vacuum are described by U(1)^n gauge…

Recent models for discrete euclidean quantum gravity incorporate a sum over simplicial triangulations. We describe an algorithm for simulating such models in general dimensions. As illustration we show results from simulations in four…

We present a concentration result concerning random weighted projections in high dimensional spaces. As applications, we prove (1) New concentration inequalities for random quadratic forms; (2) The infinity norm of most unit eigenvectors of…

We analyze the correspondence between finite sequences of finitely supported probability distributions and finite-dimensional, real, symmetric, tridiagonal matrices. In particular, we give an intrinsic description of the topology induced on…

We consider the problem of reconstructing a rank-$k$ $n \times n$ matrix $M$ from a sampling of its entries. Under a certain incoherence assumption on $M$ and for the case when both the rank and the condition number of $M$ are bounded, it…

We introduce a rotation-invariant representation of planar shapes. In particular, this representation encodes shapes as vectors such that the Euclidean distance between them serves as a valid shape distance. For standardized, star-shaped…

Any two triangulations of a closed surface with the same number of vertices can be transformed into each other by a sequence of regular flips, provided the number of vertices exceeds a number N depending on the surface. Examples show that…

Consider the binomial model $G^{d+1}(n,p)$ of the random $(d+1)$-uniform hypergraph on $n$ vertices, where each edge is present, independently of one another, with probability $p:\mathbb{N}\to[0,1]$. We prove that, for all…