Displaying 1661 – 1680 of 3014

Showing per page

On the composition of the Euler function and the sum of divisors function

Jean-Marie De Koninck, Florian Luca (2007)

Colloquium Mathematicae

Let H(n) = σ(ϕ(n))/ϕ(σ(n)), where ϕ(n) is Euler's function and σ(n) stands for the sum of the positive divisors of n. We obtain the maximal and minimal orders of H(n) as well as its average order, and we also prove two density theorems. In particular, we answer a question raised by Golomb.

On the compositum of all degree d extensions of a number field

Itamar Gal, Robert Grizzard (2014)

Journal de Théorie des Nombres de Bordeaux

We study the compositum k [ d ] of all degree d extensions of a number field k in a fixed algebraic closure. We show k [ d ] contains all subextensions of degree less than d if and only if d 4 . We prove that for d > 2 there is no bound c = c ( d ) on the degree of elements required to generate finite subextensions of k [ d ] / k . Restricting to Galois subextensions, we prove such a bound does not exist under certain conditions on divisors of d , but that one can take c = d when d is prime. This question was inspired by work of Bombieri and...

On the computation of Hermite-Humbert constants for real quadratic number fields

Michael E. Pohst, Marcus Wagner (2005)

Journal de Théorie des Nombres de Bordeaux

We present algorithms for the computation of extreme binary Humbert forms in real quadratic number fields. With these algorithms we are able to compute extreme Humbert forms for the number fields ( 13 ) and ( 17 ) . Finally we compute the Hermite-Humbert constant for the number field ( 13 ) .

On the computation of quadratic 2 -class groups

Wieb Bosma, Peter Stevenhagen (1996)

Journal de théorie des nombres de Bordeaux

We describe an algorithm due to Gauss, Shanks and Lagarias that, given a non-square integer D 0 , 1 mod 4 and the factorization of D , computes the structure of the 2 -Sylow subgroup of the class group of the quadratic order of discriminant D in random polynomial time in log D .

On the concentration of certain additive functions

Dimitris Koukoulopoulos (2014)

Acta Arithmetica

We study the concentration of the distribution of an additive function f when the sequence of prime values of f decays fast and has good spacing properties. In particular, we prove a conjecture by Erdős and Kátai on the concentration of f ( n ) = p | n ( l o g p ) - c when c > 1.

On the conductor formula of Bloch

Kazuya Kato, Takeshi Saito (2004)

Publications Mathématiques de l'IHÉS

In [6], S. Bloch conjectures a formula for the Artin conductor of the ℓ-adic etale cohomology of a regular model of a variety over a local field and proves it for a curve. The formula, which we call the conductor formula of Bloch, enables us to compute the conductor that measures the wild ramification by using the sheaf of differential 1-forms. In this paper, we prove the formula in arbitrary dimension under the assumption that the reduced closed fiber has normal crossings.

Currently displaying 1661 – 1680 of 3014