Best simultaneous L1 approximations

Three possible definitions are proposed for best simultaneous L₁ approximation to n continuous real-valued functions, and the relation between best simultaneous approximations and best L₁ approximations to the arithmetic mean of the n functions is discussed.     

Sobolev-Type Classes of Functions with Values in a Metric Space. II

We prove equivalence of the definitions by the author and by Korevaar and Schoen of the Sobolev classes of mappings of a domain of an arithmetic n-dimensional space to a metric space.     

The quantifier complexity of polynomial‐size iterated definitions in first‐order logic

We refine the constructions of Ferrante‐Rackoff and Solovay on iterated definitions in first‐order logic and their expressibility with polynomial size formulas. These constructions introduce additional quantifiers; however, we show that these extra quantifiers range over only finite sets and can be eliminated. We prove optimal upper and lower bounds on the quantifier complexity of polynomial size formulas obtained from the iterated definitions. In the quantifier‐free case and in the case of purely existential or universal quantifiers, we show that Ω(n /log n) quantifiers are necessary and sufficient. The last lower bounds are obtained with the aid of the Yao‐Håstad switching lemma (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Minimum numbers and Wecken theorems in topological coincidence theory. I

Minimum numbers measure the obstruction to removing coincidences of two given maps (between smooth manifolds M and N of dimensions m and n, resp.). In this paper, we compare them to four distinct types of Nielsen numbers. These agree with the classical Nielsen number when m = n (e.g., in the fixed point setting where M = N and one of the maps is the identity map). However, in higher codimensions, m − n > 0, their definitions and computations involve distinct aspects of differential topology and homotopy theory.     

All Admissible Linear Estimates of the Mean Matrix

In this paper, a1ll admissible linear estimates of the mean matrix Θ from the distribution N(Θ_n×m, I_m I_n) are given under each of the several definitions for admissibility.     

ON (m,n)-INJECTIVITY OF MODULES

Let R be a ring. For two fixed positive integers m and n, a right R-module M is called (m, n)-injective if every right R-homomorphism from an n-generated submodule of R^m to M extends to one from R^m to M. This definition unifies several definitions on generalizations of injectivity of modules. The aim of this paper is to investigate properties of the (m, n)-injective modules. Various results are developed, many extending known results.     

On isometries of matrix spaces

Let A _kbe the group of isometries of the space of n-by-n matrices over reals (resp. complexes, quaternions) with respect to the Ky Fan k-norm (see the Introduction for the definitions). Let Γ⁰ be the group of transformations of this space consisting of all products of left and right multiplications by the elements of SO(n)(resp. U(n), Sp(n)). It is shown that, except for three particular casesA_k coincides with the normalizer of Γ in Δ group of isometries of the above matrix space with respect to the standard inner product. We also give an alternative treatment of the case D = R n = 4k = 2 which was studied in detail by Johnson, Laffey, and Li [4].     

Discrete Quantum Walks Hit Exponentially Faster

This paper addresses the question: what processes take polynomial time on a quantum computer that require exponential time classically? We show that the hitting time of the discrete time quantum walk on the n-bit hypercube from one corner to its opposite is polynomial in n. This gives the first exponential quantum-classical gap in the hitting time of discrete quantum walks. We provide the basic framework for quantum hitting time and give two alternative definitions to set the ground for its study on general graphs. We outline a possible application to sequential packet routing.     

Minimax type theorems forn-valued functions

Summary We consider in R ⁿ the ordering induced by a cone and give suitable definitions of Sup, Inf,convexity and lower semicontinuity relative to n-valued functions: in this framework we can prove minimax theorems for such a class of functions.This work was partially supported by Istituto per la Matematica Applicata del C.N.R. (Genova).     

Polynomial identity rings as rings of functions

We generalize the usual relationship between irreducible Zariski closed subsets of the affine space, their defining ideals, coordinate rings, and function fields, to a non-commutative setting, where “varieties” carry a PGL_n-action, regular and rational “functions” on them are matrix-valued, “coordinate rings” are prime polynomial identity algebras, and “function fields” are central simple algebras of degree n. In particular, a prime polynomial identity algebra of degree n is finitely generated if and only if it arises as the “coordinate ring” of a “variety” in this setting. For n=1 our definitions and results reduce to those of classical affine algebraic geometry.     

Carleson measures and conformal self‐mappings in the real unit ball

Bounded and compact Carleson measures in the unit ball B of R ⁿ , n ≥ 2, are characterized by means of global Dirichlet integrals of the conformal self‐map T_a taking a ∈ B to the origin. The same proof applies in the unit ball of C ⁿ . It is also proved that the powers of the Jacobian of T_a satisfy the weak Harnack inequality and even Harnack's inequality with a constant independent of a. As an application of these results it is shown that the two different definitions for Carleson measures in the existing literature are equivalent for a certain range of parameter values. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Local Baire classification of Lyapunov exponents

One considers two different definitions of the Baire class of a functional at a point. These definitions are in agreement with the common definition of the Baire class. The semicontinuity of a functional at a point is associated with its inclusion into the first Baire class at that point in the sense of the said definitions for Lyapunov exponents of a homogeneous nth-order system. In particular, it is shown that for the two smallest exponents, the inclusion into the first Baire class at a point is equivalent to semicontinuity in the sense of one of the two definitions and continuity in the sense of the other. __________ Translated from Trudy Seminara imeni I. G. Petrovskogo, No. 26, pp. 56–70, 2007.     

Weak helix submanifolds of euclidean spaces

Let M⊂ℝ ⁿ be a submanifold of a euclidean space. A vector d∈ℝ ⁿ is called a helix direction of M if the angle between d and any tangent space T _p M is constant. Let ℋ(M) be the set of helix directions of M. If the set ℋ(M) contains r linearly independent vectors we say that M is a weak r-helix. We say that M is a strong r-helix if ℋ(M) is a r-dimensional linear subspace of ℝ ⁿ . For curves and hypersurfaces both definitions agree. The object of this article is to show that these definitions are not equivalent. Namely, we construct (non strong) weak 2-helix surfaces of ℝ⁴. The author is supported by the Project M.I.U.R. “Riemann Metrics and Differentiable Manifolds” and by G.N.S.A.G.A. of I.N.d.A.M., Italy.     

Schnyder Woods for Higher Genus Triangulated Surfaces,with Applications to Encoding

Schnyder woods are a well-known combinatorial structure for plane triangulations, which yields a decomposition into three spanning trees. We extend here definitions and algorithms for Schnyder woods to closed orientable surfaces of arbitrary genus. In particular, we describe a method to traverse a triangulation of genus g and compute a so-called g-Schnyder wood on the way. As an application, we give a procedure to encode a triangulation of genus g and n vertices in 4n+O(glog (n)) bits. This matches the worst-case encoding rate of Edgebreaker in positive genus. All the algorithms presented here have execution time O((n+g)g) and hence are linear when the genus is fixed. Extended version of the article appeared in the Proc. of the ACM SoCG 2008. Part of the first author’s work was done during his visit to the CS Department of Université Libre de Bruxelles (Belgium).     

On Asymptotic Proximity of Distributions

We consider some general facts concerning the convergence

Stability Analysis of nth Order Nonlinear Impulsive Differential Equations in Quasi–Banach Space

Abstract

This article is about Ulam’s type stability of n^th order nonlinear differential equations with fractional integrable impulses. It is a best procession to the stability of higher order fractional integrable impulsive differential equations in quasi–normed Banach space. Different Ulam’s type stability results are obtained by using the definitions of Riemann–Liouville fractional integral, Hölder’s inequality and the beta integral inequality.     

Convergence of Weighted Sums and Laws of Large Numbers in D([0,1]; E)

Convergence properties of weighted sums of functions in D([0, 1]; E) (E a Banach space) are investigated. We show that convergence in the Skorokhod J₁-topology of a sequence (x_n) in D([0, 1]; E) does not imply convergence of a sequence ( _n) of averages. Convergence in the J₁-topology of a sequence ( _n) of averages is shown, under the growth condition x_n ∞ = o(n), to be equivalent to the convergence of ( _n) in the uniform topology. Convergence of a sequence (x_n,) is shown to imply convergence of the sequence ( _n) of averages in the M₁ and M₂ topologies. The strong law of large numbers in D[0, 1] is considered and an example is constructed to show that different definitions of the strong law of large numbers are nonequivalent.     

Higher-order symmetric duality in nondifferentiable multiobjective programming problems

In this paper, a pair of nondifferentiable multiobjective programming problems is first formulated, where each of the objective functions contains a support function of a compact convex set in Rⁿ. For a differentiable function h :Rⁿ×Rⁿ→R, we introduce the definitions of the higher-order F-convexity (F-pseudo-convexity, F-quasi-convexity) of function f :Rⁿ→R with respect to h. When F and h are taken certain appropriate transformations, all known other generalized invexity, such as η-invexity, type I invexity and higher-order type I invexity, can be put into the category of the higher-order F-invex functions. Under these the higher-order F-convexity assumptions, we prove the higher-order weak, higher-order strong and higher-order converse duality theorems related to a properly efficient solution.     

Corrigendum: The cover time of the giant component of a random graph,Random Structures and Algorithms 32 (2008), 401–439

The above paper gives an asymptotically precise estimate of the cover time of the giant component of a sparse random graph. The proof as it stands is not tight enough, and in particular, Eq. (64) is not strong enough to prove (65). The o(1) term in (64) needs to be improved to o(1/(lnn)²) for (65) to follow. The following section, which replaces Section 3.6, amends this oversight. The notation and definitions are from the paper. A further correction is needed. Property P2 claims that the conductance of the giant is whp , Ω(1/lnn). The proof of P2 in the appendix of the paper is not quite complete. A complete proof of Property P2 can be found in 1 , 2 . © 2008 Wiley Periodicals, Inc. Random Struct. Alg., 2009