On Complete Arcs Arising from Plane Curves

We point out an interplay between -Frobenius non-classical plane curves and complete -arcs in . A typical example that shows how this works is the one concerning an Hermitian curve. We present some other examples here which give rise to the existence of new complete -arcs with parameters and being a power of the characteristic. In addition, for q a square, new complete -arcs with either and or and are constructed by using certain reducible plane curves.     

Varieties Defined by Permutations

We continue to study interrelations between permutative varieties and the cyclic varieties defined by cycles of the form . A criterion is given determining whether a cyclic variety is interpretable in . For a permutation without fixed elements, it is stated that a set of primes for which is interpretable in in the lattice is finite. It is also proved that for distinct primes , the Helly number of a type in coincides with dimension of the dual type and equals .     

Profinite and Continuous Higher K-Theory of Exact Categories, Orders, and Group Rings

Let be a rational prime, an exact category. In this article, we define and study for all , the profinite higher K-theory of , that is as well as , where is the -dimensional mod- Moore space. We study connections between and prove several -completeness results involving these and associated groups including the cases where is the category of finitely generated (resp. finitely generated projective) modules over orders in semi-simple algebras over number fields and p-adic fields. We also define and study continuous K-theory of orders in p-adic semi-simple algebras and show some connection between the profinite and continuous K-theory of .     

Optimal Subcodes of Second Order Reed-Muller Codes andMaximal Linear Spaces of Bivectors of Maximal Rank

There are exactlytwo non-equivalent [32,11,12]-codes in the binaryReed-Muller code which contain and have the weight set {0,12,16,20,32}. Alternatively,the 4-spaces in the projective space over the vector space for which all points have rank 4 fall into exactlytwo orbits under the natural action of PGL(5) on .     

Hiding Cliques for Cryptographic Security

We demonstrate how a well studied combinatorial optimizationproblem may be used as a new cryptographic primitive. The problemin question is that of finding a "large" clique in a randomgraph. While the largest clique in a random graph with nvertices and edge probability p is very likely tobe of size about , it is widely conjecturedthat no polynomial-time algorithm exists which finds a cliqueof size with significantprobability for any constant > 0. We presenta very simple method of exploiting this conjecture by hidinglarge cliques in random graphs. In particular, we show that ifthe conjecture is true, then when a large clique—of size,say, is randomlyinserted (hidden) in a random graph, finding a clique ofsize remains hard.Our analysis also covers the case of high edge probabilitieswhich allows us to insert cliques of size up to . Our result suggests several cryptographicapplications, such as a simple one-way function.     

Some Generalizations of the Notion of Length

Two numerical characteristics of a nonrectifiable arc generalizing the notion of length are introduced. Geometrically, this notion can naturally be generalized as the least upper bound of the sums , where are the lengths of segments of a polygonal line inscribed in the curve and is a given function. On the other hand, the length of is the norm of the functional in the space ; its norms in other spaces can be considered as analytical generalizations of length. In this paper, we establish conditions under which the generalized geometric rectifiability of a curve implies its generalized analytic rectifiability.     

On Sparse Parity Check Matrices

We consider the extremal problem to determine the maximal number of columns of a 0-1 matrix with rows and at most ones in each column such that each columns are linearly independent modulo . For fixed integers and , we shall prove the probabilistic lower bound = ; for a power of , we prove the upper bound which matches the lower bound for infinitely many values of . We give some explicit constructions.     

Split Orthogonal Arrays and Maximum Independent Resilient Systems of Functions

A system of (Boolean) functions in variables is called randomized if the functions preserve the property of their variables to be independent and uniformly distributed random variables. Such a system is referred to as -resilient if for any substitution of constants for any variables, where 0 i t, the derived system of functions in variables will be also randomized. We investigate the problem of finding the maximum number of functions in variables of which any form a -resilient system. This problem is reduced to the minimization of the size of certain combinatorial designs, which we call split orthogonal arrays. We extend some results of design and coding theory, in particular, a duality in bounding the optimal sizes of codes and designs, in order to obtain upper and lower bounds on . In some cases, these bounds turn out to be very tight. In particular, for some infinite subsequences of integers they allow us to prove that , , , , . We also find a connection of the problem considered with the construction of unequal-error-protection codes and superimposed codes for multiple access in the Hamming channel.     

A Comparison on the Commutative Neutrix Convolution of Distributions and the Exchange Formula

Let , be ultradistributions in and let and where is a sequence in which converges to the Dirac-delta function . Then the neutrix product is defined on the space of ultradistributions as the neutrix limit of the sequence provided the limit exist in the sense that

On the Uniqueness of the Recovery of Parameters of the Maxwell System from Dynamical Boundary Data

The paper deals with the problem of recovering the parameters (functions) and of the Maxwell dynamical system

Characterizations of Translation Generalized Quadrangles

