Related papers: Numbers which are orders only of cyclic groups
In this note, we describe a construction that leads to families of graphs whose critical groups are cyclic. For some of these families we are able to give a formula for the number of spanning trees of the graph, which then determines the…
We present a survey of exact and asymptotic formulas on the number of cyclic subgroups and total number of subgroups of the groups ${\Bbb Z}_{n_1} \times \cdots \times {\Bbb Z}_{n_k}$, where $k\ge 2$ and $n_1,\ldots,n_k$ are arbitrary…
Consider the random process that starts with $n$ vertices and no edges, where the edges of $K_n$ are added one at a time in a uniformly chosen random order $e_1, e_2,\ldots, e_{\binom{n}{2}}$. Let $T$ be the earliest time at which $e_1$…
A cyclic presentation of a group is a presentation with an equal number of generators and relators that admits a particular cyclic symmetry. We characterise the orientable, non-orientable, and redundant cyclic presentations and obtain…
A Berge cycle of length $\ell$ in a hypergraph is an alternating sequence of $\ell$ distinct vertices and $\ell$ distinct edges $v_1,e_1,v_2, \ldots, v_\ell, e_{\ell}$ such that $\{v_i, v_{i+1}\} \subseteq e_i$ for all $i$, with indices…
Let $n$ be a large number. A subset $A$ of $Z_n$ is complete if $S_A = Z_n$, where $S_A$ is the collection of the subset sums of $A$. Olson proved that if $n$ is a prime and $|A|> 2n^{1/2} $, then $S_A$ is complete. We show that a similar…
A sequence $D=(d_1,d_2,\ldots,d_n)$ of non-negative integers is called a graphic sequence if there is a simple graph with vertices $v_1,v_2,\ldots,v_n$ such that the degree of $v_i$ is $d_i$ for $1\leq i\leq n$. Given a graph theoretical…
Let $\phi(n)$ be the Euler totient function and $\sigma(n)$ denote the sum of divisors of $n$. In this note, we obtain explicit upper bounds on the number of positive integers $n\leq x$ such that $\phi(\sigma(n)) > cn$ for any $c>0$. This…
Denote the sum of element orders in a finite group $G$ by $\psi(G)$ and let $C_n$ denote the cyclic group of order $n$. Suppose that $G$ is a non-cyclic finite group of order $n$ and $q$ is the least prime divisor of $n$. We proved that…
We describe a way to decompose the chromatic symmetric function as a positive sum of smaller pieces. We show that these pieces are $e$-positive for cycles. Then we prove that attaching a cycle to a graph preserves the $e$-positivity of…
Let $R=\mathbb{Z}_{4}[u]/\langle u^k\rangle=\mathbb{Z}_{4}+u\mathbb{Z}_{4}+\ldots+u^{k-1}\mathbb{Z}_{4}$ ($u^k=0$) where $k\in \mathbb{Z}^{+}$ satisfies $k\geq 2$. For any odd positive integer $n$, it is known that cyclic codes over $R$ of…
Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems and communication systems as they have efficient encoding and decoding algorithms. In this paper, we settle an open problem…
Consider a graph $\Gamma$. A set $ S $ of vertices in $\Gamma$ is called a {cyclic vertex cutset} of $\Gamma$ if $\Gamma - S$ is disconnected and has at least two components containing cycles. If $\Gamma$ has a cyclic vertex cutset, then it…
We present the first fixed-length elementary closed-form expressions for the prime-counting function, $\pi(n)$, and the $n$-th prime number, $p(n)$. These expressions are arithmetic terms, requiring only a finite and fixed number of…
In 1996, in his last paper, Erd\H{o}s asked the following question that he formulated together with Faudree: is there a positive $c$ such that any $(n+1)$-regular graph $G$ on $2n$ vertices contains at least $c 2^{2n}$ distinct…
A nonpolycyclic nilpotent-by-cyclic group Gamma can be expressed as the HNN extension of a finitely-generated nilpotent group N. The first main result is that quasi-isometric nilpotent-by-cyclic groups are HNN extensions of quasi-isometric…
Let $\omega^*(n) = \{d|n: d=p-1, \mbox{$p$ is a prime}\}$. We show that, for each integer $k\geq2$, $$ \sum_{n\leq x}\omega^*(n)^k \asymp x(\log x)^{2^k-k-1}, $$ where the implied constant may depend on $k$ only. This confirms a recent…
It is proved that there exists an absolute constant c > 0 such that for every natural number k, every non-bipartite 2-connected graph with average degree at least ck contains k cycles with consecutive odd lengths. This implies the existence…
In this paper we classify all the cyclic finite dimensional indecomposable\\ modules of the perfect Lie algebras $\mathfrak{sl}(n+1)\ltimes \mathbbm{C}^{n+1}$, given by the semidirect sum of the simple Lie algebra $A_n$ with its standard…
We describe a geometric theory classified by Connes-Consani's epicylic topos and two related theories respectively classified by the cyclic topos and by the topos $[{\mathbb N}^{\ast}, \mathbf{Set}]$.