An infinite dimensional analogue of the Albeverio-Röckner's theorem on Fukushima's conjecture

LetX be the solution of the SDE:dX _t = (X _t)dB _t +b(X _t)dt, with andb C _b (R) such that >0 for some constant , andB a real Brownian motion. Let be the law ofX onE=C([0, 1],R) andk E* – {0}, whereE* is the topological dual space ofE. Consider the classical form: _k (u, v)=u / kv / kd, whereu andv are smooth functions onE. We prove that, if _k is closable for anyk in a dense subset ofE* and if the smooth functions are contained in the domain of the generator of the closure of _k , must be a constant function.     

Existence and construction of Δ1-splines of class Ck on a three-directional mesh

Let ^* be the equilateral triangulation of the plane and let ₁ ^* be the equilateral triangle formed by four triangles of ^*. We study the space of piecewise polynomial functions in C ^k (R ²) with support ₁ ^*, having a sufficiently high degree n and which are invariant with respect to the group of symmetries of ₁ ^*. Such splines are called ₁ ^*-splines. We first compute the dimension of this space in function of n and k. Then, for any fixed k0, we prove the existence of ₁ ^*-splines of class C ^k and minimal degree, but these splines are not unique. Finally, we describe an algorithm computing the Bernstein–Bézier coefficients of these splines.     

Selberg's inequality in arithmetic progressions. II

We obtain an elementary derivation for Selberg's formula related to the function ψ _{r, k} ^* (x; q, ?) for allr, k positive integers.     

An integral-free representation of a line complex with symmetric arrangement of inflection centers

We study complexes ₂ and ₃ with symmetrically situated fourfold inflection centers, two or three of which respectively are infinitely distant on each ray. The class of complexes ₃ turns out to be known. The complex ₂ is new and may involve three arbitrary functions of a single argument. The study of the geometric properties of the complex ₂ culminates in an integral-free representation for it which makes it possible to write out explicitly a solution of the original system of differential equations for the complex.Translated from Ukrainskií Geometricheskií Sbornik, Issue 29, 1986, pp. 125–132.     

BC-type interpolation Macdonald polynomials and binomial formula for Koornwinder polynomials

We consider 3-parametric polynomialsP ^* (x; q, t, s) which replace theA _n-series interpolation Macdonald polynomialsP ^* (x; q, t) for theBC _n-type root system. For these polynomials we prove an integral representation, a combinatorial formula, Pieri rules, Cauchy identity, and we also show that they do not satisfy any rationalq-difference equation. Ass the polynomialsP ^* (x; q, t, s) becomeP ^* (x; q, t). We also prove a binomial formula for 6-parametric Koornwinder polynomials.     

Difference schemes for fourth-order one-dimensional equations with nonlinear boundary condition

A difference scheme is constructed for a boundary-value problem for a one-dimensional biharmonic equation with nonlinear boundary condition. Under the hypothesis that the exact solution of the problem belongs to the Sobolev space W ₂ ^k(),k [2, 4], in the lattice norm L ₂ (), an estimate is obtained of the precision of the difference scheme to O(h^k–1,5).Translated fromVychislitel'naya i Prikladnaya Matematika, No. 69, pp. 43–50, 1989.     

On the exactness of certain inequalities in approximation theory

We prove the following: for every sequence {F_v}, F_v ? 0, F_v > 0 there exists a functionf such that

1. E_n(f)?F_n (n=0, 1, 2, ...) and
2. A_kn^?k? _v=1 ⁿ v^k?1 F_v?1?Ω_k (f, n^?1) (n=1, 2, ...).

     

Packing of partial designs

We say that two hypergraphsH ₁ andH ₂ withv vertices eachcan be packed if there are edge disjoint hypergraphsH ₁ andH ₂ on the same setV ofv vertices, whereH _i is isomorphic toH _i.It is shown that for every fixed integersk andt, wheretk2t–2 and for all sufficiently largev there are two (t, k, v) partial designs that cannot be packed. Moreover, there are twoisomorphic partial (t, k, v)-designs that cannot be packed. It is also shown that for every fixedk2t–1 and for all sufficiently largev there is a (₁,t,k,v) partial design and a (₁,t,k,v) partial design that cannot be packed, where _{1 2}O(v ^k–2t+1 logv). Both results are nearly optimal asymptotically and answer questions of Teirlinck. The proofs are probabilistic.     

