Related papers: Topological Symmetry Groups for Small Complete Gra…

We propose a new method of computing cohomology groups of spaces of knots in $\R^n$, $n \ge 3$, based on the topology of configuration spaces and two-connected graphs, and calculate all such classes of order $\le 3.$ As a byproduct we…

An embedding of a graph on an orientable surface is orientably-regular (or rotary, in an equivalent terminology) if the group of orientation-preserving automorphisms of the embedding is transitive (and hence regular) on incident vertex-edge…

We continue the study of twisted automorphisms of Hopf algebras started in "Twisted automorphisms of Hopf algebras". In this paper we concentrate on the group algebra case. We describe the group of twisted automorphisms of the group algebra…

A 2-cell embedding of a graph $G$ into a closed (orientable or nonorientable) surface is called regular if its automorphism group acts regularly on the flags - mutually incident vertex-edge-face triples. In this paper, we classify the…

A family of graphs optimized as the topologies for supercomputer interconnection networks is proposed. The special needs of such network topologies, minimal diameter and mean path length, are met by special constructions of the weight…

If a fintie group G acts topologically and faithfully on R^3, then G is a subgroup of O(3)

In this paper we prove that over algebraically closed field $K$ of positive characteristic $\neq 2$ every automorphism of the group of origin-preserving automorphisms of the polynomial algebra $K[x_1,\ldots, x_n]$ ($n>3$) which fixes every…

The topological containment problem is known to be polynomial-time solvable for any fixed pattern graph $H$, but good characterisations have been found for only a handful of non-trivial pattern graphs. The complete graph on five vertices,…

In this note, we study non-transitive graphs and prove a number of results when they satisfy a coarse version of transitivity. Also, for each finitely generated group $G$, we produce continuum many pairwise non-quasi-isometric regular…

For $n \geq 2$, the $n$-th curvature set of a metric space $X$ is the set consisting of all $n$-by-$n$ distance matrices of $n$ points sampled from $X$. Curvature sets can be regarded as a geometric analogue of configuration spaces. In this…

The algebras for all possible Lorentzian and Euclidean kinematics with $\frak{so}(3)$ isotropy except static ones are re-classified. The geometries for algebras are presented by contraction approach. The relations among the geometries are…

We give a complete classification of hexagonal tilings and locally C6 graphs, by showing that each of them has a natural embedding in the torus or in the Klein bottle. We also show that locally grid graphs are minors of hexagonal tilings…

We shall determine the uniquely existing extension of the alternating group of degree 6 (being normal in the group) by a cyclic group of order 4, which can act on a complex K3 surface.

A graph $G$ is called \emph{symmetric with respect to a functional $F_G(P)$} defined on the set of all the probability distributions on its vertex set if the distribution $P^*$ maximizing $F_G(P)$ is uniform on $V(G)$. Using the…

Any knot group is the image of the group of a prime knot by a homomorphism that preserves peripheral structure. In fact, there are infinitely many such prime knots. A related partial order on knots is defined, and its properties are…

A topological group $G$ is called an $M_\omega$-group if it admits a countable cover $\K$ by closed metrizable subspaces of $G$ such that a subset $U$ of $G$ is open in $G$ if and only if $U\cap K$ is open in $K$ for every $K\in\K$. It is…

We study the smallest possible number of points in a topological space having k open sets. Equivalently, this is the smallest possible number of elements in a poset having k order ideals. Using efficient algorithms for constructing a…

We show that certain graphs of groups with cyclic edge groups are aTmenable. In particular, this holds when each vertex group is either virtually special or acts properly and semisimply on $\mathbb{H}^n$.

A subgraph $H$ of a graph $G$ is isometric if the distances between vertices in $H$ coincide with the distances between the corresponding vertices in $G$. We show that for any integer $n\ge 1$, there is a graph on $3^{n+O(\log^2 n)}$…

A topological space is reversible if each continuous bijection of it onto itself is open. We introduce an analogue of this notion in the category of topological groups: A topological group G is g-reversible if every continuous automorphism…