Related papers: Angles as probabilities

We consider the generalised friendship paradox, focussing on the number of triangles at a vertex as the relevant attribute. We show that, contrary to the setting where the attribute is the number of edges at a vertex or the number of wedges…

We prove two results about transforming any convex polyhedron, modeled as a linkage L of its edges. First, if we subdivide each edge of L in half, then L can be continuously flattened into a plane. Second, if L is equilateral and we again…

We compute the generating function of random planar quadrangulations with three marked vertices at prescribed pairwise distances. In the scaling limit of large quadrangulations, this discrete three-point function converges to a simple…

The thesis concentrates on two problems in discrete geometry, whose solutions are obtained by analytic, probabilistic and combinatoric tools. The first chapter deals with the strong polarization problem. This states that for any sequence…

Three--dimensional colored triangulations are gluings of tetrahedra whose faces carry the colors 0, 1, 2, 3 and in which the attaching maps between tetrahedra are defined using the colors. This framework makes it possible to generalize the…

We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex. By analogy to Steinitz's theorem characterizing the graphs of…

Here I will review the theoretical results that have been obtained for spin glasses. I will concentrate my attention on the predictions of the mean field approach in three dimensional systems and on its numerical and experimental…

In this paper we introduce the intuitive notion of trivergence of probability distributions (TPD). This notion allow us to calculate the similarity among triplets of objects. For this computation, we can use the well known measures of…

By the famous ADE classification rational double points are simple. Rational triple points are also simple. We conjecture that the simple normal surface singularities are exactly those rational singularities, whose resolution graph can be…

An n-simplex is said to be n-well-centered if its circumcenter lies in its interior. We introduce several other geometric conditions and an algebraic condition that can be used to determine whether a simplex is n-well-centered. These…

This paper presents formulae for calculation the solid angle of intersecting spherical caps, conical surfaces and polyhedral cones.

Consider a 3$-$dimensional manifold $N$ obtained by gluing a finite number of ideal hyperbolic tetrahedra via isometries along their faces. By varying the isometry type of each tetrahedron but keeping fixed the gluing pattern we define a…

In this paper we prove a generalization of a theorem of Schneider, which gives a criterion for a projective surface over the complex numbers to have an ample cotangent bundle. After reviewing different notions of positivity, we introduce a…

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 show that there are a finite number of possible pictures for a surface in a tetrahedron with local index $n$. Combined with previous results, this establishes that any topologically minimal surface can be transformed into one with a…

A summation is a shift-invariant ${\rm R}$-module homomorphism from a submodule of ${\rm R}[[\sigma]]$ to ${\rm R}$ or another ring. [11] formalized a method for extending a summation to a larger domain by telescoping. In this paper, we…

A triangulation of a polygon has an associated Stanley-Reisner ideal. We obtain a full algebraic and combinatorial understanding of these ideals, and describe their separated models. More generally we do this for stacked simplicial…

We present a new model of a non-Euclidean plane, in which angles in a triangle sum up to $\pi$. It is a subspace of the Cartesian plane over the field of hyperreal numbers $\mathbb{R}^*$. The model enables one to represent the negation of…

We consider the problem of computing a triangulation of the real projective plane P2, given a finite point set S={p1, p2,..., pn} as input. We prove that a triangulation of P2 always exists if at least six points in S are in general…

We characterise which simplicial surfaces can be folded onto a triangle. We define a notion of folding that incorporates the non-intersection-properties of real materials. All of the surfaces foldable onto a triangle admit a…