EuDML | Browse

The search session has expired. Please query the service again.

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Displaying 81 – 100 of 1970

A classification of the extensions of degree $p^{2}$ over $ℚ_{p}$ whose normal closure is a $p$ -extension

Luca Caputo (2007)

Journal de Théorie des Nombres de Bordeaux

Let $k$ be a finite extension of $ℚ_{p}$ and $ℰ_{k}$ be the set of the extensions of degree $p^{2}$ over $k$ whose normal closure is a $p$ -extension. For a fixed discriminant, we show how many extensions there are in $ℰ_{ℚ_{p}}$ with such discriminant, and we give the discriminant and the Galois group (together with its filtration of the ramification groups) of their normal closure. We show how this method can be generalized to get a classification of the extensions in $ℰ_{k}$ .

A closer look at lattice points in rational simplices.

Beck, Matthias (1999)

The Electronic Journal of Combinatorics [electronic only]

A closer look at some new identities.

Campbell, Geoffrey B. (1998)

International Journal of Mathematics and Mathematical Sciences

A combinatorial approach to hyperharmonic numbers.

Benjamin, Arthur T., Gaebler, David, Gaebler, Robert (2003)

Integers

A combinatorial approach to partitions with parts in the gaps

Dennis Eichhorn (1998)

Acta Arithmetica

Many links exist between ordinary partitions and partitions with parts in the “gaps”. In this paper, we explore combinatorial explanations for some of these links, along with some natural generalizations. In particular, if we let $p_{k, m} (j, n)$ be the number of partitions of n into j parts where each part is ≡ k (mod m), 1 ≤ k ≤ m, and we let $p *_{k, m} (j, n)$ be the number of partitions of n into j parts where each part is ≡ k (mod m) with parts of size k in the gaps, then $p *_{k, m} (j, n) = p_{k, m} (j, n)$ .

A combinatorial class number formula.

J. Brzezinski (1989)

Journal für die reine und angewandte Mathematik

A combinatorial identity arising from cobordism theory.

Gijswijt, D., Moree, P. (2005)

Acta Mathematica Universitatis Comenianae. New Series

A combinatorial interpretation for a super-Catalan recurrence.

Callan, David (2005)

Journal of Integer Sequences [electronic only]

A combinatorial interpretation for certain relatives of the Conolly sequence.

Balamohan, B., Li, Zhiqiang, Tanny, Stephen (2008)

Journal of Integer Sequences [electronic only]

A combinatorial interpretation of Serre's conjecture on modular Galois representations

Adriaan Herremans (2003)

Annales de l’institut Fourier

We state a conjecture concerning modular absolutely irreducible odd 2-dimensional representations of the absolute Galois group over finite fields which is purely combinatorial (without using modular forms) and proof that it is equivalent to Serre’s strong conjecture. The main idea is to replace modular forms with coefficients in a finite field of characteristic $p$ , by their counterparts in the theory of modular symbols.

A common combinatorial principle underlies Riemann's formula, the Chebyshev phenomenon, and other subtle effects in comparative prime number theory. I.

Richard H. Hudson (1980)

Journal für die reine und angewandte Mathematik

A common generalization of binomial coefficients, Stirling numbers and Gaussian Coefficientes

Voigt, B. (1984)

Proceedings of the 11th Winter School on Abstract Analysis

A common generalization of some identities.

Zhang, Zhizheng, Wang, Jun (2005)

Integers

Currently displaying 81 – 100 of 1970

Previous Page 5 Next

Displaying 81 – 100 of 1970

A classification of the extensions of degree $p^{2}$ over $ℚ_{p}$ whose normal closure is a $p$ -extension

A closer look at lattice points in rational simplices.

A closer look at some new identities.

A combinatorial approach to hyperharmonic numbers.

A combinatorial approach to partitions with parts in the gaps

A combinatorial class number formula.

A combinatorial identity arising from cobordism theory.

A combinatorial interpretation for a super-Catalan recurrence.

A combinatorial interpretation for certain relatives of the Conolly sequence.

A combinatorial interpretation of Serre's conjecture on modular Galois representations

A combinatorial interpretation of the eigensequence for composition.

A combinatorial interpretation of the poly-Bernoulli numbers and two Fermat analogues.

A combinatorial method for construction normal numbers.

A combinatorial proof of a result from number theory.

A combinatorial proof of Andrews' smallest parts partition function.

A combinatorial proof of Sun's “curious” identity.

A combinatorial proof of the sum of $q$ -cubes.

A common combinatorial principle underlies Riemann's formula, the Chebyshev phenomenon, and other subtle effects in comparative prime number theory. I.

A common generalization of binomial coefficients, Stirling numbers and Gaussian Coefficientes

A common generalization of some identities.

Currently displaying 81 – 100 of 1970