相关论文: Enumeration of chord diagrams

In this note, we establish an equivalence of categories between the category of all eight-dimensional composition algebras with any given quadratic form $n$ over a field $k$ of characteristic not two, and a category arising from an action…

A graph is an opposition graph, respectively, a coalition graph, if it admits an acyclic orientation which puts the two end-edges of every chordless 4-vertex path in opposition, respectively, in the same direction. Opposition and coalition…

We show that for any nontrivial knot $K$ and any natural number $n$ there is a diagram $D$ of $K$ such that the unknotting number of $D$ is greater than or equal to $n$. It is well known that twice the unknotting number of $K$ is less than…

A divisor graph $G$ is an ordered pair $(V, E)$ where $V \subset \mathbbm{Z}$ and for all $u \neq v \in V$, $u v \in E$ if and only if $u \mid v$ or $v \mid u$. A graph which is isomorphic to a divisor graph is also called a divisor graph.…

The $c_2$ invariant is an arithmetic graph invariant introduced by Schnetz and developed by Brown and Schnetz in order to better understand Feynman integrals. This document looks at the special case where the graph in question is a…

We compute the number of equivalence classes of nonperiodic covering cycles of given length in a non oriented connected graph. A covering cycle is a closed path that traverses each edge of the graph at least once. A special case is the…

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…

This article investigates the properties of order-divisor graphs associated with finite groups. An order-divisor graph of a finite group is an undirected graph in which the set of vertices includes all elements of the group, and two…

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.…

We present two noncommutative algebras over a field of characteristic zero that each posses a family of actions by cyclic groups of order $2n$, represented in $n \times n$ matrices, requiring generators of degree $3n$.

The distinguishing number $D(G,X)$ of an action of a group $G$ on a set $X$ is the least size of a partition of $X$ such that no element of $G$ acting nontrivially on $X$ preserves this partition. In this paper we describe the…

Suppose that all groups of order $n$ are defined on the same set $G$ of cardinality $n$, and let the \emph{distance} of two groups of order $n$ be the number of pairs $(a,b)\in G\times G$ where the two group operations differ. Given a group…

In this paper, we study the flow of signals through linear paths with the nonlinear condition that a node emits a signal when it receives external stimuli or when two incoming signals from other nodes arrive coincidentally with a combined…

In this note we derive enumerative formulas for several types of labelled acyclic directed graphs by slight modifications of the familiar recursive formula for simple acyclic digraphs. These considerations are motivated by, and based upon,…

Let $Q(n,k)$ be the number of $n$-ary quasigroups of order $k$. We derive a recurrent formula for Q(n,4). We prove that for all $n\geq 2$ and $k\geq 5$ the following inequalities hold: $({k-3}/2)^{n/2}(\frac{k-1}2)^{n/2} < log_2 Q(n,k) \leq…

We characterize the graphs with loops whose degree sequences have no repeated values and find their adjacency spectrum. In the case of simple graphs, such graphs are called anti-regular graphs and are examples of threshold graphs. The…

This paper is devoted to the units of integral group rings of cyclic $2$-groups of small orders, namely, the orders of $2^n$ for $n<8$. Immediately we should note the issues our consideration describe in the introduction in more detail.…

We define an infinite graded graph of ordered pairs and a~canonical action of the group $\mathbb{Z}$ (the adic action) and of the infinite sum of groups of order two~$\mathcal{D}=\sum_1^{\infty} \mathbb{Z}/2\mathbb{Z}$ on the path space of…

Previously one of the authors constructed uncountable families of groups of type $FP$ and of $n$-dimensional Poincar\'e duality groups for each $n\geq 4$. We strengthen these results by showing that these groups comprise uncountably many…

We establish analytically several new identities connecting enumerators of different types of circulant graphs of prime, twice prime and prime-squared orders. In particular, it is shown that the semi-sum of the number of undirected…