Abbildung derM 6 2 desR 7 auf Punktreihen eines linearen Komplexes

Ohne Zusammenfassung     

Permutation polynomials of degree 6 or 7 over finite fields of characteristic 2

In Dickson (1896–1897) [2], the author listed all permutation polynomials up to degree 5 over an arbitrary finite field, and all permutation polynomials of degree 6 over finite fields of odd characteristic. The classification of degree 6 permutation polynomials over finite fields of characteristic 2 was left incomplete. In this paper we complete the classification of permutation polynomials of degree 6 over finite fields of characteristic 2. In addition, all permutation polynomials of degree 7 over finite fields of characteristic 2 are classified.     

Class number 5, 6 and 7

We outline the determination of all imaginary quadratic fields with class number 5, 6 or 7.

     

A characterization of Inoue surfaces with $$p_g=0$$ and $$K^2=7$$K2=7

Inoue constructed the first examples of smooth minimal complex surfaces of general type with \(p_g=0\) and \(K^2=7\). These surfaces are finite Galois covers of the 4-nodal cubic surface with the Galois group, the Klein group \(\mathbb {Z}_2\times \mathbb {Z}_2\). For such a surface S, the bicanonical map of S has degree 2 and it is composed with exactly one involution in the Galois group. The divisorial part of the fixed locus of this involution consists of two irreducible components: one is a genus 3 curve with self-intersection number 0 and the other is a genus 2 curve with self-intersection number \(-\,1\). Conversely, assume that S is a smooth minimal complex surface of general type with \(p_g=0\), \(K^2=7\) and having an involution \(\sigma \). We show that, if the divisorial part of the fixed locus of \(\sigma \) consists of two irreducible components \(R_1\) and \(R_2\), with \(g(R_1)=3, R_1^2=0, g(R_2)=2\) and \(R_2^2=-\,1\), then the Klein group \(\mathbb {Z}_2\times \mathbb {Z}_2\) acts faithfully on S and S is indeed an Inoue surface.     

ExtensionsQ-régulières deQ(t) de groupe de Galois 6.A 6 et 6.A 7

We prove that 6A ₆ and 6A ₇ are Galois groups of regular extensions ofQ(t), therefore of infinitely many extensions ofQ.      

A New Functor from E 6-mod to E 7-mod

We find a new representation of the simple Lie algebra of type E ₇ on the polynomial algebra in 27 variables. Using this representation and Shen's idea of mixed product, we construct a new functor from E ₆-Mod to E ₇-Mod. A condition for the functor to map a finite-dimensional irreducible E ₆-module to an infinite-dimensional irreducible E ₇-module is obtained. Our general framework also gives a direct polynomial extension from irreducible E ₆-modules to irreducible E ₇-modules, which can be used to derive Gel'fand–Zetlin bases for E ₇ from those for E ₆ that can be obtained from those for D ₅ according to our earlier work.     

The smallest graph of girth 6 and valency 7

With the aid of a computer. we give a regular graph of girth 6 and valency 7, which has 90 vertices and show that this is the unique smallest graph with these properties.     

Whitney Interpolation Constants Bounded by 2 for k = 5, 6, 7

Let f C[0, 1], k = 5, 6, 7. We prove that if f(i/(k – 1)) = 0, i = 0, 1,..., k – 1, then      

On groups whose element orders divide 6 and 7

We prove that a group whose element orders divide 6 and 7 either is locally finite or an extension of a nontrivial elementary abelian 2-group by a group without involutions.     

2类6点7边图的$\lambda$-填充与$\lambda$-覆盖

A maximum （v, G, λ）-PD and a minimum （v, G, λ）-CD axe studied for 2 graphs of 6 vertices and 7 edges. By means of ＂difference method＂ and ＂holey graph design＂, we obtain the result： there exists a （v, Gi, λ）-OPD （OCD） for v ≡ 2, 3, 4, 5, 6 （mod 7）, λ ≥ 1, i = 1, 2.     

一个六点七边图的填充与覆盖

$\lambda{K_v}$为$\lambda$重$v$点完全图, $G$ 为有限简单图. $\lambda {K_v}$ 的一个 $G$-设计 ( $G$-填充设计, $G$-覆盖设计), 记为 ($v,G,\lambda$)-$GD$(($v,G,\lambda$)-$PD$, ($v,G,\lambda$)-$CD$), 是指一个序偶($X,\calB$)，其中 $X$ 为 ${K_v}$ 的顶点集， $\cal B$ 为 ${K_v}$ 中同构于 $G$的子图的集合, 称为区组集,使得 ${K_v     

A fast $$(2 + \frac{2}{7})$$ ( 2 + 2 7 ) -approximation algorithm for capacitated cycle covering

Mathematical Programming - We consider the capacitated cycle covering problem: given an undirected, complete graph G with metric edge lengths and demands on the vertices, we want to cover the...     

Trees of Diameter 6 and 7 with Minimum Number of Independent Sets

Mathematical Notes - We consider the problem of describing $$n$$ -vertex trees of diameter $$d$$ containing as few independent sets as possible. This problem is solved for $$d=6$$ and...     

Anharmonicity factors and potential energy constants of B2H6 and B2D6

The anharmonicity factors of B₂H₆ and B₂D₆ have been calculated using Dennison’s method. Using the calculated harmonic wave numbers, the valence force constants have been obtained by the Wilson’s F-G matrix method.     

The domination numbers of the 5 × n and 6 × n grid graphs

The k × n grid graph is the product P_k × P_n of a path of length k ? 1 and a path of length n ? 1. We prove here formulas found by E. O. Hare for the domination numbers of P₅ × P_n and P₆ × P_n. © 1993 John Wiley & Sons, Inc.