Related papers: Large Deviations and Moments for the Euler Charact…

We study here a standard next-nearest-neighbor (NNN) model of ballistic growth on one- and two-dimensional substrates focusing our analysis on the probability distribution function $P(M,L)$ of the number $M$ of maximal points (i.e., local…

In this paper we study the connection between the phenomenon of homological percolation (the formation of "giant" cycles in persistent homology), and the zeros of the expected Euler characteristic curve. We perform an experimental study…

We study the fluctuations of random surfaces on a two-dimensional discrete torus. The random surfaces we consider are defined via a nearest-neighbor pair potential which we require to be twice continuously differentiable on a (possibly…

We report some novel properties of a square lattice filled with white sites, randomly occupied by black sites (with probability $p$). We consider connections up to second nearest neighbours, according to the following rule. Edge-sharing…

A recurrent state of the rotor-routing process on a finite sink-free graph can be represented by a unicycle that is a connected spanning subgraph containing a unique directed cycle. We distinguish between short cycles of length 2 called…

We consider $N\times N$ Gaussian random matrices, whose average density of eigenvalues has the Wigner semi-circle form over $[-\sqrt{2},\sqrt{2}]$. For such matrices, using a Coulomb gas technique, we compute the large $N$ behavior of the…

For an $n$-fold geometrically cyclic branched covering $Y$ of a smooth, projective scheme $X$ branched at a smooth closed subscheme $Z\subset X$ with $n \in k^\times$, we compute the quadratic Euler characteristic of $Y$ in terms of certain…

Suppose that you add rigid bars between points in the plane, and suppose that a constant fraction $q$ of the points moves freely in the whole plane; the remaining fraction is constrained to move on fixed lines called sliders. When does a…

Consider a string of $n$ positions, i.e. a discrete string of length $n$. Units of length $k$ are placed at random on this string in such a way that they do not overlap, and as often as possible, i.e. until all spacings between neighboring…

This is an announcement of conjectures and results concerning the generating series of Euler characteristics of Hilbert schemes of points on surfaces with simple (Kleinian) singularities. For a quotient surface C^2/G with G a finite…

Let $k \ge 3$ be a fixed integer. We exactly determine the asymptotic distribution of $\ln Z_k(G(n,m))$, where $Z_k(G(n,m))$ is the number of $k$-colourings of the random graph $G(n,m)$. A crucial observation to this aim is that the…

We construct a continuous-time non-commutative random walk on $U(\mathfrak{gl}_N)$ with dilation maps $U(\mathfrak{gl}_N)\rightarrow L^2(U(N))^{\otimes\infty}$. This is an analog of a continuous-time non-commutative random walk on the group…

Limiting distributions are derived for the sparse connected components that are present when a random graph on $n$ vertices has approximately $\half n$ edges. In particular, we show that such a graph consists entirely of trees, unicyclic…

We consider the 2-dimensional random matching problem in $\mathbb{R}^2.$ In a challenging paper, Caracciolo et. al. arXiv:1402.6993 on the basis of a subtle linearization of the Monge Ampere equation, conjectured that the expected value of…

We show that $k$-uniform hypergraphs on $n$ vertices whose codegree is at least $(2/3 + o(1))n$ can be decomposed into tight cycles, subject to the trivial divisibility conditions. As a corollary, we show those graphs contain tight Euler…

The main goal of this article is to understand how the length spectrum of a random surface depends on its genus. Here a random surface means a surface obtained by randomly gluing together an even number of triangles carrying a fixed metric.…

Let $H_1,\dots,H_k$ be Hamilton cycles in $K_n$, chosen independently and uniformly at random. We show, for $k = o(n^{1/100})$, that the probability of $H_1,\dots,H_k$ being edge-disjoint is $(1+o(1))e^{-2\binom{k}{2}}$. This extends a…

We describe a new random greedy algorithm for generating regular graphs of high girth: Let $k\geq 3$ and $c \in (0,1)$ be fixed. Let $n \in \mathbb{N}$ be even and set $g = c \log_{k-1} (n)$. Begin with a Hamilton cycle $G$ on $n$ vertices.…

We study periodic Brownian paths, wrapped around the surface of a cylinder. One characteristic of such a path is its width square, $w^2$, defined as its variance. Though the average of $w^2$ over all possible paths is well known, its full…

We give a new lower bound on the number of connected components of the space of representations of a surface group into the group of orientation preserving homeomorphisms of the circle. Precisely, for the fundamental group of a genus g…