Related papers: Paley and the Paley graphs

We complete the classification of automorphism groups of del Pezzo surfaces over algebraically closed fields of odd positive characteristic.

We determine the structure of Leavitt path algebras of polynomial growth and discuss their automorphisms and involutions.

In this paper, we construct some non-normal Cayley graphs and explicitly provide their spectra and eigenspaces using representation theory of finite groups.

In this paper, we give a characterization for a class of edge-transitive Cayley graphs, and provide methods for constructing Cayley graphs with certain symmetry properties. Also this study leads to construct and characterise a new family of…

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…

We classify the automorphism groups of del Pezzo surfaces of degrees one and two over an algebraically closed field of characteristic two. This finishes the classification of automorphism groups of del Pezzo surfaces in all characteristics.

We propose to study homomorphisms of connectome graphs. Homomorphisms can be studied as sequences of elementary homomorphisms - folds, which identify pairs of vertices. Several fold types are defined. Initial computation results for some…

We give a sharp bound for the automorphism group of a cubic simple graph with a given number of vertices. For each number of vertices we give an explicit graph attaining the bound, and prove its uniqueness in special cases.

We study automorphism groups of real del Pezzo surfaces, concentrating on finite groups acting minimally on them. As a result, we obtain a vast part of classification of finite subgroups in the real plane Cremona group.

Littlewood--Paley theory began with the classic paper of Littlewood and Paley (J.\ E.\ Littlewood, R.\ E.\ A.\ C.\ Paley, {\em Theorems on Fourier Series and Power Series}. J. Lond. Math. Soc. (1), {\bf 6} (1931), 230--33). We discuss this…

We give an accessible and modern description of the automorphisms of a finite abelian group $G$. Included is an explicit formula for the cardinality of $Aut(G)$.

When the theory of Leavitt path algebras was already quite advanced, it was discovered that some of the more difficult questions were susceptible to a new approach using topological groupoids. The main result that makes this possible is…

The present article constitutes the third part of our study of the large scale geometry of metrisable groups, the first two part appearing in the companion paper "Large scale geometry of metrisable groups". In this third part, we present a…

Harary and Palmer announced an enumeration problem of labelled self-complementary graphs at the end of their book (Graphical Enumeration, Academic Press, New York and London, 1973). This paper resolves this problem. A method for solving…

In this paper, we begin by partitioning the edges (or arcs) of a circulant (di)graph according to which generator in the connection set leads to each edge. We then further refine the partition by subdividing any part that corresponds to an…

In this paper we will provide an introductory understanding of random graph models, and matchings in the case of Erdos-Renyi random graphs. We will provide a synthesis of background theory to this end. We will further examine pertinent…

We study so called weakly-periodic twisted-multiplicative automorphisms of the free skew-field. In particular, we show that any automorphism of a free skew-field that is defined by a periodic automorphism of a free group is equivalent to a…

This survey concerns regular graphs that are extremal with respect to the number of independent sets, and more generally, graph homomorphisms. More precisely, in the family of of $d$-regular graphs, which graph $G$ maximizes/minimizes the…

Assume that there is a free group action of automorphisms on a bipartite graph. If there is a perfect matching on the factor graph, then obviously there is a perfect matching on the graph. Surprisingly, the reversed is also true for…

We study coherence of graph products and Coxeter groups and obtain many results in this direction.