Large indecomposables over representation-infinite orders and algebras

Let R be a complete discrete valuation domain with quotient field K, and let be an R-order in a semisimple K-algebra. Butler, Campbell, and Kovács have shown that R-free -modules decompose into -lattices when is representation-finite. Using the theory of ladder functors, we prove the converse by constructing indecomposable R-free -modules of infinite rank if is not representation-finite.Received: 23 March 2004     

Nonlocal symmetries and the theory of coverings: An addendum to A. M. vinogradov's ‘local symmetries and conservation laws”

For a systemY of partial differential equations, the notion of a covering Y is introduced whereY is infinite prolongation ofY. Then nonlocal symmetries ofY are defined as transformations of which conserve the underlying contact structure. It turns out that generating functions of nonlocal symmetries are integro-differential-type operators.     

On numerical cubatures of singular surface integrals in boundary element methods

Summary We present and analyze methods for the accurate and efficient evaluation of weakly, Cauchy and hypersingular integrals over piecewise analytic curved surfaces in ³.The class of admissible integrands includes all kernels arising in the numerical solution of elliptic boundary value problems in three-dimensional domains by the boundary integral equation method. The possibly not absolutely integrable kernels of boundary integral operators in local coordinates are pseudohomogeneous with analytic characteristics depending on the local geometry of the surface at the source point. This rules out weighted quadrature approaches with a fixed singular weight.For weakly singular integrals it is shown that Duffy's triangular coordinates leadalways to a removal of the kernel singularity. Also asymptotic estimates of the integration error are provided as the size of the boundary element patch tends to zero. These are based on the Rabinowitz-Richter estimates in connection with an asymptotic estimate of domains of analyticity in ².It is further shown that the modified extrapolation approach due to Lyness is in the weakly singular case always applicable. Corresponding error and asymptotic work estimates are presented.For the weakly singular as well as for Cauchy and hypersingular integrals which e.g. arise in the study of crack problems we analyze a family of product integration rules in local polar coordinates. These rules are hierarchically constructed from finite part integration formulas in radial and Gaussian formulas in angular direction. Again, we show how the Rabinowitz-Richter estimates can be applied providing asymptotic error estimates in terms of orders of the boundary element size.Partially supported by the Priority Research Programme Boundary Element Methods of the German Research Foundation DFG under Grant No. We 659/16-1 (guest programme) and under AFOSR-grant 89-0252.     

Some fractal sets determined by stable processes

Summary LetY _i be independent stable subordinators in (, ,P) with indices 0< _i <1 andR _i are the ranges ofY _i ,i=1, 2. We are able to find the exact Hausdorff measure and packing measure results for the product setsR ₁×R ₂, and whenever ₁ + ₂ 1/2, we deduce results for the vector sumR ₁R ₂={x+y:xR ₁,yR ₂}.     

On basicity of exponentials inL P (dμ) and general prediction problems

Let be a nonnegative measure on the unit circle in the complex plane and 1<p<. It is of interest to find conditions on so that the set of exponentialse ⁱⁿ form a strongM-basis forL ^p (d). Some partial results are proved which can shed some light on this important open question. These results are of fundamental importance in the prediction theory of stochastic processes and other fields of applications. These results is then used to obtain a theorem which reduces some prediction problems to easier ones.To 80^th birthday of Paul ErdsThis research is supported by Office of Naval Research Grant No N00014-89-J-1824.     

Dominated, diagonal polynomials on ℓ p spaces

We show that the r-dominated polynomials on _p(2 p ) are integral on ₁, and give examples proving that the converse is not true. We characterize when the 2-homogeneous, diagonal polynomials on _p(1 < p ) are r-dominated. We prove that, unlike the linear case, there are nuclear polynomials which are not 1-dominated.Received: 6 June 2004; revised: 28 September 2004     

Trace theorems and kinetic equations for non divergence free external forces

For a general class of time dependent linear Boltzmann type equations with (i) an external, non divergence free force terma a ?u/?ξ (ii) a collision term which can be written as the difference of a gain term involving a general nonnegative "collision frequencyn h(x,ξ,t) and a loss term involving an arbitrary bounded linear operator J, and (iii) a general boundary operator K which is a (strict) contraction, the method of characteristics and perturbation techniques are used to obtain the well-posed- ness of the initial-boundary value problem, provided the divergence b of a is bounded above. The functional setting is L^p, 1o-semigroup on L_p(Σdμ). The results are proven by generalizing a recently established theory of time dependent kinetic equations where the external force is divergence free with respect to velocity. Solutions on spaces of measures are discussed briefly.     

