On the long time behaviour of a generalized KdV equation

We consider the Cauchy problem for the generalized Korteweg-de Vries equation% MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaiabgkGi2oaaBaaaleaacaaIXaaabeaakiaadwhacqGHRaWkcqGH% ciITdaWgaaWcbaGaamiEaaqabaGccaGGOaGaeyOeI0IaeyOaIy7aa0% baaSqaaiaadIhaaeaacaaIYaaaaOGaaiykamaaCaaaleqabaGaeqyS% degaaOGaamyDaiabgUcaRiabgkGi2oaaBaaaleaacaWG4baabeaakm% aabmGabaWaaSaaaeaacaWG1bWaaWbaaSqabeaacqaH7oaBaaaakeaa% cqaH7oaBaaaacaGLOaGaayzkaaGaeyypa0JaaGimaaaa!56D5!\[\partial _1 u + \partial _x ( - \partial _x^2 )^\alpha u + \partial _x \left( {\frac{{u^\lambda }}{\lambda }} \right) = 0\]where is a positive real and and integer larger than 1. We obtain the detailed large distance behaviour of the fundamental solution of the linear problem and show that for 1/2 and % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaiabeU7aSjabg6da+iabeg7aHjabgUcaRmaalaaabaGaaG4maaqa% aiaaikdaaaGaey4kaSYaaeWaceaacqaHXoqydaahaaWcbeqaaiaaik% daaaGccqGHRaWkcaaIZaGaeqySdeMaey4kaSYaaSaaaeaacaaI1aaa% baGaaGinaaaaaiaawIcacaGLPaaadaahaaWcbeqaaiaaigdacaGGVa% GaaGOmaaaaaaa!4FF7!\[\lambda > \alpha + \frac{3}{2} + \left( {\alpha ^2 + 3\alpha + \frac{5}{4}} \right)^{1/2} \], solutions of the nonlinear equation with small initial conditions are smooth in the large and asymptotic when t± to solutions of the linear problem.     

Subelliptic operators on Lie groups: Variable coefficients

