Related papers: On proper compactifications of topological groups

For real application and theoretical investigation of ordinary hypergraphs and non-ordinary hypergraphs, researchers need to establish standard rules and feasible operating methods. We propose a visualization tool for investigating…

Let G be a discrete group. We give methods to compute for a generalized (co-)homology theory its values on the Borel construction (EG x X)/G of a proper G-CW-complex X satisfying certain finiteness conditions. In particular we give formulas…

In the study of aperiodic order via dynamical methods, topological entropy is an important concept. In this paper, parts of the theory, like Bowen's formula for fibre wise entropy or the independence of the definition from the choice of a…

In the communication systems domain, constructing and maintaining network topologies via topology control (TC) algorithms is an important cross-cutting research area. Network topologies are usually modeled using attributed graphs whose…

We investigate some properties of topological groups related to disconnectedness or Archimedeanness. We prove or disprove the preservation of those under operations as subgroups, quotients, products, etc. Characterizations of…

In recent work, Stokes and Vermant considered graph-of-groups realisations of hypergraphs as a new description of rigidity-theoretic problems. In this paper, we show that the infinitesimal aspects of graph-of-groups realisations can be…

We study the real spectrum compactification of character varieties of finitely generated groups in semisimple Lie groups. This provides a compactification with good topological properties, and we interpret the boundary points in terms of…

In this paper we relate a well-known in symplectic geometry compactification of the space of symmetric bilinear forms considered as a chart of the Lagrangian Grassmannian to the specific compactifications of the space of electrical networks…

The purpose of this paper is extend the notion of morphism of groupoids introduced by Zakrzewski to locally compact $\sigma$-compact groupoids endowed with Haar systems and to use the extension to construct a covariant functor from this…

We study the tailoring of structured random graph ensembles to real networks, with the objective of generating precise and practical mathematical tools for quantifying and comparing network topologies macroscopically, beyond the level of…

We construct classifying spaces for discrete and compact Lie groups, with the property that they are topological groups and complete metric spaces in a natural way. We sketch a program in view of extending these constructions.

In this paper we present a topological way of building a compactification of a symmetric space from a compactification of a Weyl Chamber.

This paper is mainly a semi-tutorial introduction to elementary algebraic topology and its applications to Ising-type models of statistical physics, using graphical models of linear and group codes. It contains new material on systematic…

Let $\mathcal{P}_G$ be the family of all topologically mixing, but not exact self-maps of a topological graph $G$. It is proved that the infimum of topological entropies of maps from $\mathcal{P}_G$ is bounded from below by $(\log 3/…

We establish the exponential law for suitably topologies on spaces of vector-valued smooth functions on topological groups, where smoothness is defined by using differentiability along continuous one-parameter subgroups. As an application,…

The theme of this survey is that subgroups of the mapping class group of a finite type surface S can be studied via the geometric/dynamical properties of their action on the Thurston compactification of the Teichmuller space of S, just as…

For any $C\in[0,\infty]$ a compact group automorphism $T:X\to X$ is constructed with the property that $$ \frac{1}{n}\log|\{x\in X\mid T^n(x)=x\}|\longrightarrow C. $$ This may be interpreted as a combinatorial analogue of the (still open)…

We study the connectivity of proper power graphs of some family of finite groups including nilpotent groups, groups with a non-trivial partition, and symmetric and alternating groups.

Adjacency polytopes, a.k.a. symmetric edge polytopes, associated with undirected graphs have been defined and studied in several seemingly independent areas including number theory, discrete geometry, and dynamical systems. In particular,…

These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…