Elements of Prescribed Order,Prescribed Traces and Systems of Rational Functions Over Finite Fields

Let k 1 and be a system of rational functions forming a strongly linearly independent set over a finite field . Let be arbitrarily prescribed elements. We prove that for all sufficiently large extensions , there is an element of prescribed order such that is the relative trace map from onto We give some applications to BCH codes, finite field arithmetic and ordered orthogonal arrays. We also solve a question of Helleseth et~al. (Hypercubic 4 and 5-designs from Double-Error-Correcting codes, Des. Codes. Cryptgr. 28(2003). pp. 265–282) completely.classification 11T30, 11G20, 05B15     

The Valuations of the Near Octagon {\mathbb{H}}_4

Let , n  ≥ 2, be the near 2n-gon on the 2-factors of a complete graph with 2n + 2 vertices. In this paper, we classify the valuations of the near octagon . We use this classification to study isometric full embeddings of into DQ(8,2) and DH(7,4). We show that there is up to isomorphism a unique isometric full embedding of into each of these dual polar spaces. Further applications are expected in the classification of dense near polygons with lines of size 3.     

Forbidden (0,1)-vectors in Hyperplanes of $$\mathbb{R}^{n}$$: The unrestricted case

In this paper, we continue our investigation on “Extremal problems under dimension constraints” introduced [1]. The general problem we deal with in this paper can be formulated as follows. Let be an affine plane of dimension k in . Given determine or estimate .Here we consider and solve the problem in the special case where is a hyperplane in and the “forbidden set” . The same problem is considered for the case, where is a hyperplane passing through the origin, which surprisingly turns out to be more difficult. For this case we have only partial results.AMS Classification: 05C35, 05B30, 52C99     

A class number formula for the p-cyclotomic field

Let p be an odd prime number and . Let be the classical Stickelberger ideal of the group ring . Iwasawa [6] proved that the index equals the relative class number of . In [2], [4] we defined for each subgroup H of G a Stickelberger ideal of , and studied some of its properties. In this note, we prove that when mod 4 and [G : H] = 2, the index equals the quotient . Received: 13 January 2006     

Topological Structures in Colombeau Algebras: Topological $\widetilde{\mathbb{C}}$ -modules and Duality Theory

We study modules over the ring of complex generalized numbers from a topological point of view, introducing the notions of -linear topology and locally convex -linear topology. In this context particular attention is given to completeness, continuity of -linear maps and elements of duality theory for topological -modules. As main examples we consider various Colombeau algebras of generalized functions.Mathematics Subject Classifications (2000) 46F30, 13J99, 46A20.Claudia Garetto: Current address: Institut für Technische Mathematik, Geometrie und Bauinformatik, Universität Innsbruck, 6020 Insbruck, Austria. e-mail: claudia@mat1.uibk.ac.at     

Type II Codes over $$\mathbb{Z}/2k\mathbb{Z}$$, Invariant Rings and Theta Series

We consider type II codes over finite rings . It is well-known that their gth complete weight enumerator polynomials are invariant under the action of a certain finite subgroup of , which we denote H_k,g. We show that the invariant ring with respect to H_k,g is generated by such polynomials. This is carried out by using some closely related results concerning theta series and Siegel modular forms with respect to .     

On lattices of convex sets in {\mathbb{R}}^{n}

Properties of several sorts of lattices of convex subsets of are examined. The lattice of convex sets containing the origin turns out, for n > 1, to satisfy a set of identities strictly between those of the lattice of all convex subsets of and the lattice of all convex subsets of The lattices of arbitrary, of open bounded, and of compact convex sets in all satisfy the same identities, but the last of these is join-semidistributive, while for n > 1 the first two are not. The lattice of relatively convex subsets of a fixed set satisfies some, but in general not all of the identities of the lattice of “genuine” convex subsets of To the memory of Ivan RivalReceived April 22, 2003; accepted in final form February 16, 2005.This revised version was published online in August 2005 with a corrected cover date.     

{\left( {\mathfrak{V},\mathfrak{W}} \right)}{\text{-cotorsion pairs}}

Let R be a unital associative ring and two classes of left R-modules. In this paper we introduce the notion of a In analogy to classical cotorsion pairs as defined by Salce [10], a pair of subclasses and is called a if it is maximal with respect to the classes and the condition for all and Basic properties of are stated and several examples in the category of abelian groups are studied. Received: 17 March 2005     