Error analysis of the Björck-Pereyra algorithms for solving Vandermonde systems

Summary A forward error analysis is presented for the Björck-Pereyra algorithms used for solving Vandermonde systems of equations. This analysis applies to the case where the points defining the Vandermonde matrix are nonnegative and are arranged in increasing order. It is shown that for a particular class of Vandermonde problems the error bound obtained depends on the dimensionn and on the machine precision only, being independent of the condition number of the coefficient matrix. By comparing appropriate condition numbers for the Vandermonde problem with the forward error bounds it is shown that the Björck-Pereyra algorithms introduce no more uncertainty into the numerical solution than is caused simply by storing the right-hand side vector on the computer. A technique for computing running a posteriori error bounds is derived. Several numerical experiments are presented, and it is observed that the ordering of the points can greatly affect the solution accuracy.     

Decay of conservation laws and their generating functions

Quantities which are conserved in nondissipative media decay in the presence of dissipation. The velocity of such a decay (or the balance law) may be found explicitly using the generating function of the conservation law. The general approach is illustrated with a system of MHD equations for incompressible magnetofluids.     

On depth measures and dual statistics. A methodology for dealing with general data

A general depth measure, based on the use of one-dimensional linear continuous projections, is proposed. The applicability of this idea in different statistical setups (including inference in functional data analysis, image analysis and classification) is discussed. A special emphasis is made on the possible usefulness of this method in some statistical problems where the data are elements of a Banach space.The asymptotic properties of the empirical approximation of the proposed depth measure are investigated. In particular, its asymptotic distribution is obtained through U-statistics techniques. The practical aspects of these ideas are discussed through a small simulation study and a real-data example.     

Inversion de l'espace et du temps des processus de Lévy stables

We proove a new duality relation between stable Lévy processes with index and those with index . This duality appears to be the trajectorial version of the duality of Zolotarev which concerns one dimensional stable laws. We give an application of this result to the behaviour of the paths at small and large times of the process ``conditioned to stay positive'. Mots-clefs: Lévy process Stable process Fluctuation identities Ladder process     

Complete classification of torsion of elliptic curves over quadratic cyclotomic fields

Text

In a previous paper Najman (in press) [9], the author examined the possible torsions of an elliptic curve over the quadratic fields Q(i) and . Although all the possible torsions were found if the elliptic curve has rational coefficients, we were unable to eliminate some possibilities for the torsion if the elliptic curve has coefficients that are not rational. In this note, by finding all the points of two hyperelliptic curves over Q(i) and , we solve this problem completely and thus obtain a classification of all possible torsions of elliptic curves over Q(i) and .

Video

For a video summary of this paper, please click here or visit http://www.youtube.com/watch?v=VPhCkJTGB_o.     

Algebraic multilevel preconditioning methods. I

Summary A recursive way of constructing preconditioning matrices for the stiffness matrix in the discretization of selfadjoint second order elliptic boundary value problems is proposed. It is based on a sequence of nested finite element spaces with the usual nodal basis functions. Using a nodeordering corresponding to the nested meshes, the finite element stiffness matrix is recursively split up into two-level block structures and is factored approximately in such a way that any successive Schur complement is replaced (approximated) by a matrix defined recursively and thereform only implicitely given. To solve a system with this matrix we need to perform a fixed number (v) of iterations on the preceding level using as an iteration matrix the preconditioning matrix already defined on that level. It is shown that by a proper choice of iteration parameters it suffices to use \left( {1 - \gamma ^2 } \right)^{ - \tfrac{1}{2}} $$ " align="middle" border="0"> iterations for the so constructedv-foldV-cycle (wherev=2 corresponds to aW-cycle) preconditioning matrices to be spectrally equivalent to the stiffness matrix. The conditions involve only the constant in the strengthened C.-B.-S. inequality for the corresponding two-level hierarchical basis function spaces and are therefore independent of the regularity of the solution for instance. If we use successive uniform refinements of the meshes the method is of optimal order of computational complexity, if . Under reasonable assumptions of the finite element mesh, the condition numbers turn out to be so small that there are in practice few reasons to use an accelerated iterative method like the conjugate gradient method, for instance.Dedicated to the memory of Peter HenriciThe research of the second author reported here was supported in part by the Committee of Science, Bulgaria, under Grant No. 55/26.03.87     

