Klein polyhedra for the fourth extremal cubic form

Davenport and Swinnerton-Dyer found the first 19 extremal ternary cubic formsg _i; they have the same meaning as the familiar Markov forms in the binary quadratic case. The Klein polyhedra for the formsg ₁,g ₂,g ₃ were recently computed by Bryuno and Parusnikov. The same authors computed the convergents for certain matrix generalizations of the continued fraction algorithm and studied their arrangement with respect to the Klein polyhedra. Here we consider similar problems for the fourth formg ₄. Namely, the Klein polyhedra forg ₄ and the conjugate formg ₄* are computed. They turn out to be essentially different. Their periods and fundamental domains are found. The matrix algorithm expansions of the vectors of these forms are calculated. Translated fromMatematicheskie Zametki, Vol. 67, No. 1, pp. 110–128, January, 2000.     

Klein polyhedra for three extremal cubic forms

Davenport and Swinnerton-Dyer found the first 19 extremal ternary cubic forms g _i, which have the same meaning as the well-known Markov forms in the binary quadratic case. Bryuno and Parusnikov recently computed the Klein polyhedra for the forms g ₁ – g ₄. They also computed the convergents for various matrix generalizations of the continued fractions algorithm for multiple root vectors and studied their position with respect to the Klein polyhedra. In the present paper, we compute the Klein polyhedra for the forms g ₅, – g ₇ and the adjoint form g ₇ ^* . Their periods and fundamental domains are found and the expansions of the multiple root vectors of these forms by means of the matrix algorithms due to Euler, Jacobi, Poincaré, Brun, Parusnikov, and Bryuno, are computed. The position of the convergents of the continued fractions with respect to the Klein polyhedron is used as a measure of quality of the algorithms. Eulers and Poincarés algorithms proved to be the worst ones from this point of view, and the Bryuno one is the best. However, none of the algorithms generalizes all the properties of continued fractions.Translated from Matematicheskie Zametki, vol. 77, no. 4, 2005, pp. 566–583.Original Russian Text Copyright © 2005 by V. I. Parusnikov.This revised version was published online in April 2005 with a corrected issue number.     

On rigidity and analytic inflexibility of surfaces of negative Gaussian curvature under a given direction of displacement of boundary points

We study the infinitesimal bendings of first and second order of regular (classC ²) surfaces of negative Gaussian curvature, which are bounded either a) by four asymptotic linesg ₁,g ₂,g ₁ , andg ₂ , or b) by two asymptotic linesg ₁ andg ₂ and a lineg which nowhere has asymptotic directions, under the assumption that connections are imposed on the surface permitting displacement of the points of the linesg ₁ andg ₂ (in the first case) and the lineg (in the second) in a constant direction.Translated from Ukrainskií Geometricheskií Sbornik, Issue 28, 1985, pp. 82–89.     

Generalizations of Slater's constraint qualification for infinite convex programs

In this paper we study constraint qualifications and duality results for infinite convex programs (P) = inf{f(x): g(x) – S, x C}, whereg = (g ₁,g ₂) andS = S ₁ ×S ₂,S _i are convex cones,i = 1, 2,C is a convex subset of a vector spaceX, andf andg _i are, respectively, convex andS _i -convex,i = 1, 2. In particular, we consider the special case whenS ₂ is in afinite dimensional space,g ₂ is affine andS ₂ is polyhedral. We show that a recently introduced simple constraint qualification, and the so-called quasi relative interior constraint qualification both extend to (P), from the special case thatg = g ₂ is affine andS = S ₂ is polyhedral in a finite dimensional space (the so-called partially finite program). This provides generalized Slater type conditions for (P) which are much weaker than the standard Slater condition. We exhibit the relationship between these two constraint qualifications and show how to replace the affine assumption ong ₂ and the finite dimensionality assumption onS ₂, by a local compactness assumption. We then introduce the notion of strong quasi relative interior to get parallel results for more general infinite dimensional programs without the local compactness assumption. Our basic tool reduces to guaranteeing the closure of the sum of two closed convex cones.     

Sequences of rational torsions on abelian varieties

Summary We address the question of how fast the available rational torsion on abelian varieties over increases with dimension. The emphasis will be on the derivation of sequences of torsion divisors on hyperelliptic curves. Work of Hellegouarch and Lozach (and Klein) may be made explicit to provide sequences of curves with rational torsion divisors of orders increasing linearly with respect to genus. The main results in §2) are applications of a new technique which provide sequences of hyperelliptic curves for all torsions in an interval [a _g ,a _g +b _g ]] wherea _g is quadratic ing andb _g is linear ing. As well as providing an improvement from linear to quadratic, these results provide a wide selection of torsion orders for potential use by those involved in computer integration. We conclude by considering possible techniques for divisors of non-hyperelliptic curves, and for general abelian varieties.     

Curvature identities for normal manifolds of killing type

We present two curvature identities and study the corresponding classesR ₁ andR ₂ of normal manifolds of Killing type. Translated fromMatematicheskie Zametki, Vol. 62, No. 3, pp. 351–362, September, 1997. Translated by S. S. Anisov     

