Related papers: On the Genus of a Random Riemann Surface

Networks representing many complex systems in nature and society share some common structural properties like heterogeneous degree distributions and strong clustering. Recent research on network geometry has shown that those real networks…

The generating functions of the Severi degrees for sufficiently ample line bundles on algebraic surfaces are multiplicative in the topological invariants of the surface and the line bundle. Recently new proofs of this fact were given for…

We study projectively flat holomorphic vector bundles over Riemann surfaces. To each such bundle, we naturally assign a Wronskian line bundle. The main idea is a notion of the division of two meromorphic sections. Abel's identity is…

This article is an attempt to generalize Riemann's bilinear relations on compact Riemann surface of genus at least 2, which may lead to new structures in the theory of hyperbolic Riemann surfaces. No significant result is obtained, the…

We study random subcube intersection graphs, that is, graphs obtained by selecting a random collection of subcubes of a fixed hypercube $Q_d$ to serve as the vertices of the graph, and setting an edge between a pair of subcubes if their…

This is largely a survey paper, dealing with Cartan geometries in the complex analytic category. We first remind some standard facts going back to the seminal works of F. Klein, E. Cartan and C. Ehresmann. Then we present the concept of a…

A soft random graph $G(n,r,p)$ can be obtained from the random geometric graph $G(n,r)$ by keeping every edge in $G(n,r)$ with probability $p$. This random graph is a particular case of the soft random graph model introduced by Penrose, in…

We derive parametrizations of the Delaunay constant mean curvature surfaces of revolution that follow directly from parametrizations of the conics that generate these surfaces via the corresponding roulette. This uniform treatment exploits…

The Random Geometric Graph (RGG) is a random graph model for network data with an underlying spatial representation. Geometry endows RGGs with a rich dependence structure and often leads to desirable properties of real-world networks such…

There has been considerable recent interest, primarily motivated by problems in applied algebraic topology, in the homology of random simplicial complexes. We consider the scenario in which the vertices of the simplices are the points of a…

In this paper, we construct Delaunay type constant mean curvature surfaces along a nondegenerate closed geodesic in a 3-dimensional Riemannian manifold.

Inspired by the seminal result that a graph and an associated rotation system uniquely determine the topology of a closed manifold, we propose a combinatorial method for reconstruction of surfaces from points. Our method constructs a…

The microbiome constitutes a complex microbial ecology of interacting components that regulates important pathways in the host. Measurements of microbial abundances are key to learning the intricate network of interactions amongst microbes.…

For real application and theoretical investigation of ordinary hypergraphs and non-ordinary hypergraphs, researchers need to establish standard rules and feasible operating methods. We propose a visualization tool for investigating…

A strict lower bound for the diameter of a symmetric graph is proposed, which is calculable with the order $n$ and other local parameters of the graph such as the degree $k\,(\geq 3)$, even girth $g\,(\geq 4)$, and number of $g$-cycles…

We show that a random graph studied by Ioffe and Levit is an example of an inhomogeneous random graph of the type studied by Bollobas, Janson and Riordan, which enables us to give a new, simple, proof of their result on a phase transition.

This manuscript collects three independent works: arXiv:1902.03805, arXiv:1906.04444, with Antonio Lerario and arXiv:2103.10853, together with some additional results, observations, examples and comments, some of which were taken up in the…

We examine properties of random numerical semigroups under a probabilistic model inspired by the Erdos-Renyi model for random graphs. We provide a threshold function for cofiniteness, and bound the expected embedding dimension, genus, and…

In this paper we address the issue of designing developable surfaces with Bezier patches. We show that developable surfaces with a polynomial edge of regression are the set of developable surfaces which can be constructed with Aumann's…

In this paper we introduce a general framework for proving lower bounds for various Ramsey type problems within random settings. The main idea is to view the problem from an algorithmic perspective: we aim at providing an algorithm that…