\mathcal{P}\mathcal{A}{\text{-isomorphisms}} of inverse semigroups

A partial automorphism of a semigroup S is any isomorphism between its subsemigroups, and the set all partial automorphisms of S with respect to composition is an inverse monoid called the partial automorphism monoid of S. Two semigroups are said to be if their partial automorphism monoids are isomorphic. A class of semigroups is called if it contains every semigroup to some semigroup from Although the class of all inverse semigroups is not we prove that the class of inverse semigroups, in which no maximal isolated subgroup is a direct product of an involution-free periodic group and the two-element cyclic group, is It follows that the class of all combinatorial inverse semigroups (those with no nontrivial subgroups) is A semigroup is called if it is isomorphic or antiisomorphic to any semigroup that is to it. We show that combinatorial inverse semigroups which are either shortly connected [5] or quasi-archimedean [10] are To Ralph McKenzieReceived April 15, 2004; accepted in final form October 7, 2004.     

Affine configurations of 4 lines in \mathbb{R}^{\text{3}}

We prove that affine configurations of 4 lines in are topologically and combinatorially homeomorphic to affine configurations of 6 points in Received: 14 July 2004; revised: 18 February 2005     

Symmetric <Emphasis Type="Bold">(4,4)</Emphasis>-Nets and Generalized Hadamard Matrices Over Groups of Order 4

The symmetric class-regular (4,4)-nets having a group of bitranslations G of order four are enumerated up to isomorphism. There are 226 nets with , and 13 nets with . Using a (4,4)-net with full automorphism group of smallest order, the lower bound on the number of pairwise non-isomorphic affine 2-(64,16,5) designs is improved to 21,621,600. The classification of class-regular (4,4)-nets implies the classification of all generalized Hadamard matrices (or difference matrices) of order 16 over a group of order four up to monomial equivalence. The binary linear codes spanned by the incidence matrices of the nets, as well as the quaternary and -codes spanned by the generalized Hadamard matrices are computed and classified. The binary codes include the affine geometry [64,16,16] code spanned by the planes in AG(3,4) and two other inequivalent codes with the same weight distribution.These codes support non-isomorphic affine 2-(64,16,5) designs that have the same 2-rank as the classical affine design in AG(3,4), hence provide counter-examples to Hamadas conjecture. Many of the -codes spanned by generalized Hadamard matrices are self-orthogonal with respect to the Hermitian inner product and yield quantum error-correcting codes, including some codes with optimal parameters.Vladimir D. Tonchev-Research of this author sponsored by the National Security Agency under Grant MDA904-03-1-0088.classification 5B, 51E, 94B     

Modified Alternating $$\vec{k}$$–generators

This paper deals with a class of pseudorandom bit generators – modified alternating –generators. This class is constructed similarly to the class of alternating step generators. Three subclasses of are distinguished, namely linear, mixed and nonlinear generators. The main attention is devoted to the subclass of linear and mixed generators generating periodic sequences with maximal period lengths. A necessary and sufficient condition for all sequences generated by the linear generators of to be with maximal period lengths is formulated. Such sequences have good statistical properties, such as distribution of zeroes and ones, and large linear complexity. Two methods of cryptanalysis of the proposed generators are given. Finally, three new classes of modified alternating –generators, designed especially to be more secure, are presented.     

Matrix Groups Related to the Quaternion Group and Spherical Orbit Codes

We consider a finite matrix group with 3⁴· 2¹⁶ elements, which is a subgroup of the infinite group , where is the regular representation of the quaternion group and C is a matrix that transforms the regular representation Q to its cellwise-diagonal form. There is a number of ways to define the matrix C. Our aim is to make the group similar in a certain sense to a finite group. The eventual choice of an appropriate matrix C done heuristically. We study the structure of the group and use this group to construct spherical orbit codes on the unit Euclidean sphere in R⁸. These codes have code distance less than 1. One of them has 3²· 2⁸ = 2304 elements and its squared Euclidean code distance is 0.293. Communicated by: V. A. Zinoviev     

On self-dual codes over {\mathbb{F}}_5

