EuDML | Browse

Displaying 21 – 26 of 26

Corps quadratiques, $G L_{2} (𝐙)$ et polynômes de Dickson

Michel Kervaire (1996)

Annales de l'institut Fourier

On caractérise les puissances $n$ -ièmes dans un corps quadratique réel et dans $G L_{2} (Z)$ à l’aide des polynômes de Dickson. Ces mêmes polynômes sont utilisés pour obtenir des renseignements sur l’indice du groupe des unités d’un ordre non-maximal dans le groupe de toutes les unités d’un corps quadratique réel. Le texte est détaillé et élémentaire.

Counting Maximal Distance-Independent Sets in Grid Graphs

Reinhardt Euler, Paweł Oleksik, Zdzisław Skupień (2013)

Discussiones Mathematicae Graph Theory

Previous work on counting maximal independent sets for paths and certain 2-dimensional grids is extended in two directions: 3-dimensional grid graphs are included and, for some/any ℓ ∈ N, maximal distance-ℓ independent (or simply: maximal ℓ-independent) sets are counted for some grids. The transfer matrix method has been adapted and successfully applied

Displaying 21 – 26 of 26

Corps quadratiques, $G L_{2} (𝐙)$ et polynômes de Dickson

Counting Maximal Distance-Independent Sets in Grid Graphs

Counting pattern-free set partitions. II: Noncrossing and other hypergraphs.

Covering systems, Kubert identities and difference equations

Covering the integers by arithmetic sequences

Cyclotomic polynomials with large coefficients

Currently displaying 21 – 26 of 26

Displaying 21 – 26 of 26

Corps quadratiques, G L 2 ( 𝐙 ) et polynômes de Dickson

Counting Maximal Distance-Independent Sets in Grid Graphs

Counting pattern-free set partitions. II: Noncrossing and other hypergraphs.

Covering systems, Kubert identities and difference equations

Covering the integers by arithmetic sequences

Cyclotomic polynomials with large coefficients

Currently displaying 21 – 26 of 26

Corps quadratiques, $G L_{2} (𝐙)$ et polynômes de Dickson