Weight functions on the Kneser graph and the solution of an intersection problem of Sali

LetX, Y be finite sets and suppose thatF is a collection of pairs of sets (F, G),FX,GY satisfying |FF|s, |GG|t and |FF|+|GG|s+t+1 for all (F, G),F, GF. Extending a result of Sali, we determine the maximum ofF.     

Black holes on the plane drawn by a Wiener process

Summary We say that the discD()R ², of radius , located around the origin isp-covered in timeT by a Wiener processW(·) if for anyzD() there exists a 0tT such thatW(t) is a point of the disc of radiusp, located aroundz. The supremum of those 's (0) is studied for which,D() isp-covered inT.     

Limits of certain iterates of Post-Widder operators

The paper is a study of the limiting behaviour of the [n t]-th iterates of the well-known Post-Widder operatorsL _{n, x} used in the real inversion of the Laplace transform. It is shown that the limiting operators constitute a semigroup T _t;t0 of class (C ₀) on a family C _,; , >0 of Banach spaces. Applications of the semigroup structure lead to a pointwise saturation theorem forL _{n, x} and a characterization of convex functions inC _, through an inequality involving the action ofL _{n, x}.     

Maximal inequalities,convexity inequality,and their duality. II

, , . . . [1], , . , , ., , L logL. , , . . . . [5]. , .     

On convergence of function series

, a _n f _n (x) . .     

Exact estimates for partially monotone approximation

