The isogeny conjecture for <Emphasis Type="Italic">A</Emphasis>-motives

We prove the isogeny conjecture for A-motives over finitely generated fields K of transcendence degree ≤1. This conjecture says that for any semisimple A-motive M over K, there exist only finitely many isomorphism classes of A-motives M′ over K for which there exists a separable isogeny M′→M. The result is in precise analogy to known results for abelian varieties and for Drinfeld modules and will have strong consequences for the \mathfrak p{\mathfrak {p}}-adic and adelic Galois representations associated to M. The method makes essential use of the Harder–Narasimhan filtration for locally free coherent sheaves on an algebraic curve.     

A-optimal designs for an additive cubic model

Chan et al. (1998a) obtained A-optimal designs for an additive quadratic mixture model for q≥3 mixture components. In this paper, we obtain the A-optimal designs for an additive cubic model for q≥3 mixture components using the class of symmetric weighted centroid designs based on barycentres of various depths. We observe that barycentres of depths 0 and 2 are possible support points for an A-optimal design. We have also given the optimal weights of A-optimal designs for 3≤q≤17.     

Unconditional global well-posedness for the 3D Gross-Pitaevskii equation for data without finite energy

The Cauchy problem for the Gross-Pitaevskii equation in three space dimensions is shown to have an unconditionally unique global solution for data of the form 1 + H ^s for 5/6 < s < 1, which do not have necessarily finite energy. The proof uses the I-method which is complicated by the fact that no L ²-conservation law holds. This shows that earlier results of Bethuel-Saut for data of the form 1 + H ¹ and Gérard for finite energy data remain true for this class of rough data.     

Superconvergence analysis of splitting positive definite nonconforming mixed finite element method for pseudo-hyperbolic equations

In this paper, a new splitting positive definite nonconforming mixed finite element method is proposed for pseudo-hyperbolic equations, in which a quasi-Wilson quadrilateral element is used for the flux p, and the bilinear element is used for u. Superconvergence results in ｜｜·｜｜div,h norm for p and optimal error estimates in L2 norm for u are derived for both semi-discrete and fully discrete schemes under almost uniform meshes.     

Loss without recovery of Gibbsianness during diffusion of continuous spins

We consider a specific continuous-spin Gibbs distribution μ_t=0 for a double-well potential that allows for ferromagnetic ordering. We study the time-evolution of this initial measure under independent diffusions. For `high temperature' initial measures we prove that the time-evoved measure μ<sub>t</sub> is Gibbsian for all t. For `low temperature' initial measures we prove that μ_t stays Gibbsian for small enough times t, but loses its Gibbsian character for large enough t. In contrast to the analogous situation for discrete-spin Gibbs measures, there is no recovery of the Gibbs property for large t in the presence of a non-vanishing external magnetic field. All of our results hold for any dimension d≥2. This example suggests more generally that time-evolved continuous-spin models tend to be non-Gibbsian more easily than their discrete-spin counterparts. Research carried out at EURANDOM and supported by Deutsche Forschungsgemeinschaft     

Two-Sided Optimal Bounds for Green Functions of Half-Spaces for Relativistic <Emphasis Type="Italic">α</Emphasis>-Stable Process

The purpose of this paper is to find optimal estimates for the Green function of a half-space of the relativistic α -stable process with parameter m on ℝ ^d space. This process has an infinitesimal generator of the form mI–(m ^2/α I–Δ) ^α/2, where 0<α<2, m>0, and reduces to the isotropic α-stable process for m=0. Its potential theory for open bounded sets has been well developed throughout the recent years however almost nothing was known about the behaviour of the process on unbounded sets. The present paper is intended to fill this gap and we provide two-sided sharp estimates for the Green function for a half-space. As a byproduct we obtain some improvements of the estimates known for bounded sets. Our approach combines the recent results obtained in Byczkowski et al. (Bessel Potentials, Hitting Distributions and Green Functions (2006) (preprint). ), where an explicit integral formula for the m-resolvent of a half-space was found, with estimates of the transition densities for the killed process on exiting a half-space. The main result states that the Green function is comparable with the Green function for the Brownian motion if the points are away from the boundary of a half-space and their distance is greater than one. On the other hand for the remaining points the Green function is somehow related the Green function for the isotropic α-stable process. For example, for d≥3, it is comparable with the Green function for the isotropic α-stable process, provided that the points are close enough. Research supported by KBN Grants.     