Jacobi matrices for sums of weight functions

Orthogonal polynomials are conveniently represented by the tridiagonal Jacobi matrix of coefficients of the recurrence relation which they satisfy. LetJ ₁ andJ ₂ be finite Jacobi matrices for the weight functionsw ₁ andw ₂, resp. Is it possible to determine a Jacobi matrix \(\tilde J\) , corresponding to the weight functions \(\tilde w\) =w ₁+w ₂ using onlyJ ₁ andJ ₂ and if so, what can be said about its dimension? Thus, it is important to clarify the connection between a finite Jacobi matrix and its corresponding weight function(s). This leads to the need for stable numerical processes that evaluate such matrices. Three newO(n ²) methods are derived that “merge” Jacobi matrices directly without using any information about the corresponding weight functions. The first can be implemented using any of the updating techniques developed earlier by the authors. The second new method, based on rotations, is the most stable. The third new method is closely related to the modified Chebyshev algorithm and, although it is the most economical of the three, suffers from instability for certain kinds of data. The concepts and the methods are illustrated by small numerical examples, the algorithms are outlined and the results of numerical tests are reported.     

Polynomials with graphs of maximum length

In this paper we find the pairs of functionsg, G (g<G) such that the maximum length of the graph of polynomials of given degree contained betweeng andG is attained on one of the two snakes generated by the functionsg andG. Translated fromMatematicheskie Zametki, Vol. 65, No. 1, pp. 61–69, January, 1999.     

Local linear operators and multicontour solutions of homogeneous coupled map lattices

Theorems are proved establishing a relationship between the spectra of the linear operators of the formA+Ωg _iB_ig_i ⁻¹ andA+B _i, whereg _i∈G, andG is a group acting by linear isometric operators. It is assumed that the closed operatorsA andB _i possess the following property: ‖B _iA⁻¹gB_jA⁻¹‖→0 asd(e,g)→∞. Hered is a left-invariant metric onG ande is the unit ofG. Moreover, the operatorA is invariant with respect to the action of the groupG. These theorems are applied to the proof of the existence of multicontour solutions of dynamical systems on lattices. Translated fromMatematicheskie Zametki, Vol. 65, No. 1, pp. 37–47, January, 1999.     

On the solvability problem for equations with a single coefficient

It is proved that the general solvability problem for equations in a free group is polynomially reducible to the solvability problem for equations of the formw(x ₁, ...,x _n)=g, whereg is a coefficient, i.e., an element of the group, andw(x ₁, ...,x _n) is a group word in the alphabet of unknowns. We prove the NP-completeness of the solvability problem in a free semigroup for equations of the formw(x ₁,...,x _n)=g, wherew(x ₁,...,x _n) is a semigroup word in the alphabet of unknowns andg is an element of a free semigroup. Translated fromMatematicheskie Zametki, Vol. 59, No. 6, pp. 832–845, June, 1996. I wish to express my deep gratitude to S. I. Adyan and A. A. Razborov for the discussion of the present paper and for valuable remarks concerning the exposition. This research was partially supported by the International Science Foundation under grant MUV000.     

On the geometry and trigonometry of homogeneous 3-manifolds with 4-dimensional isometry group

In this article we study the geometry of the family of simply connected homogeneous 3-manifolds (M, g _K,τ ) given as a principal bundle over a 2-manifold of constant curvature such that the curvature form is constant. We give explicit results for the conjugate radius, normal Jacobi fields and the cut locus on (M, g _K,τ ). Moreover, we determine the trigonometry on (M, g _K,τ ) by a complete set of trigonometric laws. The author would like to thank Uwe Abresch for his advice.     

Riesz transforms for Jacobi expansions

We define Riesz transforms and conjugate Poisson integrals associated with multi-dimensional Jacobi expansions. Under a slight restriction on the type parameters, we prove that these operators are bounded in L ^p , 1 < p < ∞, with constants independent of the dimension. Our tools are suitably defined g-functions and Littlewood-Paley-Stein theory, involving the Jacobi-Poisson semigroup and modifications of it. Research of both authors supported by the European Commission via the Research Training Network “Harmonic Analysis and Related Problems”, contract HPRN-CT-2001-00273-HARP. The first-named author was also supported by MNiSW Grant N201 054 32/4285.     

Packing Arrays and Packing Designs

A packing array is a b × k array, A with entriesa _i,j from a g-ary alphabet such that given any two columns,i and j, and for all ordered pairs of elements from a g-ary alphabet,(g ₁, g ₂), there is at most one row, r, such thata _r,i = g ₁ anda _r,j = g ₂. Further, there is a set of at leastn rows that pairwise differ in each column: they are disjoint. A central question is to determine, forgiven g, k and n, the maximum possible b. We examine the implications whenn is close to g. We give a brief analysis of the case n = g and showthat 2g rows is always achievable whenever more than g exist. We give an upper bound derivedfrom design packing numbers when n = g – 1. When g + 1 k then this bound is always at least as good as the modified Plotkin bound of [12]. When theassociated packing has as many points as blocks and has reasonably uniform replication numbers, we show thatthis bound is tight. In particular, finite geometries imply the existence of a family of optimal or near optimalpacking arrays. When no projective plane exists we present similarly strong results. This article completelydetermines the packing numbers, D(v, k, 1), when .     

