Existence of Solutions To Weak Parabolic Equations For Measures

Let A = (a^ij) be a Borel mapping on [0, 1] x R^d with valuesin the space of non-negative operators on R^d and let b = (bⁱ)be a Borel mapping on [0, 1] x R^d with values in R^d. Let Under broad assumptions on A and b, we construct a family µ= (µ_t)_t [0, 1] of probability measures µ_t on R^dwhich solvesthe Cauchy problem L* µ = 0 with initial conditionµ₀ = , where \nu is a probability measure on R^d, in thefollowing weak sense: and Such an equation is satisfied by transition probabilities ofa diffusion process associated with A and b provided such aprocess exists. However, we do not assume the existence of aprocess and allow quite singular coefficients, in particular,b may be locally unbounded or A may be degenerate. An infinite-dimensionalanalogue is discussed as well. Main methods are L^p-analysiswith respect to suitably chosen measures and reduction to theelliptic case (studied previously) by piecewise constant approximationsin time. 2000 Mathematics Subject Classification 35K10, 35K12,60J35, 60J60, 47D07.     

Non-Regular Tangential Behaviour of a Monotone Measure

A Radon measure µ on Rⁿ is said to be k-monotone if is a non-decreasing function on (0,) for every x Rⁿ. (If µ is the k-dimensional Hausdorffmeasure restricted to a k-dimensional minimal surface then thisimportant property is expressed by the monotonicity formula.)We give an example of a 1-monotone measure µ in R² withnon-unique and non-conical tangent measures at a point. Furthermore,we show that µ can be the one-dimensional Hausdorff measurerestricted to a closed set A R². 2000 Mathematics Subject Classification49Q05, 49Q20 (primary), 28A75, 53A10 (secondary).     

Uniqueness of solutions to weak parabolic equations for measures

We study uniqueness of solutions of parabolic equations formeasures µ(dt dx) = µ_t(dx)dt of the type L*µ = 0, satisfying µ_t as t 0, where each µ_tis a probability measure on ^d, L = _t + a^ij(t, x)_xixj + bⁱ(t,x)_xj is a differential operator on (0, T) x ^d and is a giveninitial measure. One main result is that uniqueness holds underuniform ellipticity and Lipschitz conditions on a^ij but forbⁱ merely local integrability and coercivity conditions aresufficient.     

On the Discreteness and Convergence in n-Dimensional Mobius Groups

Throughout this paper, we adopt the same notations as in [1,6, 8] such as the Möbius group M(Rⁿ), the Clifford algebraC_n–1, the Clifford matrix group SL(2, _n), the Cliffordnorm of ||A||=(|a|²+|b|²+|c|²+|d|²) (1) and the Clifford metric of SL(2, _n) or of the Möbius groupM(Rⁿ) d(A₁,A₂)=||A₁–A₂||(|a₁–a₂|²+|b₁–b₂|²+|c₁–c₂|²+|d₁–d₂|²)(2) where |·| is the norm of a Clifford number and represents f_i M(), i = 1,2, and so on. In addition, we adopt some notions in [6, 12]:the elementary group, the uniformly bounded torsion, and soon. For example, the definition of the uniformly bounded torsionis as follows.     

A Class of Infinite Dimensional Simple Lie Algebras

Let A be an abelian group, F be a field of characteristic 0,and , ß be linearly independent additive maps fromA to F, and let ker()\{0}. Then there is a Lie algebra L = L(A,, ß, ) = _xA Fe_x under the product [e_x, e_y]]=(x–y)e_x+y+(ß) (x, y) e_x+y–. If, further, ß() = 1, and ß(A) = Z, thereis a subalgebra L⁺:=L(A⁺, , ß, ) = _xA⁺ Fe_x, whereA⁺ = {xA|ß(x)0}. The necessary and sufficient conditionsare given for L' = [L, L] and L⁺ to be simple, and all semi-simpleelements in L' and L⁺ are determined. It is shown that L' andL⁺ cannot be isomorphic to any other known Lie algebras andL' is not isomorphic to any L⁺, and all isomorphisms betweentwo L' and all isomorphisms between two L⁺ are explicitly described.     

Beardon's Diophantine Equations and Non-Free Mobius Groups

