Related papers: An algorithm to decide if an outer automorphism is…
A polynomial algorithm for graphs' isomorphism testing is constructed in assumption that there exists a corresponding polynomial algorithm for graphs with trivial automorphism group.
We give a combinatorial proof of an unpublished result of E. Klarreich: The Gromov boundary of the complex of curves of a non-exceptional oriented surface S of finite type can naturally be identified with the space of minimal geodesic…
An automorphism of a graph $G$ with $n$ vertices is a bijective map $\phi$ from $V(G)$ to itself such that $\phi(v_i)\phi(v_j)\in E(G)$ $\Leftrightarrow$ $v_i v_j\in E(G)$ for any two vertices $v_i$ and $v_j$ of $G$. Denote by…
We find sharp upper bounds on the order of the automorphism group of a hypersurface in complex projective space in every dimension and degree. In each case, we prove that the hypersurface realizing the upper bound is unique up to…
We address a natural question in noncommutative geometry, namely the rigidity observed in many examples, whereby noncommutative spaces (or equivalently their coordinate algebras) have very few automorphisms by comparison with their…
Let $\Sigma$ be a compact, orientable surface of negative Euler characteristic, and let $h$ be a complete hyperbolic metric on $\Sigma$. A geodesic curve $\gamma$ in $\Sigma$ is filling, if it cuts the surface into topological disks and…
In a recent paper [3], the authors introduced a map $\mathcal{F}$ which associates a Deitmar scheme (which is defined over the field with one element, denoted by $\mathbb{F}_1$) with any given graph $\Gamma$. By base extension, a scheme…
This paper describes a new approach to the problem of generating the class of all geodetic graphs homeomorphic to a given geodetic one. An algorithmic procedure is elaborated to carry out a systematic finding of such a class of graphs. As a…
The paper investigates exterior and symmetric (co)homologies of groups. We introduce symmetric homology of groups and compute exterior and symmetric (co)homologies of some finite groups. We also compare the classical, exterior and symmetric…
In this paper we prove two results, one semi-historical and the other new. The semi-historical result, which goes back to Thurston and Riley, is that the geometrization theorem implies that there is an algorithm for the homeomorphism…
A geometric graph is a graph embedded in the plane with vertices at points and edges drawn as curves (which are usually straight line segments) between those points. The average transversal complexity of a geometric graph is the number of…
Symmetry is an important aesthetic criteria in graph drawing and network visualisation. Symmetric graph drawings aim to faithfully represent automorphisms of graphs as geometric symmetries in a drawing. In this paper, we design and…
Network models with latent geometry have been used successfully in many applications in network science and other disciplines, yet it is usually impossible to tell if a given real network is geometric, meaning if it is a typical element in…
We give an efficient algorithm that, given a graph $G$ and a partition $V_1,\ldots,V_m$ of its vertex set, finds either an independent transversal (an independent set $\{v_1,\ldots,v_m\}$ in $G$ such that $v_i\in V_i$ for each $i$), or a…
Let $G$ be a group. The directed endomorphism graph, \dend of $G$ is a directed graph with vertex set $G$ and there is a directed edge from the vertex `$a$' to the vertex `$\, b$' $(a \neq b) $ if and only if there exists an endomorphism on…
An \emph{outer-string representation} of a graph $G$ is an intersection representation of $G$ where vertices are represented by curves (strings) inside the unit disk and each curve has exactly one endpoint on the boundary of the unit disk…
For a subshift over a finite alphabet, a measure of the complexity of the system is obtained by counting the number of nonempty cylinder sets of length $n$. When this complexity grows exponentially, the automorphism group has been shown to…
We will describe some results regarding the algorithmic nature of homeomorphism problems for manifolds; in particular, the following theorem. Theorem 1: Every PL or smooth simply connected manifold M^n of dimension n at least 5 can be…
An irreducible, algebraic curve $\mathcal X_g$ of genus $g\geq 2$ defined over an algebraically closed field $k$ of characteristic $\mbox{char } \, k = p \geq 0$, has finite automorphism group $\mbox{Aut} (\mathcal X_g)$. In this paper we…
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$.