Primitive Ideals and Automorphisms of Quantum Matrices

Let be a field and q be a nonzero element of that is not a root of unity. We give a criterion for 〈0〉 to be a primitive ideal of the algebra of quantum matrices. Next, we describe all height one primes of ; these two problems are actually interlinked since it turns out that 〈0〉 is a primitive ideal of whenever has only finitely many height one primes. Finally, we compute the automorphism group of in the case where m ≠ n. In order to do this, we first study the action of this group on the prime spectrum of . Then, by using the preferred basis of and PBW bases, we prove that the automorphism group of is isomorphic to the torus when m ≠ n and (m,n) ≠ (1, 3),(3, 1). This research was supported by a Marie Curie Intra-European Fellowship within the 6th European Community Framework Programme and by Leverhulme Research Interchange Grant F/00158/X.     

Skorokhod decomposition of reflected diffusions on bounded Lipschitz domains with singular non-reflection part

Let be a compact set with interior G. Let L ¹ (G,dx), >0 dx-a.e. on G, and m:=dx. Let A=(a _ij ) be symmetric, and globally uniformly strictly elliptic on G. Let be such that ; f, , is closable in L ² (G,m) with closure ( ^r ,D( ^r )). The latter is fulfilled if satisfies the Hamza type condition, or _i L ¹ _loc (G,dx), 1id. Conservative, non-symmetric diffusion processes X _t related to the extension of a generalized Dirichlet form where satisfies are constructed and analyzed. If G is a bounded Lipschitz domain, H ^1,1 (G), and a _ij D( ^r ), a Skorokhod decomposition for X _t is given. This happens through a local time that is uniquely associated to the smooth measure 1_{{ Tr ()>0}} d, where Tr denotes the trace and the surface measure on G.This research has been financially supported by TMR grant HPMF-CT-2000-00942 of the European Union. Mathematics Subject Classification (2000): 60J60, 60J55, 31C15, 31C25, 35J25     

Universality of critical behaviour in a class of recurrent random walks

Let X₀=0, X₁, X₂,.. be an aperiodic random walk generated by a sequence ₁, ₂,... of i.i.d. integer-valued random variables with common distribution p(·) having zero mean and finite variance. For anN-step trajectory and a monotone convex functionV: withV(0)=0, define Further, let be the set of all non-negative paths compatible with the boundary conditionsX₀=a, X_N=b. We discuss asymptotic properties of under the probability distribution N and 0, Z^a,b_N,+, being the corresponding normalization. If V(·) grows not faster than polynomially at infinity, define H() to be the unique solution to the equation Our main result reads that as 0, the typical height of X_[, ^N] scales as H() and the correlations along decay exponentially on the scale H()². Using a suitable blocking argument, we show that the distribution tails of the rescaled height decay exponentially with critical exponent 3/2. In the particular case of linear potential V(·), the characteristic length H() is proportional to ^-1/3 as 0.Mathematics Subject Classification (2000):60G50, 60K35; 82B27, 82B41     

Asymptotic properties of type I elliptical random vectors

Let be an elliptical random vector with a non-singular square matrix and a spherical random vector in , and let be a sequence of vectors in such that . We assume in this paper that the associated random radius R _k =(S ₁ + S ₂ +...+S _k )^1/2 is almost surely positive, and it has distribution function in the Gumbel max-domain of attraction. Relying on extreme value theory we obtain an exact asymptotic expansion of the tail probability for converging as to a boundary point. Further we discuss density convergence under a suitable transformation. We apply our results to obtain an asymptotic approximation of the distribution of partial excess above a high threshold, and to derive a conditional limiting result. Further, we investigate the asymptotic behaviour of concomitants of order statistics, and the tail asymptotics of associated random radius for subvectors of .      

Hitting time of a half-line by two-dimensional random walk

