Normal Bases and Their Dual-Bases over Finite Fields

In this paper, we prove the following results： 1） A normal basis N over a finite field is equivalent to its dual basis if and only if the multiplication table of N is symmetric; 2） The normal basis N is self-dual if and only if its multiplication table is symmetric and Tr（α^2） = 1, where α generates N; 3） An optimal normal basis N is self-dual if and only if N is a type-Ⅰ optimal normal basis with q = n = 2 or N is a type-Ⅱ optimal normal basis.     

Inverse-preserving Linear Maps Between Spaces of Matrices over Fields

Suppose F is a field different from F2, the field with two elements. Let Mn（F） and Sn（F） be the space of n × n full matrices and the space of n ×n symmetric matrices over F, respectively. For any G1, G2 ∈ {Sn（F）, Mn（F）}, we say that a linear map f from G1 to G2 is inverse-preserving if f（X）^-1 = f（X^-1） for every invertible X ∈ G1. Let L （G1, G2） denote the set of all inverse-preserving linear maps from G1 to G2. In this paper the sets .L（Sn（F）,Mn（F））, L（Sn（F）,Sn（F））, L （Mn（F）,Mn（F）） and L（Mn （F）, Sn （F）） are characterized.     

Orthogonal Geometries over Finite Fields with Characteristic≠2 and Block Designs

