Related papers: Random Surfaces with Boundary
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface…
For surfaces without boundary, nonlocal notions of directional and mean curvatures have been recently given. Here, we develop alternative notions, special cases of which apply to surfaces with boundary. Our main tool is a new fractional or…
We study the systole of a random surface, where by a random surface we mean a surface constructed by randomly gluing together an even number of triangles. We study two types of metrics on these surfaces, the first one coming from using…
Regular algebraic surfaces isogenous to a higher product of curves can be obtained from finite groups with ramification structures. We find unmixed ramification structures for finite groups constructed as p-quotients of particular infinite…
It has been known for years how random height variations of a repeated nano-scale structure can give rise to smooth angular color variations instead of the well-known diffraction pattern experienced if no randomization is present. However,…
We study random surfaces constructed by glueing together $N/k$ filled $k$-gons along their edges, with all $(N-1)!! = (N-1)(N-3)...3\cdot 1$ pairings of the edges being equally likely. (We assume that lcm $\{2,k\}$ divides $N$.) The Euler…
Random graphs with a given degree sequence are often constructed using the configuration model, which yields a random multigraph. We may adjust this multigraph by a sequence of switchings, eventually yielding a simple graph. We show that,…
The convex hull of N independent random points chosen on the boundary of a simple polytope in R^n is investigated. Asymptotic formulas for the expected number of vertices and facets, and for the expectation of the volume difference are…
We construct isoperimetric regions from separating hypersurfaces in closed manifolds. This yields isoperimetric boundaries exhibiting a wide variety of topological types and singular sets.
We show that a strongly irreducible and boundary-strongly irreducible surface can be isotoped to be almost normal in a triangulated 3-manifold.
We study of the shape of a compact singular minimal surface in terms of the geometry of its boundary, asking what type of {\it a priori} information can be obtained on the surface from the knowledge of its boundary. We derive estimates of…
Let $G_n$ be the genus of a two-dimensional surface obtained by gluing, uniformly at random, the sides of an $n$-gon. Recently Linial and Nowik proved, via an enumerational formula due to Harer and Zagier, that the expected value of $G_n$…
The study of random surfaces, especially in the asymptotics of large genus, has been of increasing interest in recent years. Many geometrical questions have analogous formulations in the theory of random graphs with a large number of…
A natural representation of random graphs is the random measure. The collection of product random measures, their transformations, and non-negative test functions forms a general representation of the collection of non-negative weighted…
A triangulation of a surface is irreducible if no edge can be contracted to produce a triangulation of the same surface. In this paper, we investigate irreducible triangulations of surfaces with boundary. We prove that the number of…
Brooks and Makover introduced an approach to random Riemann surfaces based on associating a dense set of them - Belyi surfaces - with random cubic graphs. In this paper, using Bollobas model for random regular graphs, we examine the…
The main result is the construction of ergodic transversal measures of full support on the space of all k-surfaces of a compact hyperbolic 3-manifold. This space is a laminated space, each of its leaf being identified with a "complete"…
A random intersection graph is constructed by independently assigning a subset of a given set of objects $W,$ to each vertex of the vertex set $V$ of a simple graph $G.$ There is an edge between two vertices of $V,$ iff their respective…
Random skew plane partitions of large size distributed according to an appropriately scaled Schur process develop limit shapes. In the present work we consider the limit of large random skew plane partitions where the inner boundary…