CAPS in Z(2,n)

We consider point sets in (Z^2,n) where no three points are on a line – also called caps or arcs. For the determination of caps with maximum cardinality and complete caps with minimum cardinality we provide integer linear programming formulations and identify some values for small n.

Efficient Computing of some Vector Operations over GF(3) and GF(4)

The problem of efficient computing of the affine vector operations (addition of two vectors and multiplication of a vector by a scalar over GF (q)), and also the weight of a given vector, is important for many problems in coding theory, cryptography, VLSI technology etc. In this paper we propose a new way of representing vectors over GF (3) and GF (4) and we describe an efficient performance of these affine operations. Computing weights of binary vectors is also discussed.

An Example Concerning Valdivia Compact Spaces

∗ Supported by Research grants GAUK 190/96 and GAUK 1/1998

Equivariant Embeddings of Differentiable Spaces

Given a differentiable action of a compact Lie group G on a compact smooth manifold V , there exists [3] a closed embedding of V into a finite-dimensional real vector space E so that the action of G on V may be extended to a differentiable linear action (a linear representation) of G on E. We prove an analogous equivariant embedding theorem for compact differentiable spaces (∞-standard in the sense of [6, 7, 8]).

Polynomial Automorphisms Over Finite Fields

It is shown that the invertible polynomial maps over a finite field Fq , if looked at as bijections Fn,q −→ Fn,q , give all possible bijections in the case q = 2, or q = p^r where p > 2. In the case q = 2^r where r > 1 it is shown that the tame subgroup of the invertible polynomial maps gives only the even bijections, i.e. only half the bijections. As a consequence it is shown that a set S ⊂ Fn,q can be a zero set of a coordinate if and only if #S = q^(n−1).

The Automorphism Group of the Free Algebra of Rank Two

The theorem of Czerniakiewicz and Makar-Limanov, that all the automorphisms of a free algebra of rank two are tame is proved here by showing that the group of these automorphisms is the free product of two groups (amalgamating their intersection), the group of all affine automorphisms and the group of all triangular automorphisms. The method consists in finding a bipolar structure. As a consequence every finite subgroup of automorphisms (in characteristic zero) is shown to be conjugate to a group of linear automorphisms.

Fermat's Equation in Matrices

The Fermat equation is solved in integral two by two matrices of determinant one as well as in finite order integral three by three matrices.

Generalizing of Neural Nets: Functional Nets of Special Type

Special generalizing for the artificial neural nets: so called RFT – FN – is under discussion in the report. Such refinement touch upon the constituent elements for the conception of artificial neural network, namely, the choice of main primary functional elements in the net, the way to connect them(topology) and the structure of the net as a whole. As to the last, the structure of the functional net proposed is determined dynamically just in the constructing the net by itself by the special recurrent procedure. The number of newly joining primary functional elements, the topology of its connecting and tuning of the primary elements is the content of the each recurrent step. The procedure is terminated under fulfilling “natural” criteria relating residuals for example. The functional proposed can be used in solving the approximation problem for the functions, represented by its observations, for classifying and clustering, pattern recognition, etc. Recurrent procedure provide for the versatile optimizing possibilities: as on the each step of the procedure and wholly: by the choice of the newly joining elements, topology, by the affine transformations if input and intermediate coordinate as well as by its nonlinear coordinate wise transformations. All considerations are essentially based, constructively and evidently represented by the means of the Generalized Inverse.

Self-affinity in financial asset returns

We test for departures from normal and independent and identically distributed (NIID) log returns, for log returns under the alternative hypothesis that are self-affine and either long-range dependent, or drawn randomly from an L-stable distribution with infinite higher-order moments. The finite sample performance of estimators of the two forms of self-affinity is explored in a simulation study. In contrast to rescaled range analysis and other conventional estimation methods, the variant of fluctuation analysis that considers finite sample moments only is able to identify both forms of self-affinity. When log returns are self-affine and long-range dependent under the alternative hypothesis, however, rescaled range analysis has higher power than fluctuation analysis. The techniques are illustrated by means of an analysis of the daily log returns for the indices of 11 stock markets of developed countries. Several of the smaller stock markets by capitalization exhibit evidence of long-range dependence in log returns. © 2012 Elsevier Inc. All rights reserved.

Conjugate Compositions in Even-Dimensional Affinely Connected Spaces without a Torsion

Let in even-dimensional a±nely connected space without a torsion A2m be given a composition Xm£Xm by the affinor a¯ ®. The affinor b¯ ®, determined with the help of the eigen-vectors of the matrix (a¯ ®), de¯nes the second composition Ym £ Y m. Conjugate compositions are introduced by the condition: the a±nors of any of both compositions transform the vectors from the one position of the composition, generated by the other a±nor, in the vectors from the another its position. It is proved that the compositions de¯ne by a±nors a¯ ® and b¯ ® are conjugate. It is proved also that if the composition Xm£Xm is Cartesian and composition Ym£Y m is Cartesian or chebyshevian, or geodesic than the space A2m is affine.

A Solver for Complex-Valued Parametric Linear Systems

This work reports on a new software for solving linear systems involving affine-linear dependencies between complex-valued interval parameters. We discuss the implementation of a parametric residual iteration for linear interval systems by advanced communication between the system Mathematica and the library C-XSC supporting rigorous complex interval arithmetic. An example of AC electrical circuit illustrates the use of the presented software.

A Smooth Four-Dimensional G-Hilbert Scheme

2000 Mathematics Subject Classification: 14C05, 14L30, 14E15, 14J35.

Functional Transfer Theorems for Maxima of Stationary Processes

2000 Mathematics Subject Classification: 60G70, 60F12, 60G10.

Plaintext Recovery in DES-like Cryptosystems Based on S-boxes with Embedded Parity Check

We describe an approach for recovering the plaintext in block ciphers having a design structure similar to the Data Encryption Standard but with improperly constructed S-boxes. The experiments with a backtracking search algorithm performing this kind of attack against modified DES/Triple-DES in ECB mode show that the unknown plaintext can be recovered with a small amount of uncertainty and this algorithm is highly efficient both in time and memory costs for plaintext sources with relatively low entropy. Our investigations demonstrate once again that modifications resulting to S-boxes which still satisfy some design criteria may lead to very weak ciphers. ACM Computing Classification System (1998): E.3, I.2.7, I.2.8.

Régularité Lipschitzienne des Géodésiques Minimisantes pour Quelques Distributions Affines

2000 Mathematics Subject Classification: 49J15, 49J30, 53B50.