Rates of convergence in the CLT for linear random fields

In this paper, we study sums of linear random fields defined on the lattice Z ² with values in a Hilbert space. The rate of convergence of distributions of such sums to the Gaussian law is discussed, and mild sufficient conditions to obtain an approximation of order n ^−p are presented. This can be considered as a complement of a recent result of [A.N. Nazarova, Logarithmic velocity of convergence in CLT for stochastic linear processes and fields in a Hilbert space, Fundam. Prikl. Mat., 8:1091–1098, 2002 (in Russian)], where the logarithmic rate of convergence was stated, and as a generalization of the result of [D. Bosq, Erratum and complements to Berry–Esseen inequality for linear processes in Hilbert spaces, Stat. Probab. Lett., 70:171–174, 2004] for linear processes.     

RETRACTED ARTICLE: Convergence of Weighted Sums for Arrays of Negatively Dependent Random Variables and Its Applications

We discuss the complete convergence of weighted sums for arrays of rowwise negatively dependent random variables (ND r.v.’s) to linear processes. As an application, we obtain the complete convergence of linear processes based on ND r.v.’s which extends the result of Li et al. (Stat. Probab. Lett. 14:111–114, 1992), including the results of Baum and Katz (Trans. Am. Math. Soc. 120:108–123, 1965), from the i.i.d. case to a negatively dependent (ND) setting. We complement the results of Ahmed et al. (Stat. Probab. Lett. 58:185–194, 2002) and confirm their conjecture on linear processes in the ND case.     

On a class of secant-like methods for solving nonlinear equations

We provide a semilocal convergence analysis for a certain class of secant-like methods considered also in Argyros (J Math Anal Appl 298:374–397, 2004, 2007), Potra (Libertas Mathematica 5:71–84, 1985), in order to approximate a locally unique solution of an equation in a Banach space. Using a combination of Lipschitz and center-Lipschitz conditions for the computation of the upper bounds on the inverses of the linear operators involved, instead of only Lipschitz conditions (Potra, Libertas Mathematica 5:71–84, 1985), we provide an analysis with the following advantages over the work in Potra (Libertas Mathematica 5:71–84, 1985) which improved the works in Bosarge and Falb (J Optim Theory Appl 4:156–166, 1969, Numer Math 14:264–286, 1970), Dennis (SIAM J Numer Anal 6(3):493–507, 1969, 1971), Kornstaedt (1975), Larsonen (Ann Acad Sci Fenn, A 450:1–10, 1969), Potra (L’Analyse Numérique et la Théorie de l’Approximation 8(2):203–214, 1979, Aplikace Mathematiky 26:111–120, 1981, 1982, Libertas Mathematica 5:71–84, 1985), Potra and Pták (Math Scand 46:236–250, 1980, Numer Func Anal Optim 2(1):107–120, 1980), Schmidt (Period Math Hung 9(3):241–247, 1978), Schmidt and Schwetlick (Computing 3:215–226, 1968), Traub (1964), Wolfe (Numer Math 31:153–174, 1978): larger convergence domain; weaker sufficient convergence conditions, finer error bounds on the distances involved, and a more precise information on the location of the solution. Numerical examples further validating the results are also provided.     

<Emphasis Type="Italic">L</Emphasis>log <Emphasis Type="Italic">L</Emphasis> Condition for Supercritical Branching Hunt Processes

In this paper we use the spine decomposition and martingale change of measure to establish a Kesten–Stigum Llog L theorem for branching Hunt processes. This result is a generalization of the results in Asmussen and Hering (Z. Wahrscheinlichkeitstheor. Verw. Geb. 36:195–212, 1976) and Hering (Branching Processes, pp. 177–217, 1978) for branching diffusions.     

Distributive Lattices with a Generalized Implication: Topological Duality

In this paper we introduce the notion of generalized implication for lattices, as a binary function ⇒ that maps every pair of elements of a lattice to an ideal. We prove that a bounded lattice A is distributive if and only if there exists a generalized implication ⇒ defined in A satisfying certain conditions, and we study the class of bounded distributive lattices A endowed with a generalized implication as a common abstraction of the notions of annihilator (Mandelker, Duke Math J 37:377–386, 1970), Quasi-modal algebras (Celani, Math Bohem 126:721–736, 2001), and weakly Heyting algebras (Celani and Jansana, Math Log Q 51:219–246, 2005). We introduce the suitable notions of morphisms in order to obtain a category, as well as the corresponding notion of congruence. We develop a Priestley style topological duality for the bounded distributive lattices with a generalized implication. This duality generalizes the duality given in Celani and Jansana (Math Log Q 51:219–246, 2005) for weakly Heyting algebras and the duality given in Celani (Math Bohem 126:721–736, 2001) for Quasi-modal algebras.     

