Results 41 to 50 of about 7,730,013 (301)
A framework for deterministic primality proving using elliptic curves with complex multiplication [PDF]
Mathematics of Computation, 2014 We provide a framework for using elliptic curves with complex multiplication to determine the primality or compositeness of integers that lie in special sequences, in deterministic quasi-quadratic time.
Alexander Abatzoglou +3 more
semanticscholar +1 more source
The cyclotomic Iwasawa main conjecture for Hilbert cusp forms with complex multiplication [PDF]
, 2015 We deduce the cyclotomic Iwasawa main conjecture for Hilbert modular cuspforms with complex multiplication from the multivariable main conjecture for CM number fields.
T. Hara, T. Ochiai
semanticscholar +1 more source
Faltings heights of abelian varieties with complex multiplication [PDF]
, 2015 Let M be the Shimura variety associated with the group of spinor similitudes of a rational quadratic space over of signature (n,2). We prove a conjecture of Bruinier-Kudla-Yang, relating the arithmetic intersection multiplicities of special divisors and ...
F. Andreatta +3 more
semanticscholar +1 more source
Frontiers in Human Neuroscience, 2019 Some individuals experience more difficulties with math than others, in particular when arithmetic problems get more complex. Math ability, on one hand, and arithmetic complexity, on the other hand, seem to partly share neural underpinnings.
Christina Artemenko +13 more
doaj +1 more source
Montgomery Reduction for Gaussian Integers
Cryptography, 2021 Modular arithmetic over integers is required for many cryptography systems. Montgomery reduction is an efficient algorithm for the modulo reduction after a multiplication. Typically, Montgomery reduction is used for rings of ordinary integers.
Malek Safieh, Jürgen Freudenberger
doaj +1 more source
Towards Formulation of a Complex Binary Number System
Sultan Qaboos University Journal for Science, 2002 For years complex numbers have been treated as distant relatives of real numbers despite their widespread applications in the fields of electrical and computer engineering.
Tariq Jamil, David Blest, Amer Al-Habsi
doaj +1 more source
Computation on elliptic curves with complex multiplication [PDF]
LMS J. Comput. Math., 2013 We give the complete list of possible torsion subgroups of elliptic curves with complex multiplication over number elds of degree 1-13. Addi- tionally we describe the algorithm used to compute these torsion subgroups and its implementation.
P. Clark +3 more
semanticscholar +1 more source
On-line algorithms for multiplication and division in real and complex numeration systems [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 A positional numeration system is given by a base and by a set of digits. The base is a real or complex number $\beta$ such that $|\beta|>1$, and the digit set $A$ is a finite set of digits including $0$. Thus a number can be seen as a finite or infinite
Christiane Frougny +3 more
doaj +1 more source
Musings on multiplication tables and associated mathematics and teaching practices
Pythagoras, 2009 This paper is based on my reflections on a deceptively simple tabular representation of a combined 12×12 multiplication table showing multiplier and multiplicand,starting at a time when I taught mathematics full time at a primary (elementary) school
Faaiz Gierdien
doaj +1 more source
Construction of dual-generalized complex Fibonacci and Lucas quaternions
Karpatsʹkì Matematičnì Publìkacìï, 2022 The aim of this paper is to construct dual-generalized complex Fibonacci and Lucas quaternions. It examines the properties both as dual-generalized complex number and as quaternion. Additionally, general recurrence relations, Binet's formulas, Tagiuri's (
G.Y. Şentürk, N. Gürses, S. Yüce
doaj +1 more source