Beyond uniform cyclotomy
The study of cyclotomic numbers began with Carl Friedrich Gauss, who explored their relationship to constructing regular polygons with a compass and straightedge. Ernst Kummer expanded on Gauss's work in 1847 by introducing cyclotomic integers, which formed the basis for modern algebraic theory of cyclotomic fields.\N\NThe \textit{cyclotomic classes} of order \(e\) of \(\mathrm{GF}(q^n)\) \((e\mid q^n-1)\), written \(C^e_i (0 \leq i \leq e-1)\), are the multiplicative cosets of the subgroup of index \(e\) in \(\mathrm{GF}(q^n)^{*}\). The \textit{cyclotomic number} \((i, j)_{e}\) counts the number of solutions to the equation \(z_{i}+1=z_{j}\) where \(z_{i} \in C^{e} _{i},z_{j} \in C^{e} _{j}\). The cyclotomic numbers \((i,j)_{e}\) over \(\mathrm{GF}(q)\) are \textit{uniform} if \((0,i)_{e} = (i, 0)_{e} =(i,i)_{e} =(0,1)_{e}\) for i=0, and \((i,j)_{e} =(1,2)_{e}\) for \( 0 \neq i\neq j\neq 0\). \N\NThe main Result is as follows: \N\NTheorem. Consider the finite field \(\mathrm{GF}(q^n)\), where \(n \geq 2\). Let \(e =\frac{(q^{n} - 1)}{(q - 1)}\) and let \(\alpha\) be a primitive element of \(\mathrm{GF}(q^{n})\). Let \(q^{n} = ef +1\)and let \(\epsilon | e\). Then\N\begin{itemize}\N\item[(1)] \[ (0,0)_{\varepsilon} =(f-1)+\sum^{\frac{e}{\epsilon} -1}_{s=1} \sum_{\substack{r=0 \bmod \varepsilon, \\ 1 \leq r \leq e-1}} (r, \varepsilon s)_{e} \]\N\item[(2)] For all \(0<i<e\), \[ (i,0)_{\varepsilon} =(0,i)_{\varepsilon} =(e-i,e-i)_{\varepsilon} =\sum^{ \frac{e}{\varepsilon} -1}_{s=1} \sum_{\substack{r=i \bmod \varepsilon, \\ 1 \leq r \leq e-1}} (r, \varepsilon s)_{e}\]\N\item[(3)] For all \(0<i \neq j<e\), \[ (i,j)_{\varepsilon} =\sum^{\frac{e}{\varepsilon} -1}_{s=1} \sum_{\substack{r=i \bmod \varepsilon, \\ 1 \leq r \leq e-1}} (r, \varepsilon s+j)_{e}\]\N\end{itemize}\N\NThere is potential for further research in cyclotomy, which could yield more intriguing results. The authors have provided examples to enhance understanding of the theory.
- A q-polynomial approach to constacyclic codes
- A theorem in finite projective geometry and some applications to number theory.
- All two-weight irreducible cyclic codes?
- Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families
- Construction and nonexistence of strong external difference families
- Constructions of linear codes with small hulls from association schemes
- Constructions of strongly regular Cayley graphs and skew Hadamard difference sets from cyclotomic classes
- Cyclotomic construction of strong external difference families in finite fields
- Cyclotomic problem, Gauss sums and Legendre curve
- Cyclotomy and difference families in elementary Abelian groups
- Cyclotomy and strongly regular graphs
- Cyclotomy, difference sets, sequences with low correlation, strongly regular graphs and related geometric substructures
- Families of irreducible polynomials of Gaussian periods and matrices of cyclotomic numbers
- Fast computation of Gauss sums and resolution of the root of unity ambiguity
- Finite Projective Plane Geometries and Difference Sets
- scientific article; zbMATH DE number 1131801 (Why is no real title available?)
- scientific article; zbMATH DE number 3221502 (Why is no real title available?)
- scientific article; zbMATH DE number 3252237 (Why is no real title available?)
- Internal and external partial difference families and cyclotomy
- Linear codes with small hulls in semi-primitive case
- On the number of solutions of u^k+D w^2 p
- Partial geometric difference sets and partial geometric difference families
- Resolution of the sign ambiguity in the determination of the cyclotomic numbers of order 4 and the corresponding Jacobsthal sum.
- Standard generators of finite fields and their cyclic subgroups
- The CRC handbook of combinatorial designs
- The Cyclotomic Numbers of Order Eighteen with Applications to Difference Sets
- The cyclotomic numbers of order eleven
- The Cyclotomic Numbers of Order Sixteen
- The Jacobi sums of orders thirteen and sixty and related quadratic decompositions
- The weight enumerator of the duals of a class of cyclic codes with three zeros
- Uniform cyclotomy
- Upper bounds on cyclotomic numbers
This page was built for publication: Beyond uniform cyclotomy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6994700)
