相关论文: Infinite Unicorn Paths and Gromov Boundaries

To every Gromov hyperbolic space X one can associate a space at infinity called the Gromov boundary of X. Gromov showed that quasi-isometries of hyperbolic metric spaces induce homeomorphisms on their boundaries, thus giving rise to a…

We present a unified approach to proving Ramsey-type theorems for graphs with a forbidden induced subgraph which can be used to extend and improve the earlier results of Rodl, Erdos-Hajnal, Promel-Rodl, Nikiforov, Chung-Graham, and…

We prove a version of Gromov's compactness theorem for pseudo-holomorphic curves which holds locally in the target symplectic manifold. This result applies to sequences of curves with an unbounded number of free boundary components, and in…

In 1973 P. Erd\H{o}s and L. Lov\'asz noticed that any hypergraph whose edges are pairwise intersecting has chromatic number 2 or 3. In the first case, such hypergraph may have any number of edges. However, Erd\H{o}s and Lov\'asz proved that…

We study the spectra of mixed graphs about its Hermitian adjacency matrix of the second kind (i.e. N-matrix) introduced by Mohar [1]. We extend some results and define one new Hermitian adjacency matrix, and the entry corresponding to an…

We study two actions of big mapping class groups. The first is an action by isometries on a Gromov-hyperbolic graph. The second is an action by homeomorphisms on a circle in which the vertices of the graph naturally embed. The first two…

Here we give brief account of hermitian symplectic spaces, showing that they are intimately connected to symmetric as well as self-adjoint extensions of a symmetric operator. Furthermore we find an explicit parameterisation of the Lagrange…

The quasi-redirecting (QR) boundary, introduced by Qing and Rafi, generalizes the Gromov boundary for studying the large-scale geometry of finitely generated groups. Although it is not known to exist for all such groups, its existence has…

We enumerate the edges in the Hasse diagram of several lattices arising in the combinatorial context of lattice paths. Specifically, we will consider the case of Dyck, Grand Dyck, Motzkin, Grand Motzkin, Schr\"oder and Grand Schr\"oder…

The combinatorial Mandelbrot set is a continuum in the plane, whose boundary can be defined, up to a homeomorphism, as the quotient space of the unit circle by an explicit equivalence relation. This equivalence relation was described by…

As shown in a previous paper, certain naturally arising cones of holomorphic vector bundle sections over the main component $\ov\M_{1,k}^0(\P,d)$ of the moduli space of stable genus-one holomorphic maps into $\P$ have a well-defined euler…

We study the notions of continuous orbit equivalence and eventual one-sided conjugacy of finitely-aligned higher-rank graphs and two-sided conjugacy of row-finite higher-rank graphs with finitely many vertices and no sinks or sources. We…

In an article published in 1987 in Combinatorica \cite{MR918397}, Frieze and Jackson established a lower bound on the length of the longest induced path (and cycle) in a sparse random graph. Their bound is obtained through a rough analysis…

A holomorphic curve in moduli spaces is the image of a non-constant holomorphic map from a hyperbolic surface $B$ of type $(g,n)$ to the moduli space $\mathcal{M}_h$ of closed Riemann surfaces of genus $h$. We show that, when all peripheral…

We prove a conjecture of Barraud-Cornea for orientable Lagrangian surfaces. As a corollary, we obtain that displaceable Lagrangian 2--tori have finite Gromov width. In order to do so, we adapt the pearl complex of Biran-Cornea to the…

In previous works, we have demonstrated that the path integral for {\it real, Lorentzian} four-geometries in Einstein gravity yields sensible results in well-understood physical situations, but leads to uncontrolled fluctuations when the…

The hypercube \( Q_n \) contains a Hamiltonian path joining \( x \) and \( y \) (where $x$ and $y$ from the opposite partite set) containing \( P \) if and only if the induced subgraph of \( P \) is a linear forest, where none of these…

This introduction to graphs and graph algebras provides the optimal bound for the number of all paths of length $k$ in a graph with $N\geq k$ edges and no loops. Our proof relies on a construction of a number of terminating algorithms that…

A graph $H$ is \emph{common} if the number of monochromatic copies of $H$ in a 2-edge-colouring of the complete graph $K_n$ is asymptotically minimised by the random colouring, or equivalently, $t_H(W)+t_H(1-W)\geq 2^{1-e(H)}$ holds for…

We complete the $L^p$ boundedness theory of commutators of Hilbert transforms along monomial curves by providing the previously missing lower bounds. This optimal result now covers all monomial curves while previous results had significant…