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.     

Some inequalities about the covering radius of Reed-Muller codes

Let R(r, m) be the rth order Reed-Muller code of length 2 ^m , and let (r, m) be its covering radius. We prove that if 2 k m - r - 1, then (r + k, m + k) (r, m + 2(k - 1). We also prove that if m - r 4, 2 k m - r - 1, and R(r, m) has a coset with minimal weight (r, m) which does not contain any vector of weight (r, m) + 2, then (r + k, m + k) (r, m) + 2k(. These inequalities improve repeated use of the known result (r + 1, m + 1) (r, m).This work was supported by a grant from the Research Council of Wright State University.     

A Method of Solution for the One-Dimensional Heat Equation Subject to Nonlocal Conditions

The problem of solving the one-dimensional heat equation /t - ²/x² = f(x, t) subject to given initial and nonlocal conditions is considered. It is solved in the Laplace transform domain by taking the Laplace transform of the unknown function with respect to time t. The physical solution is recovered with the help of a numerical technique for inverting the Laplace transform.AMS Subject Classification (1991): 35K20.     

Convex independent sets and 7-holes in restricted planar point sets

For a finite setA of points in the plane, letq(A) denote the ratio of the maximum distance of any pair of points ofA to the minimum distance of any pair of points ofA. Fork>0 letc (k) denote the largest integerc such that any setA ofk points in general position in the plane, satisfying for fixed , contains at leastc convex independent points. We determine the exact asymptotic behavior ofc (k), proving that there are two positive constants=(), such thatk ^1/3c (k)k ^1/3. To establish the upper bound ofc (k) we construct a set, which also solves (affirmatively) the problem of Alonet al. [1] about the existence of a setA ofk points in general position without a 7-hole (i.e., vertices of a convex 7-gon containing no other points fromA), satisfying . The construction uses Horton sets, which generalize sets without 7-holes constructed by Horton and which have some interesting properties.     

Combined free and forced laminar convection in internally finned square ducts

Analysis is presented for the heat transfer performance of square ducts with internal fins from each wall in the case of combined free and forced convection by fully developed laminar flow. Numerical results are obtained for the Nusselt number and the pressure drop parameter for various values of finlengths and heat source parameter. For various values of Rayleigh numbers, the Nusselt number increases with the increase in finlength and decreases with the increase in heat source parameter.

---

Zusammenfassung Es wird eine Analyse für den Wärmeaustausch von quadratischen Rohren mit inneren Rippen an jeder Wand im Falle einer Kombination von freier und erzwungener Konvektion bei voll entwickelter laminarer Strömung gegeben. Numerische Resultate für die Nusselt-Zahl und den Druckabfall-Koeffizienten für verschiedene Rippenbreiten und Parameter der Wärmequelle werden erhalten. Für einige Werte der Rayleighzahl wächst die Nusselt-Zahl mit der Rippenbreite und fällt mit wachsendem Parameter der Wärmequelle.

---

Nomenclature A cross sectional area of the duct - B _2k Bernoulli numbers - c _p specific heat at constant pressure - D _h hydraulic diameter of finless duct - E _n complex constants (20) - F heat source parameter,Q/c _p - F _n () defined by Equation (14) - G(, , , ) Green's function (15, 16) - g gravitational acceleration - H() Heaviside function - h() defined by Equation (22) - i imaginary unit,i ²=–1 - ImW imaginary part ofW - K(,t) kernel of the integral equation, defined by (25) - k thermal conductivity - L pressure drop parameter, –D _h ² (p/x+ _w )/ - l fin length of each fin, Figure (1) - N _u Nusselt number, Equation (32) - p pressure - Q heat generation rate - R() defined by Equation (26) - R _A Rayleigh number, _w gc _p D _h ⁴ /k - ReW real part ofW - T dimensionless temperature, (t–t _w )/(c _p D _h ² /k) - T _mx dimensionless mixed mean temperature, Equation (33) - t fluid temperature - t ₀ reference temperature atx=0 - u local axial velocity - mean axial velocity - V u/ - W complex function defined by Equation (6) - w suffix denoting wall conditions - W ₀ defined by Equation (9) - W ₁ W–W ₀, Equation (18) - x axial coordinate along the length of the duct - y, z cross-sectional coordinates - constant temperature gradient, t/x - coefficient of thermal expansion of the fluid - fluid density - _n - dynamic viscosity - () Dirac delta function - ² Laplacian operator, ²/y ²/²/z ² - , y/D _h ,z/D _h      

D λ -cycles in 3-cyclable graphs

Letk and be positive integers, andG a 2-connected graph of ordern with minimum degree and independence number. A cycleC ofG is called aD -cycle if every component ofG – V(C) has order smaller than. The graphG isk-cyclable if anyk vertices ofG lie on a common cycle. A previous result of the author is that if k 2, G isk-connected and every connected subgraphH ofG of order has at leastn +k ² + 1/k + 1 – vertices outsideH adjacent to at least one vertex ofH, thenG contains aD -cycle. Here it is conjectured that k-connected can be replaced by k-cyclable, and this is proved fork = 3. As a consequence it is shown that ifn 4 – 6, or ifG is triangle-free andn 8 – 10, thenG contains aD ₃-cycle orG , where denotes a well-known class of nonhamiltonian graphs of connectivity 2. As an analogue of a result of Nash-Williams it follows that ifn 4 – 6 and – 1, thenG is hamiltonian orG . The results are all best possible and compare favorably with recent results on hamiltonicity of graphs which are close to claw-free.     

A Class of Iterative Algorithms and Solvability of Nonlinear Variational Inequalities Involving Multivalued Mappings

The solvability of the following class of nonlinear variational inequality (NVI) problems based on a class of iterative procedures, which possess an equivalence to a class of projection formulas, is presented.Determine an element x ^* K and u ^* T(x ^*) such that u ^*, x – x ^* 0 for all x K where T: K P(H) is a multivalued mapping from a real Hilbert space H into P(H), the power set of H, and K is a nonempty closed convex subset of H. The iterative procedure adopted here is represented by a nonlinear variational inequality: for arbitrarily chosen initial points x ⁰, y ⁰ K, u ⁰ T(y ⁰) and v ⁰ T(x ⁰), we have u ^k + x ^k+1 – y ^k , x – x ^k+1 0, x K, for u ^k T(y ^k ) and for k 0where v ^k + y ^k – x ^k , x – y ^k 0, x K and for v ^k T(x ^k ).     

Non removable edges in 3-connected cubic graphs

LetG be a cyclicallyk-edge-connected cubic graph withk 3. Lete be an edge ofG. LetG be the cubic graph obtained fromG by deletinge and its end vertices. The edgee is said to bek-removable ifG is also cyclicallyk-edge-connected. Let us denote by S _k (G) the graph induced by thek-removable edges and by N _k (G) the graph induced by the non 3-removable edges ofG. In a previous paper [7], we have proved that N ₃(G) is empty if and only ifG is cyclically 4-edge connected and that if N ₃(G) is not empty then it is a forest containing at least three trees. Andersen, Fleischner and Jackson [1] and, independently, McCuaig [11] studied N ₄(G). Here, we study the structure of N _k (G) fork 5 and we give some constructions of graphs such thatN _k (G) = E(G). We note that the main result of this paper (Theorem 5) has been announced independently by McCuaig [11].

---

Résumé SoitG un graphe cubique cyliquementk-arête-connexe, aveck 3. Soite une arête deG et soitG le graphe cubique obtenu à partir deG en supprimante et ses extrémités. L'arêtee est ditek-suppressible siG est aussi cycliquementk-arête-connexe. Désignons par S _k (G) le graphe induit par les arêtesk-suppressibles et par N _k (G) celui induit par les arêtes nonk-suppressibles. Dans un précédent article [7], nous avons montré que N ₃(G) est vide si et seulement siG est cycliquement 4-arête-connexe et que si N ₃(G) n'est pas vide alors c'est une forêt possédant au moins trois arbres. Andersen, Fleischner and Jackson [1] et, indépendemment, McCuaig [11] ont étudié N ₄(G). Ici, nous étudions la structure de N _k (G) pourk 5 et nous donnons des constructions de graphes pour lesquelsN _k (G) = E(G). Nous signalons que le résultat principal de cet article (Théorème 5) a été annoncé indépendamment par McCuaig [11].

     

Differential geometry of tensor product immersions II

In the first part of this series, we prove that the tensor product immersionf ₁ f _2k of2k isometric spherical immersions of a Riemannian manifoldM in Euclidean space is of-type with k and classify tensor product immersionsf ₁ f _2k which are ofk-type. In this article we investigate the tensor product immersionsf ₁ f _2k which are of (k+1)-type. Several classification theorems are obtained.     

Directed packings with block size 5 and even ν

Let andk be positive integers. A transitively orderedk-tuple (a ₁,a ₂,...,a _k) is defined to be the set {(a _i, a_j) 1i<jk} consisting ofk(k–1)/2 ordered pairs. A directed packing with parameters ,k and index =1, denoted byDP(k, 1; ), is a pair (X, A) whereX is a -set (of points) andA is a collection of transitively orderedk-tuples ofX (called blocks) such that every ordered pair of distinct points ofX occurs in at most one block ofA. The greatest number of blocks required in aDP(k, 1; ) is called packing number and denoted byDD(k, 1; ). It is shown in this paper that for all even integers , where [x] is the floor ofx.     

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.     

Harmonic analysis on tori

We consider measurable subsets {ofR}ⁿ with 0<m()<, and we assume that has a spectral set . (In the special case when is also assumed open, may be obtained as the joint spectrum of a family of commuting self-adjoint operators {H _k: 1kn} in L ² () such that each H _k is an extension of i(/x _k) on C _c (), k=1, ..., n.)It is known that is a fundamental domain for a lattice if is itself a lattice. In this paper, we consider a class of examples where is not assumed to be a lattice. Instead is assumed to have a certain inhomogeneous form, and we prove a necessary and sufficient condition for to be a fundamental domain for some lattice in {ofR}ⁿ. We are thus able to decide the question, fundamental domain or not, by considering only properties of the spectrum . Our criterion is obtained as a corollary to a theorem concerning partitions of sets which have a spectrum of inhomogeneous form.Work supported in part by the NSF.Work supported in part by the NSRC, Denmark.     

Analogues of hadwiger's theorem in space ℝ n —Sufficient conditions for a convex domain to enclose another

We estimate the kinematic measure of one convex domain moving to another under the groupG of rigid motions in ⁿ . We first estimate the kinematic formula for the total scalar curvature D ₀gD ₁ Rdv of then–2 dimensional intersection submanifold D ₀gD ₁. Then we use Chern and Yen's kinematic fundamental formula and our integral inequality to obtain a sufficient condition for one convex domain to contain another in ⁿ (4). Forn=4, we directly obtain another sufficient condition in ⁴.     

Regular (2, 2)-systems

Let (E,I) be an independence system over the finite setE = {e ₁, ,e _n }, whose elements are orderede ₁ e _n . (E,I) is called regular, if the independence of {e _l , ,e _{l k} },l ₁ < <l _k , implies that of {e _{m l} , ,e _{m k} }, wherem _l < ··· <m _k andl ₁ m ₁, ,l _k m _k . (E,I) is called a 2-system, if for anyI I,e E I the setI {e } contains at most 2 distinct circuitsC, C I and the number 2 is minimal with respect to this property. If, in addition, for any two independent setsI andJ the family (C J, C C (J, I)), whereC(J, I) denotes {C C:e J I C {e}}, can be partitioned into 2 subfamilies each of which possesses a transversal, then (E,I) is called a (2, 2)-system. In this paper we characterize regular 2-systems and we show that the classes of regular 2-systems resp. regular (2, 2)-systems are identical.     

Galerkin methods for parabolic equations with nonlinear boundary conditions

A variety of Galerkin methods are studied for the parabolic equationu _t =(a(x) u),x ⁿ ,t (O,T], subject to the nonlinear boundary conditionu _v =g(x,t,u),x,t (O,T] and the usual initial condition. Optimal order error estimates are derived both inL ² () andH ¹ () norms for all methods treated, including several that produce linear computational procedures.The authors were partially supported by The National Science Foundation during the preparation of this paper.     

Randomly Weighted Sums of Subexponential Random Variables with Application to Ruin Theory

Let {X _k , 1 k n} be n independent and real-valued random variables with common subexponential distribution function, and let {k, 1 k n} be other n random variables independent of {X _k , 1 k n} and satisfying a _k b for some 0 < a b < for all 1 k n. This paper proves that the asymptotic relations P (max_{1 m n k=1} ^m _k X _k > x) P (sum _k=1 ⁿ _k X _k > x) sum _k=1 ⁿ P ( _k X _k > x) hold as x . In doing so, no any assumption is made on the dependence structure of the sequence { _k , 1 k n}. An application to ruin theory is proposed.     

On monotone extensions of boundary data

Summary A functionf C (), is called monotone on if for anyx, y the relation x – y ₊ ^s impliesf(x)f(y). Given a domain with a continuous boundary and given any monotone functionf on we are concerned with the existence and regularity ofmonotone extensions i.e., of functionsF which are monotone on all of and agree withf on . In particular, we show that there is no linear mapping that is capable of producing a monotone extension to arbitrarily given monotone boundary data. Three nonlinear methods for constructing monotone extensions are then presented. Two of these constructions, however, have the common drawback that regardless of how smooth the boundary data may be, the resulting extensions will, in general, only be Lipschitz continuous. This leads us to consider a third and more involved monotonicity preserving extension scheme to prove that, when is the unit square [0, 1]² in ², strictly monotone analytic boundary data admit a monotone analytic extension.Research supported by NSF Grant 8922154Research supported by DARPA: AFOSR #90-0323     

Some remarks on the modulus of continuity of a conformal mapping of the disk onto a Jordan domain

Letd(;z, t) be the smallest diameter of the arcs of a Jordan curve with endsz andt. Consider the rapidity of decreasing ofd(;)=sup{d(;z, t):z, t , ¦z–t¦} (as 0,0) as a measure of nicety of . Letg(x) (x0) be a continuous and nondecreasing function such thatg(x)x,g(0)=0. Put¯g(x)=g(x)+x, h(x)=(¯g(x))². LetH(x) be an arbitrary primitive of 1/h ^–1(x). Note that the functionH ^–1 x is positive and increasing on (–, +),H ^–1 0 asx– andH ^–1+ asx +. The following statement is proved in the paper.Translated fromMatematicheskie Zametki, Vol. 60, No. 2, pp. 176–184, August, 1996.This research was supported by the Russian Foundation for Basic Research under grant No. 93-01-00236 and by the International Science Foundation under grant No. NCF000.     

Local invariants of differential equations

We consider an analytic system X=(X) in the neighborhood of the fixed point X=0. Depending on the characteristic numbers of the matrix (/x)₀, we define the integer d 0 as the dimension of the normal form or as the multiplicity of the resonance. We show that a system with d=1, subject to certain additional assumptions, has a finite number of invariants relative to reversible formal changes of variablesx = (Y). All these invariants are the coefficients of some normal form. We touch upon questions concerning invariants of relatively smooth and continuous substitutions.Translated from Matematicheskie Zametki, Vol. 14, No. 4, pp. 499–507, October, 1973.     

Subsets with Restricted Movement

Let G be a finite permutation group on a set with no fixed points in and let m and k be integers with 0 < m < k. For a finite subset of the movement of is defined as move() = max_gG| ^g \ |. Suppose further that G is not a 2-group and that p is the least odd prime dividing |G| and move() m for all k-element subsets of . Then either || k + m or k (7m – 5) / 2, || (9m – 3)/2. Moreover when || > k + m, then move() m for every subset of .