k-regular factors and semi-k-regular factors in bipartite graphs

LetG be a graph, andk1 an integer. LetU be a subset ofV(G), and letF be a spanning subgraph ofG such that deg _F (x)=k for allx V(G)–U. If deg _F (x)k for allxU, thenF is called an upper semi-k-regular factor with defect setU, and if deg _F (x)k for allxU, thenF is called a lower semi-k-regular factor with defect setU. Now letG=(X, Y;E(G)) be a bipartite graph with bipartition (X,Y) such that X=Yk+2. We prove the following two results.(1) Suppose that for each subsetU ₁X such that U ₁=max{k+1, X+1/2},G has an upper semi-k-regular factor with defect setU ₁Y, and for each subsetU ₂Y such that U ₂=max{k+1, X+1/2},G has an upper semi-k-regular factor with defect setXU ₂. ThenG has ak-factor.(2) Suppose that for each subsetU ₁X such that U ₁=X–1/k+1,G has a lower semi-k-regular factor with defect setU ₁Y, and for each subsetU ₂Y such that U ₂=X–1/k+1,G has a lower semi-k-regular factor with defect setXU ₂. ThenG has ak-factor.     

Application of a computer to the proof of a conjecture of Minkowski in the geometry of numbers

A computer-assisted proof is given of Minkowski's conjecture on the critical determinant of the region x^p+y^p<1 in the cases 1.03p 1.9745, p2.40, p2.577.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 71, pp. 163–180, 1977.     

On the optimal mapping of distributions

We consider the problem of mappingXY, whereX andY have given distributions, so as to minimize the expected value of X–Y². This is equivalent to finding the joint distribution of the random variable (X, Y), with specified marginal distributions forX andY, such that the expected value of X–Y² is minimized. We give a sufficient condition for the minimizing joint distribution and supply numerical results for two special cases.     

The product of finitely based varieties of lattice-ordered groups

The question as to whether a product of two finitely based varieties of lattice-ordered groups is finitely based is considered. It is proved that varieties and are finitely based; here is a variety of lattice-ordered groups defined by identities [x ⁿ,y ⁿ] =e and [[x,y] z, [x ₁,y ₁] z ₁] =e; is a variety of lattice-ordered nilpotent groups of class s, defined by an identity [x ₁,x ₂,...,x _(s+1)] =e; V is an arbitrary finitely based variety of lattice-ordered groups. Translated fromAlgebra i Logika, Vol. 33, No. 3, pp. 255–263, May–June, 1994.Supported by the Russian Foundation for Fundamental Research, grant No. 93-011-1524.     

A symmetry problem in the calculus of variations

Let be a ball in ^N, centered at zero, and letu be a minimizer of the nonconvex functional over one of the classesC _M := {w W _loc ^1, () 0 w(x) M in,w concave} orE _M := {w W _loc ^1,2 () 0 w(x) M in,w 0 inL()}of admissible functions. Thenu is not radial and not unique. Therefore one can further reduce the resistance of Newton's rotational body of minimal resistance through symmetry breaking.     

Existence of solutions for the Navier-Stokes equations,having an infinite dissipation of energy,in a class of domains with noncompact boundaries

In the domain ³ with two exits at infinity, ₁ = {x:x<g ₁(x ₃),x ₃ > 2} and ₂ = {x:0<x ₃<g ₃(x), x>2}, one investigates the stationary system of Navier-Stokes equations under the boundary condition. One proves existence and uniqueness theorems for the solution of this problem with an infinite Dirichlet integral, under a given flow of the velocity vector across the cross sections of the exits at infinity. As an example one considers the case wheng _i(t) 1.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 110, pp. 180–202, 1981.     

Uniqueness of Nelson's Diffusions II: Infinite Dimensional Setting and Applications