Stability and Instance Optimality for Gaussian Measurements in Compressed Sensing

In compressed sensing, we seek to gain information about a vector x∈ℝ ^N from d ≪ N nonadaptive linear measurements. Candes, Donoho, Tao et al. (see, e.g., Candes, Proc. Intl. Congress Math., Madrid, 2006; Candes et al., Commun. Pure Appl. Math. 59:1207–1223, 2006; Donoho, IEEE Trans. Inf. Theory 52:1289–1306, 2006) proposed to seek a good approximation to x via ℓ ₁ minimization. In this paper, we show that in the case of Gaussian measurements, ℓ ₁ minimization recovers the signal well from inaccurate measurements, thus improving the result from Candes et al. (Commun. Pure Appl. Math. 59:1207–1223, 2006). We also show that this numerically friendly algorithm (see Candes et al., Commun. Pure Appl. Math. 59:1207–1223, 2006) with overwhelming probability recovers the signal with accuracy, comparable to the accuracy of the best k-term approximation in the Euclidean norm when k∼d/ln N.     

Semilinear Mixed Problems on Hilbert Complexes and Their Numerical Approximation

Arnold, Falk, and Winther recently showed (Bull. Am. Math. Soc. 47:281–354, 2010) that linear, mixed variational problems, and their numerical approximation by mixed finite element methods, can be studied using the powerful, abstract language of Hilbert complexes. In another recent article (arXiv:), we extended the Arnold–Falk–Winther framework by analyzing variational crimes (à la Strang) on Hilbert complexes. In particular, this gave a treatment of finite element exterior calculus on manifolds, generalizing techniques from surface finite element methods and recovering earlier a priori estimates for the Laplace–Beltrami operator on 2- and 3-surfaces, due to Dziuk (Lecture Notes in Math., vol. 1357:142–155, 1988) and later Demlow (SIAM J. Numer. Anal. 47:805–827, 2009), as special cases. In the present article, we extend the Hilbert complex framework in a second distinct direction: to the study of semilinear mixed problems. We do this, first, by introducing an operator-theoretic reformulation of the linear mixed problem, so that the semilinear problem can be expressed as an abstract Hammerstein equation. This allows us to obtain, for semilinear problems, a priori solution estimates and error estimates that reduce to the Arnold–Falk–Winther results in the linear case. We also consider the impact of variational crimes, extending the results of our previous article to these semilinear problems. As an immediate application, this new framework allows for mixed finite element methods to be applied to semilinear problems on surfaces.     

Some new common fixed point theorems in fuzzy metric spaces