Let µ be a real number. The Möbius group G_µis the matrix group generated by It is known that G_µ is free if |µ| 2 (see [1])or if µ is transcendental (see [3, 8]). Moreover, thereis a set of irrational algebraic numbers µ which is densein (–2, 2) and for which G_µ is non-free [2, p. 528].We may assume that µ > 0, and in this paper we considerrational µ in (0, 2). The following problem is difficult. Let G^nf denote the set of all rational numbers µ in (0,2) for which G_µ is non-free. In 1969 Lyndon and Ullman[8] proved that G^nf contains the elements of the forms p/(p²+ 1) and 1/(p + 1), where p = 1, 2, ..., and that if µ₀ G^nf, then µ₀/p G^nf for p = 1, 2, .... In 1993 Beardon[2] studied problem (P) by means of the words of the form A^rB^s A^t and A^r B^s A^t B^u A^v, and he obtained a sufficient conditionfor solvability of (P), included implicitly in [2, pp. 530–531],by means of the following Diophantine equations: 1991 Mathematics SubjectClassification 20E05, 20H20, 11D09.     

On the division of polynomial matrices

The main purpose of this paper is to determine two new algorithmsfor the division of the polynomial matrix B(s) R[s]^pxq by A(s) R[s]^pxp (a) based on the Laurent matrix expansion at s = =of the inverse of A(s), i.e. A(s)^–1, and (b) in a waysimilar to the one presented by Gantmacher (1959).     

New perturbation analyses for the Cholesky factorization

We present new perturbation analyses for the Cholesky factorizationA = R^T R of a symmetric positive definite matrix A. The analysesmore accurately reflect the sensitivity of the problem thanprevious normwise results. The condition numbers here are alteredby any symmetric pivoting used in PAP^T = R^TR, and both numericalresults and an analysis show that the standard method of pivotingis optimal in that it usually leads to a condition number veryclose to its lower limit for any given A. It follows that thecomputed R will probably have greatest accuracy when we usethe standard symmetric pivoting strategy. Initially we give a thorogh analysis to obtain both first-orderand strict normwise perturbation bounds which are as tight aspossible, leading to a definition of an optimal condition numberfor the problem. Then we use this approach to obtain reasonablyclear first-order and strict componentwise perturbation bounds. We complete the work by giving a much simpler normwise analysiswhich provides a somewhat weaker bound, but which allows usto estimate the condition of the problem quite well with anefficient computation. This simpler analysis also shows whythe factorization is often less sensitive than we previouslythought, and adds further insight into why pivoting usuallygives such good results. We derive a useful upper bound on thecondition of the problem when we use pivoting. This research was supported by the Natural Sciences and EngineeringResearch Ciuncil of Canada Grant OGP0009236. This research was supported in part by the US National ScienceFoundation under grant CCR 95503126.     

Arbitrary rank jumps for A-hypergeometric systems through Laurent polynomials

We investigate the solution space of hypergeometric systemsof differential equations in the sense of Gel’fand, Graev,Kapranov and Zelevinski. For any integer d 2, we constructa matrix A_(d) ^{d x 2d} and a parameter vector ß_(d)such that the holonomic rank of the A-hypergeometric systemH_A(d)(ß_(d)) exceeds the simplicial volume vol(A_(d))by at least d – 1. The largest previously known gap betweenrank and volume was 2. Our construction gives evidence to the general observation thatrank jumps seem to go hand in hand with the existence of multipleLaurent (or Puiseux) polynomial solutions.     

Tjurina and Milnor Numbers of Matrix Singularities

To gain understanding of the deformations of determinants andPfaffians resulting from deformations of matrices, the deformationtheory of composites f F with isolated singularities is studied,where f : YC is a function with (possibly non-isolated) singularityand F : XY is a map into the domain of f, and F only is deformed.The corresponding T¹(F) is identified as (something like) thecohomology of a derived functor, and a canonical long exactsequence is constructed from which it follows that = µ(f F) – ß₀ + ß₁, where is the length of T¹(F) and ß_i is the lengthof Tor_i^O_Y(O_Y/J_f, O_X). This explains numerical coincidences observedin lists of simple matrix singularities due to Bruce, Tari,Goryunov, Zakalyukin and Haslinger. When f has Cohen–Macaulaysingular locus (for example when f is the determinant function),relations between and the rank of the vanishing homology ofthe zero locus of f F are obtained.     

Binomial Sums and Functions of Exponential Type