We consider the probability that a two-dimensional random walk starting from the origin never returns to the half-line {(x₁,x₂)|x₁0,x₂=0} before time n. It is proved that for aperiodic random walk with mean zero and finite 2+(>2)-th absolute moment, this probability times n^1/4 converges to some positive constant c^* as . We show that c^* is expressed by using the characteristic function of the increment of the random walk. For the simple random walk, this expression gives Mathematics Subject Classification (2000):60G50, 60E10     

Parameter Estimates in Random Intercept Mixed Effects Model for Repeated Measures

In this article the following random intercept mixed effects model will be considered： yij = vi =v^τijβ＋ εij,i=1,…,m;j=1,2,…,ni, where {vi} are i.i.d, random effects with mean α 2. 2 and finite variance σ^2 v, {εij} are i.i.d, random errors with finite variance ε^2 ε. Here we will estimate α,σ^2 v,σ^2 ε,β and study their large sample properties, such as strong consistency, strong convergence rates and asymptotic normality.     

Almost everywhere convergence of the spherical partial sums for radial functions

LetfL ^p( ⁿ ),n2, be a radial function and letS _Rf be the spherical partial sums operator. We prove that if thenS _Rf(x)f(x) a.e. asR. The result is false for and \frac{{2n}}{{n + 1}}$$ " align="middle" border="0"> .Partially supported by M.P.I.     

Linear phase transition in random linear constraint satisfaction problems

Our model is a generalized linear programming relaxation of a much studied random K-SAT problem. Specifically, a set of linear constraints on K variables is fixed. From a pool of n variables, K variables are chosen uniformly at random and a constraint is chosen from also uniformly at random. This procedure is repeated m times independently. We are interested in whether the resulting linear programming problem is feasible. We prove that the feasibility property experiences a linear phase transition, when n and m = cn for a constant c. Namely, there exists a critical value c^* such that, when c < c^*, the problem is feasible or is asymptotically almost feasible, as n, but, when c>c^*, the distance to feasibility is at least a positive constant independent of n. Our result is obtained using the combination of a powerful local weak convergence method developed in Aldous [Ald92], [Ald01], Aldous and Steele [AS03], Steele [Ste02] and martingale techniques. By exploiting a linear programming duality, our theorem implies the following result in the context of sparse random graphs G(n, cn) on n nodes with cn edges, where edges are equipped with randomly generated weights. Let (n, c) denote maximum weight matching in G(n, cn). We prove that when c is a constant and n , the limit lim_n (n, c)/n, exists, with high probability. We further extend this result to maximum weight b-matchings also in G(n, cn).     

A sphere theorem for non-reversible Finsler metrics

For a non-reversible Finsler metric F on a compact smooth manifold M we introduce the reversibility = max {F(–X)|F(X)=1}1. We prove the following generalization of the classical sphere theorem in Riemannian geometry: A simply-connected and compact Finsler manifold of dimension n3 with reversibility and with flag curvature is homotopy equivalent to the n-sphere.Mathematics Subject Classification (2000):53C60; 53C20, 53C22     

Temperley-Lieb Immanants

We use the Temperley-Lieb algebra to define a family of totally nonnegative polynomials of the form . The cone generated by these polynomials contains all totally nonnegative polynomials of the form , where, are matrix minors. We also give new conditions on the sets I,...,K′ which characterize differences of products of minors which are totally nonnegative. Received September 30, 2004     

Laplace approximations for sums of independent random vectors

Summary LetX _i,iN, be i.i.d.B-valued random variables whereB is a real separable Banach space, and a mappingB R. Under some conditions an asymptotic evaluation of is possible, up to a factor (1+o(1)). This also leads to a limit theorem for the appropriately normalized sums under the law transformed by the density exp .     

Formality Theorem with Coefficients in a Module