Let q be an odd prime power, and F_q the finite field with q elements. Write The orthogonal group of degree 2ν δ defined by S_i, where (and throughout     

Some Conditions for Matrices over an Incline To Be Invertible and General Linear Group on an Incline

Inclines are the additively idempotent semirings in which products are less than or equal to either factor. In this paper, some necessary and sufficient conditions for a matrix over L to be invertible are given, where L is an incline with 0 and 1. Also it is proved that L is an integral incline if and only if GLn（L） = PLn （L） for any n （n 〉 2）, in which GLn（L） is the group of all n × n invertible matrices over L and PLn（L） is the group of all n × n permutation matrices over L. These results should be regarded as the generalizations and developments of the previous results on the invertible matrices over a distributive lattice.     

Construction of a Fuchs Equation with Four Given Finite Singular Points and Given Reducible 2 × 2 Monodromy Matrices

On the complex projective line, we construct a Fuchs equation with four given finite singular points and with fundamental solution matrix that has given reducible 2×2 monodromy matrices in the nonresonance case.     

Non-existence of Some Nearly Perfect Sequences,Near Butson–Hadamard Matrices,and Near Conference Matrices

In this paper we study the non-existence problem of (nearly) perfect (almost) m-ary sequences via their connection to (near) Butson–Hadamard (BH) matrices and (near) conference matrices. We refine the idea of Brock on the unsolvability of certain equations in the case of cyclotomic number fields whose ring of integers is not a principal ideal domain and get many new non-existence results for near BH matrices and near conference matrices. We also apply previous results on vanishing sums of roots of unity and self conjugacy condition to derive non-existence results for near BH matrices and near conference matrices.     

Matrices with different Gondran–Minoux and determinantal ranks over max-algebras

Let GMr(A) be the row Gondran–Minoux rank of a matrix, GMc(A) be the column Gondran–Minoux rank, and d(A) be the determinantal rank, respectively. The following problem was posed by M. Akian, S. Gaubert, and A. Guterman: Find the minimal numbers m and n such that there exists an (m × n)-matrix B with different row and column Gondran–Minoux ranks. We prove that in the case GMr(B) > GMc(B) the minimal m and n are equal to 5 and 6, respectively, and in the case GMc(B) > GMr(B) the numbers m = 6 and n = 5 are minimal. An example of a matrix $ A \in {\mathcal{M}_{5 \times 6}}\left( {{\mathbb{R}_{\max }}} \right) $ such that GMr(A) = GMc(A ^t) = 5 and GMc(A) = GMr(A ^t) = 4 is provided. It is proved that p = 5 and q = 6 are the minimal numbers such that there exists an (p×q)-matrix with different row Gondran–Minoux and determinantal ranks.     

Enumeration and Generating Functions of Rota–Baxter Words

In this paper, we prove results on enumerations of sets of Rota–Baxter words ( ${{{\tt RBWs}}}$ ) in a single generator and one unary operator. Examples of operators are integral operators, their generalization to Rota–Baxter operators, and Rota–Baxter type operators. ${{{\tt RBWs}}}$ are certain words formed by concatenating generators and images of words under the operators. Under suitable conditions, they form canonical bases of free Rota–Baxter type algebras which are studied recently in relation to renormalization in quantum field theory, combinatorics, number theory, and operads. Enumeration of a basis is often a first step to choosing a data representation in implementation. We settle the case of one generator and one operator, starting with the idempotent case (more precisely, the exponent 1 case). Some integer sequences related to these sets of ${{{\tt RBWs}}}$ are known and connected to other sequences from combinatorics, such as the Catalan numbers, and others are new. The recurrences satisfied by the generating series of these sequences prompt us to discover an efficient algorithm to enumerate the canonical basis of certain free Rota–Baxter algebras.     

Enumeration and Generating Functions of Differential Rota–Baxter Words

In this paper, the methods and results in enumeration and generation of Rota–Baxter words in Guo and Sit (Algebraic and Algorithmic Aspects of Differential and Integral Operators (AADIOS), Math. Comp. Sci., vol. 4, Sp. Issue (2,3), 2011) are generalized and applied to a free, non-commutative, non-unitary, ordinary differential Rota–Baxter algebra with one generator. A differential Rota–Baxter algebra is an associative algebra with two operators modeled after the differential and integral operators, which are related by the First Fundamental Theorem of Calculus. Differential Rota–Baxter words are words formed by concatenating differential monomials in the generator with images of words under the Rota–Baxter operator. Their totality is a canonical basis of a free, non-commutative, non-unitary, ordinary differential Rota–Baxter algebra. A free differential Rota–Baxter algebra can be constructed from a free Rota–Baxter algebra on a countably infinite set of generators. The order of the derivation gives another dimension of grading on differential Rota–Baxter words, enabling us to generalize and refine results from Guo and Sit to enumerate the set of differential Rota–Baxter words and outline an algorithm for their generation according to a multi-graded structure. Enumeration of a basis is often a first step to choosing a data representation in implementation of algorithms involving free algebras, and in particular, free differential Rota–Baxter algebras and several related algebraic structures on forests and trees. The generating functions obtained can be used to provide links to other combinatorial structures.     

Linear maps preserving M–P inverses of matrices between matrix spaces over fields

Suppose F is a field of characteristic not 2. Let n and m be two arbitrary positive integers with n≥2. We denote by M _n (F) and S _n (F) the space of n×n full matrices and the space of n×n symmetric matrices over F, respectively. All linear maps from S _n (F) to M _m (F) preserving M–P inverses of matrices are characterized first, and thereby all linear maps from S _n (F) (M _n (F)) to S _m (F) (M _m (F)) preserving M–P inverses of matrices are characterized, respectively.     

Using Normal Form of Idempotent Matrices over Finite Local Ring Z/p^kZ to Construct Cartesian Authentication Codes

In this paper, we determine the normal forms of idempotent matrices for similarity over finite local rings Z/p^kZ, from which we construct a Cartesian authentication code and compute its size parameters and the probabilities of successful impersonation and substitution attack under the hypothesis that the cecoding rules are chosen according to a uniform probability distribution.     

RESEARCH ANNOUNCEMENTS On Multiplication Tables of Normal Bases and Their Dual-bases Over Finite Fields

Let q be a Power of a Prime P and n be a Positive integer,9 elements andF=凡二be the oth extension of K.N={a‘K=凡be the finite field with=o,1,…,。一1}15 a normalbasis of F over凡,wherea,== aq’,艺=o,1,…,n一1.VA,:F,letA二艺写、、,Blet咖B玄,几一11,一们乙,二o勺“j,a云,勺匕厂。,七henF望F望心T0(少一’.SoifA=(ao,…,a。一iB=(b0,…,纵一1),AB二C(e。,…,e。一:),thene‘=A,一‘)T,l=0,1,·‘口无,n一i,where几==(:{夕)15:iven by几一1。、。,一艺,{夕心一明任凡无=0On the other hand,T=(t‘,Ja=a价aQ…     

Ternary Code Construction of Unimodular Lattices and Self-Dual Codes over ℤ6

We revisit the construction method of even unimodular lattices using ternary self-dual codes given by the third author (M. Ozeki, in Théorie des nombres, J.-M. De Koninck and C. Levesque (Eds.) (Quebec, PQ, 1987), de Gruyter, Berlin, 1989, pp. 772–784), in order to apply the method to odd unimodular lattices and give some extremal (even and odd) unimodular lattices explicitly. In passing we correct an error on the condition for the minimum norm of the lattices of dimension a multiple of 12. As the results of our present research, extremal odd unimodular lattices in dimensions 44, 60 and 68 are constructed for the first time. It is shown that the unimodular lattices obtained by the method can be constructed from some self-dual ₆-codes. Then extremal self-dual ₆-codes of lengths 44, 48, 56, 60, 64 and 68 are constructed.     

Infraparticle Problem,Asymptotic Fields and Haag–Ruelle Theory

In this article, we want to argue that an appropriate generalization of the Wigner concepts may lead to an asymptotic particle with well-defined mass, although no mass hyperboloid in the energy–momentum spectrum exists.