Related papers: Arcs, hypercubes, and graphs as quotients of proje…
We consider three kinds of quotients of the curve complex which are obtained by coning off uniformly quasi-convex subspaces: symmetric curve sets, non-maximal train track sets, and compression body disc sets. We show that the actions of the…
We explicitly calculate an arithmetic adelic quotient group for a locally free sheaf on an arithmetic surface when the fiber over the infinite point of the base is taken into account. The calculations are presented via a short exact…
We give strengthened versions of the Herwig-Lascar and Hodkinson-Otto extension theorems for partial automorphisms of finite structures. Such strengthenings yield several combinatorial and group-theoretic consequences for homogeneous…
We present a new notion of limits of weighted directed graphs of growing size based on convergence of their random quotients. These limits are specified in terms of random exchangeable measures on the unit square. We call our limits…
We give an upper bound for the degree of rational curves in a family that covers a given birational ruled surface in projective space. The upper bound is stated in terms of the degree, sectional genus and arithmetic genus of the surface. We…
We study the Fraisse limit of the class of all finite simplicial complexes. Whilst the natural model-theoretic setting for this class uses an infinite language, a range of results associated with Fraisse limits of structures for finite…
We prove a general counting result for arcs of the same type in compact surfaces. Wealso count infinite arcs in cusped surfaces and arcs in orbifolds. These theorems are derived from aresult that guarantees the convergence of certain…
An approach to the enumeration of feasible parameters for strongly regular graphs is described, based on the pair of structural parameters (a,c) and the positive eigenvalue e. The Krein bound ensures that there are only finitely many…
In this paper we study actions of reductive groups on affine spaces. We prove that there is a fan structure on the space of characters of the group, which parameterizes the possible invariant quotients. In the second half of the paper we…
In this paper, we give a self-contained and quite elementary proof that the class of all dimension drop algebras together with their distinguished faithful traces forms a Fra\"iss\'e class with the Jiang-Su algebra as its limit. We also…
The curve graphs are not locally finite. In this paper, we show that the curve graphs satisfy a property which is equivalent to graphs being uniformly locally finite via Masur--Minsky's subsurface projections. As a direct application of…
We define and study a natural category of graph limits. The objects are pairs $(\pi,\mu)$, where $\pi$ (the distribution of vertices) is an abstract probability measure on some abstract measurable space $(X,\mathcal{A})$ and $\mu$ (the…
We introduce and study embeddings of graphs in finite projective planes, and present related results for some families of graphs including complete graphs and complete bipartite graphs. We also make connections between embeddings of graphs…
Graphons are analytic objects associated with convergent sequences of graphs. Problems from extremal combinatorics and theoretical computer science led to a study of graphons determined by finitely many subgraph densities, which are…
Metrizable spaces are studied in which every closed set is an $\alpha$-limit set for some continuous map and some point. It is shown that this property is enjoyed by every space containing sufficiently many arcs (formalized in the notion of…
Limits of graphs were initiated recently in the two extreme contexts of dense and bounded degree graphs. This led to elegant limiting structures called graphons and graphings. These approach have been unified and generalized by authors in a…
The theory of graph limits represents large graphs by analytic objects called graphons. Graph limits determined by finitely many graph densities, which are represented by finitely forcible graphons, arise in various scenarios, particularly…
We investigate when limits of graphs (graphons) and permutations (permutons) are uniquely determined by finitely many densities of their substructures, i.e., when they are finitely forcible. Every permuton can be associated with a graphon…
Borgs, Chayes, Cohn and Holden (2016+) recently extended the definition of graphons from probability spaces to arbitrary $\sigma$-finite measure spaces, in order to study limits of sparse graphs. They also extended the definition of the cut…
We study projective completions of affine algebraic varieties induced by filtrations on their coordinate rings. In particular, we study the effect of the 'multiplicative' property of filtrations on the corresponding completions and…