Categories of algebraic sets

The category of algebraic sets is defined in a straightforward way for any algebraic theory . It is a concrete, complete and cocomplete category dually equivalent to a full reflective subcategory of the category of -algebras. For the algebraic theory of commutative algebras over a field K, we get the algebraic sets over K.     

On depth first search strees inm-out digraphs

We consider depth first search (DFS for short) trees in a class of random digraphs: am-out model. Let _i be thei ^th vertex encountered by DFS andL(i, m, n) be the height of _i in the corresponding DFS tree. We show that ifi/n asn, then there exists a constanta(,m), to be defined later, such thatL(i, m, n)/n converges in probability toa(,m) asn. We also obtain results concerning the number of vertices and the number of leaves in a DFS tree.     

On graphical partitions

An integer partition {₁,₂,..., _v } is said to be graphical if there exists a graph with degree sequence _i . We give some results corcerning the problem of deciding whether or not almost all partitions of even integer are non-graphical. We also give asymptotic estimates for the number of partitions with given rank.     

On the summability of Fourier series with the method of lacunary arithmetic means

. f- ,S _n (f)— . {n _k }, n _k+1/n _k >1+ck ^– ,— , 0<1/2, f ₀, .     

For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite?

Denote by the class of all triangle-free graphs on n vertices and m edges. Our main result is the following sharp threshold, which answers the question for which densities a typical triangle-free graph is bipartite. Fix > 0 and let . If n/2 m (1 – ) t ₃, then almost all graphs in are not bipartite, whereas if m (1 + )t ₃, then almost all of them are bipartite. For m (1 + )t ₃, this allows us to determine asymptotically the number of graphs in . We also obtain corresponding results for C -free graphs, for any cycle C of fixed odd length. Forschergruppe Algorithmen, Struktur, Zufall supported by Deutsche Forschungsgemeinschaft grant FOR 413/1-1     

Brownian charges around loops

Summary Let (X _t ⁿ ) be a Poisson sequence of independent Brownian motions in ^d ,d3; Let be a compact oriented submanifold of d, of dimensiond–2 and volume ; let t be the sum of the windings of (X _s ⁿ , 0st) around ; then t/t converges in law towards a Cauchy variable of parameter /2. A similar result is valid when the winding is replaced by the integral of a harmonic 1-form in ^d .     

Speed of convergence as a function of given accuracy for random search methods

The essence of this article lies in a demonstration of the fact that for some random search methods (r.s.m.) of global optimization, the number of the objective function evaluations required to reach a given accuracy may have very slow (logarithmic) growth to infinity as the accuracy tends to zero. Several inequalities of this kind are derived for some typical Markovian monotone r.s.m. in metric spaces including thed-dimensional Euclidean space ^d and its compact subsets. In the compact case, one of the main results may be briefly outlined as a constructive theorem of existence: if is a first moment of approaching a good subset of-neighbourhood ofx ₀=arg maxf by some random search sequence (r.s.s.), then we may choose parameters of this r.s.s. in such a way that E c(f) In² . Certainly, some restrictions on metric space and functionf are required.     

Moyennes uniformes et moyennes suivant une marche aléatoire

Summary Let be a bounded function on such that converges towards l as n goes to infinity, uniformly with respect to m. Let {X _n} be a random walk on , not concentrated on a proper subgroup of Then, with probability 1, converges towards l as n goes to infinity. The result also holds for any countable abelian group instead of . Other modes of convergence are considered (Cesaro convergence of order >1/2). The Cesaro convergence of expressions such that (X _n) (X _n+1) is also investigated.     

О предельном распределении для сумм независимых слууайных велиуин на бикомпактных коммутативных топологиуеских группах

,      

Large deviations for the invariant measure of a reaction-diffusion equation with non-Gaussian perturbations

