Related papers: Enumeration of chord diagrams

We obtain a new classification of the finite metacyclic group in terms of group invariants. We present an algorithm to compute these invariants, and hence to decide if two given finite metacyclic groups are isomorphic, and another algorithm…

We prove that the displacement group of the dihedral quandle with n elements is isomorphic to the group generated by rotations of the n/2-gon when n is even and the n-gon when n is odd. We additionally show that any quandle with at least…

We define an algebraic group comprising symmetric chain complexes which captures the first two stages of the Cochran-Orr-Teichner solvable filtration of the knot concordance group in a single invariant. To achieve this we impose additional…

In this paper, we present a novel approach for calculating the set of subgroups of a finite group, focusing on cyclic subgroups, and using it to establish the quantity of all subgroups in the direct product of two groups. Specifically, we…

Refining a result of Erdos and Mays, we give asymptotic series expansions for the functions $A(x)-C(x)$, the count of $n\leq x$ for which every group of order $n$ is abelian (but not all cyclic), and $N(x)-A(x)$, the count of $n\leq x$ for…

The number of maximal independent sets of the n-cycle graph C_n is known to be the nth term of the Perrin sequence. The action of the automorphism group of C_n on the family of these maximal independent sets partitions this family into…

The power graph $\mathcal{P}(G)$ of a finite group $G$ is the simple undirected graph whose vertex set is $G$, in which two distinct vertices are adjacent if one of them is an integral power of the other. For an integer $n\geq 2$, let $C_n$…

We consider a class of "harmonic variations" for nonsingular curves, obtained as asymptotic degenerations along bitangents. On a geometric level, we obtain an attractive relationship between the class and the genus of $C$. The distribution…

We prove that the automorphism group of the dihedral quandle with n elements is isomorphic to the affine group of the integers mod n, and also obtain the inner automorphism group of this quandle. In [9], automorphism groups of quandles (up…

In this note, extending some results of Erdos, Frankl, Rodl, Alexeev, Bollobas and Thomason we determine asymptotically the number of graphs which do not contain certain large subgraphs. In particular, if H_1,...,H_n,... are graphs with…

There is an established bijection between finite-index subgroups Gamma of Gamma(2) and bipartite graphs on surfaces, or, equivalently, certain triples of permutations. We utilize this relationship to study both congruence and noncongruence…

Let G be a 2-group of order 2^n, n>5, and nilpotency class n-2. The invariants of such groups determined by their group algebras over the field of two elements are given in the paper.

In this paper, we show that for a graph of order $n$, where $n\ge 5$, if the signless Laplacian index is larger than or equal to certain value depending on $n$, then the graph contains a doubly chorded cycle, where the chords incident to a…

We prove an asymptotic formula for the number of $k$-uniform hypergraphs with a given degree sequence, for a wide range of parameters. In particular, we find a formula that is asymptotically equal to the number of $d$-regular $k$-uniform…

For $n\in \mathbb{N}$, a group is called $n$-coherent if every subgroup of type $\mathsf{F}_n$ is of type $\mathsf{F}_{n+1}$. For $n\ge 1$, we observe that graphs of groups with $n$-coherent vertex groups and virtually poly-cyclic edge…

Let $n \geq 1$ be an odd integer. We construct an anticyclotomic Euler system for certain cuspidal automorphic representations of unitary groups with signature $(1, 2n-1)$.

Using the theory of combinatorial species, we compute the cycle index for bipartite graphs, which we use to count unlabeled bipartite graphs and bipartite blocks.

The investigation of colour symmetries for periodic and aperiodic systems consists of two steps. The first concerns the computation of the possible numbers of colours and is mainly combinatorial in nature. The second is algebraic and…

We present an algorithm for determining whether a bipartite graph $G$ is 2-chordal (formerly doubly chordal bipartite). At its core this algorithm is an extension of the existing efficient algorithm for determining whether a graph is…

We determine the minimal non-trivial integer group determinant for the dicyclic group of order $4n$ when $n$ is odd. We also discuss the set of all integer group determinants for the dicyclic groups of order $4p$.