Degeneracies of generalized inverse,vector-valued padé approximants

Wynn used generalized inverses to interpret continued fractions containing vector-valued elements. This approach led to the introduction of generalized inverse, vector-valued Padé approximants (GIPAs). All possible cases of degeneracy of GIPAs are analysed in this paper. We derive linear equations for the coefficients of the denominator polynomial of a GIPA. The solution of these equations allows construction of a GIPA in all cases where such a GIPA exists. We show that the block structure of the table of GIPAs is precisely analogous to that of the Padé table.Communicated by Edward B. Saff.     

Differentiating σ-fields for Gaussian and shifted Gaussian processes

We study the notions of differentiating and non-differentiating σ-fields in the general framework of (possibly drifted) Gaussian processes and characterize their invariance properties, when changing to an equivalent probability measure. As an application, we investigate the class of stochastic derivatives associated with shifted fractional Brownian motions. We finally establish conditions for the existence of a jointly measurable version of the differentiated process and we outline a general framework for stochastic embedded equations.     

Fundamental groups,inverse schützenberger automata,and monoid presentations

This paper gives decidable conditions for when a finitely generated subgroup of a free group is the fundamental group of a Schützenberger automaton corresponding to a monoid presentation of an inverse monoid. Also, generalizations are given to specific types of inverse monoids as well as to monoids which are "nearly inverse." This result has applications to computing membership for inverse monoids in a Mal'cev product of the pseudovariety of semilattices with a pseudovariety of groups.

This paper also shows that there is a bijection between strongly connected inverse automata and subgroups of a free group, generated by positive words. Hence, we also obtain that it is decidable whether a finite strongly connected inverse automaton is a Schützenberger automaton corresponding to a monoid presentation of an inverse monoid. Again, we have generalizations to other types of inverse monoids and to "nearly inverse" monoids. We show that it is undecidable whether a finite strongly connected inverse automaton is a Schützenberger automaton of a monoid presentation of anE-unitary inverse monoid.     

Core–EP inverse

In this work, we introduce a notion of ‘core–EP inverse’ for a square matrix which is not essentially of index one. This extends the notion of ‘core inverse’, which was initially defined for the matrices of index one. The properties of matrices having ‘core–EP inverse’ and ‘core–EP generalized inverse’ are studied, and obtained a formula to compute the core–EP generalized inverse from a particular linear combination of minors of given matrix.     

On Incomplete Gaussian Sums

In his memior of 1837 on the existence of primes in a given arithmetic pro-gression, Dirichlet introduced what are now called Dirichlet's characters. Thesecharacters are arithmetic functions which are multiplicative and periodic. This paper deals with incomplete sums of the following type     

Multivariate orthogonal polynomials, homogeneous Padé approximants and Gaussian cubature

The connection between orthogonal polynomials, Padé approximants and Gaussian quadrature is well known and will be repeated in section 1. In the past, several generalizations to the multivariate case have been suggested for all three concepts [4,6,9,...], however without reestablishing a fundamental and clear link. In sections 2 and 3 we will elaborate definitions for multivariate Padé and Padé-type approximation, multivariate polynomial orthogonality and multivariate Gaussian integration in order to bridge the gap between these concepts. We will show that the new m-point Gaussian cubature rules allow the exact integration of homogeneous polynomials of degree 2m−1, in any number of variables. A numerical application of the new integration rules can be found in sections 4 and 5. This revised version was published online in June 2006 with corrections to the Cover Date.     

Completely inverse AG ∗∗-groupoids

A completely inverse AG ^??-groupoid is a groupoid satisfying the identities (xy)z=(zy)x, x(yz)=y(xz) and xx ^?1=x ^?1 x, where x ^?1 is a unique inverse of x, that is, x=(xx ^?1)x and x ^?1=(x ^?1 x)x ^?1. First we study some fundamental properties of such groupoids. Then we determine certain fundamental congruences on a completely inverse AG ^??-groupoid; namely: the maximum idempotent-separating congruence, the least AG-group congruence and the least E-unitary congruence. Finally, we investigate the complete lattice of congruences of a completely inverse AG ^??-groupoids. In particular, we describe congruences on completely inverse AG ^??-groupoids by their kernel and trace.     

B(LF,ω～2 )-refinability of inverse limits

Let X be the limit of an inverse system {X α , παβ , Λ} and and let λ be the cardinal number of Λ. Assume that each projection πα : X→ X α is an open and onto map and X is λ-paracompact. We prove that if each X α is B(LF, ω 2 )-refinable (hereditarily B(LF, ω 2 )-refinable), then X is B(LF, ω 2 )-refinable (hereditarily B(LF, ω 2 )-refinable). Furthermore, we show that B(LF, ω 2 )-refinable spaces can be preserved inversely under closed maps.     

Gaussian quadrature rules with exponential weights on (−1, 1)

We study the behavior of some “truncated” Gaussian rules based on the zeros of Pollaczek-type polynomials. These formulas are stable and converge with the order of the best polynomial approximation in suitable function spaces. Moreover, we apply these results to the related Lagrange interpolation process and to prove the stability and the convergence of a Nyström method for Fredholm integral equations of the second kind. Finally, some numerical examples are shown.     

