相关论文: Regular maps of order $2$-powers

Normal bases and self-dual normal bases over finite fields have been found to be very useful in many fast arithmetic computations. It is well-known that there exists a self-dual normal basis of $\mathbb{F}_{2^n}$ over $\mathbb{F}_2$ if and…

For a fixed integer $e \geqslant 3$ and $n$ large enough, we show that the number of congruence classes modulo $2^e$ of characteristic polynomials of $n \times n$ symmetric $\{\pm 1\}$-matrices with constant diagonal is equal to…

We establish the following two main results on order types of points in general position in the plane (realizable simple planar order types, realizable uniform acyclic oriented matroids of rank $3$): (a) The number of extreme points in an…

We consider planar cubic maps, i.e. connected cubic graphs imbedded into plane, with marked spanning tree and marked directed edge (not in this tree). The number of such objects with $2n$ vertices is $C_{2n}\cdot C_{n+1}$, where $C_k$ is…

Let $H_{n}^{+}(\mathbb{R})$ be the cone of all positive semidefinite $n\times n$ real matrices. We describe the form of all surjective maps on $H_{n}^{+}(\mathbb{R}) $, $n\geq 3$, that preserve the minus partial order in both directions.

This papers focuses on the average order of dominating sets of a graph. We find the extremal graphs for the maximum and minimum value over all graphs on $n$ vertices, while for trees we prove that the star minimizes the average order of…

A simple undirected graph is said to be {\em semisymmetric} if it is regular and edge-transitive but not vertex-transitive. Every semisymmetric graph is a bipartite graph with two parts of equal size. It was proved in [{\em J. Combin.…

In the work [4] tree-rooted planar cubic maps with marked directed edge (not in this tree) were enumerated. The number of such objects with $2n$ vertices is $C_{2n}\cdot C_{n+1}$, where $C_k$ is Catalan number. In this work a marked…

Let $G$ be a $(2,m,n)$-group and let $x$ be the number of distinct primes dividing $\chi$, the Euler characteristic of $G$. We prove, first, that, apart from a finite number of known exceptions, a non-abelian simple composition factor $T$…

A graph has the unique path property UPP_n if there is a unique path of length n between any ordered pair of nodes. This paper reiterates Royle and MacKay's technique for constructing orderly algorithms. We wish to use this technique to…

We show that the average order of a dominating set of a forest graph $G$ on $n$ vertices with no isolated vertices is at most $2n/3$. Moreover, the equality is achieved if and only if every non-leaf vertex of $G$ is a support vertex with…

We explore the existence of a class of generalised Laplace maps for third order partial differential operators of the form…

A complete classification of the multivalued coset groups of order $3$ is given. The proof is based on the classification of rank $3$ groups having regular normal subgroups.

This study is the first part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10}. Circulant graphs $C_n(R)$ and $C_n(S)$ are said to be \emph{Adam's isomorphic} if there exist some $a\in…

In 2002, D. Fon-Der-Flaass constructed a prolific family of strongly regular graphs. In this paper, we prove that for infinitely many natural numbers $n$, this family contains $n^{\Omega(n^{2/3})}$ strongly regular $n$-vertex graphs $X$…

In this paper, we introduce an alternative method for applying averaging theory of orders $1$ and $2$ in the plane. This is done by combining Taylor expansions of the displacement map with the integral form of the…

In this paper we show that every sufficiently large family of convex bodies in the plane has a large subfamily in convex position provided that the number of common tangents of each pair of bodies is bounded and every subfamily of size five…

In this paper we develop a classification of real functions based on growth rates of repeated iteration. We show how functions are naturally distinguishable when considering inverses of repeated iterations. For example, $n+2\to 2n\to 2^n\to…

We study families of superelliptic curves with fixed automorphism groups. Such families are parametrized with invariants expressed in terms of the coefficients of the curves. Algebraic relations among such invariants determine the lattice…

A map is a cellular decomposition of a closed surface. In the framework of classifying all regular maps by their supporting surface, it is an open problem to find all closed surfaces that support no regular maps. Classification of regular…