相关论文: Arc-transitive maps with edge number coprime to th…

Graph drawing beyond planarity focuses on drawings of high visual quality for non-planar graphs which are characterized by certain forbidden edge configurations. A natural criterion for the quality of a drawing is the number of edge…

The main purpose of this paper is to describe some published results and outline corresponding approaches which when applied to automorphism groups of algebras or groups establish that these groups are linear or non-linear.

A loop whose inner mappings are automorphisms is an \emph{automorphic loop} (or \emph{A-loop}). We characterize commutative (A-)loops with middle nucleus of index 2 and solve the isomorphism problem. Using this characterization and certain…

We define train track maps for graphs-of-groups $\cal G$ and exhibit the precise conditions under which the fundamental finiteness properties known for classical train track maps extend to this generalization. These finiteness properties…

This is a survey on recent results on counting of curves over finite fields. It reviews various results on the maximum number of points on a curve of genus g over a finite field of cardinality q, but the main emphasis is on results on the…

We give a complete classification of the ideals of the core of the C*-algebras associated with self-similar maps under a certain condition. Any ideal is completely determined by the intersection with the coefficient algebra C(K) of the…

We investigate the structure of connected graphs, not necessarily locally finite, with infinitely many ends. On the one hand we study end-transitive such graphs and on the other hand we study such graphs with the property that the…

The Euler characteristic of a finite category is defined and shown to be compatible with Euler characteristics of other types of object, including orbifolds. A formula for the cardinality of the colimit of a diagram of sets is proved,…

If the face\mbox{-}cycles at all the vertices in a map are of the same type, then the map is said to be a semi-equivelar map. Automorphism (symmetry) of a map can be thought of as a permutation of the vertices which preserves the…

In this article, we are concerned with various aspects of arcs on surfaces. In the first part, we deal with topological aspects of arcs and their complements. We use this understanding, in the second part, to construct interesting actions…

We consider the class of the topologically locally finite (in short TLF) planar vertex-transitive graphs, a class containing in particular all the one-ended planar Cayley graphs and the normal transitive tilings. We characterize these…

An argument is given to associate integrable nonintegrable transition of discrete maps with the transition of Lawvere's fixed point theorem to its own contrapositive. We show that the classical description of nonlinear maps is neither…

It is shown that each subgroup of odd index in an alternating group of degree at least 10 has all insoluble composition factors to be alternating. A classification is then given of 2-arc-transitive graphs of odd order admitting an…

A set of vertices of a graph is distinguishing if the only automorphism that preserves it is the identity. The minimal size of such sets, if they exist, is the distinguishing cost. The distinguishing costs of vertex transitive cubic graphs…

Quasi-vertex-transitive maps are the homogeneous maps on the plane with finitely many vertex orbits under the action of their automorphism groups. We show that there exist quasi-vertex-transitive maps of types $[p^3, 3]$ for $p \equiv 1$…

An interesting fact is that most of the known connected $2$-arc-transitive nonnormal Cayley graphs of small valency on finite simple groups are $(\mathrm{A}_{n+1},2)$-arc-transitive Cayley graphs on $\mathrm{A}_n$. This motivates the study…

The automorphism group of a curve is studied from the viewpoint of the canonical embedding and Petri's theorem. A criterion for identifying the automorphism group as an algebraic subgroup the general linear group is given. Furthermore the…

A graph $\Gamma$ is called edge-regular whenever it is regular and for any two adjacent vertices, the number of their common neighbors is independent of the choice of vertices. A clique $C$ in $\Gamma$ is called regular whenever for any…

Datasets are mathematical objects (e.g., point clouds, matrices, graphs, images, fields/functions) that have shape. This shape encodes important knowledge about the system under study. Topology is an area of mathematics that provides…

Tournaments are graphs obtained by assigning a direction for every edge in an undirected complete graph. We give a formula for the number of isomorphism classes of vertex-transitive tournaments with prime order. For that, we introduce…