Classification of 9-dimensional trilinear alternating forms over GF(2)

Let V be a finite-dimensional vector space over a finite field and let f be a trilinear alternating form over V. For such forms, we introduce two new invariants. Together with a generalized radical polynomial used for classification of forms in dimension 8 over GF(2), they are sufficient to distinguish between all trilinear alternating forms in dimension 9 over GF(2). To prove the completeness of the list of forms, we computed their groups of automorphisms. There are 31 degenerate and 317 nondegenerate forms. We point out some forms with either small or large automorphism group.     

Classification of 8-Dimensional Trilinear Alternating Forms over GF(2)

Let V be an n-dimensional vector space over a finite field and let f be a trilinear alternating form over V. For such forms we introduce a new invariant called radical polynomial and investigate its behaviour, in particular in the case of the 2-element field. We show that it is compatible with direct products of forms and how it is related to its values on dimension n ? 1. Moreover, it turns out that it is full up to dimension 7. On the other hand, on higher dimensions it is no more full and it is necessary to generalize it to obtain (using computer) a classification of forms on dimension 8 over the 2-element field. This classification is provided, together with the sizes of stabilizers of the corresponding forms.     

Nombre De Facteurs Absolument Irréductibles D'un Polynôme

Dans cette note, nous établissons le lien entre le nombre de facteurs absolument irréductibles d'un polynôme et la dimension d'un espace vectoriel de formes différentielles fermées. Notre résultat généralise un théorème de Gao.

In this note, we establish the relationship between the number of absolutely irreducible factors of a polynomial and the dimension of a space of closed differentials forms. Our result generalizes a theorem of Gao.     

Stiefel–Whitney invariants for bilinear forms

We examine potential extensions of the Stiefel–Whitney invariants from quadratic forms to bilinear forms which are not necessarily symmetric. We show that as long as the symbolic nature of the invariants is maintained, some natural extensions carry only low dimensional information. In particular, the generic invariant on upper triangular matrices is equivalent to the dimension and determinant. Along the process, we show that every non-alternating matrix is congruent to an upper triangular matrix, and prove a version of Witt?s Chain Lemma for upper-triangular bases. (The classical lemma holds for orthogonal bases.)     

The Computational Complexity of the Chow Form

We present a bounded probability algorithm for the computation of the Chowforms of the equidimensional components of an algebraic variety. In particular, this gives an alternative procedure for the effective equidimensional decomposition of the variety, since each equidimensional component is characterized by its Chow form. The expected complexity of the algorithm is polynomial in the size and the geometric degree of the input equation system defining the variety. Hence it improves (or meets in some special cases) the complexity of all previous algorithms for computing Chow forms. In addition to this, we clarify the probability and uniformity aspects, which constitutes a further contribution of the paper. The algorithm is based on elimination theory techniques, in line with the geometric resolution algorithm due to M. Giusti, J. Heintz, L. M. Pardo, and their collaborators. In fact, ours can be considered as an extension of their algorithm for zero-dimensional systems to the case of positive-dimensional varieties. The key element for dealing with positive-dimensional varieties is a new Poisson-type product formula. This formula allows us to compute the Chow form of an equidimensional variety from a suitable zero-dimensional fiber. As an application, we obtain an algorithm to compute a subclass of sparse resultants, whose complexity is polynomial in the dimension and the volume of the input set of exponents. As another application, we derive an algorithm for the computation of the (unique) solution of a generic overdetermined polynomial equation system.     

Symmetry breaking of systems of linear second-order ordinary differential equations with constant coefficients

We show that the structure of the Lie symmetry algebra of a system of n linear second-order ordinary differential equations with constant coefficients depends on at most n-1 parameters. The tools used are Jordan canonical forms and appropriate scaling transformations. We put our approach to test by presenting a simple proof of the fact that the dimension of the symmetry Lie algebra of a system of two linear second-order ordinary differential with constant coefficients is either 7, 8 or 15. Also, we establish for the first time that the dimension of the symmetry Lie algebra of a system of three linear second-order ordinary differential equations with constant coefficients is 10, 12, 13 or 24.     

Dimension formula of cusp form spaces on half-spaces of quaternions

A dimension formula for the spaces of cusp forms defined on quatemionic half-spacea of degree two is obtained by Selberg trace formula, and the contributions of some conjugacy classes are calculated. Some results on the classification of the conjugacy classes of modular group are obtained.     

线性规划问题的规范型算法

提出了线性规划问题的两种规范标准形式；证明了任意一个线性规划问题都可化为这两种形式之一；给出了不需引入人工变量的线性规划问题的求解算法。     

Hypernormal form theory: foundations and algorithms

Hypernormal forms (unique normal forms, simplest normal forms) are investigated both from the standpoint of foundational theory and algorithms suitable for use with computer algebra. The Baider theory of the Campbell-Hausdorff group is refined, by a study of its subgroups, to determine the smallest substages into which the hypernormalization process can be divided. This leads to a linear algebra algorithm to compute the generators needed for each substage with the least amount of work. A concrete interpretation of Jan Sanders’ spectral sequence for hypernormal forms is presented. Examples are given, and a proof is given for a little-known theorem of Belitskii expressing the hypernormal form space (in the inner product style) as the kernel of a higher-order differential operator.     