The purpose of this paper is to prove some new common fixed point theorems in (GV)-fuzzy metric spaces. While proving our results, we utilize the idea of compatibility due to Jungck (Int J Math Math Sci 9:771–779, 1986) together with subsequentially continuity due to Bouhadjera and Godet-Thobie (arXiv: 0906.3159v1 [math.FA] 17 Jun 2009) respectively (also alternately reciprocal continuity due to Pant (Bull Calcutta Math Soc 90:281–286, 1998) together with subcompatibility due to Bouhadjera and Godet-Thobie (arXiv:0906.3159v1 [math.FA] 17 Jun 2009) as patterned in Imdad et al. (doi:) wherein conditions on completeness (or closedness) of the underlying space (or subspaces) together with conditions on continuity in respect of any one of the involved maps are relaxed. Our results substantially generalize and improve a multitude of relevant common fixed point theorems of the existing literature in metric as well as fuzzy metric spaces which include some relevant results due to Imdad et al. (J Appl Math Inform 26:591–603, 2008), Mihet (doi:), Mishra (Tamkang J Math 39(4):309–316, 2008), Singh (Fuzzy Sets Syst 115:471–475, 2000) and several others.     

Optimality and Duality Results for Bilevel Programming Problem Using Convexifactors

The paper is devoted to the applications of convexifactors to bilevel programming problem. Here we have defined ∂ ^∗-convex, ∂ ^∗-pseudoconvex and ∂ ^∗-quasiconvex bifunctions in terms of convexifactors on the lines of Dutta and Chandra (Optimization 53:77–94, 2004) and Li and Zhang (J. Opt. Theory Appl. 131:429–452, 2006). We derive sufficient optimality conditions for the bilevel programming problem by using these functions, and we establish various duality results by associating the given problem with two dual problems, namely Wolfe type dual and Mond–Weir type dual.     

An exact algorithm for the 0–1 linear knapsack problem with a single continuous variable

The 0–1 linear knapsack problem with a single continuous variable (KPC) is an extension of the binary knapsack problem (KP). It is an NP-hard problem. In this paper, we show that KPC can be reduced to KP and a pseudo-knapsack problem (PKP), which is similar to the traditional knapsack problem except that the profits of items may be non-positive, and the weight sum has two sided limits on capacity. We use the Dynamic Programming algorithm COMBO (Martello et al., Manag Sci 45(3):414–424, 1999) to solve KP, and modify the branch and bound method EXPKNAP (Pisinger, Eur J Oper Res 87:175–187, 1995) for KP to solve the PKP. Numerical experiments show the efficiency of our method.     

Order-Compactifications of Totally Ordered Spaces: Revisited

Order-compactifications of totally ordered spaces were described by Blatter (J Approx Theory 13:56–65, 1975) and by Kent and Richmond (J Math Math Sci 11(4):683–694, 1988). Their results generalize a similar characterization of order-compactifications of linearly ordered spaces, obtained independently by Fedorčuk (Soviet Math Dokl 7:1011–1014, 1966; Sib Math J 10:124–132, 1969) and Kaufman (Colloq Math 17:35–39, 1967). In this note we give a simple characterization of the topology of a totally ordered space, as well as give a new simplified proof of the main results of Blatter (J Approx Theory 13:56–65, 1975) and Kent and Richmond (J Math Math Sci 11(4):683–694, 1988). Our main tool will be an order-topological modification of the Dedekind-MacNeille completion. In addition, for a zero-dimensional totally ordered space X, we determine which order-compactifications of X are Priestley order-compactifications.     

Optimal Meshes for Finite Elements of Arbitrary Order

Given a function f defined on a bounded domain Ω⊂ℝ² and a number N>0, we study the properties of the triangulation T_N\mathcal{T}_{N} that minimizes the distance between f and its interpolation on the associated finite element space, over all triangulations of at most N elements. The error is studied in the norm X=L ^p for 1≤p≤∞, and we consider Lagrange finite elements of arbitrary polynomial degree m−1. We establish sharp asymptotic error estimates as N→+∞ when the optimal anisotropic triangulation is used, recovering the results on piecewise linear interpolation (Babenko et al. in East J. Approx. 12(1), 71–101, 2006; Babenko, submitted; Chen et al. in Math. Comput. 76, 179–204, 2007) and improving the results on higher degree interpolation (Cao in SIAM J. Numer. Anal. 45(6), 2368–2391, 2007, SIAM J. Sci. Comput. 29, 756–781, 2007, Math. Comput. 77, 265–286, 2008). These estimates involve invariant polynomials applied to the m-th order derivatives of f. In addition, our analysis also provides practical strategies for designing meshes such that the interpolation error satisfies the optimal estimate up to a fixed multiplicative constant. We partially extend our results to higher dimensions for finite elements on simplicial partitions of a domain Ω⊂ℝ ^d .     

Orbital stability of spherical galactic models

We consider the three dimensional gravitational Vlasov Poisson system which is a canonical model in astrophysics to describe the dynamics of galactic clusters. A well known conjecture (Binney, Tremaine in Galactic Dynamics, Princeton University Press, Princeton, 1987) is the stability of spherical models which are nonincreasing radially symmetric steady states solutions. This conjecture was proved at the linear level by several authors in the continuation of the breakthrough work by Antonov (Sov. Astron. 4:859–867, 1961). In the previous work (Lemou et al. in A new variational approach to the stability of gravitational systems, submitted, 2011), we derived the stability of anisotropic models under spherically symmetric perturbations using fundamental monotonicity properties of the Hamiltonian under suitable generalized symmetric rearrangements first observed in the physics literature (Lynden-Bell in Mon. Not. R. Astron. Soc. 144:189–217, 1969; Gardner in Phys. Fluids 6:839–840, 1963; Wiechen et al. in Mon. Not. R. Astron. Soc. 223:623–646, 1988; Aly in Mon. Not. R. Astron. Soc. 241:15, 1989). In this work, we show how this approach combined with a new generalized Antonov type coercivity property implies the orbital stability of spherical models under general perturbations.     

Virtual control regularization of state constrained linear quadratic optimal control problems

A numerical method for linear quadratic optimal control problems with pure state constraints is analyzed. Using the virtual control concept introduced by Cherednichenko et al. (Inverse Probl. 24:1–21, 2008) and Krumbiegel and R?sch (Control Cybern. 37(2):369–392, 2008), the state constrained optimal control problem is embedded into a family of optimal control problems with mixed control-state constraints using a regularization parameter α>0. It is shown that the solutions of the problems with mixed control-state constraints converge to the solution of the state constrained problem in the L ² norm as α tends to zero. The regularized problems can be solved by a semi-smooth Newton method for every α>0 and thus the solution of the original state constrained problem can be approximated arbitrarily close as α approaches zero. Two numerical examples with benchmark problems are provided.     

A Renewal Theorem for Strongly Ergodic Markov Chains in Dimension <Emphasis Type="Italic">d</Emphasis> ≥ 3 and Centered Case

In dimension d ≥ 3, we present a general assumption under which the renewal theorem established by Spitzer (1964) for i.i.d. sequences of centered nonlattice r.v. holds true. Next we appeal to an operator-type procedure to investigate the Markov case. Such a spectral approach has been already developed by Babillot (Ann Inst Henri Poincaré, Sect B, Tome 24(4):507–569, 1988), but the weak perturbation theorem of Keller and Liverani (Ann Sc Norm Super Pisa CI Sci XXVIII(4):141–152, 1999) enables us to greatly weaken the moment conditions of Babillot (Ann Inst Henri Poincaré, Sect B, Tome 24(4):507–569, 1988). Our applications concern the v-geometrically ergodic Markov chains, the ρ-mixing Markov chains, and the iterative Lipschitz models, for which the renewal theorem of the i.i.d. case extends under the (almost) expected moment condition.     

<Emphasis Type="Italic">π</Emphasis>-formulas implied by Dougall’s summation theorem for <Subscript>5</Subscript><Emphasis Type="Italic">F</Emphasis><Subscript>4</Subscript>-series

The general summation theorem for well-poised ₅ F ₄-series discovered by Dougall (Proc. Edinb. Math. Soc. 25:114–132, 1907) is shown to imply several infinite series of Ramanujan-type for 1/π and 1/π ², including those due to Bauer (J. Reine Angew. Math. 56:101–121, 1859) and Glaisher (Q. J. Math. 37:173–198, 1905) as well as some recent ones by Levrie (Ramanujan J. 22:221–230, 2010).     

An FIO calculus for marine seismic imaging, II: Sobolev estimates

We establish sharp L ²-Sobolev estimates for classes of pseudodifferential operators with singular symbols [Guillemin and Uhlmann (Duke Math J 48:251–267, 1981), Melrose and Uhlmann (Commun Pure Appl Math 32:483–519, 1979)] whose non-pseudodifferential (Fourier integral operator) parts exhibit two-sided fold singularities. The operators considered include both singular integral operators along curves in \mathbb R²{\mathbb R^2} with simple inflection points and normal operators arising in linearized seismic imaging in the presence of fold caustics [Felea (Comm PDE 30:1717–1740, 2005), Felea and Greenleaf (Comm PDE 33:45–77, 2008), Nolan (SIAM J Appl Math 61:659–672, 2000)].     

A note on sensitivity of semigroup actions

It is well known that for a transitive dynamical system (X,f) sensitivity to initial conditions follows from the assumption that the periodic points are dense. This was done by several authors: Banks, Brooks, Cairns, Davis and Stacey (Am. Math. Mon. 99, 332–334, 1992), Silverman (Rocky Mt. J. Math. 22, 353–375, 1992) and Glasner and Weiss (Nonlinearity 6, 1067–1075, 1993). In the latter article Glasner and Weiss established a stronger result (for compact metric systems) which implies that a transitive non-minimal compact metric system (X,f) with dense set of almost periodic points is sensitive. This is true also for group actions as was proved in the book of Glasner (Ergodic Theory via Joinings, 2003). Our aim is to generalize these results in the frame of a unified approach for a wide class of topological semigroup actions including one-parameter semigroup actions on Polish spaces.     

Tropical Hurwitz numbers

Hurwitz numbers count genus g, degree d covers of ℙ¹ with fixed branch locus. This equals the degree of a natural branch map defined on the Hurwitz space. In tropical geometry, algebraic curves are replaced by certain piece-wise linear objects called tropical curves. This paper develops a tropical counterpart of the branch map and shows that its degree recovers classical Hurwitz numbers. Further, the combinatorial techniques developed are applied to recover results of Goulden et al. (in Adv. Math. 198:43–92, 2005) and Shadrin et al. (in Adv. Math. 217(1):79–96, 2008) on the piecewise polynomial structure of double Hurwitz numbers in genus 0.     

Ring semigroups whose subsemigroups form a chain

A multiplicative semigroup S is called a ring semigroup if an addition may be defined on S so that (S,+,⋅) is a ring. Such semigroups have been well-studied in the literature (see Bell in Words, Languages and Combinatorics, pp. 24–31, World Scientific, Singapore, 1994; Jones in Semigroup Forum 47(1):1–6, 1993; Jones and Ligh in Semigroup Forum 17(2):163–173, 1979). In this note, we use Mihăilescu’s Theorem (formerly Catalan’s Conjecture) to characterize the ring semigroups whose subsemigroups containing 0 form a chain with respect to set inclusion.