Results 51 to 60 of about 2,328 (103)
The Multiple Equal-Difference Structure of Cyclotomic Cosets
In this paper we introduce the definition of equal-difference cyclotomic coset, and prove that in general any cyclotomic coset can be decomposed into a disjoint union of equal-difference subsets. Among the equal-difference decompositions of a cyclotomic coset, an important class consists of those in the form of cyclotomic decompositions, called the ...
Zhu, Li +3 more
openaire +2 more sources
On the geometric fixed points of real topological cyclic homology
Abstract We give a formula for the geometric fixed‐points spectrum of the real topological cyclic homology of a bounded below ring spectrum, as an equaliser of two maps between tensor products of modules over the norm. We then use this formula to carry out computations in the fundamental examples of spherical group rings, perfect Fp$\mathbb {F}_p ...
Emanuele Dotto +2 more
wiley +1 more source
Cyclotomy and permutation polynomials of large indices [PDF]
We use cyclotomy to design new classes of permutation polynomials over finite fields. This allows us to generate many classes of permutation polynomials in an algorithmic way.
Wang, Qiang
core
A p$p$‐adic approach to the existence of level‐raising congruences
Abstract We construct level‐raising congruences between p$p$‐ordinary automorphic representations, and apply this to the problem of symmetric power functoriality for Hilbert modular forms. In particular, we prove the existence of the nth$n\text{th}$ symmetric power lift of a Hilbert modular eigenform of regular weight for each odd integer n=1,3,⋯,25$n =
Jack A. Thorne
wiley +1 more source
Adelic Rogers integral formula
Abstract We formulate and prove the extension of the Rogers integral formula (Rogers [Acta Math. 94 (1955), 249–287]) to the adeles of number fields. We also prove the second moment formulas for a few important cases, enabling a number of classical and recent applications of the formula to extend immediately to any number field.
Seungki Kim
wiley +1 more source
GF(2^m) Low-Density Parity-Check Codes Derived from Cyclotomic Cosets
Coding
Tjhai, C. +4 more
openaire +2 more sources
Row‐Hamiltonian Latin squares and Falconer varieties
Abstract A Latin square is a matrix of symbols such that each symbol occurs exactly once in each row and column. A Latin square L$L$ is row‐Hamiltonian if the permutation induced by each pair of distinct rows of L$L$ is a full cycle permutation. Row‐Hamiltonian Latin squares are equivalent to perfect 1‐factorisations of complete bipartite graphs.
Jack Allsop, Ian M. Wanless
wiley +1 more source
We consider the ringR_(2p^n q^m )=GF(l)[x]/(x^(2p^n q^m )-1) where p,q,l are distinct odd primes,l is a primitive root both modulo p^n and q^m such that gcd(p^n),(q^m))d.Explicit expressions for all the 2(m n d+m+n+1) Cyclotomic Cosets areobtained, p does not divide q-1 .
openaire +1 more source
Pinki Devi, Pankaj Kumar
openaire +1 more source
CYCLOTOMIC COSETS IN THE RING EQUATION
We consider the ringR_(4p^n q^m )=GF(l)[x]/(x^(4p^n q^m )-1) where p,q,l are distinct odd primes,l is a primitive root both modulo p^n and q^m such that gcd (p^n), (q^m)) d.Explicit expressions for all the 4(m n d m n 1) Cyclotomic Cosets areobtained, p does not divide q 1 .
openaire +1 more source

