Results 11 to 20 of about 15,508 (120)
Galois representations and Galois groups over Q [PDF]
, 2014 In this paper we generalize results of P. Le Duff to genus n hyperelliptic curves. More precisely, let C/Q be a hyperelliptic genus n curve and let J(C) be the associated Jacobian variety.
Arias-de-Reyna, Sara +5 more
core +5 more sources
Fields of moduli of three-point G-covers with cyclic p-Sylow, I [PDF]
, 2011 We examine in detail the stable reduction of Galois covers of the projective line over a complete discrete valuation field of mixed characteristic (0, p), where G has a cyclic p-Sylow subgroup of order p^n. If G is further assumed to be p-solvable (i.e.,
Obus, Andrew
core +3 more sources
The Semisimplicity Conjecture for A-Motives
, 2008 We prove the semisimplicity conjecture for A-motives over finitely generated fields K. This conjecture states that the rational Tate modules V_p(M) of a semisimple A-motive M are semisimple as representations of the absolute Galois group of K.
Bourbaki +5 more
core +1 more source
Curves, dynamical systems and weighted point counting [PDF]
, 2012 Suppose X is a (smooth projective irreducible algebraic) curve over a finite field k. Counting the number of points on X over all finite field extensions of k will not determine the curve uniquely. Actually, a famous theorem of Tate implies that two such
Cornelissen, Gunther
core +1 more source
On the Surjectivity of Galois Representations Associated to Elliptic Curves over Number Fields
, 2012 Given an elliptic curve $E$ over a number field $K$, the $\ell$-torsion points $E[\ell]$ of $E$ define a Galois representation $\gal(\bar{K}/K) \to \gl_2(\ff_\ell)$. A famous theorem of Serre states that as long as $E$ has no Complex Multiplication (CM),
Larson, Eric, Vaintrob, Dmitry
core +1 more source
, 2020 The problem of computing \emph{the exponent lattice} which consists of all the multiplicative relations between the roots of a univariate polynomial has drawn much attention in the field of computer algebra.
AJ van der Poorten +18 more
core +1 more source
A Reduction Method for Higher Order Variational Equations of Hamiltonian Systems [PDF]
, 2011 Let $\mathbf{k}$ be a differential field and let $[A]\,:\,Y'=A\,Y$ be a linear differential system where $A\in\mathrm{Mat}(n\,,\,\mathbf{k})$. We say that $A$ is in a reduced form if $A\in\mathfrak{g}(\bar{\mathbf{k}})$ where $\mathfrak{g}$ is the Lie ...
Aparicio, Ainhoa, Weil, Jacques-Arthur
core +2 more sources
Hermitian Dickson Dualities for Codes over Near-Fields
MathematicsA Dickson near-field is obtained from Fp2 by twisting multiplication so that distributivity holds only on the right. In this work, we develop a basic theory of right-linear codes of length n over NF(p2).
Altaf Alshuhail, Fozaiyah A. Al-hubairah
doaj +1 more source
Finding Minimum‐Cost Explanations for Predictions Made by Tree Ensembles
Software: Practice and Experience, EarlyView.ABSTRACT The ability to reliably explain why a machine learning model arrives at a particular prediction is crucial when used as decision support by human operators of critical systems. The provided explanations must be provably correct, and preferably without redundant information, called minimal explanations.
John Törnblom +2 more
wiley +1 more source
Approximate computations with modular curves
, 2012 This article gives an introduction for mathematicians interested in numerical computations in algebraic geometry and number theory to some recent progress in algorithmic number theory, emphasising the key role of approximate computations with modular ...
Couveignes, Jean-Marc, Edixhoven, Bas
core +4 more sources