Every positive integer is the Frobenius number of an irreducible numerical semigroup with at most four generators

Letg be a positive integer. We prove that there are positive integersn ₁,n ₂,n ₃ andn ₄ such that the semigroupS=(n ₁,n ₂,n ₃,n ₄) is an irreducible (symmetric or pseudosymmetric) numerical semigroup with g(S)=g. This work has been supported by the project BFM2000-1469.     

Modular forms and differential operators

In 1956, Rankin described which polynomials in the derivatives of modular forms are again modular forms, and in 1977, H Cohen defined for eachn ≥ 0 a bilinear operation which assigns to two modular formsf andg of weightk andl a modular form [f, g]_n of weightk +l + 2n. In the present paper we study these “Rankin-Cohen brackets” from two points of view. On the one hand we give various explanations of their modularity and various algebraic relations among them by relating the modular form theory to the theories of theta series, of Jacobi forms, and of pseudodifferential operators. In a different direction, we study the abstract algebraic structure (“RC algebra”) consisting of a graded vector space together with a collection of bilinear operations [,]_n of degree + 2n satisfying all of the axioms of the Rankin-Cohen brackets. Under certain hypotheses, these turn out to be equivalent to commutative graded algebras together with a derivationS of degree 2 and an element Φ of degree 4, up to the equivalence relation (∂,Φ) ~ (∂ - ϕE, Φ - ϕ² + ∂(ϕ)) where ϕ is an element of degree 2 andE is the Fuler operator (= multiplication by the degree). Dedicated to the memory of Professor K G Ramanathan     

Sails and Hilbert bases

A Klein polyhedron is the convex hull of the nonzero integral points of a simplicial coneC⊂ ℝⁿ. There are relationships between these polyhedra and the Hilbert bases of monoids of integral points contained in a simplicial cone. In the two-dimensional case, the set of integral points lying on the boundary of a Klein polyhedron contains a Hilbert base of the corresponding monoid. In general, this is not the case if the dimension is greater than or equal to three (e.g., [2]). However, in the three-dimensional case, we give a characterization of the polyhedra that still have this property. We give an example of such a sail and show that our criterion does not hold if the dimension is four. CEREMADE, University Paris 9. Translated from Funktsional'nyi Analiz i Ego Prilozheniya, Vol. 34, No. 2, pp. 43–49, April–June, 2000. Translated by J.-O. Moussafir     

Some properties of rational approximations of degree (k, 1) in the hardy spaceH 2(D)

We prove that the well-known interpolation conditions for rational approximations with free poles are not sufficient for finding a rational function of the least deviation. For rational approximations of degree (k, 1), we establish that these interpolation conditions are equivalent to the assertion that the interpolation pointc is a stationary point of the functionk(c) defined as the squared deviation off from the subspace of rational functions with numerator of degree k and with a given pole 1/¯c. For any positive integersk ands, we construct a functiong H₂(D) such thatR _k ,1(g)=R _k +s,1(g) > 0. whereR _k ,1(g) is the least deviation ofg from the class of rational function of degree (k, 1).Translated fromMatematicheskie Zametki, Vol. 64, No. 2, pp. 251–259, August, 1998.The author is keenly grateful to N. S. Vyacheslavov, E. P. Dolzhenko, and V. G. Zinov for useful discussions.     

On a Banach space approximable by Jacobi polynomials

Let X represent either the space C[-1,1] L _p ^(α,β) (w), 1 ≦ p < ∞ on [-1, 1]. Then Xare Banach spaces under the sup or the p norms, respectively. We prove that there exists a normalized Banach subspace X ¹ _αβ of Xsuch that every f ∈ X ¹ _αβ can be represented by a linear combination of Jacobi polynomials to any degree of accuracy. Our method to prove such an approximation problem is Fourier–Jacobi analysis based on the convergence of Fourier–Jacobi expansions. This revised version was published online in June 2006 with corrections to the Cover Date.     

Generic polynomials for transitive subgroups of the group S 4 over fields of characteristic 2

Generic polynomials for the symmetric group S₄, the Klein group V₄, the cyclic group of order 4, the dihedral group D₄, and the alternating group A₄ over fields of characteristic 2 are described explicitly. Bibliography: 5 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 330, 2006, pp. 247–258.     

On some congruence with application to exponential sums

We will study the solution of a congruence,x ≡g ^1/2)ωg(2 ⁿ ) mod 2 ⁿ , depending on the integersg andn, where ω _g (2 ⁿ ) denotes the order ofg modulo 2 ⁿ . Moreover, we introduce an application of the above result to the study of an estimation of exponential sums.