Results 41 to 50 of about 47,929 (192)
Non-cyclotomic fusion categories
, 2010 Etingof, Nikshych and Ostrik ask in arXiv:math.QA/0203060 if every fusion category can be completely defined over a cyclotomic field. We show that this is not the case: in particular one of the fusion categories coming from the Haagerup subfactor arXiv ...
Morrison, Scott, Snyder, Noah
core +1 more source
Solving the n $n$‐Player Tullock Contest
Journal of Public Economic Theory, Volume 28, Issue 2, April 2026.ABSTRACT The n $n$‐player Tullock contest with complete information is known to admit explicit solutions in special cases, such as (i) homogeneous valuations, (ii) constant returns, and (iii) two contestants. But can the model be solved more generally?
Christian Ewerhart
wiley +1 more source
BarekengThis research aims to obtain a method for constructing S-boxes based on GF(22), GF(24) and GF(26). A review of the Galois Field GF(2m) is presented for m=1,2,3,4,5 and 6.
Adi Setiawan +2 more
doaj +1 more source
A classification of Prüfer domains of integer‐valued polynomials on algebras
Bulletin of the London Mathematical Society, Volume 58, Issue 4, April 2026.Abstract Let D$D$ be an integrally closed domain with quotient field K$K$ and A$A$ a torsion‐free D$D$‐algebra that is finitely generated as a D$D$‐module and such that A∩K=D$A\cap K=D$. We give a complete classification of those D$D$ and A$A$ for which the ring IntK(A)={f∈K[X]∣f(A)⊆A}$\textnormal {Int}_K(A)=\lbrace f\in K[X] \mid f(A)\subseteq A ...
Giulio Peruginelli, Nicholas J. Werner
wiley +1 more source
PRIMITIVE MATRICES AND GENERATORS OF PSEUDO RANDOM SEQUENCES OF GALOIS
Ìнформаційні технології в освіті, 2014 In theory and practice of information cryptographic protection one of the key problems is the forming a binary pseudo-random sequences (PRS) with a maximum length with acceptable statistical characteristics.
A. Beletsky, E. Beletsky
doaj
Mathematika, Volume 72, Issue 2, April 2026.Abstract In this paper, we study traces of Hecke operators on Drinfeld modular forms of level 1 in the case A=Fq[T]$A = \mathbb {F}_q[T]$. We deduce closed‐form expressions for traces of Hecke operators corresponding to primes of degree at most 2 and provide algorithms for primes of higher degree.
Sjoerd de Vries
wiley +1 more source
Invariance of recurrence sequences under a galois group
International Journal of Mathematics and Mathematical Sciences, 1996 Let F be a Galois field of order q, k a fixed positive integer and R=Fk×k[D] where D is an indeterminate. Let L be a field extension of F of degree k. We identify Lf with fk×1 via a fixed normal basis B of L over F. The F-vector space Γk(F)(=Γ(L)) of all
Hassan Al-Zaid, Surjeet Singh
doaj +1 more source
Ordinary primes for GL2$\operatorname{GL}_2$‐type abelian varieties and weight 2 modular forms
Mathematika, Volume 72, Issue 2, April 2026.Abstract Let A$A$ be a g$g$‐dimensional abelian variety defined over a number field F$F$. It is conjectured that the set of ordinary primes of A$A$ over F$F$ has positive density, and this is known to be true when g=1,2$g=1, 2$, or for certain abelian varieties with extra endomorphisms.
Tian Wang, Pengcheng Zhang
wiley +1 more source
Biases towards the zero residue class for quadratic forms in arithmetic progressions
Mathematika, Volume 72, Issue 2, April 2026.Abstract We prove a bias towards the zero residue class in the distribution of the integers represented by binary quadratic forms. In most cases, we prove that the bias comes from a secondary term in an associated asymptotic expansion. This is unlike Chebyshev's bias, which exists somewhere at the level of O(x1/2+ε)$O(x^{1/2+\varepsilon })$.
Jeremy Schlitt
wiley +1 more source
Implementation of Reed-Solomon RS(255,239) Code
Proceedings of the International Conference on Applied Innovations in IT, 2014 In this paper the construction of Reed-Solomon RS(255,239) codeword is described and the process of coding and decoding a message is simulated and verified.
Maja Malenko
doaj +1 more source