Related papers: On the decycling of powers and products of cycles

Given $A:=\left(\begin{smallmatrix}1&1\\0&1\end{smallmatrix}\right)$, $B:=\left(\begin{smallmatrix}1&0\\1&1\end{smallmatrix}\right)$ and $C:=\left(\begin{smallmatrix}1&0\\0&-1\end{smallmatrix}\right)$ three elements of…

This paper is devoted to studying the numbers $L_{c,m,n} := \mathrm{lcm}\{m^2+c ,(m+1)^2+c , \dots , n^2+c\}$, where $c,m,n$ are positive integers such that $m \leq n$. Precisely, we prove that $L_{c,m,n}$ is a multiple of the rational…

Cyclic codes are an important subclass of linear codes with wide applications in communication systems and data storage systems. In 2013, Ding and Helleseth presented nine open problems on optimal ternary cyclic codes $\mathcal{C}_{(1,e)}$.…

Let $M$ be a 3-manifold with a finite set $X(M)$ of conjugacy classes of representations $\rho:\pi_1(M)\to$SU$_2$. We study here the distribution of the values of the Chern-Simons function CS$:X(M)\to \mathbb{R}/2\pi\mathbb{Z}$. We observe…

The explicit formulas for the sums of positive powers of the integers $s_i$ unrepresentable by the triple of integers $d_1,d_2,d_3\in {\mathbb N}, \gcd(d_1,d_2,d_3)=1$, are derived.

Calculation of the centre of mass of a group of particles in a periodically-repeating cell is an important aspect of chemical and physical simulation. One popular approach calculates the centre of mass via the projection of the individual…

Cyclic codes have efficient encoding and decoding algorithms over finite fields, so that they have practical applications in communication systems, consumer electronics and data storage systems. The objective of this paper is to give eight…

Let $M$ be a $G$-manifold and $\om$ a $G$-invariant exact $m$-form on $M$. We indicate when these data allow us to constract a cocycle on a group $G$ with values in the trivial $G$-module $\mathbb R$ and when this cocycle is nontrivial.

BCH codes are an important class of cyclic codes, and have wide applicantions in communication and storage systems. However, it is difficult to determine the parameters of BCH codes and only a few cases are known. In this paper, we mainly…

Motivated by recent interest in their applications, we report a systematic study of Cs atomic properties calculated by a high-precision relativistic all-order method. Excitation energies, reduced matrix elements, transition rates, and…

By means of the mathematical analysis theory, inequality theory, mathematical induction and the dimension reduction method, under the proper hypotheses, we establish the following cyclic inequalities: \[\sum_{i=1}^{n}…

Let $P(n,m)$ be a graph chosen uniformly at random from the class of all planar graphs on vertex set $\{1, \ldots, n\}$ with $m=m(n)$ edges. We study the cycle and block structure of $P(n,m)$ when $m\sim n/2$. More precisely, we determine…

This article is devoted to present an explicit formula for the $c$th nilpotent multiplier of nilpotent products of some cyclic groups $G={\bf {Z}}\stackrel{n_1}{*}{\bf {Z}}\stackrel{n_2}{*}...\stackrel{n_{t-1}}{*}{\bf…

We describe a new algorithm for computing exp(f) where f is a power series in C[[x]]. If M(n) denotes the cost of multiplying polynomials of degree n, the new algorithm costs (2.1666... + o(1)) M(n) to compute exp(f) to order n. This…

Let ${\Bbb Z}_{m}$ be the additive group of residue classes modulo $m$ and $s(m_{1},m_{2})$ denote the number of subgroups of the group ${\Bbb Z}_{m_{1}}\times {\Bbb Z}_{m_{2}}$, where $m_{1}$ and $m_{2}$ are arbitrary positive integers. We…

Determining the weight distribution of a linear code is a classical and fundamental topic in coding theory that has been extensively investigated. Repeated-root cyclic codes, which form a significant subclass of error-correcting codes, have…

Let $m, n, k$ and $c$ be positive integers. Let $\nu_2(k)$ be the 2-adic valuation of $k$. By $S(n,k)$ we denote the Stirling numbers of the second kind. In this paper, we first establish a convolution identity of the Stirling numbers of…

We study cycle counts in permutations of $1,\dots,n$ drawn at random according to the Mallows distribution. Under this distribution, each permutation $\pi \in S_n$ is selected with probability proportional to $q^{\text{inv}(\pi)}$, where…

We introduce an invariant linked to some foundational questions in geometric measure theory and provide bounds on this invariant by decomposing an arbitrary cycle into uniformly rectifiable pieces. Our invariant measures the difficulty of…

We establish necessary and sufficient conditions for the existence of a decomposition of a complete multigraph into edge-disjoint cycles of specified lengths, or into edge-disjoint cycles of specified lengths and a perfect matching.