Displaying 561 – 580 of 3014

Showing per page

On coefficient valuations of Eisenstein polynomials

Matthias Künzer, Eduard Wirsing (2005)

Journal de Théorie des Nombres de Bordeaux

Let p 3 be a prime, let n > m 1 . Let π n be the norm of ζ p n - 1 under C p - 1 , so that ( p ) [ π n ] | ( p ) is a purely ramified extension of discrete valuation rings of degree p n - 1 . The minimal polynomial of π n over ( π m ) is an Eisenstein polynomial; we give lower bounds for its coefficient valuations at π m . The function field analogue, as introduced by Carlitz and Hayes, is studied as well.

On cohomological systems of Galois representations

Wojciech Gajda, Sebastian Petersen (2016)

Banach Center Publications

The paper contains an expanded version of the talk delivered by the first author during the conference ALANT3 in Będlewo in June 2014. We survey recent results on independence of systems of Galois representations attached to ℓ-adic cohomology of schemes. Some other topics ranging from the Mumford-Tate conjecture and the Geyer-Jarden conjecture to applications of geometric class field theory are also considered. In addition, we have highlighted a variety of open questions which can lead to interesting...

On component groups of Jacobians of Drinfeld modular curves

Mihran Papikian (2004)

Annales de l'Institut Fourier

Let J 0 ( 𝔫 ) be the Jacobian variety of the Drinfeld modular curve X 0 ( 𝔫 ) over 𝔽 q ( t ) , where 𝔫 is an ideal in 𝔽 q [ t ] . Let 0 B J 0 ( 𝔫 ) A 0 be an exact sequence of abelian varieties. Assume B , as a subvariety of J 0 ( 𝔫 ) , is stable under the action of the Hecke algebra 𝕋 End ( J 0 ( 𝔫 ) ) . We give a criterion which is sufficient for the exactness of the induced sequence of component groups 0 Φ B , Φ J , Φ A , 0 of the Néron models of these abelian varieties over 𝔽 q [ [ 1 t ] ] . This criterion is always satisfied when either A or B is one-dimensional. Moreover, we prove that the sequence...

On computations with integer division

Bettina Just, Friedhelm Meyer auf der Heide, Avi Wigderson (1989)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

On computing Belyi maps

J. Sijsling, J. Voight (2014)

Publications mathématiques de Besançon

We survey methods to compute three-point branched covers of the projective line, also known as Belyĭ maps. These methods include a direct approach, involving the solution of a system of polynomial equations, as well as complex analytic methods, modular forms methods, and p -adic methods. Along the way, we pose several questions and provide numerous examples.

On computing quaternion quotient graphs for function fields

Gebhard Böckle, Ralf Butenuth (2012)

Journal de Théorie des Nombres de Bordeaux

Let Λ be a maximal 𝔽 q [ T ] -order in a division quaternion algebra over 𝔽 q ( T ) which is split at the place . The present article gives an algorithm to compute a fundamental domain for the action of the group of units Λ * on the Bruhat-Tits tree 𝒯 associated to PGL 2 ( 𝔽 q ( ( 1 / T ) ) ) . This action is a function field analog of the action of a co-compact Fuchsian group on the upper half plane. The algorithm also yields an explicit presentation of the group Λ * in terms of generators and relations. Moreover we determine an upper bound...

On computing subfields. A detailed description of the algorithm

Jürgen Klüners (1998)

Journal de théorie des nombres de Bordeaux

Let ( α ) be an algebraic number field given by the minimal polynomial f of α . We want to determine all subfields ( β ) ( α ) of given degree. It is convenient to describe each subfield by a pair ( g , h ) [ t ] × [ t ] such that g is the minimal polynomial of β = h ( α ) . There is a bijection between the block systems of the Galois group of f and the subfields of ( α ) . These block systems are computed using cyclic subgroups of the Galois group which we get from the Dedekind criterion. When a block system is known we compute the corresponding...

On conditional independence and log-convexity

František Matúš (2012)

Annales de l'I.H.P. Probabilités et statistiques

If conditional independence constraints define a family of positive distributions that is log-convex then this family turns out to be a Markov model over an undirected graph. This is proved for the distributions on products of finite sets and for the regular Gaussian ones. As a consequence, the assertion known as Brook factorization theorem, Hammersley–Clifford theorem or Gibbs–Markov equivalence is obtained.

Currently displaying 561 – 580 of 3014