相关论文: Infinite Unicorn Paths and Gromov Boundaries

We give bounds on the gap functions of the singularities of a cuspidal plane curve of arbitrary genus, generalising recent work of Borodzik and Livingston. We apply these inequalities to unicuspidal curves whose singularity has one Puiseux…

This paper proves limit theorems for the number of monochromatic edges in uniform random colorings of general random graphs. These can be seen as generalizations of the birthday problem (what is the chance that there are two friends with…

We establish a version of a classical theorem of Pommerenke, which is a diameter version of the Gehring-Hayman inequality on Gromov hyperbolic domains of $\mathbb{R}^n$. Two applications are given. Firstly, we generalize Ostrowski's…

The main goal of this paper is to determine the Poisson boundary of lamplighter random walks over a general class of discrete groups $\Gamma$ endowed with a rich boundary. The starting point is the Strip Criterion of identification of the…

Xiong and Liu [L. Xiong and Z. Liu, Hamiltonian iterated line graphs, Discrete Math. 256 (2002) 407-422] gave a characterization of the graphs $G$ for which the $n$-th iterated line graph $L^n(G)$ is hamiltonian, for $n\ge2$. In this paper,…

We give a combinatorial proof, using the hyperbolicity of the curve graphs, of the bounded geodesic image theorem of Masur and Minsky. Recently it has been shown that curve graphs are uniformly hyperbolic, thus a universal bound can be…

This is an introductory review of the connection between homotopy theory and path integrals, mainly focus on works done by Schulman [23] that he compared path integral on SO(3) and its universal covering space SU(2), DeWitt and Laidlaw [15]…

For each infinite word over a given finite alphabet, we define an increasing sequence of rooted finite graphs, that can be thought as approximations of the famous Sierpinski carpet. These sequences naturally converge to an infinite rooted…

Infinite generalizations of theorems in finite combinatorics were initiated by Erd\H{o}s due to his famous Erd\H{o}s-Menger conjecture (now known as the Aharoni-Berger theorem) that extends Menger's theorem to infinite graphs in a…

We give the asymptotic growth of the number of (multi-)arcs of bounded length between boundary components on complete finite-area hyperbolic surfaces with boundary. Specifically, if $S$ has genus $g$, $n$ boundary components and $p$…

Thurston introduced \emph{invariant (quadratic) laminations} in his 1984 preprint as a vehicle for understanding the connected Julia sets and the parameter space of quadratic polynomials. Important ingredients of his analysis of the angle…

We show that (equivariant) K-theoretic 3-point Gromov-Witten invariants of genus zero on a Grassmann variety are equal to triple intersections computed in the ordinary (equivariant) K-theory of a two-step flag manifold, thus generalizing an…

We introduce a type of graph integrals which are holomorphic analogs of configuration space integrals. We prove their (ultraviolet) finiteness by considering a compactification of the moduli space of graphs with metrics, and study their…

Though the uniformization theorem guarantees an equivalence of Riemann surfaces and smooth algebraic curves, moving between analytic and algebraic representations is inherently transcendental. Our analytic curves identify pairs of circles…

Motivated by Nirenberg's problem on isometric rigidity of tight surfaces, we study closed asymptotic curves $\Gamma$ on negatively curved surfaces $M$ in Euclidean $3$-space. In particular, using C\u{a}lug\u{a}reanu's theorem, we obtain a…

We present a substantial generalization of the equinumeracy of grand Dyck paths and Dyck-path prefixes, constrained within a band. The number of constrained paths starting at level $i$ and ending in a window of size $2j+2$ is equal to the…

In his PhD Thesis, E.R. Scheinerman conjectured that planar graphs are intersection graphs of line segments in the plane. This conjecture was proved with two different approaches by J. Chalopin and the author, and by the author, L.…

We develop a generalisation of the path homology theory introduced by Grigor'yan, Lin, Muranov and Yau (GLMY-theory) in a general simplicial setting. The new theory includes as particular cases the GLMY-theory for path complexes and new…

We study some percolation problems on the complete graph over $\mathbf N$. In particular, we give sharp sufficient conditions for the existence of (finite or infinite) cliques and paths in a random subgraph. No specific assumption on the…

We consider random temporal graphs, a version of the classical Erd\H{o}s--R\'enyi random graph G(n,p) where additionally, each edge has a distinct random time stamp, and connectivity is constrained to sequences of edges with increasing time…