Quadratic forms and Pfister neighbors in characteristic 2

We study Pfister neighbors and their characterization over fields of characteristic , where we include the case of singular forms. We give a somewhat simplified proof of a theorem of Fitzgerald which provides a criterion for when a nonsingular quadratic form is similar to a Pfister form in terms of the hyperbolicity of this form over the function field of a form which is dominated by . From this, we derive an analogue in characteristic of a result by Knebusch saying that, in characteristic , a form is a Pfister neighbor if its anisotropic part over its own function field is defined over the base field. Our result includes certain cases of singular forms, but we also give examples which show that Knebusch's result generally fails in characteristic for singular forms. As an application, we characterize certain forms of height in the sense of Knebusch whose quasi-linear parts are of small dimension. We also develop some of the basics of a theory of totally singular quadratic forms. This is used to give a new interpretation of the notion of the height of a standard splitting tower as introduced by the second author in an earlier paper.

     

矩阵对的相似标准形

设A,B,C,D都是n阶方阵,矩阵对(A,B)相似于矩阵对(C,D),如果存在n阶可逆矩阵P,使得P-1AP=C,P-1BP=D.本文借助Belitskii约化算法,提供一种在相似变化下化任一n阶矩阵对为标准形的有效方法,该方法可以看作Jordan标准形的推广.     

A rank-one algorithm for unconstrained function minimization

A rank-one algorithm is presented for unconstrained function minimization. The algorithm is a modified version of Davidon's variance algorithm and incorporates a limited line search. It is shown that the algorithm is a descent algorithm; for quadratic forms, it exhibits finite convergence, in certain cases. Numerical studies indicate that it is considerably superior to both the Davidon-Fletcher-Powell algorithm and the conjugate-gradient algorithm.     

An Arbitrary Starting Variable Dimension Algorithm for Computing an Integer Point of a Simplex

An arbitrary starting variable dimension algorithm is proposed to compute an integer point of an n-dimensional simplex. It is based on an integer labeling rule and a triangulation of Rⁿ. The algorithm consists of two interchanging phases. The first phase of the algorithm is a variable dimension algorithm, which generates simplices of varying dimensions,and the second phase of the algorithm forms a full-dimensional pivoting procedure, which generates n-dimensional simplices. The algorithm varies from one phase to the other. When the matrix defining the simplex is in the so-called canonical form, starting at an arbitrary integer point, the algorithm within a finite number of iterations either yields an integer point of the simplex or proves that no such point exists.     

AN ALGORITHM FOR JORDAN CANONICAL FORM OF A QUATERNION MATRIX

In this paper, we first introduce a concept of companion vector, and study the Jordan canonical forms of quaternion matrices by using the methods of complex rep resentation and companion vector, not only give out a practical algorithm for Jordan canonical form J of a quaternion matrix A, but also provide a practical algorithm for corresponding nonsingular matrix P with P-1AP = J.     

Further Reduction of Normal Forms for Vector Fields

We study Lie's method in the way of Ushiki for further reduction of normal forms for vector fields with singularity at the origin. We give further reduction of normal forms in two typical cases for vector fields in dimension 2: one with a rotation as its linear part and the other with a nilpotent linear part.     

An explicit recursive formula for computing the normal forms associated with semisimple cases

This paper presents an explicit, computationally efficient, recursive formula for computing the normal forms, center manifolds and nonlinear transformations for general n-dimensional systems, associated with semisimple singularities. Based on the formula, we develop a Maple program, which is very convenient for an end-user who only needs to prepare an input file and then execute the program to “automatically” generate the result. Several examples are presented to demonstrate the computational efficiency of the algorithm.     

Bit-size estimates for triangular sets in positive dimension

We give bit-size estimates for the coefficients appearing in triangular sets describing positive-dimensional algebraic sets defined over Q. These estimates are worst case upper bounds; they depend only on the degree and height of the underlying algebraic sets. We illustrate the use of these results in the context of a modular algorithm.This extends the results by the first and the last author, which were confined to the case of dimension 0. Our strategy is to get back to dimension 0 by evaluation and interpolation techniques. Even though the main tool (height theory) remains the same, new difficulties arise to control the growth of the coefficients during the interpolation process.     

Long Time Behaviour of Leafwise Heat Flow for Riemannian Foliations

For any Riemannian foliation F on a closed manifold M with an arbitrary bundle-like metric, leafwise heat flow of differential forms is proved to preserve smoothness on M at infinite time. This result and its proof have consequences about the space of bundle-like metrics on M, about the dimension of the space of leafwise harmonic forms, and mainly about the second term of the differentiable spectral sequence of F.     

Toroidal automorphic forms for some function fields

Zagier introduced toroidal automorphic forms to study the zeros of zeta functions: an automorphic form on GL₂ is toroidal if all its right translates integrate to zero over all non-split tori in GL₂, and an Eisenstein series is toroidal if its weight is a zero of the zeta function of the corresponding field. We compute the space of such forms for the global function fields of class number one and genus g?1, and with a rational place. The space has dimension g and is spanned by the expected Eisenstein series. We deduce an “automorphic” proof for the Riemann hypothesis for the zeta function of those curves.