Hadamard matrices of order 28m, 36m and 44m

We show that if four suitable matrices of order m exist then there are Hadamard matrices of order 28m, 36m, and 44m. In particular we show that Hadamard matrices of orders 14(q + 1), 18(q + 1), and 22(q + 1) exist when q is a prime power and q ≡ 1 (mod 4).Also we show that if n is the order of a conference matrix there is an Hadamard matrix of order 4mn.As a consequence there are Hadamard matrices of the following orders less than 4000: 476, 532, 836, 1036, 1012, 1100, 1148, 1276, 1364, 1372, 1476, 1672, 1836, 2024, 2052, 2156, 2212, 2380, 2484, 2508, 2548, 2716, 3036, 3476, 3892.All these orders seem to be new.     

The number of K m,m -free graphs

A graph is called H-free if it contains no copy of H. Denote by f _n (H) the number of (labeled) H-free graphs on n vertices. Erdős conjectured that f _n (H) ≤ 2^{(1+o(1))ex(n,H)}. This was first shown to be true for cliques; then, Erdős, Frankl, and R?dl proved it for all graphs H with χ(H)≥3. For most bipartite H, the question is still wide open, and even the correct order of magnitude of log₂ f _n (H) is not known. We prove that f _n (K _m,m ) ≤ 2 ^O (n ^2−1/m ) for every m, extending the result of Kleitman and Winston and answering a question of Erdős. This bound is asymptotically sharp for m∈{2,3}, and possibly for all other values of m, for which the order of ex(n,K _m,m ) is conjectured to be Θ(n ^2−1/m ). Our method also yields a bound on the number of K _m,m -free graphs with fixed order and size, extending the result of Füredi. Using this bound, we prove a relaxed version of a conjecture due to Haxell, Kohayakawa, and Łuczak and show that almost all K _3,3-free graphs of order n have more than 1/20·ex(n,K _3,3) edges.     

The characterization of totally geodesic submanifolds ofS m andCP m

We prove a theorem on ruled surfaces that generalizes a theorem of Ferus on totally geodesic foliations. On the basis of this theorem we obtain criteria for totally geodesic submanifolds ofS ^m andCP ^m that generalize and complement certain results of Borisenko, Ferus, and Abe. We give an application to the geodesic differential forms defined by Dombrowski in the case of submanifolds ofS ^m andCP ^m.Translated from Ukrainskií Geometricheskií Sbornik, Issue 28, 1985, pp. 106–116.The author is grateful to V. A. Toponogov for posing this problem and for attention to the work and to A. A. Borisenko for helpful criticisms.     

New Kloosterman sums identities over F2m for all m

Recently, Shin and Sung found new identities for Kloosterman sums over F_2^m with odd m. They posed the question whether similar results could be obtained for even m. In this paper, we will give a positive answer to this question. We will present new results that hold for any m and include as special cases the results of Shin and Sung in the case where m is odd.     

On Remez-type inequalities for polynomials in R m and C m

Remez-type inequalities provide estimates for the size of polynomials on given sets KR ^m (or C ^m ) when the magnitude of polynomials on largeldquo subsets of K is known. We shall study this question on smooth sets K in R ^m and C ^m and show how the smoothness of K effects the estimates.     

2m-Cycle Systems of K 2m+1\C m

For all m ≥ 3 the edges of complete graph on 2m + 1 vertices can he partitioned into m 2m-cycles and an m-cycle.     

Gauss-Runge-Kutta-Nyström methods

Symplectic Runge-Kutta-Nyström methods are frequently used to integrate secondorder systems of the special formÿ=f(y), where the functionf is the gradient of a scalar field multiplied by a regular matrix. In this paper Gauss-Runge-Kutta-Nyström methods, i.e., methods of the highest order, are discussed. It is proved that these methods are always symmetric and that symmetry is equivalent to symplecticness. Furthermore, it is shown that for each stage number the symplectic Gauss-Runge-Kutta-Nyström methods are given by a family of methods with one free parameter.     

Quasi-ALE Metrics with Holonomy SU(m) and Sp(m)

Let G be a finite subgroup of U(m),and X a resolution of ^m /G. We define aspecial class of Kähler metrics g on Xcalled Quasi Asymptotically Locally Euclidean (QALE) metrics. Thesesatisfy a complicated asymptotic condition, implying that gis asymptotic to the Euclidean metric on ^m /G away fromits singular set. When ^m /Ghas an isolated singularity,QALE metrics are just ALE metrics. Our main result is an existencetheorem for Ricci-flat QALE Kähler metrics: if G is afinite subgroup of SU(m) and X a crepant resolution of ^m /G, then there is a unique Ricci-flat QALE Kähler metric on X in each Kähler class.This is proved using a version of the Calabi conjecture for QALEmanifolds. We also determine the holonomy group of the metrics in termsof G.     

Intrinsic normalizations of seminonholonomic complexes SNGr(m,n, (m+1) (n−m)−ϱ)

V. Kapsukas Vilnius State University. Translated from Litovskii Matematicheskii Sbornik (Lietuvos Matematikos Rinkinys), Vol. 28, No. 2, pp. 299–314, April–June, 1988.     

Hall Polynomials for Affine Quivers of Type Am（m≥1）

It is well known that Hall polynomials as structural coefficients play an important role in the structure of Lie algebras and quantum groups. By using the properties of representation categories of affine quivers, the task of computing Hall polynomials for affine quivers can be reduced to counting the numbers of solutions of some matrix equations. This method has been applied to obtain Hall polynomials for indecomposable representations of quivers of type Am（m≥1）     

Nearest q-Flat to m Points

Recently, Bradley and Mangasarian studied the problem of finding the nearest plane to m given points in ⁿ in the least square sense. They showed that the problem reduces to finding the least eigenvalue and associated eigenvector of a certain n×n symmetric positive-semidefinite matrix. We extend this result to the general problem of finding the nearest q-flat to m points, with 0qn–1.     

环F2m+uF2m+u2F2m+u3F2m上线性码及其对偶码的Gray像

本文研究了环F2m+uF2m+u2 Fm+u3F2m上线性码.利用环是Frobenius环,证明了环上线性码C及其自对偶码的Gray像为F2m上的线性码和自对偶码.同时,给出了上循环码C的Gray像ψ(C)为F2m上的拟循环码.     

Tribonacci partition formulas modulo m

Each Tribonacci sequence starting with an arbitrary triple of integers is periodic modulo m for any modulus m 〉 1. For a given m, the mapping between the set S of all m^3 triples of initial values and the set of their coresponding periods define a partition of the set S. In this paper we shall investigate some basic questions related to these partitions from the point of view of enumerative combinatorics.