Nonuniqueness Sequences for Weighted Algebras of Holomorphic Functions in the Unit Circle

Suppose that is a system of continuous subharmonic functions in the unit disk and is the class of holomorphic functions f in such that log|f(z)| ≤ B _f p _f (z) + C _f , z ∈ , where B _f and C _f are constants and p _f ∈ . We obtain sufficient conditions for a given number sequence Λ = { λ_n} ⊂ to be a subsequence of zeros of some nonzero holomorphic function from , i.e., Λ is a nonuniqueness sequence for .__________Translated from Matematicheskie Zametki, vol. 77, no. 5, 2005, pp. 775–787.Original Russian Text Copyright ©2005 by L. Yu. Cherednikova.     

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.     

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.     

Spectral-Null Codes and Null Spaces of Hadamard Submatrices

Codes of length 2 ^m over {1, -1} are defined as null spaces of certain submatrices of Hadamard matrices. It is shown that the codewords of all have an rth order spectral null at zero frequency. Establishing the connection between and the parity-check matrix of Reed-Muller codes, the minimum distance of is obtained along with upper bounds on the redundancy of . An efficient algorithm is presented for encoding unconstrained binary sequences into .     

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 .     

A Theorem Concerning Nets Arising from Generalized Quadrangles with a Regular Point

Suppose is a generalized quadrangle (GQ) of order , with a regular point. Then there is a net which arises from this regular point. We prove that if such a net has a proper subnet with the same degree as the net, then it must be an affine plane of order t. Also, this affine plane induces a proper subquadrangle of order t containing the regular point, and we necessarily have that . This result has many applications, of which we give one example. Suppose is an elation generalized quadrangle (EGQ) of order , with elation point p. Then is called a skew translation generalized quadrangle (STGQ) with base-point p if there is a full group of symmetries about p of order t which is contained in the elation group. We show that a GQ of order s is an STGQ with base-point p if and only if p is an elation point which is regular.     

Extremal Self-Dual Codes over \mathbb{F} 2 × \mathbb{F} 2

In this paper, it is shown that extremal (Hermitian) self-dual codes over ₂ × ₂ exist only for lengths 1, 2, 3, 4, 5, 8 and 10. All extremal self-dual codes over ₂ × ₂ are found. In particular, it is shown that there is a unique extremal self-dual code up to equivalence for lengths 8 and 10. Optimal self-dual codes are also investigated. A classification is given for binary [12, 7, 4] codes with dual distance 4, binary [13, 7, 4] codes with dual distance 4 and binary [13, 8, 4] codes with dual distance 4.     

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

Lattices of interpretability types of varieties

Let be the set of all primes, the field of all algebraic numbers, and Z the set of square-free natural numbers. We consider partially ordered sets of interpretability types such as , and , where AD is a variety of -divisible Abelian groups with unique taking of the pth root _p(x) for every p , is a variety of -modules over a normal field , contained in , and G_n is a variety of n-groupoids defined by a cyclic permutation (12 ...n). We prove that , and are distributive lattices, with and where ub and ub_f are lattices (w.r.t. inclusion) of all subsets of the set and of finite subsets of , respectively.Deceased.__________Translated from Algebra i Logika, Vol. 44, No. 2, pp. 198–210, March–April, 2005.     

The Xedni Calculus and the Elliptic Curve Discrete Logarithm Problem

Let be an elliptic curve defined over a finite field, and let be two points on E. The Elliptic Curve Discrete Logarithm Problem (ECDLP) asks that an integer m be found so that S=mT in . In this note we give a new algorithm, termed the Xedni Calculus, which might be used to solve the ECDLP. As remarked by Neal Koblitz, the Xedni method is also applicable to the classical discrete logarithm problem for and to the integer factorization problem.     

Brownian Martingales and Some New Results on Interpolation of Hardy Spaces

Let H₁( ) be the usual Hardy space on . We show that the couple (H₁( ), L( ) is a Calderón couple. This result immediately follows from the following stronger one: Given any fH₁( ) +L( ) there exist two linear operators U and V satisfying the properties: (i) Uf=Nf (Nf being the non-tangential maximal function of f) and U is contractive from H₁( ) to L₁( ) and also from L( ) to L( ); (ii) V(Nf)=f, V is similtaneously bounded from L₁( ) to H₁( ) and from L( ) to L( ) and the norms of V on these spaces are controlled by a universal constant. We also have similar results on the couple (L_p( ), BMO ( )) for every 1相似文献   

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

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.     

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.     

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.     

Zeros of H ∞-Functions on Hyperplanes in \mathbb{B} n

Let ⁿ be the unit ball in ℂⁿ, n ≥ 2. Let T_α = {z ∈ ⁿ : (z, a) = |a|²} for a ∈ ⁿ and denote for a discrete set A in ⁿ. We find a sharp necessary condition for a set A to be a part of the zero-set for a function in H^∞( ⁿ). Bibliography 4 titles.__________Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 303, 2003, pp. 272–278.     

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.     

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.     

A Uniqueness Theorem for the Dual Problem Associated to a Variational Problem with Linear Growth

Uniqueness is proved for solutions of the dual problem that is associated with the minimum problem among the mappings with prescribed Dirichlet boundary data and for smooth strictly convex integrands f of linear growth. No further assumptions on f or its conjugate function are imposed, in particular, is not assumed to be strictly convex. A special solution of the dual problem is seen to be a mapping into the image of , which immediately implies uniqueness. Bibliography: 13 titles.     

Self-dual bases in\mathbb{F}_{q^n }

We characterize weakly self-dual bases of the field extension over , examine the existence of weakly self-dual polynomial bases, and use duality to analyze normal basis multiplication.