Summary In this paper we establish a large deviations principle for the invariant measure of the non-Gaussian stochastic partial differential equation (SPDE) _t v =v +f(x,v )+(x,v ) . Here is a strongly-elliptic second-order operator with constant coefficients, h:=DH _xx-h, and the space variablex takes values on the unit circleS ¹. The functionsf and are of sufficient regularity to ensure existence and uniqueness of a solution of the stochastic PDE, and in particular we require that 0<mM wherem andM are some finite positive constants. The perturbationW is a Brownian sheet. It is well-known that under some simple assumptions, the solutionv ² is aC ^k (S ¹)-valued Markov process for each 0<1/2, whereC (S ¹) is the Banach space of real-valued continuous functions onS ¹ which are Hölder-continuous of exponent . We prove, under some further natural assumptions onf and which imply that the zero element ofC (S ¹) is a globally exponentially stable critical point of the unperturbed equation _t ⁰ = ⁰ +f(x,⁰), that has a unique stationary distributionv ^K, on (C (S ¹), (C ^K (S ¹))) when the perturbation parameter is small enough. Some further calculations show that as tends to zero,v ^K, tends tov ^K,0, the point mass centered on the zero element ofC (S ¹). The main goal of this paper is to show that in factv ^K, is governed by a large deviations principle (LDP). Our starting point in establishing the LDP forv ^K, is the LDP for the process , which has been shown in an earlier paper. Our methods of deriving the LDP forv ^K, based on the LDP for are slightly non-standard compared to the corresponding proofs for finite-dimensional stochastic differential equations, since the state spaceC (S ¹) is inherently infinite-dimensional.This work was performed while the author was with the Department of Mathematics, University of Maryland, College Park, MD 20742, USA     

Admissibility of linear estimators of regression coefficients under quadratic loss

For the general fixed effects linear model:Y=X+, N(0,V),V0, we obtain the necessary and sufficient conditions forLY+a to be admissible for a linear estimable functionS in the class of all estimators under the loss function (d -S)D(d -S), whereD0 is known. For the general random effects linear model: =XV ₁₁ X+XV ₁₂+V ₂₁ X+V ₂₂0, we also get the necessary and sufficient conditions forLY+a to be admissible for a linear estimable functionS+Q in the class of all estimators under the loss function (d -S -Q)D(d -S -Q), whereD0 is known.     

The quality of the Diophantine approximations found by the Jacobi-Perron algorithm and related algorithms

Given a vector of real numbers=(₁,... _d ) ^d , the Jacobi-Perron algorithm and related algorithms, such as Brun's algorithm and Selmer's algorithm, produce a sequence of (d+1)×(d+1) convergent matrices {C⁽ⁿ⁾():n1} whose rows provide Diophantine approximations to . Such algorithms are specified by two mapsT:[0, 1] ^d [0, 1] ^d and A:[0,1] ^d GL(d+1,), which compute convergent matrices C⁽ⁿ⁾())...A(T())A(). The quality of the Diophantine approximations these algorithms find can be measured in two ways. The best approximation exponent is the upper bound of those values of for which there is some row of the convergent matrices such that for infinitely many values ofn that row of C⁽ⁿ⁾() has . The uniform approximation exponent is the upper bound of those values of such that for all sufficiently large values ofn and all rows of C⁽ⁿ⁾⁽⁾ one has . The paper applies Oseledec's multiplicative ergodic theorem to show that for a large class of such algorithms and take constant values and on a set of Lebesgue measure one. It establishes the formula where are the two largest Lyapunov exponents attached by Oseledec's multiplicative ergodic theorem to the skew-product (T, A,d), whered is aT-invariant measure, absolutely continuous with respect to Lebesgue measure. We conjecture that holds for a large class of such algorithms. These results apply to thed-dimensional Jacobi-Perron algorithm and Selmer's algorithm. We show that; experimental evidence of Baldwin (1992) indicates (nonrigorously) that. We conjecture that holds for alld2.     

Sensitivity analysis of the greatest eigenvalue of a symmetric matrix via the ɛ-subdifferential of the associated convex quadratic form

LetA(·) be ann × n symmetric affine matrix-valued function of a parameteruR ^m , and let (u) be the greatest eigenvalue ofA(u). Recently, there has been interest in calculating (u), the subdifferential of atu, which is useful for both the construction of efficient algorithms for the minimization of (u) and the sensitivity analysis of (u), namely, the perturbation theory of (u). In this paper, more generally, we investigate the Legendre-Fenchel conjugate function of (·) and the -subdifferential (u) of atu. Then, we discuss relations between the set (u) and some perturbation bounds for (u).The author is deeply indebted to Professor J. B. Hiriart-Urruty who suggested this study and provided helpful advice and constant encouragement. The author also thanks the referees and the editors for their substantial help in the improvement of this paper.     

Mixed-norm estimates for a class of integral operators

(, ) — R ^m ×R ⁿ . f R ^m ×R ⁿ f_p,q, f L _p (R ^m) x y, L^q(Rⁿ). ׃ _q,r cƒ _p,r , ׃ R ^m ×R ⁿ , , , q r . , ( ¦¦) K ₀ (y); p, g r , K ₀.     

TheO(n3) algorithm for a special case of the maximum cost-to-time ratio cycle problem and its coherence with an eigenproblem of a matrix

