首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 46 毫秒
1.
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 n,y n] =e and [[x,y] z, [x 1,y 1] z 1] =e; is a variety of lattice-ordered nilpotent groups of class s, defined by an identity [x 1,x 2,...,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.  相似文献   

2.
A set X of boundary points of a (possibly unbounded) convex body KE d illuminating K from within is called primitive if no proper subset of X still illuminates K from within. We prove that for such a primitive set X of an unbounded, convex set KE d (distinct from a cone) one has X=2 if d=2, X6 if d=3, and that there is no upper bound for X if d4.  相似文献   

3.
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 xp+yp<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.  相似文献   

4.
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 1X such that U 1=max{k+1, X+1/2},G has an upper semi-k-regular factor with defect setU 1Y, and for each subsetU 2Y such that U 2=max{k+1, X+1/2},G has an upper semi-k-regular factor with defect setXU 2. ThenG has ak-factor.(2) Suppose that for each subsetU 1X such that U 1=X–1/k+1,G has a lower semi-k-regular factor with defect setU 1Y, and for each subsetU 2Y such that U 2=X–1/k+1,G has a lower semi-k-regular factor with defect setXU 2. ThenG has ak-factor.  相似文献   

5.
A computer-assisted proof is given of Minkowski's conjecture on the critical determinant of the region xp+yp<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.  相似文献   

6.
We consider the problem of mappingXY, whereX andY have given distributions, so as to minimize the expected value of XY2. 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 XY2 is minimized. We give a sufficient condition for the minimizing joint distribution and supply numerical results for two special cases.  相似文献   

7.
[Zho2] {x n } , n 0 n .

Supported in part by an NSERC Postdoctoral Fellowship and a CRF grant of University of Alberta.  相似文献   

8.
Let G be a finite subgroup of GL(V), where V is a finite-dimensional vector space over the field K and char KG. We show that if the algebra of invariants K(V)G of the symmetric algebra of V is a complete intersection then K(V)H is also a complete intersection for all subgroups H of G such that H={ Gv (v)=v for all v VH}.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 116, pp. 63–67, 1982.  相似文献   

9.
For a symmetric function t(x)(xd) 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+1!() (x*#x03A9;'). Let S be the image of d under the mapping x(1(x), ..., d(x)). One proves the following theorem: For any tk(d) there exists such that, if and only if (n)(nd)n+1, 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.  相似文献   

10.
We obtain the sharp order of growth of the eigenvalue distribution function for the operator in the anisotropic Sobolev space , generated by the quadratic form Q u2 d, whereQ2 is the unit square and is a probability self-affine fractal measure onQ. The geometry of Supp should be in a certain way consistent with the parameterst 1 ,t 2 .  相似文献   

11.
In the domain 3 with two exits at infinity, 1 = {x:x<g 1(x 3),x 3 > 2} and 2 = {x:0<x 3<g 3(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.  相似文献   

12.
Let a,b be given, multiplicatively independent positive integers and let >0. In a recent paper jointly with Y. Bugeaud we proved the upper bound exp(n) for g.c.d.(an–1, bn–1); shortly afterwards we generalized this to the estimate g.c.d.(u–1,v–1)v) for multiplicatively independent S-units u,vZ. In a subsequent analysis of those results it turned out that a perhaps better formulation of them may be obtained in terms of the language of heights of algebraic numbers. In fact, the purposes of the present paper are: to generalize the upper bound for the g.c.d. to pairs of rational functions other than {u–1,v–1} and to extend the results to the realm of algebraic numbers, giving at the same time a new formulation of the bounds in terms of height functions and algebraic subgroups of Gm2.  相似文献   

13.
Given a closed convex set K in Rn; a vector function F:K×K Rm; a closed convex (not necessarily pointed) cone P(x) in m with non-empty interior, PP(x) Ø, various existence results to the problemfind xK such that F(x,y)- int P(x) y K under P(x)-convexity/lower semicontinuity of F(x,) and pseudomonotonicity on F, are established. Moreover, under a stronger pseudomonotonicity assumption on F (which reduces to the previous one in case m=1), some characterizations of the non-emptiness of the solution set are given. Also, several alternative necessary and/or sufficient conditions for the solution set to be non-empty and compact are presented. However, the solution set fails to be convex in general. A sufficient condition to the solution set to be a singleton is also stated. The classical case P(x)=m + is specially discussed by assuming semi-strict quasiconvexity. The results are then applied to vector variational inequalities and minimization problems. Our approach is based upon the computing of certain cones containing particular recession directions of K and F.  相似文献   

14.
For >0, 2,4,6,... on the set of those Borel measures on , such that xpd(x)<, one introduces a metric, characterizing the nearness of the convolutions xp* and xp*. From the convergence of a sequence of probability measures in this metric there follows its convergence in the Kantorovich-Rubinshtein metric. From here one derives theorems on the approximation of -isometries: if H is a finite-dimensional subspace in Lp, then there exists a continuous function H(), such that for any linear -isometric operator THLp there exists a linear isometry UH Lp, such that T–U<H().Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 157, pp. 151–156, 1987.  相似文献   

15.
{p mn } - 00>0, (1, 1) (1.1) (1.2). {s mn } J p - ( bJ p -lims mn =), (1.3) 0<x,y<1 p s (, )/p(x, y) x, y 1-. {r mn } - , (1.5) 0<, <1. N rp - , (1.6). , bJ p -lims mn = bJ q -lim(N rps) mn =. J p - . , .  相似文献   

16.
The existence and the uniqueness of a weak solution of the Cauchy problem, for a second-order semilinear pseudodifferential hyperbolic equation on a smooth Riemannian manifold (of dimension n3) without boundary, is proved. In particular, for the equation ü–u+up–1=0 one has unique solvability for the Cauchy problem when 1(n+2)/(n–2).Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akademii Nauk SSSR, Vol. 182, pp. 38–85, 1990.  相似文献   

17.
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 cosn (/n) (–<) or the closed curvesr=asin(/n)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 cosn /n(–) et les courbesr=asin/nn() où est un entier positif (n>1).
  相似文献   

18.
In this paper, we describe a natural implementation of the classical logarithmic barrier function method for smooth convex programming. It is assumed that the objective and constraint functions fulfill the so-called relative Lipschitz condition, with Lipschitz constantM>0.In our method, we do line searches along the Newton direction with respect to the strictly convex logarithmic barrier function if we are far away from the central trajectory. If we are sufficiently close to this path, with respect to a certain metric, we reduce the barrier parameter. We prove that the number of iterations required by the algorithm to converge to an -optimal solution isO((1+M 2) log) orO((1+M 2)nlog), depending on the updating scheme for the lower bound.on leave from Eötvös University, Budapest, Hungary.  相似文献   

19.
Wu  Liming 《Potential Analysis》2000,13(3):269-301
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 1. 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.  相似文献   

20.
We give a minimal triangulation : S 12 3 S 4 2 of the Hopf map h:S 3S 2 and use it to obtain a new construction of the 9-vertex complex projective plane.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号