Related papers: Automorphisms of Deitmar schemes, I. Functoriality…
We provide a coherent overview of a number of recent results obtained by the authors in the theory of schemes defined over the field with one element. Essentially, this theory encompasses the study of a functor which maps certain geometries…
In [19] it was explained how one can naturally associate a Deitmar scheme (which is a scheme defined over the field with one element, $\mathbb{F}_1$) to a so-called "loose graph" (which is a generalization of a graph). Several properties of…
A detailed proof is given of a theorem describing the centraliser of a transitive permutation group, with applications to automorphism groups of objects in various categories of maps, hypermaps, dessins, polytopes and covering spaces, where…
A finite graph $\Gamma$ is called $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. We study a family of symmetric graphs, called the unitary…
In a number of recent works [6, 7] the authors have introduced and studied a functor $\mathcal{F}_k$ which associates to each loose graph $\Gamma$ -which is similar to a graph, but where edges with $0$ or $1$ vertex are allowed - a…
The inner automorphisms of a group G can be characterized within the category of groups without reference to group elements: they are precisely those automorphisms of G that can be extended, in a functorial manner, to all groups H given…
For a rational map $\phi$ from a metric graph $\varGamma$ to a tropical projective space $\boldsymbol{TP^n}$ defined by a ratio of rational functions $f_1, \ldots, f_{n + 1}$, an automorphism $\sigma$ of $\varGamma$ induces a permutation of…
We introduce a class of algebras over a field $\mathbb{F}$ related to directed graphs in which all edges are labeled by nonzero elements of the field $\mathbb{F}$. If all labels are different from $1$, these algebras are axial algebras. We…
In this article, we will show that the automorphism group of any hypergraph is essentially equal to the determinant of some matrix over a ring generated from the set of ground points. With this, we are also able to determine whether two…
The regular objects in various categories, such as maps, hypermaps or covering spaces, can be identified with the normal subgroups N of a given group \Gamma, with quotient group isomorphic to \Gamma/N. It is shown how to enumerate such…
Given an evolution algebra associated to a connected finite graph $\Gamma$, we exhibit a free action of the group of symmetries of $\Gamma$ on the set of automorphisms of the algebra. This allows us to explicitly describe this set and we…
Given a positive definite even lattice and a commutative ring, there is a standard construction of a lattice vertex algebra over the commutative ring, and it admits a natural grading by non-negative integers. We describe the groups of…
For any algebraically closed field $K$ and any endomorphism $f$ of $\mathbb{P}^1(K)$ of degree at least 2, the automorphisms of $f$ are the M\"obius transformations that commute with $f$, and these form a finite subgroup of…
In this paper we will prove that there exists a covariant functor from the category of schemes to the category of graphs. This functor provides a combination between algebraic varieties and combinatorial graphs so that the invariants…
Let $K$ be a field and $f:\mathbb{P}^N \to \mathbb{P}^N$ a morphism. There is a natural conjugation action on the space of such morphisms by elements of the projective linear group $\text{PGL}_{N+1}$. The group of automorphisms, or…
This is a survey on the automorphism groups in various classes of affine algebraic surfaces and the algebraic group actions on such surfaces. Being infinite-dimensional, these automorphism groups share some important features of algebraic…
In the present paper, we show that many combinatorial and topological objects, such as maps, hypermaps, three-dimensional pavings, constellations and branched coverings of the two--sphere admit any given finite automorphism group. This…
Comparability graphs are graphs which have transitive orientations. The dimension of a poset is the least number of linear orders whose intersection gives this poset. The dimension ${\rm dim}(X)$ of a comparability graph $X$ is the…
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…
Let $\Gamma$ be a simple undirected graph on a finite vertex set and let $A$ be its adjacency matrix. Then $\Gamma$ is {\it singular} if $A$ is singular. The problem of characterising singular graphs is easy to state but very difficult to…