The method of geometric progression for finding a minimum of unimodal functions

An asymptotically optimal method for finding a minimal point x^* for a function f(x) C², unimodal on an interval [a_k,b_k], is proposed. This method partitions the intervals _k = b_k – a_k, k = 1, 2, ..., and locates x^* by means of a decreasing geometric progression.Translated from Vychislitel'naya i Prikladnaya Matematika, No. 70, 104–108, 1990.     

Solution of Hadwiger-Levi's Covering Problem for Duals of Cyclic 2k-Polytopes

For a collection C of convex bodies let h(C) be the minimum number m with the property that every element K of C can be covered by m or fewer smaller homothetic copies of K. Denote by C _d ^* the collection of all duals of cyclic d-polytopes, d 2. We show that h(C _2k ^* )=(k +1)2 for any k 2. We also prove the inequalities (d+1) (d+3)/4 h(C _d ^* ) (d+1) 2/2$ for any d 2.     

Rotating flow past an elliptic-cylindrical bump of large aspect ratio

Summary Very slow flow of a rapidly rotating fluid past a right cylindrical obstacle of heightd on one of two co-rotating parallel planes, separated by a distanceh, is studied. The elliptic boundaryvalue problem for the geostrophic flow is formulated quite generally, and solutions are given for an infinitely-long ridge and an elliptic cylinder. A modified Ekman number,E _*v/d ², where is the inverse aspect ratio of the cylinder, characterizes the latter solution. ForE _*<1, the fluid flows around a stagnant Taylor column over the elliptic cylinder; forE _*1, the fluid flows over the cylinder as though it were an infinitely-long ridge;E _*=O(1) shows part of the fluid flowing over, and part around, the cylinder. The drag increases from orderE ^–1/4 to orderE ^–1 asE _* increases from small to large values.

---

Zusammenfassung In dieser Arbeit wird die sehr langsame Strömung in einem rasch rotierenden Fluid untersucht um einen zylindrischen Körper, dessen Höhed die viel kleiner ist als die Distanzh der zwei unendlich ausgedehnten mitrotierenden parallelen Platten, welche das Fluid begrenzen; der Körper sitzt auf der unteren Platte. Eine allgemeine Formulierung des elliptischen Randwertproblems wurde für die geostrophische Strömung angegeben. Lösungen wurden für ein unendlich langes Wehr und einen elliptischen Zylinder gefunden. Eine modifizierte Ekman-Zahl,E _*=v/d ² E, in welcher das reziproke Verhältnis von Länge zu Durchmesser darstellt, charakterisiert die Lösung für den elliptischen Zylinder. WennE _*1, umgeht die Flüssigkeit die stagnierende Taylorsäule, die auf dem elliptischen Zylinder ruht; wennE _*1, geht die Flüssigkeit über den Zylinder, als ob er ein unendlich langes Wehr wäre; wennE _*=0(1), geht ein Teil der Flüssigkeit über den Zylinder und ein anderer um ihn herum. Der Reibungswiderstand erhöht sich von 0(E ^–1/4) zu 0(E ^–1), wennE _* von kleinen zu grossen Werten ansteigt.

     

A Combinatorial Construction for Perfect Deletion-Correcting Codes

By a T ^*(2, k, v)-code we mean a perfect(k-2)-deletion-correcting code of length k over an alphabet ofsize v, which is capable of correcting any combination of up to(k-2) deletions and insertions of letters occured in transmission ofcodewords. In this paper, we provide a combinatorial construction forT ^*(2, k, v-codes. As an application, we show that aT ^*(2, 6, v-code exists for all positive integersv 3 (mod 5), with at most 12 possible exceptions of v. In theprocedure, a result on incomplete directed BIBDs is also established which is ofinterest in its own right.     

Number of no nisomorphic subgraphs in an n-point graph

LetG(n) be the set of all nonoriented graphs with n enumerated points without loops or multiple lines, and let v_k(G) be the number of mutually nonisomorphic k-point subgraphs of G G(n). It is proved that at least |G(n)| (1–1/n) graphs G G(n) possess the following properties: a) for any k [6log₂n], where c=–c log₂c–(1–c)×log₂(1–c) and c>1/2, we havev _k(G) > C _n ^k (1–1/n²); b) for any k [cn + 5 log₂n] we havev _k(G) = C _n ^k . Hence almost all graphs G G(n) containv(G) 2ⁿ pairwise nonisomorphic subgraphs.Translated from Matematicheskie Zametki, Vol. 9, No. 3, pp. 263–273, March, 1971.     