Let twon×n matrices be given, namely a real matrixA=(a_ij) and a (0, 1)-matrixT=(t_ij). For a cyclic permutation=(i ₁,i ₂,...,i _k) of a subset of N={1, 2, ..., n} we define _A;T(), the cost-to-time ratio weight of, as . This paper presents an O(n³) algorithm for finding (A;T)=max _A;T(), the maximum cost-to-time ratio weight of the matricesA andT. Moreover a generalised eigenproblem is proposed.     

Conditions for the existence of stieltjes integral of functions of bounded generalized variation

, , , , - , , , , . . . .     

Une variante à la Coxeter du groupe de Steinberg

LetG _n ()be the semi-direct product of the symmetric groupS _n by the Steinberg groupSt _n ()of a ringWe first prove thatG _n ()has a Coxeter-type presentation. The canonical morphism St _n () GL _n ()extends to a group homo G_n() GL _n ()We next determine the kernel of for n = We also give an expression for the generator of the algebraic K group K ₂(Z)of the integers in terms of permutation matrices.     

Regressions and monotone chains II: The poset of integer intervals

A regressive function (also called a regression or contractive mapping) on a partial order P is a function mapping P to itself such that (x)x. A monotone k-chain for is a k-chain on which is order-preserving; i.e., a chain x ₁<...ksuch that (x ₁)...(x_k). Let P _nbe the poset of integer intervals {i, i+1, ..., m} contained in {1, 2, ..., n}, ordered by inclusion. Let f(k) be the least value of n such that every regression on P _nhas a monotone k+1-chain, let t(x,j) be defined by t(x, 0)=1 and t(x,j)=x ^t(x,j–1). Then f(k) exists for all k (originally proved by D. White), and t(2,k) < f(K) <t( + _k, k) , where _k 0 as k. Alternatively, the largest k such that every regression on P _nis guaranteed to have a monotone k-chain lies between lg^*(n) and lg^*(n)–2, inclusive, where lg^*(n) is the number of appliations of logarithm base 2 required to reduce n to a negative number. Analogous results hold for choice functions, which are regressions in which every element is mapped to a minimal element.     

Harmonic analysis on tori

We consider measurable subsets {ofR}ⁿ with 0<m()<, and we assume that has a spectral set . (In the special case when is also assumed open, may be obtained as the joint spectrum of a family of commuting self-adjoint operators {H _k: 1kn} in L ² () such that each H _k is an extension of i(/x _k) on C _c (), k=1, ..., n.)It is known that is a fundamental domain for a lattice if is itself a lattice. In this paper, we consider a class of examples where is not assumed to be a lattice. Instead is assumed to have a certain inhomogeneous form, and we prove a necessary and sufficient condition for to be a fundamental domain for some lattice in {ofR}ⁿ. We are thus able to decide the question, fundamental domain or not, by considering only properties of the spectrum . Our criterion is obtained as a corollary to a theorem concerning partitions of sets which have a spectrum of inhomogeneous form.Work supported in part by the NSF.Work supported in part by the NSRC, Denmark.     

New lower semicontinuity results for polyconvex integrals

Summary We study integral functionals of the formF(u, )= f(u)dx, defined foru C¹(;R ^k), R ⁿ . The functionf is assumed to be polyconvex and to satisfy the inequalityf(A) c₀¦(A)¦ for a suitable constant c₀ > 0, where (A) is then-vector whose components are the determinants of all minors of thek×n matrixA. We prove thatF is lower semicontinuous onC ¹(;R ^k) with respect to the strong topology ofL ¹(;R ^k). Then we consider the relaxed functional , defined as the greatest lower semicontinuous functional onL ¹(;R ^k ) which is less than or equal toF on C¹(;R ^k). For everyu BV(;R ^k) we prove that (u,) f(u)dx+c₀¦D^su¦(), whereDu=u dx+D^su is the Lebesgue decomposition of the Radon measureDu. Moreover, under suitable growth conditions onf, we show that (u,)= f(u)dx for everyu W^1,p(;R ^k), withp min{n,k}. We prove also that the functional (u, ) can not be represented by an inte- gral for an arbitrary functionu BV_loc(R ⁿ;R ^k). In fact, two examples show that, in general, the set function (u, ) is not subadditive whenu BV_loc(R ⁿ;R ^k), even ifu W _loc ^1,p (R ⁿ;R ^k) for everyp < min{n,k}. Finally, we examine in detail the properties of the functionsu BV(;R ^k) such that (u, )= f(u)dx, particularly in the model casef(A)=¦(A)¦.