Results 51 to 60 of about 384 (160)
On (unitary) perfect polynomials over F2 with only Mersenne primes as odd divisors [PDF]
The only (unitary) perfect polynomials over F2 with only Mersenne primes as odd divisors that are products of $x$, $x+1$ and Mersenne primes are precisely the nine (resp. nine "classes") known ones.
Gallardo, Luis, Rahavandrainy, Olivier
core +1 more source
Mersenne Primes and the Quest to Find Them [PDF]
The purpose of this thesis is to explore Mersenne primes. Mersenne primes are prime numbers of the form 2ⁿ − 1 where itself is prime. We delve into some properties of Mersenne primes and discuss conjectures about their distribution.
Levenius, Leo G.
core +2 more sources
Engineering Reports, Volume 7, Issue 10, October 2025.StorjLedger leverages erasure‐coded sharding and Proof‐of‐Storage to deliver nearly 1000 transactions per second with sub‐second latency, 98% data redundancy, and 76% lower storage costs, resolving the blockchain trilemma by harmonizing scalability, security, and decentralization.
Saha Reno, Koushik Roy
wiley +1 more source
Groups with triangle‐free graphs on p$p$‐regular classes
Mathematische Nachrichten, Volume 298, Issue 6, Page 1796-1807, June 2025.Abstract Let p$p$ be a prime. In this paper, we classify the p$p$‐structure of those finite p$p$‐separable groups such that, given any three non‐central conjugacy classes of p$p$‐regular elements, two of them necessarily have coprime lengths.
M. J. Felipe +2 more
wiley +1 more source
On the Mersenne Prime Numbers [PDF]
, 2020 The prime numbers have been an important field of research for thousands of years and are intertwined with most other fields of mathematics. One topic that has piqued the interest of mathematicians young and old is the Mersenne prime numbers, which have ...
VanLandingham, Julia
core +1 more source
NeonCROSS: Vectorized Implementation of Post-Quantum Signature CROSS on Cortex-A72 and Apple M3
Transactions on Cryptographic Hardware and Embedded SystemsThe advancement of quantum computing threatens traditional public-key cryptographic systems, prompting the development of post-quantum cryptography (PQC).
Hanyu Wei, Wenqian Li, Yunlei Zhao
doaj +1 more source
Variable‐Range Hopping Conduction in Amorphous, Non‐Stoichiometric Gallium Oxide
Advanced Electronic Materials, Volume 11, Issue 4, April 2025.The combination of experimental evidence, ab‐initio DOS calculations and quantitative modeling by kinetic Monte Carlo simulations reveals: Variable‐range hopping (VRH) is the dominant electron conduction mechanism in a‐GaOx (x = 0.8 to 1.0), even at room temperature, which leads to a new, fundamental understanding of a‐GaOx‐based electronic devices ...
Philipp Hein +7 more
wiley +1 more source
A characterization of some finite simple groups by their character codegrees
Mathematische Nachrichten, Volume 298, Issue 4, Page 1356-1369, April 2025.Abstract Let G$G$ be a finite group and let χ$\chi$ be a complex irreducible character of G$G$. The codegree of χ$\chi$ is defined by cod(χ)=|G:ker(χ)|/χ(1)$\textrm {cod}(\chi)=|G:\textrm {ker}(\chi)|/\chi (1)$, where ker(χ)$\textrm {ker}(\chi)$ is the kernel of χ$\chi$.
Hung P. Tong‐Viet
wiley +1 more source
BINARY BBP-FORMULAE FOR LOGARITHMS AND GENERALIZED GAUSSIAN-MERSENNE PRIMES [PDF]
, 2008 ... k=0 p(k) q(k)b k where p and q are integer polynomials, deg p < deg q, and p(k)/q(k) is non-singular for non-negative k and b ≥ 2, have special properties.
Marc Chamberland
core
Batched ranged random integer generation
Software: Practice and Experience, Volume 55, Issue 1, Page 155-169, January 2025.Summary Pseudorandom values are often generated as 64‐bit binary words. These random words need to be converted into ranged values without statistical bias. We present an efficient algorithm to generate multiple independent uniformly‐random bounded integers from a single uniformly‐random binary word, without any bias.
Nevin Brackett‐Rozinsky, Daniel Lemire
wiley +1 more source