LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:

OpenAIRE is about to release its new face with lots of new content and services.
During September, you may notice downtime in services, while some functionalities (e.g. user registration, login, validation, claiming) will be temporarily disabled.
We apologize for the inconvenience, please stay tuned!
For further information please contact helpdesk[at]openaire.eu

fbtwitterlinkedinvimeoflicker grey 14rssslideshare1

Search filters

Refine by

Publication Year

2014 (9)
2015 (6)
2012 (4)
2016 (4)
2013 (3)
View more
Publication Year

2014 (9)
2015 (6)
2012 (4)
2016 (4)
2013 (3)
2017 (3)
2018 (1)

Access Mode

Document Type

Document Language

English (30)
30 documents, page 1 of 3

Computing arithmetic Kleinian groups

Page , Aurel (2015)
Projects: EC | ANTICS (278537)
International audience; Arithmetic Kleinian groups are arithmetic lattices in PSL_2(C). We present an algorithm which, given such a group Gamma, returns a fundamental domain and a finite presentation for Gamma with a computable isomorphism.

An algorithm for the principal ideal problem in indefinite quaternion algebras

Page, Aurel (2014)
Projects: EC | ANTICS (278537)
International audience; Deciding whether an ideal of a number field is principal and finding a generator is a fundamental problem with many applications in computational number theory. For indefinite quaternion algebras, the decision problem reduces to that in the underlying number field. Finding a generator is hard, and we present a heuristically subexponential algorithm.

Generalised Weber Functions

Enge , Andreas; Morain , François (2014)
Projects: EC | ANTICS (278537)
International audience; A generalised Weber function is given by $\w_N(z) = \eta(z/N)/\eta(z)$, where $\eta(z)$ is the Dedekind function and $N$ is any integer; the original function corresponds to $N=2$. We classify the cases where some power $\w_N^e$ evaluated at some quadratic integer generates the ring class field associated to an order of an imaginary quadratic field. We compare the heights of our invariants by giving a general formula for the degree of the modular equation relating $\w_...

Dirichlet series associated to cubic fields with given quadratic resolvent

Cohen, Henri; Thorne, Frank (2014)
Projects: EC | ANTICS (278537)
International audience; Let k be a quadratic field. We give an explicit formula for the Dirichlet series enumerating cubic fields whose quadratic resolvent field is isomorphic to k. Our work is a sequel to previous work of Cohen and Morra, where such formulas are proved in a more general setting, in terms of sums over characters of certain groups related to ray class groups. In the present paper we carry the analysis further and prove explicit formulas for these Dirichlet series over Q. In a ...

Short addition sequences for theta functions

Enge , Andreas; Hart , William; Johansson , Fredrik (2018)
Projects: EC | ANTICS (278537)
International audience; The main step in numerical evaluation of classical Sl2 (Z) modular forms and elliptic functions is to compute the sum of the first N nonzero terms in the sparse q-series belonging to the Dedekind eta function or the Jacobi theta constants. We construct short addition sequences to perform this task using N + o(N) multiplications. Our constructions rely on the representability of specific quadratic progressions of integers as sums of smaller numbers of the same kind. For...

Vanishing and non-vanishing theta values

Cohen, Henri; Zagier, Don (2013)
Projects: EC | ANTICS (278537)
International audience

Computing Class Polynomials for Abelian Surfaces

Enge, Andreas; Thomé, Emmanuel (2014)
Projects: EC | ANTICS (278537)
International audience; We describe a quasi-linear algorithm for computing Igusa class polynomials of Jacobians of genus 2 curves via complex floating-point approximations of their roots. After providing an explicit treatment of the computations in quartic CM fields and their Galois closures, we pursue an approach due to Dupont for evaluating ϑ- constants in quasi-linear time using Newton iterations on the Borchardt mean. We report on experiments with our implementation and present an example...

Schertz style class invariants for quartic CM fields

Enge, Andreas; Streng, Marco (2016)
Projects: EC | ANTICS (278537)
A class invariant is a CM value of a modular function that lies in a certain unramified class field. We show that Siegel modular functions over $\mathbb Q$ for $\Gamma^0(N)\subseteq \operatorname {Sp}_4(\mathbb Z)$ yield class invariants under some splitting conditions on $N$. Small class invariants speed up onstructions in explicit class field theory and public-key cryptography. Our results generalise results of Schertz's from elliptic curves to abelian varieties and from classical modular f...

Computing isogenies between Abelian Varieties

Lubicz , David; Robert , Damien (2012)
Projects: EC | ANTICS (278537)
We describe an efficient algorithm for the computation of separable isogenies between abelian varieties represented in the coordinate system given by algebraic theta functions. Let $A$ be an abelian variety of dimension $g$ defined over a field of odd characteristic. Our algorithm decomposes in two principal steps. First, given a theta null point for $A$ and a subgroup $K$ isotropic for the Weil pairing, we explain how to compute the theta null point corresponding to the quotient abelian vari...
Cookies make it easier for us to provide you with our services. With the usage of our services you permit us to use cookies.
More information Ok