Let G be a Lie group with Lie algebra g and a _i,...,a _d and algebraic basic of g. Futher, if A _i=dL(a_i) are the corresponding generators of left translations by G on one of the usual function spaces over G, let% MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaamXvP5wqonvsaeHbfv3ySLgzaGqbciab-Heaijaab2dadaaeqbqa% aiaadogadaWgaaWcbaqedmvETj2BSbacgmGae4xSdegabeaakiaadg% eadaahaaWcbeqaaiab+f7aHbaaaeaacqGFXoqycaGG6aGaaiiFaiab% +f7aHjaacYhatuuDJXwAK1uy0HMmaeXbfv3ySLgzG0uy0HgiuD3BaG% Wbbiab9rMiekaaikdaaeqaniabggHiLdaaaa!5EC1!\[H{\rm{ = }}\sum\limits_{\alpha :|\alpha | \le 2} {c_\alpha A^\alpha } \] be a second-order differential operator with real bounded coefficients c . The operator is defined to be subelliptic if% MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaiGacMgacaGGUbGaaiOzamXvP5wqonvsaeHbfv3ySLgzaGqbaKaz% aasacqWF7bWEcqWFTaqlkmaaqafabaGaam4yamaaBaaaleaarmWu51% MyVXgaiyWacqGFXoqyaeqaaaqaaiab+f7aHjaacQdacaGG8bGae4xS% deMaaiiFaiabg2da9iaaikdaaeqaniabggHiLdGccqWFOaakiuGacq% qFNbWzcqWFPaqkcqaH+oaEdaahaaWcbeqaamaaBaaameaacqGFXoqy% aeqaaaaakiaacUdacqqFNbWzcqGHiiIZcqqFhbWrcqqFSaalcqqFGa% aicqaH+oaEcqGHiiIZrqqtubsr4rNCHbachaGaeWxhHe6aaWbaaSqa% beaacqqFKbazcqqFNaWjcqaFaC-jaaGccaGGSaGaaiiFaiabe67a4j% aacYhacqGH9aqpjqgaGeGae8xFa0NccqGH+aGpcaaIWaGaaiOlaaaa% !7884!\[\inf \{ - \sum\limits_{\alpha :|\alpha | = 2} {c_\alpha } (g)\xi ^{_\alpha } ;g \in G, \xi \in ^{d'} ,|\xi | = \} > 0.\]We prove that if the principal coefficients {c ; ||=2} of the subelliptic operator are once left differentiable in the directions a ₁,...,a _d with bounded derivatives, then the operator has a family of semigroup generator extensions on the L _p-spaces with respect to left Haar measure dg, or right Haar measure d, and the corresponding semigroups S are given by a positive integral kernel,% MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaamXvP5wqonvsaeHbfv3ySLgzaGqbaiab-HcaOGqbciab+nfatnaa% BaaaleaacaWG0baabeaaruqqYLwySbacgiGccaqFgpGae8xkaKIae8% hkaGIae43zaCMae8xkaKIae8xpa0Zaa8qeaeaacaqGKbaaleaacqGF% hbWraeqaniabgUIiYdGcceWGObGbaKaacaWGlbWaaSbaaSqaaiaads% haaeqaaOGae8hkaGIae43zaCMae43oaSJae4hAaGMae8xkaKIaa0NX% diab-HcaOiab+HgaOjab-LcaPiab-5caUaaa!5DFA!\[(S_t \phi )(g) = \int_G {\rm{d}} \hat hK_t (g;h)\phi (h).\]The semigroups are holomorphic and the kernel satisfies Gaussian upper bounds. If in addition the coefficients with ||=2 are three times differentiable and those with ||=1 are once differentiable, then the kernel also satisfies Gaussian lower bounds.Some original features of this article are the use of the following: a priori inequalities on L in Section 3, fractional operator expansions for resolvent estimates in Section 4, a parametrix method based on reduction to constant coefficient operators on the Lie group rather than the usual Euclidean space in Section 5, approximation theory of semigroups in Section 11 and time dependent perturbation theory to treat the lower order terms of H in Sections 11 and 12.     

On an optimum test of the equality of two covariance matrices

Let X: p × 1, Y: p × 1 be independently and normally distributed p-vectors with unknown means ₁, ₂ and unknown covariance matrices ₁, ₂ (>0) respectively. We shall show that Pillai's test, which is locally best invariant, is locally minimax for testing H ₀: ₁=₂ against the alternative H ₁: % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiiYdd9qrFfea0dXdf9vqai-hEir8Ve% ea0de9qq-hbrpepeea0db9q8as0-LqLs-Jirpepeea0-as0Fb9pgea% 0lrP0xe9Fve9Fve9qapdbaqaaeGacaGaaiaabeqaamaabaabcaGcba% GaaeiDaiaabkhacaqGOaWaaabmaeaadaaeqaqaaiabgkHiTiaadMea% caGGPaGaaiiiaiabg2da9iaacccacqaHdpWCcaGGGaGaeyOpa4Jaai% iiaiaaicdaaSqaaiaaigdaaeqaniabggHiLdaaleaacaqGYaaabaGa% aeylaiaabgdaa0GaeyyeIuoaaaa!4E3F!\[{\rm{tr(}}\sum\nolimits_{\rm{2}}^{{\rm{ - 1}}} {\sum\nolimits_1 { - I) = \sigma > 0} }\]as 0. However this test is not of type D among G-invariant tests.Research supported by the Canadian N.S.E.R.C. Grant.     

Estimation of a common mean of several univariate inverse Gaussian populations

The problem of estimating the common mean of k independent and univariate inverse Gaussian populations IG(, _i ), i=1,..., k with unknown and unequal 's is considered. The difficulty with the maximum likelihood estimator of is pointed out, and a natural estimator % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiiYdd9qrFfea0dXdf9vqai-hEir8Ve% ea0de9qq-hbrpepeea0db9q8as0-LqLs-Jirpepeea0-as0Fb9pgea% 0lrP0xe9Fve9Fve9qapdbaqaaeGacaGaaiaabeqaamaabaabcaGcba% acciGaf8hVd0MbaGaaaaa!3D38!\[\tilde \mu \] of along the lines of Graybill and Deal is proposed. Various finite sample properties and some decision-theoretic properties of % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiiYdd9qrFfea0dXdf9vqai-hEir8Ve% ea0de9qq-hbrpepeea0db9q8as0-LqLs-Jirpepeea0-as0Fb9pgea% 0lrP0xe9Fve9Fve9qapdbaqaaeGacaGaaiaabeqaamaabaabcaGcba% acciGaf8hVd0MbaGaaaaa!3D38!\[\tilde \mu \] are discussed.This research was partially supported by research grants #A3661 and #A3450 from NSERC of Canada.     

Fuzzy weighted scaled coefficients in semi-parametric model

In general, the regressor variables are stochastic, Duan and Li (1987, J. Econometrics, 35, 25–35), Li and Duan (1989, Ann. Statist., 17, 1009–1052) have been shown that under very general design conditions, the least squares method can still be useful in estimating the scaled regression coefficients of the semi-parametric model Y _i =Q ₁(+X _i ; _i , i+ 1,2,...,n. Here is a constant, is a 1×p row vector, X _i is a p×1 column vector of explanatory variables, _i is an unobserved random error and Q ₁ is an arbitrary unknown function. When the data set (X _i , Y _i ),i=1, 2, ..., n, contains one or several outliers, the least squares method can not provide a consistent estimator of the scaled coefficients . Therefore, we suggest the fuzzy weighted least squares method to estimate the scaled coefficients for the data set with one or several outliers. It will be shown that the proposed fuzzy weighted least squares estimators are % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaamaakaaabaGaamOBaaWcbeaaaaa!3D3C!\[\sqrt n \] and asymptotically normal under very general design condition. Consistent measurement of the precision for the estimator is also given. Moreover, a limited Monte Carlo simulation and an example are used to study the practical performance of the procedures.This research partially supported by the National Science Council, R.O.C.     

Estimation of a common multivariate normal mean vector

Let X ₁,..., X _N be independent observations from N _p (, ₁) and Y ₁,..., Y _N be independent observations from N _p (, ₂). Assume that X _i 's and Y _i 's are independent. An unbiased estimator of which dominates the sample mean % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9qq-f0-yqaqVeLsFr0-vr% 0-vr0db8meaabaqaciGacaGaaeqabaWaaeaaeaaakeaaceWGybGbae% baaaa!3A32!\[\bar X\]for p1 under the loss function L(, % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9qq-f0-yqaqVeLsFr0-vr% 0-vr0db8meaabaqaciGacaGaaeqabaWaaeaaeaaakeaacuaH8oqBga% qcaaaa!3B03!\[\hat \mu\]) = (% MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9qq-f0-yqaqVeLsFr0-vr% 0-vr0db8meaabaqaciGacaGaaeqabaWaaeaaeaaakeaacuaH8oqBga% qcaaaa!3B03!\[\hat \mu\]– )^–1 ₁(% MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9qq-f0-yqaqVeLsFr0-vr% 0-vr0db8meaabaqaciGacaGaaeqabaWaaeaaeaaakeaacuaH8oqBga% qcaaaa!3B03!\[\hat \mu\]– ) is suggested. The exact risk (under L) of the new estimator is also evaluated.     

The Parameters of Bipartite Q-polynomial Distance-Regular Graphs

Let denote a bipartite distance-regular graph with diameter D 3 and valency k 3. Suppose ₀, ₁, ..., _D is a Q-polynomial ordering of the eigenvalues of . This sequence is known to satisfy the recurrence _{i – 1} – _i + _{i + 1} = 0 (0 > i > D), for some real scalar . Let q denote a complex scalar such that q + q ^–1 = . Bannai and Ito have conjectured that q is real if the diameter D is sufficiently large.We settle this conjecture in the bipartite case by showing that q is real if the diameter D 4. Moreover, if D = 3, then q is not real if and only if ₁ is the second largest eigenvalue and the pair (, k) is one of the following: (1, 3), (1, 4), (1, 5), (1, 6), (2, 4), or (2, 5). We observe that each of these pairs has a unique realization by a known bipartite distance-regular graph of diameter 3.     

On the Heyde Theorem for Finite Abelian Groups

It is well-known Heyde's characterization theorem for the Gaussian distribution on the real line: if _j are independent random variables, _j , _j are nonzero constants such that _i ± _j ^–1 _j 0 for all i j and the conditional distribution of L ₂=_{1 1} + ··· + _{n n} given L ₁=_{1 1} + ··· + _{n n} is symmetric, then all random variables _j are Gaussian. We prove some analogs of this theorem, assuming that independent random variables take on values in a finite Abelian group X and the coefficients _j , _j are automorphisms of X.     

Independence in hypergraphs

Suppose an integral function (|A|)q₁ defined on the subsets of edges of a hypergraph (X,u,) satisfies the following two conditions: 1) any set W u such that |A|(|A|) for any AW is matroidally independent; 2) if W is an independent set, then there exists a unique partitionW=T₁+ T₂+...+T_v such that |T ⁱ |=(|T ⁱ |),i1:v, and for any AW, |A|(|A|) there exists a T_i such that AT_i. The form of such a function is found, in terms of parameters of generalized connected components, hypercycles, and hypertrees.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 114, pp. 196–204, 1982.     

On a theorem of lovász on covers inr-partite hypergraphs

A theorem of Lovász asserts that (H)/*(H)r/2 for everyr-partite hypergraphH (where and * denote the covering number and fractional covering number respectively). Here it is shown that the same upper bound is valid for a more general class of hypergraphs: those which admit a partition (V ₁, ...,V _k ) of the vertex set and a partitionp ₁+...+p _k ofr such that |eV _i |p _i r/2 for every edgee and every 1ik. Moreover, strict inequality holds whenr>2, and in this form the bound is tight. The investigation of the ratio /* is extended to some other classes of hypergraphs, defined by conditions of similar flavour. Upper bounds on this ratio are obtained fork-colourable, stronglyk-colourable and (what we call)k-partitionable hypergraphs.Supported by grant HL28438 at MIPG, University of Pennsylvania, and by the fund for the promotion of research at the Technion.This author's research was supported by the fund for the promotion of research at the Technion.     

On the product of sign vectors and unit vectors

For a fixed unit vectora=(a ₁,...,a _n )S ^n-1, consider the 2 ⁿ sign vectors=(₁,..., _n ){±1{ ⁿ and the corresponding scalar products^·a = _n ⁱ⁼¹ = _i a _i . The question that we address is: for how many of the sign vectors must^.a lie between–1 and 1. Besides the straightforward interpretation in terms of the sums ±a ₂ , this question has appealing reformulations using the language of probability theory or of geometry.The natural conjectures are that at least 1/2 the sign vectors yield |.a|1 and at least 3/8 of the sign vectors yield |.a|<1 (the latter excluding the case when |a _i |=1 for somei). These conjectured lower bounds are easily seen to be the best possible. Here we prove a lower bound of 3/8 for both versions of the problem, thus completely solving the version with strict inequality. The main part of the proof is cast in a more general probabilistic framework: it establishes a sharp lower bound of 3/8 for the probability that |X+Y|<1, whereX andY are independent random variables, each having a symmetric distribution with variance 1/2.We also consider an asymptotic version of the question, wheren along a sequence of instances of the problem satisfying ||a||0. Our result, best expressed in probabilistic terms, is that the distribution of .a converges to the standard normal distribution, and in particular the fraction of sign vectors yielding .a between –1 and 1 tends to 68%.This research was supported in part by the Institute for Mathematics and its Applications with funds provided by the National Science Foundation.     

Minimaxity and admissibility of the product limit estimator

In this article we examine the minimaxity and admissibility of the product limit (PL) estimator under the loss function% MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqaqpepeea0xe9qqVa0l% b9peea0lb9sq-JfrVkFHe9peea0dXdarVe0Fb9pgea0xa9pue9Fve9% Ffc8meGabaqaciGacaGaaeqabaWaaeaaeaaakeaacaWGmbGaaiikai% aadAeacaGGSaGabmOrayaajaGaaiykaiabg2da9maapeaabaGaaiik% aiaadAeacaGGOaGaamiDaiaacMcaaSqabeqaniabgUIiYdGccqGHsi% slceWGgbGbaKaacaGGOaGaamiDaiaacMcacaGGPaWaaWbaaSqabeaa% caaIYaaaaOGaamOramaaCaaaleqabaaccmGae8xSdegaaOGaaiikai% aadshacaGGPaGaaiikaiaaigdacqGHsislcaWGgbGaaiikaiaadsha% caGGPaGaaiykamaaCaaaleqabaGaeqOSdigaaOGaamizaiaadEfaca% GGOaGaamiDaiaacMcaaaa!5992!\[L(F,\hat F) = \int {(F(t)} - \hat F(t))^2 F^\alpha (t)(1 - F(t))^\beta dW(t)\].To avoid some pathological and uninteresting cases, we restrict the parameter space to ={F: F(ymin) }, where (0, 1) and y ₁,...y,_n are the censoring times. Under this set up, we obtain several interesting results. When y ₁=···=y _n, we prove the following results: the PL estimator is admissible under the above loss function for , {–1, 0}; if n=1, ==–1, the PL estimator is minimax iff dW ({y})=0; and if n2, , {–1, 0}, the PL estimator is not minimax for certain ranges of . For the general case of a random right censorship model it is shown that the PL estimator is neither admissible nor minimax. Some additional results are also indicated.Partially supported by the Governor's Challenge Grant.Part of the work was done while the author was visiting William Paterson College.     

Elliptic operators on Lie groups

We review the theory of strongly elliptic operators on Lie groups and describe some new simplifications. Let U be a continuous representation of a Lie group G on a Banach space and a ₁,...,a _d a basis of the Lie algebra g of G. Let A _i=dU(a _i) denote the infinitesimal generator of the continuous one-parameter group t U(exp(-ta _i)) and set % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqaqFfpeea0df9GqVa0-% aq0dXdarVe0-yr0RYxir-dbba9q8aq0-qq-He9q8qqQ8fq0-vr0-vr% Y-bdbiqaaeGaciGaaiaabeqaamaabaabaaGcbaGaamyqamaaCaaale% qajeaObaGaeyySdegaaOGaeyypa0JaamyqamaaBaaajeaWbaGaaeyA% aaWcbeaajaaOdaWgaaqcbaAaamaaBaaajiaObaGaaiiBaaqabaaaje% aObeaakiaacElacaGG3cGaai4TaiaadgeadaWgaaqcbaCaaiaabMga% aSqabaGcdaWgaaWcbaWaaSbaaKGaahaacaGGUbaameqaaaWcbeaaaa% a!4897!\[A^\alpha = A_{\rm{i}} _{_l } \cdot\cdot\cdotA_{\rm{i}} _{_n } \], where =(i ₁,...,i _n) with _j and set ||=n. We analyze properties of mth order differential operators % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqaqFfpeea0df9GqFj0-% aq0dXdarVe0-yr0RYxir-dbba9q8aq0-qq-He9q8qqQ8fq0-vr0-vr% Y-bdbiqaaeGaciGaaiaabeqaamaabaabaaGcbaGaamisaiabg2da9i% aabccadaaeqaqaaiaadogadaWgaaqcbaCaaiabgg7aHbWcbeaaaKqa% GgaacqGHXoqycaqG7aGaaeiiaiaabYhacqGHXoqycaqG8bGaeyizIm% QaaeyBaaWcbeqdcqGHris5aOGaamyqamaaCaaaleqajeaObaGaeyyS% degaaaaa!4A6C!\[H = {\rm{ }}\sum\nolimits_{\alpha {\rm{; |}}\alpha {\rm{|}} \le {\rm{m}}} {c_\alpha } A^\alpha \] with coefficients c . If H is strongly elliptic, i.e., % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqaqFfpeea0df9GqFj0-% aq0dXdarVe0-yr0RYxir-dbba9q8aq0-qq-He9q8qqQ8fq0-vr0-vr% Y-bdbiqaaeGaciGaaiaabeqaamaabaabaaGcbaGaciOuaiaacwgacq% GH9aqpcaqGGaWaaabeaeaacaGGOaaajeaObaGaeyySdeMaae4oaiaa% bccacaqG8bGaeyySdeMaaeiFaiabg2da9iaab2gaaSqab0GaeyyeIu% oakiaabMgacqaH+oaEcaGGPaWaaWbaaSqabKqaGgaacqGHXoqyaaGc% cqGH+aGpcaaIWaaaaa!4C40!\[{\mathop{\rm Re}\nolimits} = {\rm{ }}\sum\nolimits_{\alpha {\rm{; |}}\alpha {\rm{|}} = {\rm{m}}} ( {\rm{i}}\xi )^\alpha > 0\] for all % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqaqFfpeea0df9GqVa0-% aq0dXdarVe0-yr0RYxir-dbba9q8aq0-qq-He9q8qqQ8fq0-vr0-vr% Y-bdbiqaaeGaciGaaiaabeqaamaabaabaaGcbaGaeqOVdGNaeyicI4% SaeSyhHe6aaWbaaSqabeaacaWGKbaaaOGaaiixaiaacUhacaaIWaGa% aiyFaaaa!3EAA!\[\xi \in ^d \backslash \{ 0\} \], then we give a simple proof of the theorem that the closure of H generates a continuous (and holomorphic) semigroup on and the action of the semigroup is determined by a smooth, representation independent, kernel which, together with all its derivatives, satisfies mth order Gaussian bounds.     

An Optimal Way of Moving a Sequence of Points onto a Curve in Two Dimensions

Let (t), 0 t T, be a smooth curve and let _i , i = 1, 2, , n, be a sequence of points in two dimensions. An algorithm is given that calculates the parameters t_i, i = 1, 2, , n, that minimize the function max{ _i – (t_i) ₂ : i = 1, 2, , n } subject to the constraints 0 t₁ t₂ t_n T. Further, the final value of the objective function is best lexicographically, when the distances _i – (t_i)₂, i = 1, 2, , n, are sorted into decreasing order. The algorithm finds the global solution to this calculation. Usually the magnitude of the total work is only about n when the number of data points is large. The efficiency comes from techniques that use bounds on the final values of the parameters to split the original problem into calculations that have fewer variables. The splitting techniques are analysed, the algorithm is described, and some numerical results are presented and discussed.     

The nth reduced BKP hierarchy, the string equation and BW 1+∞-constraints

We study the BKP hierarchy and its n-reduction, for the case that n is odd. This is related to the principal realization of the basic module of the twisted affine Lie algebra % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqaqpepeea0dXdb9aqVe% 0larpepe0lb9cs0-LqLs-Jarpepeea0-qqVe0Firpepa0xar-xfr-x% fj-hmeGabaqaciGacaGaaeqabaWaaeaaeaaakeaadaWfGaqaaiGaco% hacaGGSbWaaSbaaSqaaiaac6gaaeqaaaqabKqaGhaacqWIh4ETaaGc% daahaaWcbeqaaiaacIcacaaIYaGaaiykaaaaaaa!3B2F!\[\mathop {{\mathop{\rm sl}\nolimits} _n }\limits^ ^{(2)} \]. We show that the following two statements for a BKP function are equivalent: (1) is is n-reduced and satisfies the string equation, i.e., L _-1=0, where L _-1 is an element of some natural Virasoro algebra. (2) satisfies the vacuum constraints of the BW ₁₊ algebra. Here BW ₁₊ is the natural analog of the W ₁₊ algebra, which plays a role in the KP case.The research of Johan van de Leur is financially supported by the Stichting Fundamenteel Onderzoek der Materie (FOM).     

Generating Uniform Random Vectors

In this paper, we study the rate of convergence of the Markov chain X _n+1=AX _n +b _n mod p, where A is an integer matrix with nonzero integer eigenvalues and {b _n } _n is a sequence of independent and identically distributed integer vectors. If _i±1 for all eigenvalues _i of A, then n=O((log p)²) steps are sufficient and n=O(log p) steps are necessary to have X _n sampling from a nearly uniform distribution. Conversely, if A has the eigenvalue ₁=±1, and _i±1 for all i1, n=O(p²) steps are necessary and sufficient.     

On a problem about covering lines by squares

LetS be the square [0,n]² of side lengthn and letS = {S ₁, ...,S _t} be a set of unit squares lying insideS, whose sides are parallel to those ofS.S is called a line cover, if every line intersectingS also intersects someS _i S. Let(n) denote the minimum cardinality of a line cover, and let(n) be defined in the same way, except that we restrict our attention to lines which are parallel to either one of the axes or one of the diagonals ofS. It has been conjectured by Fejes Tóth that(n)=2n+O(1) and by Bárány and Füredi that(n)=3/2n+O(1). We will prove that, instead,(n)=4/3n+O(1) and, as to Fejes Tóth's conjecture, we will exhibit a noninteger solution to a related LP-relaxation, which has size equal to 3/2n+O(1).     

Descendants constructed from matter field in Landau-Ginzburg theories coupled to topological gravity

It is argued that gravitational descendants in the theory of topological gravity coupled to topological Landau-Ginzburg theory (not necessarily conformal) can be constructed from matter fields alone (without metric fields and ghosts). In this sense topological gravity is induced. We discuss the mechanism of this effect (that turns out to be connected with K. Saito's higher residue pairing: Kⁱ(_i(₁),₂)=K⁰(₁,₂)), and demonstrate how it works in a simplest nontrivial example: correlator on a sphere with four marked points. We also discuss some results on k-point correlators on a sphere. From the idea of induced topological gravity it follows that the theory of pure topological gravity (without topological matter) is equivalent to the trivial Landau-Ginzburg theory (with quadratic superpotential).Published in Teoreticheskaya i Matematicheskaya Fizika, Vol. 95, No. 2, pp. 307–316, May, 1993.     

Transversally bounded lattices

A problem stemming from a boundedness question for torsion modules and its translation into ideal lattices is explored in the setting of abstract lattices. Call a complete lattice L transversally bounded (resp., uniformly transversally bounded) if for all families (X _i)_iIof nonempty subsets of L with the property that {x _iiI}<1 for all choices of x _iX _i, almost all of the sets X _ihave join smaller than 1 (resp., _jJ X _jhas join smaller than 1 for some cofinite subset J of I). It is shown that the lattices which are transversally bounded, but not uniformly so, correspond to certain ultrafilters with peculiar boundedness properties similar to those studied by Ramsey. The prototypical candidates of the two types of lattices which one is led to construct from ultrafilters (in particular the lattices arising from what will be called Ramsey systems) appear to be of interest beyond the questions at stake.     

Lattice Polytopes Associated to Certain Demazure Modules of sl n + 1

Let w be an element of the Weyl group of sl _{n + 1}. We prove that for a certain class of elements w (which includes the longest element w₀ of the Weyl group), there exist a lattice polytope R ^l(w) , for each fundamental weight _i of sl _{n + 1}, such that for any dominant weight = _{i = 1} ⁿ a _{i i} , the number of lattice points in the Minkowski sum _w = _{i = 1} ⁿ a _{i i} ^w is equal to the dimension of the Demazure module E _w (). We also define a linear map A ^w : R ^l(w) P _Z R where P denotes the weight lattice, such that char E _w () = e e^–A(x) where the sum runs through the lattice points x of ^w .