Wick-Itô Formula for Gaussian Processes

Abstract

A Wick-Itô formula for Gaussian processes is obtained. This is a change of variables formula, which is to Wick-Itô integrals what the usual Itô formula is to Itô integrals. The conditions are weak enough to allow processes with infinite quadratic variation. They are satisfied by fractional Brownian motion with parameter 1/4 < H < 1.     

The inverse Fermat–Weber problem

Given n points in the plane with nonnegative weights, the inverse Fermat–Weber problem consists in changing the weights at minimum cost such that a prespecified point in the plane becomes the Euclidean 1-median. The cost is proportional to the increase or decrease of the corresponding weight. In case that the prespecified point does not coincide with one of the given n points, the inverse Fermat–Weber problem can be formulated as linear program. We derive a purely combinatorial algorithm which solves the inverse Fermat–Weber problem with unit cost using O(n) greedy-like iterations where each of them can be done in constant time if the points are sorted according to their slopes. If the prespecified point coincides with one of the given n points, it is shown that the corresponding inverse problem can be written as convex problem and hence is solvable in polynomial time to any fixed precision.     

On spline approximation of sliced inverse regression

The dimension reduction is helpful and often necessary in exploring the nonparametric regression structure.In this area,Sliced inverse regression (SIR) is a promising tool to estimate the central dimension reduction (CDR) space.To estimate the kernel matrix of the SIR,we herein suggest the spline approximation using the least squares regression.The heteroscedasticity can be incorporated well by introducing an appropriate weight function.The root-n asymptotic normality can be achieved for a wide range choice of knots.This is essentially analogous to the kernel estimation.Moreover, we also propose a modified Bayes information criterion (BIC) based on the eigenvalues of the SIR matrix.This modified BIC can be applied to any form of the SIR and other related methods.The methodology and some of the practical issues are illustrated through the horse mussel data.Empirical studies evidence the performance of our proposed spline approximation by comparison of the existing estimators.     

Ramanujan’s inverse elliptic arc approximation

We suggest a continued fraction origin to Ramanujan’s approximation to $(\frac{a-b}{a+b})^{2}$ in terms of the arc length of an ellipse with semiaxes a and b.     

Path properties of l_p-valued Gaussian random fields

General limit theorems are established for l~p-valued Gaussian random fields indexed by a multidimensional parameter,which contain both almost sure moduli of continuity and limits of large increments for the l~p-valued Gaussian random fields under(?)explicit conditions.     

Group inverse and group involutory Matrices ∗

In this work we deal with group involutory matrices, i.e.A ^#=A. We give necessary and sufficient conditions to characterize these matrices in terms of different representations of the group inverse. First, we give different expressions of the group inverse of a square matrix A. In addition, the special case of integer matrices is considered.     

The existence of an inverse limit of an inverse system of measure spaces — A purely measurable case

The existence of an inverse limit of an inverse system of (probability) measure spaces has been investigated since the very beginning of the modern probability theory. Results from Kolmogorov [11], Bochner [2], Choksi [6], Metivier [15], Bourbaki [4], Mallory and Sion [12] among others have paved the way of the deep understanding of this problem. All the above results, however, call for some topological concepts, or at least the ones which are closely related topological ones. In this paper we investigate purely measurable inverse systems of (probability) measure spaces, and give a sufficient condition for the existence of a unique inverse limit. An example for the considered purely measurable inverse systems of (probability) measure spaces is also given.     

General Gaussian Quadrature Formulas on Chebyshev Nodes

本文给出了基于（第一类及第二类）Ｃｈｅｂｙｓｈｅｖ节点的广义Ｇａｕｓ求积公式的Ｃｏｔｅｓ数的明显公式及其渐进性态．     

用组合方法证明Gaussian系数恒等式

设F_q是q个元素的有限域,其中q是素数的幂,F_q~n是F_q上n维向量空间,用[n/m]_q表示Gaussian系数,它可看作为F_q~n的m维子空间的个数.用组合方法证明了几个Gaussian系数恒等式.     

Boundary regularity for the Ricci equation, geometric convergence, and Gel’fand’s inverse boundary problem

This paper explores and ties together three themes. The first is to establish regularity of a metric tensor, on a manifold with boundary, on which there are given Ricci curvature bounds, on the manifold and its boundary, and a Lipschitz bound on the mean curvature of the boundary. The second is to establish geometric convergence of a (sub)sequence of manifolds with boundary with such geometrical bounds and also an upper bound on the diameter and a lower bound on injectivity and boundary injectivity radius, making use of the first part. The third theme involves the uniqueness and conditional stability of an inverse problem proposed by Gelfand, making essential use of the results of the first two parts.     

Modified constructions of binary sequences using multiplicative inverse

Two new families of finite binary sequences are constructed using multiplicative inverse. The sequences are shown to have strong pseudorandom properties by using some estimates of certain exponential sums over finite fields. The constructions can be implemented fast since multiplicative inverse over finite fields can be computed in polynomial time.