If x is a regular point of the generalizedquadrangle of order (s,t), s 1 t, then x defines a dual net . If contains a line L of regularpoints and if for at least one point x on Lthe automorphism group of the dual net satisfies certain transitivityproperties, then is a translation generalized quadrangle. Thisresult has many applications. We give one example. Ifs=t 1, then is a dual affine plane. Let be a generalizedquadrangle of orders,s odd and s 1, which contains a lineL of regular points. If for at least one pointx on L the plane is Desarguesian, then is isomorphic to the classical generalizedquadrangleW(s).     

Test Rank for Some Free Polynilpotent Groups

We prove a theorem on possible test rank values for groups of the form . It is shown that test rank of a free polynilpotent group is equal to or , for any and every collection of classes. Moreover, for and .     

On posets with isomorphic interval posets

Let be a partially ordered set, Int the system of all (nonempty) intervals of partially ordered by the set-theoretical inclusion . We are interested in partially ordered sets with Int isomorphic to Int . We are going to show that they correspond to couples of binary relations on A satisfying some conditions. If is a directed partially ordered set, the only with Int isomorphic to Int are corresponding to direct decompositions of ( denotes the dual of . The present results include those presented in the paper [11] by V. Slavík. Systems of intervals, particularly of lattices, have been investigated by many authors, cf. [1]–[11].     

The Invariants of the Clifford Groups

The automorphism group of the Barnes-Wall lattice L _m in dimension 2 ^m (m ; 3) is a subgroup of index 2 in a certain Clifford group of structure 2 ₊ ^1+2m . O ⁺(2m,2). This group and its complex analogue of structure .Sp(2m, 2) have arisen in recent years in connection with the construction of orthogonal spreads, Kerdock sets, packings in Grassmannian spaces, quantum codes, Siegel modular forms and spherical designs. In this paper we give a simpler proof of Runge@apos;s 1996 result that the space of invariants for of degree 2k is spanned by the complete weight enumerators of the codes , where C ranges over all binary self-dual codes of length 2k; these are a basis if m k - 1. We also give new constructions for L _m and : let M be the -lattice with Gram matrix . Then L _m is the rational part of M ^m, and = Aut(M^m). Also, if C is a binary self-dual code not generated by vectors of weight 2, then is precisely the automorphism group of the complete weight enumerator of . There are analogues of all these results for the complex group , with doubly-even self-dual code instead of self-dual code.     

On Polynomial Bases for the Space C[-1,1]

For an arbitrary , we construct an orthogonal basis in the space consisting of algebraic polynomials such that their degrees do not exceed . It is not possible to decrease the order of growth of the degrees. Bibliography: 9 titles.     

A Completion of \mathbb{Z} is a Field

We define various ring sequential convergences on and . We describe their properties and properties of their convergence completions. In particular, we define a convergence on by means of a nonprincipal ultrafilter on the positive prime numbers such that the underlying set of the completion is the ultraproduct of the prime finite fields Further, we show that is sequentially precompact but fails to be strongly sequentially precompact; this solves a problem posed by D. Dikranjan.     

A Constructive Proof of the Generalized Gelfand Isomorphism

Using an analog of the classical Frobenius recursion, we define the notion of a Frobenius -homomorphism. For , this is an ordinary ring homomorphism. We give a constructive proof of the following theorem. Let X be a compact Hausdorff space, the th symmetric power of X, and the algebra of continuous complex-valued functions on X with the sup-norm; then the evaluation map defined by the formula identifies the space with the space of all Frobenius -homomorphisms of the algebra into with the weak topology.     

Dynamic ℤ d -Random Walks in a Random Scenery: A Strong Law of Large Numbers

In this paper, we study a _d -random walk on nearest neighbours with transition probabilities generated by a dynamical system . We prove, at first, that under some hypotheses, verifies a local limit theorem. Then, we study these walks in a random scenery , a sequence of independent, identically distributed and centred random variables and show that for certain dynamic random walks, satisfies a strong law of large numbers.     

Extremal Points of Integral Curves of Second-Order Ordinary Differential Equations and Their Local Stability

In [1--3] an extension of the solution of the equation , to the singular set , is defined in terms of the first integral. In this case all stationary points and all local extrema of the integral curve such that the function has a derivative at the extreme point belong to a set , where Y is the line . We study the local stability of local extrema of different types in the families of equations small enough. Introduce the notation . By abuse of language, we talk about the stability of local extrema when S is replaced with . Some sufficient conditions for stability and instability are found.     

Homological Dimensions of the Algebra Formed by Entire Functions of Elements of a Nilpotent Lie Algebra

This note deals with homological characteristics of algebras of holomorphic functions of noncommuting variables generated by a finite-dimensional nilpotent Lie algebra . It is proved that the embedding of the universal enveloping algebra of into its Arens–Michael hull is an absolute localization in the sense of Taylor provided that