f(x) — , - [–1,1], (f, ) — , as— f, . . (- ) (x _i,x _{i+ 1}) (i=0, 1, ...,s–1; =–1,x _s,=1), f(x) . , n=0,1,... _n() , [– 1,1] signf(x) sign _n(x) 0, ¦f(x)– _n(x)¦ C(s) (f, 1/n+1, C(s) s. , - , « » .     

Boundary-value problems for two-dimensional canonical systems

The two-dimensional canonical systemJy=–Hy where the nonnegative Hamiltonian matrix functionH(x) is trace-normed on (0, ) has been studied in a function-theoretic way by L. de Branges in [5]–[8]. We show that the Hamiltonian system induces a closed symmetric relation which can be reduced to a, not necessarily densely defined, symmetric operator by means of Kac' indivisible intervals; of. [33], [34]. The formal defect numbers related to the system are the defect numbers of this reduced minimal symmetric operator. By using de Branges' one-to-one correspondence between the class of Nevanlinna functions and such canonical systems we extend our canonical system from (0, ) to a trace-normed system on which is in the limit-point case at ±. This allows us to study all possible selfadjoint realizations of the original system by means of a boundaryvalue problem for the extended canonical system involving an interface condition at 0.     

The trace to subsets ofR n of Besov spaces in the general case

R ⁿ. , , , F R ⁿ, F , R ⁿ R ⁿ . ^p,q (Rⁿ), >0, 1, q, — ( ) Rⁿ. , ^p,q (Rⁿ) ^F Rⁿ. , q B ^p,q (F), = – (n–)/, >0, — « », ad — F, . , . : , F=R ^d,F— « » F— R ⁿ, « », F. .

---

---

This work has been supported in part by the Swedish Natural Science Research Council.     

On the asymptotic behaviour of first passage times for transient random walk

Summary Let _x denote the time at which a random walk with finite positive mean first passes into (x, ), wherex0. This paper establishes the asymptotic behaviour of Pr { _x >n} asn for fixedx in two cases. In the first case the left hand tail of the step-distribution is regularly varying, and in the second the step-distribution satisfies a one-sided Cramér type condition. As a corollary, it follows that in the first case Pr { _x >n}/Pr{ ₀ >n} coincides with the limit of the same quantity for recurrent random walk satisfying Spitzer's condition, but in the second case the limit is more complicated.     

A priori estimates of the solution of the dirichlet problem for the Monge-ampére equation in weight spaces

One proves that a priori boundedness of the norm of the solution of the problem det(U_xx)=f(x,u,u_x)>>0,u¦=0. The magnitudes of the exponents,() depends on whether the arguments u p occur or not in f (x,u,p).Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 125, pp. 74–90, 1983.     

Interpolation theorems for a family of spanning subgraphs

Let G be a graph with order p, size q and component number . For each i between p – and q, let be the family of spanning i-edge subgraphs of G with exactly components. For an integer-valued graphical invariant if H H is an adjacent edge transformation (AET) implies |(H)-(H^')|1 then is said to be continuous with respect to AET. Similarly define the continuity of with respect to simple edge transformation (SET). Let M _j() and m _j() be the invariants defined by . It is proved that both M _p–() and m _p–(;) interpolate over , if is continuous with respect to AET, and that M _j() and m _j() interpolate over , if is continuous with respect to SET. In this way a lot of known interpolation results, including a theorem due to Schuster etc., are generalized.     

Representations of *-algebras with two generators and polynomial relations

It is shown that all * -algebras with two generators with quadratic relations are tame and a classification of their representations is given. A number of examples of general polynomial relations are analyzed (the algebras here can be either tame or wild).Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova, Akad. Nauk SSSR, Vol. 172, pp. 121–129, 1989.     

Lower central series and derived series of net subgroups of the general linear group

Over a commutative ring R with invertible element 2 and with radical , nets (i.e., tables =(_ij) of ideals _ij such that _{irrj ij}) such that _ii are considered. Such nets are called pseudoradical. The groups of the lower central series and the derived series are explicitly constructed for the corresponding net subgroups G () (of the general linear group GL (n,R)) in terms of .Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 114, pp. 180–186, 1982.     

The embedding of linearly ordered sets

It is shown that if a linearly ordered set B does not contain as subsets sets of order type and ^* then B can be embedded in 2 . We construct an example of a set satisfying the above conditions which cannot be embedded in any 2 if < . Simultaneously we show that for any ordinal, 2 ⁺¹ cannot be embedded in 2 and that there exists at least ₊₁ distinct dense order types of cardinality 2 .Translated from Matematicheskie Zametki, Vol. 11, No. 1, pp. 83–88, January, 1972.In conclusion, I wish to take the opportunity to thank Yu. L. Ershov for kindness and assistance in this work.     

Characterization of regular singular linear systems of difference equations

This paper deals with linear systems of difference equations whose coefficients admit generalized factorial series representations atz=. We are concerned with the behavior of solutions near the pointz= (the only fixed singularity for difference equations). It is important to know whether a system of linear difference equations has a regular singularity or an irregular singularity. To a given system () we can assign a number , called the Moser's invariant of (), so that the system is regular singular if and only if 1. We shall develop an algorithm, implementable in a computer algebra system, which reduces in a finite number of steps the system of difference equations to an irreducible form. The computation ot the number can be done explicitly from this irreducible form.     

О Сходимости метода подобластей

.      

φ-Factors for Function Seminorms

Let (, A, ) be a measure space, a function seminorm on M, the space of measurable functions on , and M the space {f M : (f) < }. Every Borel measurable function : [0, ) [0, ) induces a function : M M by (f)(x) = (|f(x)|). We introduce the concepts of -factor and -invariant space. If is a -subadditive seminorm function, we give, under suitable conditions over , necessary and sufficient conditions in order that M be invariant and prove the existence of -factors for . We also give a characterization of the best -factor for a -subadditive function seminorm when is -finite. All these results generalize those about multiplicativity factors for function seminorms proved earlier.     

Über den algorithmischen Nachweis von Ungleichungen I

We shall develop a method to prove inequalities in a unified manner. The idea is as follows: It is quite often possible to find a continuous functional : ⁿ , such that the left- and the right-hand side of a given inequality can be written in the form (u)(v) for suitable points,v=v(u). If one now constructs a map ^{n n} , which is functional increasing (i.e. for each x ⁿ (which is not a fixed point of ) the inequality (x)<((x)) should hold) one specially gets the chain (u)( u))( ²(u))... ⁿ (u)). Under quite general conditions one finds that the sequence { ⁿ (u)} _n converges tov=v(u). As a consequence one obtains the inequality (u)(v).     

Circularity of Finite Groups without Fixed Points

Let be a fixed point free group given by the presentation where and are relative prime numbers, t = /s and s = gcd( – 1,), and is the order of modulo . We prove that if (1) = 2, and (2) is embeddable into the multiplicative group of some skew field, then is circular. This means that there is some additive group N on which acts fixed point freely, and |((a)+b)((c)+d)| 2 whenever a,b,c,d N, a0c, are such that (a)+b(c)+d.     

Finite checkability for integer rounding properties in combinatorial programming problems

LetA be a nonnegative integral matrix with no zero columns. Theinteger round-up property holds forA if for each nonnegative integral vectorw, the solution value to the integer programming problem min{1 y: yA w, y 0, y integer} is obtained by rounding up to the nearest integer the solution value to the corresponding linear programming problem min{1 y: yA w, y 0}. Theinteger round-down property is similarly defined for a nonnegative integral matrixB with no zero rows by considering max{1 y: yB w, y 0, y integer} and its linear programming correspondent. It is shown that the integer round-up and round-down properties can be checked through a finite process. The method of proof motivates a new and elementary proof of Fulkerson's Pluperfect Graph Theorem.Research partially supported by NSF Grants ENG76-09936 and ENG78-09882.