Analysis of the Xedni Calculus Attack

The xedni calculus attack on the elliptic curve discrete logarithm problem (ECDLP) involves lifting points from the finite field to the rational numbers and then constructing an elliptic curve over that passes through them. If the lifted points are linearly dependent, then the ECDLP is solved. Our purpose is to analyze the practicality of this algorithm. We find that asymptotically the algorithm is virtually certain to fail, because of an absolute bound on the size of the coefficients of a relation satisfied by the lifted points. Moreover, even for smaller values of p experiments show that the odds against finding a suitable lifting are prohibitively high.     

True Dimension of Some Binary Quadratic Trace Goppa Codes

We compute in this paper the true dimension over of Goppa Codes (L, g) defined by the polynomial proving, this way, a conjecture stated in [14,16].     

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 .     

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].     

Two New Infinite Families of 3-Designs from Kerdock Codes over Z4

In this paper we show that the support of the codewords of each type in the Kerdock code of length 2^m over Z₄ form 3-designs for any odd integer . In particular, twonew infinite families of 3-designs are obtained in this constructionfor any odd integer . In particular, twonew infinite families of 3-designs are obtained in this constructionfor any odd integer , whose parameters are ,and .     

Hyperplane Sections of Kantor's Unitary Ovoids

The projective plane is embedded as a variety of projective points in , where M is a nine dimensional -module for the groupG=GL(3,q ²). The hyperplane sections of thisvariety and their stabilizers in the group G aredetermined. When q 2 (mod 3) one such hyperplanesection is a member of the family of Kantor's unitary ovoids.We furtherdetermine all sections whereD has codimension two in M and demonstratethat these are never empty. Consequences are drawn for Kantor'sovoids.     

Minihypers and Linear Codes Meeting the Griesmer Bound: Improvements to Results of Hamada, Helleseth and Maekawa

This article improves results of Hamada, Helleseth and Maekawa on minihypers in projective spaces and linear codes meeting the Griesmer bound.In [10,12],it was shown that any -minihyper, with , where , is the disjoint union of points, lines,..., -dimensional subspaces. For q large, we improve on this result by increasing the upper bound on non-square, to non-square, square, , and (4) for square, p prime, p<3, to . In the case q non-square, the conclusion is the same as written above; the minihyper is the disjoint union of subspaces. When q is square however, the minihyper is either the disjoint union of subspaces, or the disjoint union of subspaces and one subgeometry . For the coding-theoretical problem, our results classify the corresponding codes meeting the Griesmer bound.     

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.     

Cobordisms of Embeddings with Codimension Two

We single out the obstruction for a closed -null-homologous submanifold of codimension 2 to be the boundary of a submanifold of codimension 1. As an application, we calculate the groups of cobordisms of embeddings of nonoriented n-manifolds in the Euclidean (n+2)-space for n=3 and 4. Namely, we show that and . A specific generator of the former group is explicitly given. Bibliography: 5 titles.     

Boundedness of Riesz Potential Generated by Generalized Shift Operator on B<Emphasis Type="Italic">a</Emphasis> Spaces

In this paper, the boundedness of the Riesz potential generated by generalized shift operator from the spaces to the spaces is examined.     

Sharp Conditions for the CLT of Linear Processes in a Hilbert Space

In this paper we study the behavior of sums of a linear process associated to a strictly stationary sequence with values in a real separable Hilbert space and are linear operators from H to H. One of the results is that satisfies the CLT provided are i.i.d. centered having finite second moments and . We shall provide an example which shows that the condition on the operators is essentially sharp. Extensions of this result are given for sequences of weak dependent random variables under minimal conditions.     

Invariants of Knots and Links on T-Polyhedra

Any link in is isotopic to a knot lying on the polyhedron . A nontrivial theory of links and knots on T is developed. The main result is a construction of an isotopy invariant, which can distinguish pairs of knots on T that are isotopic as knots in . Bibliography: 3 titles.     

Lower Bounds on the State Complexity of Geometric Goppa Codes

We reinterpret the state space dimension equations for geometric Goppa codes. An easy consequence is that if deg then the state complexity of is equal to the Wolf bound. For deg , we use Clifford's theorem to give a simple lower bound on the state complexity of . We then derive two further lower bounds on the state space dimensions of in terms of the gonality sequence of . (The gonality sequence is known for many of the function fields of interest for defining geometric Goppa codes.) One of the gonality bounds uses previous results on the generalised weight hierarchy of and one follows in a straightforward way from first principles; often they are equal. For Hermitian codes both gonality bounds are equal to the DLP lower bound on state space dimensions. We conclude by using these results to calculate the DLP lower bound on state complexity for Hermitian codes.     

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.     

Brauer Diagrams, Updown Tableaux and Nilpotent Matrices

We interpret geometrically a variant of the Robinson-Schensted correspondence which links Brauer diagrams with updown tableaux, in the spirit of Steinberg's result [32] on the original Robinson-Schensted correspondence. Our result uses the variety of all where is a complete flag in is a nondegenerate alternating bilinear form on and N is a nilpotent element of the Lie algebra of the simultaneous stabilizer of both and instead of Steinberg's variety of where are two complete flags in and N is a nilpotent element of the Lie algebra of the simultaneous stabilizer of both .     

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.     

Bernstein-Type Theorems and Uniqueness Theorems

Let be an entire function of finite type with respect to finite order and let be a subset of an open cone in a certain n-dimensional subspace (the smaller , the sparser ). We assume that this cone contains a ray 0} \right\}$$ " align="middle" border="0"> . It is shown that the radial indicator of at any point may be evaluated in terms of function values at points of the discrete subset . Moreover, if tends to zero fast enough as over , then this function vanishes identically. To prove these results, a special approximation technique is developed. In the last part of the paper, it is proved that, under certain conditions on and , which are close to exact conditions, the function bounded on is bounded on the ray.     

Groupe modulaire, fractions continues et approximation diophantienne en caractéristique p

The aim of this paper is to give a geometric interpretation of the continued fraction expansion in the field of formal Laurent series in X ^–1 over , in terms of the action of the modular group on the Bruhat–Tits tree of , and to deduce from it some corollaries for the diophantine approximation of formal Laurent series in X ^–1 by rational fractions in X.     

Joint Approximations of Distributions in Banach Spaces

For a given homogeneous elliptic partial differential operator with constant complex coefficients, two Banach spaces and of distributions in , and compact sets and in , we study joint approximations in the norms of the spaces and (the spaces of Whitney jet-distributions) by the solutions of the equation in neighborhoods of the set . We obtain a localization theorem, which, under certain conditions, allows one to reduce the above-cited approximation problem to the corresponding separate problems in each of the spaces.     

Tissus linéaires et théorèmes d'algébrisation de type Abdel-inverse et Reiss-inverse

A d-web in ( ,0) is given by d complex analytic foliations of codimension one in ( ,0) which are in general position. A d-web in ( ,0) is linear if all the leaves are (pieces of) hyperplanes in and is algebraic if it is associated, by duality, to a nondegenerate algebraic curve in of degree d. We characterize linear webs in ( ,0). We give explicit conditions under which a linear d-web in ( ,0) is algebraic and we obtain equations for in this case. Some related problems are discussed and some questions are posed.