Under mild condition on the modulus = of the time independent wave function , we prove that the generalized Schrödinger operator = + 2 (, ·)/ (or the generator of Nelson's diffusion) defined on a good space of test-functions on a general Polish space, generates a unique semigroup of class (C _o) in L ¹. This result reinforces the known results on the essential Markovian self-adjointness in different contexts and extends our previous works in the finite dimensional Euclidean space setting. In particular it can be applied to the ground or excited state diffusion associated with an usual Schr\"odinger operator , and to stochastic quantization of several Euclidean quantum fields.     

Metrics with finite sets of primitive extensions

In this paper, we give a complete characterization for the class of rational finite metrics with the property that the set () of primitive extensions of is finite. Here, for a metric on a setT, a positive extensionm of to a setV T is calledprimitive if none of the convex combinations of other extensions of toV is less than or equal tom. Our main theorem asserts that the following the properties are equivalent: (i) () is finite; (ii) Up to an integer factor, is a submetric of the path metric d ^H of a graphH with |(d ^H )=1; (iii) A certain bipartite graph associated with contains neither isometrick-cycles withk6 nor induced subgraphsK _3,3 ^– . We then show that () is finite if and only if the dimension of the tight span of is at most two. We also present other results, discuss applications to multicommodity flows, and raise open problems.This research was supported by grant 97-01-00115 from the Russian Foundation of Basic Research and a grant from the Sonderforschungsbereich 343, Bielefeld Universität, Bielefeld, Germany.     

A representation of symmetric functions in Carleman-Gevrey spaces

For a symmetric function t(x)(x^d) one investigates the representation, where _j(x) is the elementary symmetric polynomial of degree j. Let be the closure of the domain in ^d, let be a numerical sequence such that (n) does not decrease, let be the Carleman-Gevrey space, i.e. the collection of functions (n+1)/(n) such that for any bounded subdomain there exists a constant tC() with which one has the inequality _x t(x)H⁺¹!() (x*#x03A9;'). Let S be the image of ^d under the mapping x(₁(x), ..., _d(x)). One proves the following theorem: For any tk(^d) there exists such that, if and only if (n)(nd)ⁿ⁺¹, where is some positive number, independent of n.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 149, pp. 116–126, 1986.     

A priori estimates for solutions of nonlinear second-order elliptic equations

We consider classes of elliptic equations of the form (x,u,u D ² u)=0 for the solutions of which one establishes local and global a priori estimates for D ² u=. In particular, one investigates the Monge-Ampere equation, and for its convex solutions one constructs a local and a global estimate for D ² u and a local estimate for.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 59, pp. 31–59, 1976.     

Constrained normalization of Hamiltonian systems and perturbed Keplerian motion

Summary Consider a Hamiltonian system (H, _2n ,). LetM be a symplectic submanifold of (_2n ,). The system (H, _2n ,) constrained toM is (HM, M, M). In this paper we give an algorithm which normalizes the system on _2n in such a way that restricted toM we have normalized the constrained system. This procedure is then applied to perturbed Kepler systems such as the lunar problem and the main problem of artificial satellite theory.

---

Zusammenfassung Wir betrachten ein Hamiltonisches System (H, _2n ,). SeiMein symplectisches Submanifold von (_2n ,). Das System (H, _2n ,), aufM beschränkt, ist (HM,M,M). In der vorliegenden Arbeit wird ein Algorithmus vorgeschlagen, der dieses System so auf _2n normalisiert, daß das aufM beschränkte System auch normalisiert ist. Dieser Algorithmus wird dann auf gestörte Keplersysteme, wie z. B. das Hill-sche Mondproblem und das Hauptproblem der Theorie der künstlichen Satelliten, angewendet.

     

Mouvement brownien et formule de Tanaka en analyse

In our previous paper [5], we have obtained a decomposition of f, where f is a function defined on R ^d , that is analogous to the one proved by H. Tanaka in the early sixties for Brownian martingales (the so-called Tanaka formula). The original proofs use purely analytic methods (e.g. the Calderón–Zygmund theory, etc.). In this paper, we give a new proof of our `Tanaka formula in analysis, that is based on probabilistic arguments. The main tools here are Brownian motion, stochastic calculus and Burkholder–Gundy inequalities for martingales. These methods allow us to improve somewhat our previous results, by proving that some significant constants do not depend on the dimension d.     

Combinatorics and flexure

Combinatorial identities, trigonometric formulas, together with complex variable techniques are used to derive exact and closed expressions for the six flexure functions of certain isotropic cylinders under flexure. The cross sections are bounded either by the closed curvesr=a cosⁿ (/n) (–<) or the closed curvesr=asin(/n)ⁿ(–<), wheren isa positive integer (n>1).

---

Résumé Des identiteés combinatoires et des formules trigonométriques avec des techniques de variables complexes sont utilisées pour dériver des expressions exactes et simples pour les six fonctions de flexion de quelques cylindres isotropiques. Les sections sont limitées par les courbes ferméesr=a cosⁿ /n(–) et les courbesr=asin/nⁿ(–) où est un entier positif (n>1).

     

Events correlated with respect to every subposet of a fixed poset

Posets are said to be (positively) correlated with respect to a third posetR onX (we writeA _R B) ifP(AR) P(AR B). HereP(CR) is the probability that a randomly chosen linear extension ofR is also a linear extension ofC. We classify posetsR onX such that(x, y) _s (u, v) holds for all posetsS onX which are subposets ofR, wherex, y, u, v are distinct elements ofX. On the way to proving this result, we show when a correlation inequality due to Shepp holds strictly.     

Convolution equations in spaces of sequences with an exponential growth constraint

One describes the sets of the solutions of the convolution equations S*x=0 (on the set or on ₊={n:n0}) in the spaces of sequences of the type X=^X(, ), where. One proves that any 1-invariant subspace E,EX, coincides with KezS for some S and, after the Laplace transform can be represented in the form f·A(K_{(, )}), where K_{(, )}={z:kⁿ}_{n z} ^: }+{xX:x_k=0, k(, ), whose zeros do not accumulate to the circumference ¦¦=.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSP, Vol. 149, pp. 107–115, 1986.The author expresses his sincere gratitude to N. K. Nikol'skii for the formulation of the problem and for his interest in the paper.     

Critical determinant of the region ∣x∣p+∣y∣p<1 (supplement to the paper “on the application of the electronic computer to the proof of a conjecture of Minkowski from the geometry of numbers,” Zap. Nauchn. Sem. Lomi,71, 163–180, 1977)

Supplement to the paper cited in the title. One presents the results of the calculations on an electronic computer, by the method developed in that paper, proving Minkowski's conjecture regarding the critical determinant of the region x^p+y^p<1 for all real numbers p>2.035 and for 1.01p1.99.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 82, pp. 29–32, 1979.     

One-third-integrality in the max-cut problem

Given a graphG = (V, E), the metric polytopeS (G) is defined by the inequalitiesx(F) – x(CF) |F| – 1 for , |F| odd,C cycle ofG, and 0 x _e 1 fore E. Optimization overS (G) provides an approximation for the max-cut problem. The graphG is called 1/d-integral if all the vertices ofS(G) have their coordinates in{i/d 0 i d}. We prove that the class of 1/d-integral graphs is closed under minors, and we present several minimal forbidden minors for 1/3-integrality. In particular, we characterize the 1/3-integral graphs on seven nodes. We study several operations preserving 1/d-integrality, in particular, thek-sum operation for 0 k 3. We prove that series parallel graphs are characterized by the following stronger property. All vertices of the polytopeS (G) {x x u} are 1/3-integral for every choice of 1/3-integral bounds, u on the edges ofG. Research by this author was partially done at CWI in Amsterdam.Research by this author was done at the Institut für Diskrete Mathematik of Bonn, supported by the A. von Humboldt Foundation.Deceased on April 2nd, 1995.     

A sandwich theorem and Hyers—Ulam stability of affine functions

It is shown that two real functionsf andg, defined on a real intervalI, satisfy the inequalitiesf(x + (1 – )y) g(x) + (1 – )g(y) andg(x + (1 – )y) f(x) + (1 – )f(y) for allx, y I and [0, 1], iff there exists an affine functionh: I such thatf h g. As a consequence we obtain a stability result of Hyers—Ulam type for affine functions.     

On the rate of convergence of an unstable solution of a stochastic differential equation

We study the rate of convergence of the process(tT)/T to the processw(t)/ asT , where(t) is a solution of the stochastic differential equationd(t)=a((t))dt+((t))dw(t) Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 46, No. 10, pp. 1424–1427, October, 1994.     

Milnor numbers and the topology of polynomial hypersurfaces

Summary LetF: n + 1 be a polynomial. The problem of determining the homology groupsH _q (F ^–1 (c)), c , in terms of the critical points ofF is considered. In the best case it is shown, for a certain generic class of polynomials (tame polynomials), that for allc,F ^–1 (c) has the homotopy type of a bouquet of - ^c n-spheres. Here is the sum of all the Milnor numbers ofF at critical points ofF and ^c is the corresponding sum for critical points lying onF ^–1 (c). A second best case is also discussed and the homology groupsH _q (F ^–1 (c)) are calculated for genericc. This case gives an example in which the critical points at infinity ofF must be considered in order to determine the homology groupsH _q (F ^–1 (c)).