Results 21 to 30 of about 7,730,013 (301)
Drinfeld Modules with Complex Multiplication, Hasse Invariants and Factoring Polynomials over Finite Fields [PDF]
We present a novel randomized algorithm to factor polynomials over a finite field $\F_q$ of odd characteristic using rank $2$ Drinfeld modules with complex multiplication.
Javad Doliskani +2 more
semanticscholar +1 more source
Falcon is one of the promising digital-signature algorithms in NIST’s ongoing Post-Quantum Cryptography (PQC) standardization finalist. Computational efficiency regarding software and hardware is also the main criteria for PQC standardization.
Youngbeom Kim +2 more
doaj +1 more source
BREUIL–KISIN–FARGUES MODULES WITH COMPLEX MULTIPLICATION [PDF]
We prove that the category of (rigidified) Breuil–Kisin–Fargues modules up to isogeny is Tannakian. We then introduce and classify Breuil–Kisin–Fargues modules with complex multiplication mimicking the classical theory for rational Hodge structures.
Johannes Anschütz
semanticscholar +1 more source
Complexity and multiple complexes
Let G be a finite group and let R be a commutative ring with unit. One of the most basic problems in group cohomology is that of finding suitable projective resolutions for RG-modules. The main result of this paper shows that if \(R=k\) is a field of characteristic \(p>0\), and if M is any finitely generated kG-module then there exists a projective ...
Carlson, Jon F., Benson, David J.
openaire +1 more source
On the interrelation of multiplication and division in secondary school children
Multiplication and division are conceptually inversely related: Each division problem can be transformed into as a multiplication problem and vice versa.
Stefan eHuber +4 more
doaj +1 more source
Plane quartics over $\mathbb {Q}$ with complex multiplication [PDF]
We give examples of smooth plane quartics over QQQ with complex multiplication over Q¯¯¯¯Q¯\overline{Q} by a maximal order with primitive CM type. We describe the required algorithms as we go, these involve the reduction of period matrices, the fast ...
Pinar Kiliccer +5 more
semanticscholar +1 more source
Point counting on K3 surfaces and an application concerning real and complex multiplication [PDF]
We report on our project to find explicit examples of $K3$ surfaces having real or complex multiplication. Our strategy is to search through the arithmetic consequences of RM and CM.
A. Elsenhans, J. Jahnel
semanticscholar +1 more source
High performance and resource efficient FFT processor based on CORDIC algorithm
Fast Fourier Transform is widely used in communication and signal processing. I propose an improved multipath delay commutator pipelining architecture based on the radix-2 time decimation algorithm.
Yupu Zhao, Hong Lv, Jun Li, Lulu Zhu
doaj +1 more source
High-performance waveguide-integrated Ge/Si APDs in separate absorption, charge, and multiplication (SACM) schemes have been exploited to facilitate energy-efficient optical communication and interconnects. However, the charge layer design is complex and
Daoqun Liu +4 more
doaj +1 more source
PERIODS OF DRINFELD MODULES AND LOCAL SHTUKAS WITH COMPLEX MULTIPLICATION [PDF]
Colmez [Périodes des variétés abéliennes a multiplication complexe, Ann. of Math. (2) 138(3) (1993), 625–683; available at http://www.math.jussieu.fr/∼colmez] conjectured a product formula for periods of abelian varieties over number fields with complex ...
U. Hartl, R. Singh
semanticscholar +1 more source

