Results 31 to 40 of about 451,593 (141)
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
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
Variable‐Range Hopping Conduction in Amorphous, Non‐Stoichiometric Gallium Oxide
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
On the emergence of the Quanta Prime sequence
This paper presents the Quanta Prime Sequence (QPS) and its foundational theorem, showcasing a unique class of polynomials with substantial implications.
Moustafa Ibrahim
doaj +1 more source
A characterization of some finite simple groups by their character codegrees
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
Batched ranged random integer generation
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
This paper proposes an improved group target tracking algorithm based on rigid‐body similarity model and measurement fusion, implemented across different random finite set filtering frameworks. The method outperforms traditional VLFM algorithms in the GMPHD framework and demonstrates robustness against varying clutter densities in the PMBM framework ...
Kai Chang +4 more
wiley +1 more source
Generation of Fast Finite Field Arithmetic forCortex-M4 with ECDH and SQIsign Applications
Finite field arithmetic is central to several cryptographic algorithms on embedded devices like the ARM Cortex-M4, particularly for elliptic curve and isogenybased cryptography.
Felix Carvalho Rodrigues +7 more
doaj +1 more source
Weakly subnormal subgroups and variations of the Baer–Suzuki theorem
Abstract A subgroup R$R$ of a finite group G$G$ is weakly subnormal in G$G$ if R$R$ is not subnormal in G$G$ but it is subnormal in every proper overgroup of R$R$ in G$G$. In this paper, we first classify all finite groups G$G$ that contains a weakly subnormal p$p$‐subgroup for some prime p$p$.
Robert M. Guralnick +2 more
wiley +1 more source
An elliptic curve test for Mersenne primes
Let l ⩾ 3 be a prime, and let p = 2 l - 1 be the corresponding Mersenne number. The Lucas–Lehmer test for the primality of p goes as follows. Define the sequence of integers x k by the recursion x 0 = 4 , x k = x k - 1 2 - 2 .
B. Gross
semanticscholar +1 more source