Let (a_n)_n0 be a sequence of complex numbers, and, for n0, let A number of results are proved relating the growth of the sequences(b_n) and (c_n) to that of (a_n). For example, given p0, if b_n= O(n^p and for all > 0,then a_n=0 for all n > p. Also, given 0 < p < 1, then for all > 0 if and onlyif . It is further shown that, given rß > 1, if b_n,c_n=O(rßⁿ), then a_n=O(ⁿ),where , thereby proving a conjecture of Chalendar, Kellay and Ransford. The principal ingredientsof the proogs are a Phragmén-Lindelöf theorem forentire functions of exponential type zero, and an estimate forthe expected value of e^(X), where X is a Poisson random variable.2000 Mathematics Subject Classification 05A10 (primary), 30D15,46H05, 60E15 (secondary).     

On Finite and InfiniteCk-A-Determinacy

Let f: (Rⁿ,0) (R^p,0) be a C map-germ. We define f to be finitely,or -, A-determined, if there exists an integer m such that allgerms g with j^mg(0) = j^mf(0), or if all germs g with the sameinfinite Taylor series as f, respectively, are A-equivalentto f. For any integer k, 0 k < , we can consider A' sC^kcounterpart (consisting of C^k diffeomorphisms) A^(k), and wecan define the notion of finite, or -,A^(k)-determinacy in asimilar manner. Consider the following conditions for a C germf: (a_k) f is -A^(k)-determined, (b_k) f is finitely A^(k)-determined,(t) , (g) there exists a representative f : U R^p defined on some neighbourhood U of 0 in Rⁿ such thatthe multigerm of f is stable at every finite set , and (g') every f' with j f'(0)=j f(0) satisfiescondition (g). We also define a technical condition which willimply condition (g) above. This condition is a collection ofp+1 Lojasiewicz inequalities which express that the multigermof f is stable at any finite set of points outside 0 and onlybecomes unstable at a finite rate when we approach 0. We willdenote this condition by (e). With this notation we prove thefollowing. For any C map germ f:(Rⁿ,0) (R^p,0) the conditions(e), (t), (g') and (a) are equivalent conditions. Moreover,each of these conditions is equivalent to any of (a_k) (p+1 k < , (b_k) (p+1 k < ). 1991 Mathematics Subject Classification:58C27.     

On the Centred Hausdorff Measure

Let v be a measure on a separable metric space. For t, q R,the centred Hausdorff measures µ^h with the gauge functionh(x, r) = r^t(vB(x, r))^q is studied. The dimension defined bythese measures plays an important role in the study of multifractals.It is shown that if v is a doubling measure, then µ^h isequivalent to the usual spherical measure, and thus they definethe same dimension. Moreover, it is shown that this is trueeven without the doubling condition, if q 1 and t 0 or ifq 0. An example in R² is also given to show the surprisingfact that the above assertion is not necessarily true if 0 <q < 1. Another interesting question, which has been askedseveral times about the centred Hausdorff measure, is whetherit is Borel regular. A positive answer is given, using the aboveequivalence for all gauge functions mentioned above.     

The ({alpha}+2{beta})-Inequality on a Torus

A theorem of Macbeath asserts that µ(A+B)min(1, µ(A)+µ(B))for any subsets A and B of a finite-dimensional torus. We conjecturethat, when the obvious exceptions are excluded, a stronger inequality holds, and we prove this conjecture under some technical restrictions.     

Correction: the Embedding of Radical Rings in Simple Radical Rings

As G. M. Bergman has pointed out, in the proof of the lemmaon p. 187, we cannot conclude that $$\stackrel{\&macr;}{S}$$is universal in the sense stated. However, the proof can becompleted as follows: Any element of $$\stackrel{\&macr;}{S}$$can be obtained as the first component of the solution u ofa system (A–I)u+a = 0, (1) where A S_n, a ⁿS and A–I has an inverse over L. SinceS is generated by R and k{s}, A can (by the last part of Lemma3.2 of [1]) be taken to be linear in these arguments, say A= A₀ + sA1, where A₀ R_n, A₀ R_n, A₁ K_n. Multiplying by (I–sA₁)^–1,we reduce this equation to the form (S_vB_v–I)u+a=0, (2) with the same solution u as before, where B_v R_n, s_v k{s}¹and a ⁿS. Now consider the retraction S k{s} (3) obtained by mapping R 0. If we denote its effect by x x^*,then (2) goes over into an equation –I.v + a^* 0, (4) which clearly has a unique solution v in k{s}; therefore theretraction (3) can be extended to a homomorphism $$\stackrel{\&macr;}{S}$$ k{s}, again denoted by x x^*, provided we can show that u₁^*does not depend on the equation (1) used to define it. Thisamounts to showing that if an equation (1), or equivalently(2), has the solution u₁ = 0, then after retraction we get v₁= 0 in (4), i.e. a₁^* = 0. We shall use induction on n; if u₁= 0 in (2), then by leaving out the first row and column ofthe matrix on the left of (2), we have an equation for u₂,...,u_n and by the induction hypothesis, their values after retractionare uniquely determined. Now from (2) we have where B = (b_ij^v). Applying ^* and observing that b_ij^vR, we seethat a₁ ^* = 0, as we wished to show. The proof still appliesfor n = 1, so we have a well-defined mapping $$\stackrel{\&macr;}{S}$$ k{s}, which is a homomorphism. Now the proof of the lemma canbe completed as before.     

On the Algorithmic Complexity of Minkowski's Reconstruction Theorem

In 1903 Minkowski showed that, given pairwise different unitvectors µ₁, ..., µ_m in Euclidean n-space Rⁿ whichspan Rⁿ, and positive reals µ₁, ..., µ_m such that^m_i=1µ_iµ_i = 0, there exists a polytope P in Rⁿ, uniqueup to translation, with outer unit facet normals µ₁, ...,µ_m and corresponding facet volumes µ₁, ..., µ_m.This paper deals with the computational complexity of the underlyingreconstruction problem, to determine a presentation of P asthe intersection of its facet halfspaces. After a natural reformulationthat reflects the fact that the binary Turing-machine modelof computation is employed, it is shown that this reconstructionproblem can be solved in polynomial time when the dimensionis fixed but is #P-hard when the dimension is part of the input. The problem of ‘Minkowski reconstruction’ has variousapplications in image processing, and the underlying data structureis relevant for other algorithmic questions in computationalconvexity.     

Some Integrals of Gamma, Polygamma and Volterra Functions

Infinite integrals of the gamma and polygamma functions areexpressed in terms of the Volterra and related functions usingthe Laplace transformation method. A number of infinite, convolution,indefinite and definite integrals of v(x), v(x, ), µ(x,ß) and µ(x, ß, ) has been evaluated.A short table of the Volterra function v(x) in the range 0 x 10–0 is presented.     

Necessary and Sufficient Conditions for Exponential Stability and Ultimate Boundedness of Systems Governed by Stochastic Partial Differential Equations

Consider the following infinite dimensional stochastic evolutionequation over some Hilbert space H with norm |·|: It is proved that under certain mild assumptions, the strongsolution X_t(x₀)VHV*, t 0, is mean square exponentially stableif and only if there exists a Lyapunov functional (·,·):HxR₊R¹ which satisfies the following conditions: (i)c₁|x|²–k₁e^–µ₁t(x,t)c₂|x|²+k₂+k₂e^–µ₂t; (ii) L(x,t)–c₃(x,t)+k₃e^–µ₃t, xV, t0; where L is the infinitesimal generator of the Markov processX_t and c_i, k_i, µ_i, i = 1, 2, 3, are positive constants.As a by-product, the characterization of exponential ultimateboundedness of the strong solution is established as the nulldecay rates (that is, µ_i = 0) are considered.     

On the Small Squaring and Commutativity

Let G be a group and let k > 2 be an integer, such that (k²– 3)(k – 1) < |G|/15 if G is finite. Supposethat the condition |A²| k(k + 1)/2 + (k – 3)/2 is satisfiedby every it-element subset A G. Then G is abelian. The proofuses the structure of quasi-invariant sets.     

Euler Characteristics of Real Varieties

In this paper we show how to associate to any real projectivealgebraic variety Z RP^n–1 a real polynomial F₁:Rⁿ,0 R, 0 with an algebraically isolated singularity, having theproperty that (Z) = (1 – deg (grad F₁), where deg (gradF₁ is the local real degree of the gradient grad F₁:Rⁿ, 0 Rⁿ,0. This degree can be computed algebraically by the method ofEisenbud and Levine, and Khimshiashvili [5]. The variety Z neednot be smooth. This leads to an expression for the Euler characteristic ofany compact algebraic subset of Rⁿ, and the link of a quasihomogeneousmapping f: Rⁿ, 0 Rⁿ, 0 again in terms of the local degree ofa gradient with algebraically isolated singularity. Similar expressions for the Euler characteristic of an arbitraryalgebraic subset of Rⁿ and the link of any polynomial map aregiven in terms of the degrees of algebraically finite gradientmaps. These maps do involve ‘sufficiently small’constants, but the degrees involved ar (theoretically, at least)algebraically computable.