An upper bound for permanents of nonnegative matrices

A recent conjecture of Caputo, Carlen, Lieb, and Loss, and, independently, of the author, states that the maximum of the permanent of a matrix whose rows are unit vectors in lp is attained either for the identity matrix I or for a constant multiple of the all-1 matrix J.The conjecture is known to be true for p=1 (I) and for p?2 (J).We prove the conjecture for a subinterval of (1,2), and show the conjectured upper bound to be true within a subexponential factor (in the dimension) for all 1<p<2. In fact, for p bounded away from 1, the conjectured upper bound is true within a constant factor.     

On Variation Functions for Subsequence Ergodic Averages

 Suppose denote the ergodic averages for the natural numbers . Let denote the corresponding maximal function and let for . We show that for if there exists such that then there exists such that . Similar weak (1,1) inequalities follow for V _q when you know them for M too also with q > 1. We also show this fails completely if q= 1. We also show that for certain polynomial like and random sequences , if

On universal spaces and absorbing sets related to a transfinite extension of covering dimension

R. Pol has shown that for every countable ordinal number α there exists a universal space for separable metrizable spaces X with trindX?α. W. Olszewski has shown that for every countable limit ordinal number λ there is no universal space for separable metrizable space with trIndX?λ. T. Radul and M. Zarichnyi have proved that for every countable limit ordinal number there is no universal space for separable metrizable spaces with dimWX?α where dimW is a transfinite extension of covering dimension introduced by P. Borst. We prove the same result for another transfinite extension dimC of the covering dimension.As an application, we show that there is no absorbing sets (in the sense of Bestvina and Mogilski) for the classes of spaces X with dimCX?α belonging to some absolute Borel class.     

Anomalous behaviour for the random corrections to the cumulants of random walks in fluctuating random media

The Central Limit Theorem for a model of discrete-time random walks on the lattice ℤ^ν in a fluctuating random environment was proved for almost-all realizations of the space-time nvironment, for all ν > 1 in [BMP1] and for all ν≥ 1 in [BBMP]. In [BMP1] it was proved that the random correction to the average of the random walk for ν≥ 3 is finite. In the present paper we consider the cases ν = 1,2 and prove the Central Limit Theorem as T→∞ for the random correction to the first two cumulants. The rescaling factor for theaverage is for ν = 1 and (ln T), for ν=2; for the covariance it is , ν = 1,2. Received: 25 November 1999 / Revised version: 7 June 2000 / Published online: 15 February 2001     

On the optimal switching level for an M/G/1 queueing system

A cost function is studied for an M/G/1 queueing model for which the service rate of the virtual waiting time process U_t for U_t<K differs from that for U_t > K. The costs considered are costs for maintaining the service rate, costs for switching the service rate and costs proportional to the inventory U_t. The relevant cost factors for the system operating below level K differ from those when U_t > K. The cost function which is considered only for the stationary situation of the U_t-process expresses the average cost per unit time. The problem is to find that K for which the cost function reaches a minimum. Criteria for the possibly optimal cases are found; they have an interesting intuitive interpretation, and require the knowledge of only the first moment of the service time distribution.     

Tree spanners in planar graphs

A tree t-spanner of a graph G is a spanning subtree T of G in which the distance between every pair of vertices is at most t times their distance in G. Spanner problems have received some attention, mostly in the context of communication networks. It is known that for general unweighted graphs, the problem of deciding the existence of a tree t-spanner can be solved in polynomial time for t=2, while it is NP-hard for any t⩾4; the case t=3 is open, but has been conjectured to be hard. In this paper, we consider tree spanners in planar graphs. We show that even for planar unweighted graphs, it is NP-hard to determine the minimum t for which a tree t-spanner exists. On the other hand, we give a polynomial algorithm for any fixed t that decides for planar unweighted graphs with bounded face length whether there is a tree t-spanner. Furthermore, we prove that it can be decided in polynomial time whether a planar unweighted graph has a tree t-spanner for t=3.     

Reduktionsverfahren für Differenzengleichungen bei Randwertaufgaben II