The purpose of this paper is to improve the upper bounds of the minimum distances of self-dual codes over for lengths [22, 26, 28, 32–40]. In particular, we prove that there is no [22, 11, 9] self-dual code over , whose existence was left open in 1982. We also show that both the Hamming weight enumerator and the Lee weight enumerator of a putative [24, 12, 10] self-dual code over are unique. Using the building-up construction, we show that there are exactly nine inequivalent optimal self-dual [18, 9, 7] codes over up to the monomial equivalence, and construct one new optimal self-dual [20, 10, 8] code over and at least 40 new inequivalent optimal self-dual [22, 11, 8] codes.      

A Note on the Tight Spherical 7-Design in {\mathbb R}^{23} and 5-Design in {\mathbb R}^{7*}

In this note we prove the uniqueness of the tight spherical 7-design in consisting of 4600 vectors and with automorphism group 2 × Co₂ as well as the uniqueness of the tight spherical 5-design in on 112 vectors and with automorphism group 2 × Sp₆(2).To the memory of Jaap Seidel     

Exponential Dichotomy on the Real Line and Admissibility of Function Spaces

The purpose of this paper is to give characterizations for uniform exponential dichotomy of evolution families on the real line. We consider a general class of Banach function spaces denoted and we prove that if with and the pair is admissible for an evolution family then is uniformly exponentially dichotomic. By an example we show that the admissibility of the pair for an evolution family is not a sufficient condition for uniform exponential dichotomy. As applications, we deduce necessary and sufficient conditions for uniform exponential dichotomy of evolution families in terms of the admissibility of the pairs and with      

Codes defined by forms of degree 2 on non-degenerate Hermitian varieties in $${\mathbb{P}^{4}(\mathbb{F}_q)}$$

We study the functional codes of second order on a non-degenerate Hermitian variety as defined by G. Lachaud. We provide the best possible bounds for the number of points of quadratic sections of . We list the first five weights, describe the corresponding codewords and compute their number. The paper ends with two conjectures. The first is about minimum distance of the functional codes of order h on a non-singular Hermitian variety . The second is about distribution of the codewords of first five weights of the functional codes of second order on a non-singular Hermitian variety .      

Every Biregular Function Is a Biholomorphic Map

We study Fueter-biregular functions of one quaternionic variable. We consider left-regular functions in the kernel of the Cauchy–Riemann operator

Fq-linear Cyclic Codes over $$ F{_q^m}$$ : D FT Approach

Codes over that are closed under addition, and multiplication with elements from F_q are called F_q-linear codes over . For m 1, this class of codes is a subclass of nonlinear codes. Among F_q-linear codes, we consider only cyclic codes and call them F_q-linear cyclic codes (F_q LC codes) over The class of F_q LC codes includes as special cases (i) group cyclic codes over elementary abelian groups (q=p, a prime), (ii) subspace subcodes of Reed–Solomon codes (n=q^m–1) studied by Hattori, McEliece and Solomon, (iii) linear cyclic codes over F_q (m=1) and (iv) twisted BCH codes. Moreover, with respect to any particular F_q-basis of , any F_qLC code over can be viewed as an m-quasi-cyclic code of length mn over F_q. In this correspondence, we obtain transform domain characterization of F_q LC codes, using Discrete Fourier Transform (DFT) over an extension field of The characterization is in terms of any decomposition of the code into certain subcodes and linearized polynomials over . We show how one can use this transform domain characterization to obtain a minimum distance bound for the corresponding quasi-cyclic code. We also prove nonexistence of self dual F_q LC codes and self dual quasi-cyclic codes of certain parameters using the transform domain characterization.AMS classification 94B05     

<Emphasis Type="Italic">p</Emphasis>-Laplace Operator and Diameter of Manifolds

Let be a compact Riemannian manifold without boundary. In this paper, we consider the first nonzero eigenvalue of the p-Laplacian and we prove that the limit of when is 2/d(M), where d(M) is the diameter of M. Moreover, if is an oriented compact hypersurface of the Euclidean space or , we prove an upper bound of in terms of the largest principal curvature κ over M. As applications of these results, we obtain optimal lower bounds of d(M) in terms of the curvature. In particular, we prove that if M is a hypersurface of then: . Mathematics Subject Classifications (2000): 53A07, 53C21.