In this paper, X will denote a manifold. In a very famous paper, Kontsevich [Ko] showed that the differential graded Lie algebra (DGLA) of polydifferential operators on X is formal. Calaque [C1] extended this theorem to any Lie algebroid. More precisely, given any Lie algebroid E over X, he defined the DGLA of E-polydifferential operators, and showed that it is formal. Denote by the DGLA of E-polyvector fields. Considering M, a module over E, we define the-module of E-polyvector fields with values in M. Similarly, we define the-module of E-polydifferential operators with values in M,. We show that there is a quasi-isomorphism of L _∞-modules over from to . Our result extends Calaque’s (and Kontsevich’s) result.     

Comments on the Trotter product formula error-bound estimates for nonself-adjoint semigroups

LetA be a positive self-adjoint operator and letB be anm-accretive operator which isA-small with a relative bound less than one. LetH=A+B, thenH is well-defined on dom(H)=dom(A) andm-accretive. IfB is a strictlym-accretive operator obeying

Algebraic Dilogarithm Identities

The Rogers L-function satisfies the functional equation .From this we derive several other such equations, including Euler's identity L(x)+L(1-x)=L(1) and various identities arising from summation and transformation formulas for basic hypergeometric series. We also obtain some new equations of the form where is algebraic and the c _k are integers.     

C*-Algebras of Integral Operators with Piecewise Slowly Oscillating Coefficients and Shifts Acting Freely

We establish a symbol calculus for the C*-subalgebra of generated by the operators of multiplication by slowly oscillating and piecewise continuous functions and the operators where is the Cauchy singular integral operator and The C*-algebra is invariant under the transformations

Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices

A result of Balas and Yu (1989) states that the number of maximal independent sets of a graph G is at most ^p+1, where is the number of pairs of vertices in G at distance 2, and p is the cardinality of a maximum induced matching in G. In this paper, we give an analogue of this result for hypergraphs and, more generally, for subsets of vectors in the product of n lattices =₁××_n, where the notion of an induced matching in G is replaced by a certain binary tree each internal node of which is mapped into . We show that our bounds may be nearly sharp for arbitrarily large hypergraphs and lattices. As an application, we prove that the number of maximal infeasible vectors x=₁××_n for a system of polymatroid inequalities does not exceed max{Q,^logt/c(2Q,)}, where is the number of minimal feasible vectors for the system, , , and c(,) is the unique positive root of the equation 2^c(^c/log–1)=1. This bound is nearly sharp for the Boolean case ={0,1}ⁿ, and it allows for the efficient generation of all minimal feasible sets to a given system of polymatroid inequalities with quasi-polynomially bounded right-hand sides . This research was supported by the National Science Foundation (Grant IIS-0118635), and by the Office of Naval Research (Grant N00014-92-J-1375). The second and third authors are also grateful for the partial support by DIMACS, the National Science Foundation's Center for Discrete Mathematics and Theoretical Computer Science.Mathematics Subject Classification (2000):20E28, 20G40, 20C20     

High Order Singular Rank One Perturbations of a Positive Operator

In this paper self-adjoint realizations in Hilbert and Pontryagin spaces of the formal expression are discussed and compared. Here L is a positive self-adjoint operator in a Hilbert space with inner product 〈·,·〉, α is a real parameter, and φ in the rank one perturbation is a singular element belonging to with n ≥ 3, where is the scale of Hilbert spaces associated with L in      

Light paths with an odd number of vertices in polyhedral maps

Let P _k be a path on k vertices. In an earlier paper we have proved that each polyhedral map G on any compact 2-manifold with Euler characteristic contains a path P _k such that each vertex of this path has, in G, degree . Moreover, this bound is attained for k = 1 or k 2, k even. In this paper we prove that for each odd , this bound is the best possible on infinitely many compact 2-manifolds, but on infinitely many other compact 2-manifolds the upper bound can be lowered to .     

On the asymptotical behavior of the constant in the Berry-Esseen inequality

LetF be the distribution function of a sumS _n ofn independent centered random variables, denote the standard normal distribution function and its density. It follows from our results that