Related papers: Graphs, free groups and the Hanna Neumann conjectu…
We investigate topological realizations of higher-rank graphs. We show that the fundamental group of a higher-rank graph coincides with the fundamental group of its topological realization. We also show that topological realization of…
The celebrated Stallings' decomposition theorem states that the splitting of a finite index subgroup $H$ of a finitely generated group $G$ as an amalgamated free product or an HNN-extension over a finite group implies the same for $G$. We…
The {\it crossing number} of a graph $G$ is the minimum number of pairwise intersections of edges in a drawing of $G$. Motivated by the recent work [Faria, L., Figueiredo, C.M.H. de, Sykora, O., Vrt'o, I.: An improved upper bound on the…
Using Quillen's superconnection formalism we give a new "twisted" approach to the rational Gromov-Lawson-Rosenberg (GLR) conjecture on topological obstructions to the existence of Riemannian metrics of positive scalar curvature on compact…
Free fermions on Johnson graphs $J(n,k)$ are considered and the entanglement entropy of sets of neighborhoods is computed. For a subsystem composed of a single neighborhood, an analytical expression is provided by the decomposition in…
The `upper rank' of a group is the supremum of the (Pr\"{u}fer) ranks of its finite quotients, and for a prime $p$, the `upper $p$-rank' is the supremum of the sectional $p$-ranks of those quotients. The former is finite if and only if the…
We give a counterexample to a conjecture by Miasnikov, Ventura and Weil, stating that an extension of free groups is algebraic if and only if the corresponding morphism of their core graphs is onto, for every basis of the ambient group. In…
This paper is the last part of a comprehensive survey of a newly emerging field: a topological approach to the study of locally finite graphs that crucially incorporates their ends. Topological arcs and circles, which may pass through ends,…
Let $G$ be a finite group and let $N$ be a normal subgroup of $G$. We attach to $N$ two graphs ${\Gamma}_G(N)$ and ${\Gamma}^{\ast}_G(N)$ related to the conjugacy classes of $G$ contained in $N$ and to the set of primes dividing the sizes…
The main result of this article is a refinement of the well-known subgroup separability results of Hall and Scott for free and surface groups. We show that for any finitely generated subgroup, there is a finite dimensional representation of…
In this survey, we have attempted to show some developmental milestones on the characterizations of intersection graphs of hypergraphs. The theory of intersection graphs of hypergraphs has been a classical topic in the theory of special…
Correlation functions can be calculated on Riemann surfaces using the operator formalism. The state in the Hilbert space of the free field theory on the punctured disc, corresponding to the Riemann surface, is constructed at infinite genus,…
We prove that, to every abstract group $G$, we can associate a sequence of graphs $\Gamma_n$ such that the automorphism group of $\Gamma_n$ is isomorphic to $G$ and the genus of $\Gamma_n$ is an unbounded function of $n$.
Using an analogy with the rank theorem in differential geometry, it is shown that for a finite $n$-tuple $X$ in a tracial von Neumann algebra and any finite $m$-tuple $F$ of $*$-polynomials in $n$ noncommuting indeterminates,…
We explore transversals of finite index subgroups of finitely generated groups. We show that when $H$ is a subgroup of a rank $n$ group $G$ and $H$ has index at least $n$ in $G$ then we can construct a left transversal for $H$ which…
We relativise the Thomassen--Woess definition of accessibility in graphs, defining what it means for a graph to be accessible relative to a peripheral system. In the case of locally finite, quasi-transitive graphs, we characterise relative…
We give new upper bounds for the number of nonconstant holomorphic maps depending only on the genus. Our estimates improve previously known bounds. The proof is based on the study of pullbacks of holomorphic differentials, together with…
Understanding the structure of a graph along with the structure of its subgraphs is important for several problems in graph theory. Two examples are the Reconstruction Conjecture and isomorph-free generation. This paper raises the question…
We show that every definable group G in an o-minimal structure is definably finitely generated. That is, G contains a finite subset that is not included in any proper definable subgroup. This provides another proof, and a generalization to…
One powerful method for upper-bounding the largest independent set in a graph is the Hoffman bound, which gives an upper bound on the largest independent set of a graph in terms of its eigenvalues. It is easily seen that the Hoffman bound…