Summary In a recent paper [11], two of the authors investigated a fast reduction method for solving difference equations which approximate certain boundary value problems for Poisson's equation. In this second paper, we prove the numerical stability of the reduction method, and also report on further developments of the method. For the general case, the provided bounds for the numerical errors behave roughly like the condition numberO(n ²) of the linear system; for more realistic model problems estimates of order less thanO(n) are obtained (n ^–1=h=mesh width). The number of operations required for the reduction method isO(n ² ), for the usual five-point difference formula, as well as for the common nine-point formula with discretization error of orderh ⁴.     

Lyapunov,Bézout,and Hankel

Given a polynomial f of degree n, we denote by C its companion matrix, and by S the truncated shift operator of order n. We consider Lyapunov-type equations of the form X?SXC=>W and X?CXS=W. We derive some properties of these equations which make it possible to characterize Bezoutian matrices as solutions of the first equation with suitable right-hand sides W (similarly for Hankel and the second equation) and to write down explicit expressions for these solutions. This yields explicit factorization formulae for polynomials in C, for the Schur-Cohn matrix, and for matrices satisfying certain intertwining relations, as well as for Bezoutian matrices.     

Generalized iterative methods for semidefinite linear systems

We consider iterative methods for semidefinite systems Ax = b based on splittings A = B ? C, where B is not necessarily nonsingular. Necessary and sufficient conditions for convergence are obtained. These are then used to obtain convergence results for block SOR, block SSOR, and block JOR methods for matrices with semidefinite block diagonal.     

Gauss-Hermite quadratures for functions from Hilbert spaces with Gaussian reproducing kernels

We study univariate integration with the Gaussian weight for a positive variance α. This is done for the reproducing kernel Hilbert space with the Gaussian kernel for a positive shape parameter γ. We study Gauss-Hermite quadratures, although this choice of quadratures may be questionable since polynomials do not belong to this space of functions. Nevertheless, we provide the explicit formula for the error of the Gauss-Hermite quadrature using n function values. In particular, for 2αγ ²<1 we have an exponential rate of convergence, and for 2αγ ²=1 we have no convergence, whereas for 2αγ ²>1 we have an exponential divergence.     

A remark on local-global principles for conjugacy classes

A local-global principle is shown to hold for all conjugacy classes of any inner form of GL(n), SL(n), U(n), SU(n), and for all semisimple conjugacy classes in any inner form of Sp(n), over fieldsk with vcd(k)≤1. Over number fields such a principle is known to hold for any inner form of GL(n) and U(n), and for the split forms of Sp(n), O(n), as well as for SL(p) but not for SL(n),n non-prime. The principle holds for all conjugacy classes in any inner form of GL(n), but not even for semisimple conjugacy classes in Sp(n), over fieldsk with vcd(k)≤2. The principle for conjugacy classes is related to that for centralizers.     

An intermediate value theorem for graphs with given automorphism group

For a positive integer n and a finite group G, let the symbols e(G, n) and E(G, n) denote, respectively, the smallest and the greatest number of lines among all n-point graphs with automorphism group G. We say that the Intermediate Value Theorem (IVT) holds for G and n, if for each e satisfying e(G, n)≤e≤E(G, n), there exists an n-point graph with group G and e lines. The main result of this paper states that for every group G the IVT holds for all sufficiently large n. We also prove that the IVT holds for the identity group and all n, and exhibit examples of groups for which the IVT fails to hold for small values of n.     

On the spectral representation of symmetric stable processes

The so-called spectral representation theorem for stable processes linearly imbeds each symmetric stable process of index p into L^p (0 < p ≤ 2). We use the theory of L^p isometries for 0 < p < 2 to study the uniqueness of this representation for the non-Gaussian stable processes. We also determine the form of this representation for stationary processes and for substable processes. Complex stable processes are defined, and a complex version of the spectral representation theorem is proved. As a corollary to the complex theory we exhibit an imbedding of complex L^q into real or complex L^p for 0 < p < q ≤ 2.     

Ramsey Functions for Quasi-Progressions

 A quasi-progression of diameter n is a finite sequence for which there exists a positive integer L such that for . Let be the least positive integer such that every 2-coloring of will contain a monochromatic k-term quasi-progression of diameter n. We give a lower bound for in terms of k and i that holds for all . Upper bounds are obtained for in all cases for which . In particular, we show that . Exact formulae are found for and . We include a table of computer-generated values of , and make several conjectures. Received: September 22, 1995 / Revised: February 28, 1997