Generating More Boundary Elements of Subset Projections

Composition problem is considered for partition constrained vertex subsets of n dimensional unit cube E^n . Generating numerical characteristics of E^n subsets partitions is considered by means of the same characteristics in 1 − n dimensional unit cube, and construction of corresponding subsets is given for a special particular case. Using pairs of lower layer characteristic vectors for E^(1-n) more characteristic vectors for E^n are composed which are boundary from one side, and which take part in practical recognition of validness of a given candidate vector of partitions.

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.

Large Distinct Part Sizes in a Random Integer Partition

A partition of a positive integer n is a way of writing it as the sum of positive integers without regard to order; the summands are called parts. The number of partitions of n, usually denoted by p(n), is determined asymptotically by the famous partition formula of Hardy and Ramanujan [5]. We shall introduce the uniform probability measure P on the set of all partitions of n assuming that the probability 1/p(n) is assigned to each n-partition. The symbols E and V ar will be further used to denote the expectation and variance with respect to the measure P . Thus, each conceivable numerical characteristic of the parts in a partition can be regarded as a random variable.

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.

On Local Uniform Topological Algebras

2000 Mathematics Subject Classification: Primary 46H05, 46H20; Secondary 46M20.

On Thom Polynomials for A4(−) via Schur Functions

2000 Mathematics Subject Classification: 05E05, 14N10, 57R45.

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

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

Special compositions in affinely connected spaces without a torsion

2000 Mathematics Subject Classification: 53B05, 53B99.

Polynomial automorphisms over finite fields: Mimicking tame maps by the Derksen group

2010 Mathematics Subject Classification: 14L99, 14R10, 20B27.