Related papers: Cyclotomic construction of $\lambda$-fold near-fac…

We determine all factorisations $X=AB$, where $X$ is a finite almost simple group and $A,B$ are core-free subgroups such that $A\cap B$ is cyclic or dihedral. As a main application, we classify the graphs $\Gamma$ admitting an almost simple…

Let $G$ be a finite cyclic group, written additively, and let $A,\ B$ be nonempty subsets of $G$. We will say that $G= A+B$ is a \textit{factorization} if for each $g$ in $G$ there are unique elements $a,\ b$ of $G$ such that $g=a+b, \ a\in…

Let $q$ be a power of a prime $p$, let $k$ be a nontrivial divisor of $q-1$ and write $e=(q-1)/k$. We study upper bounds for cyclotomic numbers $(a,b)$ of order $e$ over the finite field $\mathbb{F}_q$. A general result of our study is that…

Let $F$ be any field of characteristic $p$. It is well-known that there are exactly $p$ inequivalent indecomposable representations $V_1,V_2,...,V_p$ of $C_p$ defined over $F$. Thus if $V$ is any finite dimensional $C_p$-representation…

This paper presents some basic theorems giving the structure of cyclic codes of length n over the ring of integers modulo p^a and over the p-adic numbers, where p is a prime not dividing n. An especially interesting example is the 2-adic…

Based on the concepts of $\mathbb{R}$-factorizable topological groups and $\mathcal{M}$-factorizable topological groups, we introduce four classes of factorizabilities on topological groups, named $P\mathcal{M}$-factorizabilities,…

This article examines group ring codes over finite fields and finite groups. We also present a section on two-dimensional cyclic codes in the quotient ring $\mathbb{F}_q[x, y] / \langle x^{l} - 1, y^{m} - 1 \rangle$. These two-dimensional…

We study factoriality and the class groups of locally acyclic cluster algebras. To do so, we introduce a new class of rings called finite Laurent intersection rings (FLIRs), which includes locally acyclic cluster algebras, full-rank upper…

Let $F$ be a field, $p$ a prime number, $X$ an indeterminate over $F$, $D_n =F[X^{\frac{1}{p^n}}, X^{-\frac{1}{p^n}}]$ for each integer $n \geq 0$ and $D = \bigcup\limits_{n\in\mathbb{N}_0}D_n.$ Then $D$ is a one-dimensional B{\'e}zout…

This paper deals with sequences of random variables $X_n$ only taking values in $\{0,\ldots,n\}$. The probability generating functions of such random variables are polynomials of degree $n$. Under the assumption that the roots of these…

A finite group is said to be $n$-cyclic if it contains $n$ cyclic subgroups. For a finite group $G$, the ratio of the number of cyclic subgroups to the number of subgroups is known as the cyclicity degree of the group $G$ and is denoted by…

We study almost symmetric numerical semigroups and semigroup rings. We describe a characteristic property of the minimal free resolution of the semigroup ring of an almost symmetric numerical semigroup. For almost symmetric semigroups…

This is the fifth one in a series of papers classifying the factorizations of almost simple groups with nonsolvable factors. In this paper we deal with orthogonal groups of plus type.

We establish a new asymptotic formula for the number of polynomials of degree $n$ with $k$ prime factors over a finite field $\mathbb{F}_q$. The error term tends to $0$ uniformly in $n$ and in $q$, and $k$ can grow beyond $\log n$.…

It is a classical result that a random permutation of $n$ elements has, on average, about $\log n$ cycles. We generalise this fact to all directed $d$-regular graphs on $n$ vertices by showing that, on average, a random cycle-factor of such…

Suppose that a finite $p$-group $P$ admits a Frobenius group of automorphisms $FH$ with kernel $F$ that is a cyclic $p$-group and with complement $H$. It is proved that if the fixed-point subgroup $C_P(H)$ of the complement is nilpotent of…

In the realm of modern digital communication, cryptography, and signal processing, binary sequences with a low correlation properties play a pivotal role. In the literature, considerable efforts have been dedicated to constructing good…

Suppose $C(G)$ denotes the set of all cyclic subgroups of a finite group $G$, and $\mathcal{O}_{2}(G)$ denotes the number of elements of order $2$ in $G$. In [Marius T., Finite groups with a certain number of cyclic subgroups. The American…

We identify a recursive structure among factorizations of polynomial values into two integer factors. Polynomials for which this recursive structure characterizes all non-trivial representations of integer factorizations of the polynomial…

Let $G$ be a free product of two groups with amalgamated subgroup, $\pi$ be either the set of all prime numbers or the one-element set \{$p$\} for some prime number $p$. Denote by $\Sigma$ the family of all cyclic subgroups of group $G$,…