An L p -theory for stochastic integral equations

We investigate the stochastic parabolic integral equation of convolution type

The inclusion of certain classes of functions

For any sequence {N_k} with {N_k} O we find sharp theorems on the inclusion of the classes {f: f l (0, 2),e _k ⁽¹⁾ (f) = O(N_k)¦, whereE _k ⁽¹⁾ (f) is the best approximation (in L) of f by trigonometric polynomials of order no greater than k, in the classL with slowly growing and in the class Lv, 1 <v < .Translated from Matematicheskie Zametki, Vol. 20, No. 6, pp. 835–841, December, 1976.     

∑II∑ threshold formulas

A II formula has the form, where eachL is either a variable or a negated variable. In this paper we study the computation of threshold functions by II formulas. By combining the proof of the Fredman-Komlós bound [5, 10] and a counting argument, we show that fork andn large andkn/2, every II formula computing the threshold functionT _k ⁿ has size at least exp . Fork andn large andkn ^2/3, we show that there exist II formulas for computingT _k ⁿ with size at most exp .     

On rationalized H- and co-H-spaces with an appendix on decomposable H- and co-H-spaces

Let R be a subring of the rationals with 1/2, 1/3R; let S _R ⁿ denote the R-local n-sphere and define _R ⁿ :=S _R ⁿ for n odd, _R ⁿ :=S _R ⁿ for n>0 even. An H-space (resp. a 1-conn. co-H-space) is decomposable over R, if it is homotopy equivalent to a weak product of spaces _R ⁿ (resp. to a wedge of R-local spheres). We prove that, if E is grouplike decomposable of finite type over R, the functor [-,E] is determined on finite dim. complexes by the Hopf algebra M^*(E;R); here M^* denotes the unstable cohomotopy functor of H.J. Baues. If C is cogrouplike decomposable over R, the functor [C,-] is determined on 1-conn. R-local spaces by _*(C) as a cogroup in the category of M-Lie algebras. For R = the functor [-,E] is also determined by the Lie algebra _*(E) and [C,-] by the Berstein coalgebra associated to the comultiplication of C.     

Regressions and monotone chains II: The poset of integer intervals

A regressive function (also called a regression or contractive mapping) on a partial order P is a function mapping P to itself such that (x)x. A monotone k-chain for is a k-chain on which is order-preserving; i.e., a chain x ₁<...ksuch that (x ₁)...(x_k). Let P _nbe the poset of integer intervals {i, i+1, ..., m} contained in {1, 2, ..., n}, ordered by inclusion. Let f(k) be the least value of n such that every regression on P _nhas a monotone k+1-chain, let t(x,j) be defined by t(x, 0)=1 and t(x,j)=x ^t(x,j–1). Then f(k) exists for all k (originally proved by D. White), and t(2,k) < f(K) <t( + _k, k) , where _k 0 as k. Alternatively, the largest k such that every regression on P _nis guaranteed to have a monotone k-chain lies between lg^*(n) and lg^*(n)–2, inclusive, where lg^*(n) is the number of appliations of logarithm base 2 required to reduce n to a negative number. Analogous results hold for choice functions, which are regressions in which every element is mapped to a minimal element.     

Entropy splitting for antiblocking corners and perfect graphs

We characterize pairs of convex setsA, B in thek-dimensional space with the property that every probability distribution (p ₁,...,p _k ) has a repsesentationp _i =a _l .b _i , aA, bB.Minimal pairs with this property are antiblocking pairs of convex corners. This result is closely related to a new entropy concept. The main application is an information theoretic characterization of perfect graphs.Research was partially sponsored by the Hungarian National Foundation, Scientific Research Grants No 1806 and 1812.