ON A THEOREM OF A.A. LYAPUNOV

Abstract

In this note we obtain some extensions and an approximation of the Lyapunov convexity theorem by means of the bilinear integration of a set-valued function. The integration is performed successively with respect to a non-atomic, a direct sum and a Darboux vector measure. The necessary counterexamples are provided.     

The hyperring of adèle classes

Text

We show that the theory of hyperrings, due to M. Krasner, supplies a perfect framework to understand the algebraic structure of the adèle class space HK=AK/K^× of a global field K. After promoting F₁ to a hyperfield K, we prove that a hyperring of the form R/G (where R is a ring and G⊂R^× is a subgroup of its multiplicative group) is a hyperring extension of K if and only if G∪{0} is a subfield of R. This result applies to the adèle class space which thus inherits the structure of a hyperring extension HK of K. We begin to investigate the content of an algebraic geometry over K. The category of commutative hyperring extensions of K is inclusive of: commutative algebras over fields with semi-linear homomorphisms, abelian groups with injective homomorphisms and a rather exotic land comprising homogeneous non-Desarguesian planes. Finally, we show that for a global field K of positive characteristic, the groupoid of the prime elements of the hyperring HK is canonically and equivariantly isomorphic to the groupoid of the loops of the maximal abelian cover of the curve associated to the global field K.

Video

For a video summary of this paper, please click here or visit http://www.youtube.com/watch?v=3LSKD_PfJyc.     

Sur la mesure de sortie du super mouvement brownien

Summary We study some properties of the exit measure of super Brownian motion from a smooth domainD inR ^d . In particular, we give precise estimates for the probability that the exit measure gives a positive mass to a small ball on the boundary. As an application, we compute the Hausdorff dimension of the support of the exit measure. In dimension 2, we prove that the exit measure is absolutely continuous with respect to the Lebesgue measure on the boundary. In connection with Dynkin's work, our results give some information on the behavior of solutions of u=u ² inD, and are related to the characterization of removable singularities at the boundary. As a consequence of our estimates, we give a sufficient condition for the uniqueness of the positive solution of u=u ² inD that tends to on an open subsetO of D and to 0 on the complement in D of the closure ofO. Our proofs use the path-valued process studied in [L2, L3].

     

Characterization of infinite divisibility by duality formulas. Application to Lévy processes and random measures

Processes with independent increments are proven to be the unique solutions of duality formulas. This result is based on a simple characterization of infinitely divisible random vectors by a functional equation in which a difference operator appears. This operator is constructed by a variational method and compared to approaches involving chaos decompositions. We also obtain a related characterization of infinitely divisible random measures.     

Asymptotic bias and variance for a general class of varying bandwidth density estimators

Summary We consider a general class of varying bandwidth estimators of a probability density function. The class includes the Abramson estimator, transformation kernel density estimator (TKDE), Jones transformation kernel density estimator (JTKDE), nearest neighbour type estimator (NN), Jones-Linton-Nielsen estimator (JLN), Taylor series approximations of TKDE (TTKDE) and Simpson's formula approximations of TKDE (STKDE). Each of these estimators needs a pilot estimator. Starting with an ordinary kernel estimator , it is possible to iterate and compute a sequence of estimates , using each estimate as a pilot estimator in the next step. The first main result is a formula for the bias order. If the bandwidths used in different steps have a common orderh=h(n), the bias of is of orderh ^2km ,k=1, ...,t. Hereh ^m is the bias order of the ideal estimator (defined by using the unknownf as pilot). The second main result is a recursive formula for the leading bias and stochastic terms in an asymptotic expansion of the density estimates. Ifm<, it is possible to make asymptotically equivalent to the ideal estimator.     

Sample function behavior of increasing processes of class L

Summary We consider increasing processes {X(t)t0} of classL, that is, increasing self-similar processes with inswpendent increments. Leth(t) be an increasing positive function on (0,) withh(0+)=0 andh()=. By virtue of the zero-one laws, there existsc (resp.C) [0,] such that lim inf (resp. lim sup)X(t)/h(t)=c (resp.C) a.s. both ast tends to 0 and ast tends to . We decide a necessary and sufficient condition for the existence ofh(t) withc orC=1 and explicitly constructh(t) in caseh(t) exists withc orC=1. Moreover, we give a criterion to classify functionsh(t) withc (orC)=0 andh(t) withc (orC)= in caseh(t) does not exist withc (orC)=1.