English
Related papers

Related papers: Class Number and Regulator Computation in Purely C…

200 papers

The theory of Q-Cartier divisors on the space of n-pointed, genus 0, stable maps to projective space is considered. Generators and Picard numbers are computed. A recursive algorithm computing all top intersection products of Q-Divisors is…

alg-geom · Mathematics 2008-02-03 R. Pandharipande

Let $K=\mathbb{Q}(\sqrt[4]{pd^{2}})$ be a real pure quartic number field and $k=\mathbb{Q}(\sqrt{p})$ its real quadratic subfield, where $p\equiv 5\pmod 8$ is a prime integer and $d$ an odd square-free integer coprime to $p$. In this work,…

Number Theory · Mathematics 2020-05-05 Mbarek Haynou , Mohammed Taous

The $p$-group generation algorithm from computational group theory is used to obtain information about large quotients of the pro-2 group $G = \text{Gal} (k^{nr,2}/k)$ for $k = \mathbb{Q}(\sqrt{d})$ with $d = -445, -1015, -1595, -2379$. In…

Number Theory · Mathematics 2007-05-23 Michael R. Bush

Unit-generated orders of a quadratic field are orders of the form $\mathcal{O} = \mathbb{Z}[\varepsilon]$, where $\varepsilon$ is a unit in the quadratic field. If the order $\mathcal{O}$ is a maximal order of a real quadratic field, then…

Number Theory · Mathematics 2026-04-23 Gene S. Kopp , Jeffrey C. Lagarias

In this paper, we determine the 2-rank of the class group of certain classes of real cyclic quartic number fields. Precisely, we consider the case in which the quadratic subfield is Q(\sqrt{l}) with l=2 or a prime congruent to 1 mod 8.

Number Theory · Mathematics 2020-04-20 Abdelmalek Azizi , Mohammed Tamimi , Abdelkader Zekhnini

Square-tiled surfaces can be classified by their number of squares and their cylinder diagrams (also called realizable separatrix diagrams). For the case of $n$ squares and two cone points with angle $4 \pi$ each, we set up and parametrize…

Geometric Topology · Mathematics 2018-10-23 Sunrose T. Shrestha

The Linear Quadratic Regulator (LQR), which is arguably the most classical problem in control theory, was recently related to kernel methods in (Aubin-Frankowski, SICON, 2021) for finite dimensional systems. We show that this result extends…

Optimization and Control · Mathematics 2022-10-12 Pierre-Cyril Aubin-Frankowski , Alain Bensoussan

We consider the problem of control in the setting of reinforcement learning (RL), where model information is not available. Policy gradient algorithms are a popular solution approach for this problem and are usually shown to converge to a…

Machine Learning · Computer Science 2023-04-24 Mizhaan Prajit Maniyar , Akash Mondal , Prashanth L. A. , Shalabh Bhatnagar

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…

Cryptography and Security · Computer Science 2013-12-11 Andreas Enge , Emmanuel Thomé

Linear Quadratic Regulators (LQR) achieve enormous successful real-world applications. Very recently, people have been focusing on efficient learning algorithms for LQRs when their dynamics are unknown. Existing results effectively learn to…

Machine Learning · Computer Science 2021-02-15 Tianyu Wang , Lin F. Yang

Let n be an odd number and F an imaginary quadratic field with odd discriminant. We show that there exists infinitely many cubic fields K such that the class number of K is divisible by n and the Galois closure of K contains F.

Number Theory · Mathematics 2007-05-23 Ivan Chipchakov , Kalin Kostadinov

We give practical algorithms for computing the divisor class group and the gonality of a curve over a finite field, achieving several orders of magnitude speedup over existing methods for sufficiently large genus or residue field. The…

Number Theory · Mathematics 2026-02-20 Maarten Derickx , Kenji Terao

Quadratic Unconstrained Binary Optimization (QUBO) is a broad class of optimization problems with many practical applications. To solve its hard instances in an exact way, known classical algorithms require exponential time and several…

Quantum Physics · Physics 2021-01-21 Gian Giacomo Guerreschi

Let p denote an odd prime. For all p-admissible conductors c over a quadratic number field \(K=\mathbb{Q}(\sqrt{d})\), p-ring spaces \(V_p(c)\) modulo c are introduced by defining a morphism \(\psi:\,f\mapsto V_p(f)\) from the divisor…

Number Theory · Mathematics 2014-03-18 Daniel C. Mayer

We present a new method for constructing genus 2 curves over a finite field with a given number of points on its Jacobian. This method has important applications in cryptography, where groups of prime order are used as the basis for…

Number Theory · Mathematics 2007-05-23 Kirsten Eisentraeger , Kristin Lauter

Direct policy gradient methods for reinforcement learning and continuous control problems are a popular approach for a variety of reasons: 1) they are easy to implement without explicit knowledge of the underlying model 2) they are an…

Machine Learning · Computer Science 2019-03-26 Maryam Fazel , Rong Ge , Sham M. Kakade , Mehran Mesbahi

We generalize an algorithm established in earlier work \cite{algebrapaper} to compute finitely many generators for a subgroup of finite index of an arithmetic group acting properly discontinuously on hyperbolic space of dimension $2$ and…

Group Theory · Mathematics 2020-02-03 Ann Kiefer

We compute the class of arithmetic genus two Teichmueller curves in the Picard group of pseudo-Hilbert modular surfaces, distinguished according to their torsion order and spin invariant. As an application, we compute the number of genus…

Algebraic Geometry · Mathematics 2015-04-03 André Kappes , Martin Moeller

We analyse the complexity of the computation of the class group structure, regulator, and a system of fundamental units of a certain class of number fields. Our approach differs from Buchmann's, who proved a complexity bound of L(1/2,O(1))…

Cryptography and Security · Computer Science 2009-12-11 Jean-François Biasse

This paper is about certain string-to-string functions, called the polyregular functions. These are like the regular string-to-string functions, except that they can have polynomial (and not just linear) growth. The class has four…

Formal Languages and Automata Theory · Computer Science 2018-10-23 Mikołaj Bojańczyk