Generalizations of the FKKM theorem and the Ky Fan minimax inequality, with applications to maximal elements, price equilibrium, and complementarity

This paper generalizes the Fan-Knaster-Kuratowski-Mazurkiewicz (FKKM) theorem of Ky Fan (“Game Theory and Related Topics,” pp. 151–156, North-Holland, Amsterdam, 1979; and Math. Ann. 266, 1984, 519–537) and the Ky Fan minimax inequality by introducing a class of the generalized closedness and continuity conditions, which are called the transfer closedness and transfer continuities. We then apply these results to prove the existence of maximal elements of binary relations under very weak assumptions. We also prove the existence of price equilibrium and the complementarity problem without the continuity assumptions. Thus our results generalize many of the existence theorems in the literature.     

Addendum to the Paper “The Generalized Integer Gamma Distribution—A Basis for Distributions in Multivariate Statistics”

A brief remark on the paper “The Generalized Integer Gamma Distribution— A Basis for Distributions in Multivariate Statistics,” (1998,J. Multivariate Anal.64, 86–102) and an additional result concerning the distribution of the product of some particular independent beta random variables, which broadens the scope of the results in that paper, are presented.     

On the limiting Pitman efficiency of some rank tests of independence

The limiting (as the significance level approaches 0) Pitman efficiency of a new “regression-based” rank test of independence to Kendall's tau and Spearman's rho is derived. The result is based on a version of [17], Ann. Statist.4 1003–1011) on coincidence of the limiting Pitman efficiency and the local (as the alternative approaches the hypothesis) approximate Bahadur efficiency. [7], Trans. Amer. Math. Soc.87, 173–186) result is applied to verify the main assumption of Wieand's paper. This approach is shown to be useful in some other situations, also.     

Exact Misclassification Probabilities for Plug-In Normal Quadratic Discriminant Functions: II. The Heterogeneous Case

We consider the problem of discriminating between two independent multivariate normal populations, N_p(μ₁, Σ₁) and N_p(μ₂, Σ₂), having distinct mean vectors μ₁ and μ₂ and distinct covariance matrices Σ₁ and Σ₂. The parameters μ₁, μ₂, Σ₁, and Σ₂ are unknown and are estimated by means of independent random training samples from each population. We derive a stochastic representation for the exact distribution of the “plug-in” quadratic discriminant function for classifying a new observation between the two populations. The stochastic representation involves only the classical standard normal, chi-square, and F distributions and is easily implemented for simulation purposes. Using Monte Carlo simulation of the stochastic representation we provide applications to the estimation of misclassification probabilities for the well-known iris data studied by Fisher (Ann. Eugen.7 (1936), 179–188); a data set on corporate financial ratios provided by Johnson and Wichern (Applied Multivariate Statistical Analysis, 4th ed., Prentice–Hall, Englewood Cliffs, NJ, 1998); and a data set analyzed by Reaven and Miller (Diabetologia16 (1979), 17–24) in a classification of diabetic status.     

Solution of a problem of Ulam

In this paper we solve the following Ulam problem: “Give conditions in order for a linear mapping near an approximately linear mapping to exist” and establish results involving a product of powers of norms [[5.]; [5.]; [5.]]. There has been much activity on a similar “ -isometry” problem of Ulam [ [1.], 633–636; [2.], 263–277; [4.]]. This work represents an improvement and generalization of the work of [3.], 222–224].     

Erd s–Turán Type Theorems on Quasiconformal Curves and Arcs

The theorems of Erd s and Turán mentioned in the title are concerned with the distribution of zeros of a monic polynomial with known uniform norm along the unit interval or the unit disk. Recently, Blatt and Grothmann (Const. Approx.7(1991), 19–47), Grothmann (“Interpolation Points and Zeros of Polynomials in Approximation Theory,” Habilitationsschrift, Katholische Universität Eichstätt, 1992), and Andrievskii and Blatt (J. Approx. Theory88(1977), 109–134) established corresponding results for polynomials, considered on a system of sufficiently smooth Jordan curves and arcs or piecewise smooth curves and arcs. We extend some of these results to polynomials with known uniform norm along an arbitrary quasiconformal curve or arc. As applications, estimates for the distribution of the zeros of best uniform approximants, values of orthogonal polynomials, and zeros of Bieberbach polynomials and their derivatives are obtained. We also give a negative answer to one conjecture of Eiermann and Stahl (“Zeros of orthogonal polynomials on regularN-gons,” in Lecture Notes in Math.1574(1994), 187–189).     

Best Interpolatory Approximation in Normed Linear Spaces

A theory of best approximation with interpolatory contraints from a finite-dimensional subspaceMof a normed linear spaceXis developed. In particular, to eachxX, best approximations are sought from a subsetM(x) ofMwhichdependson the elementxbeing approximated. It is shown that this “parametric approximation” problem can be essentially reduced to the “usual” one involving a certainfixedsubspaceM₀ofM. More detailed results can be obtained when (1) Xis a Hilbert space, or (2) Mis an “interpolating subspace” ofX(in the sense of [1]).     

Three Conjectures on Shepard Interpolatory Operators

After establishing direct and converse approximation theorems for the Shepard interpolatory operators, J. Szabados (Approx. Theory Appl.7, No. 3, 1991, 63–76) left some open saturation problems (“the most intriguing questions” as he said), which he raised as three conjectures. The present paper proves the second parts of some conjectures, but constructs counterexamples to show that the first parts of three conjectures are not true. The constructive procedure uses some novel ideas and techniques.     

AIC, Overfitting Principles, and the Boundedness of Moments of Inverse Matrices for Vector Autotregressions and Related Models

In his somewhat informal derivation, Akaike (in “Proceedings of the 2nd International Symposium Information Theory” (C. B. Petrov and F. Csaki, Eds.), pp. 610–624, Academici Kiado, Budapest, 1973) obtained AIC's parameter-count adjustment to the log-likelihood as a bias correction: it yields an asymptotically unbiased estimate of the quantity that measures the average fit of the estimated model to an independent replicate of the data used for estimation. We present the first mathematically complete derivation of an analogous property of AIC for comparing vector autoregressions fit to weakly stationary series. As a preparatory result, we derive a very general “overfitting principle,” first formulated in a more limited context in Findley (Ann. Inst. Statist. Math.43, 509–514, 1991), asserting that a natural measure of an estimated model's overfit due to parameter estimation is equal, asymptotically, to a measure of its accuracy loss with independent replicates. A formal principle of parsimony for fitted models is obtained from this, which for nested models, covers the situation in which all models considered are misspecified. To prove these results, we establish a set of general conditions under which, for each τ1, the absolute τth moments of the entries of the inverse matrices associated with least squares estimation are bounded for sufficiently large sample sizes.     

Strict convexity of sequence Orlicz-Musielak spaces with Orlicz norm

H. Milnes gave in (Pacific J. Math. 18 (1957), 1451–1483) a criterion for strict convexity of Orlicz spaces with respect to the so called Orlicz norm, in the case of nonatomic measure and a usual Young function. Here there are presented necessary and sufficient conditions for strict convexity of Orlicz-Musielak spaces (J. Musielak and W. Orlicz, Studia Math. 18 (1957), 49–65) with Orlicz norm in the case of purely atomic measure. For sequence Orlicz-Musielak spaces with Luxemburg norm, such a criterion is given in (A. Kami ska, Bull. Acad. Polon. Sci. Sér. Sci. Math. Astronom. Phys. 29 (1981), 137–144).     

Interpolation of Sparse Multivariate Polynomials over Large Finite Fields with Applications

We develop a Las Vegas-randomized algorithm which performs interpolation of sparse multivariate polynomials over finite fields. Our algorithm can be viewed as the first successful adaptation of the sparse polynomial interpolation algorithm for the complex field developed by M. Ben-Or and P. Tiwari (1988, in “Proceedings of the 20th ACM Symposium on the Theory of Computing,” pp. 301–309, Assoc. Comput. Mach., New York) to the case of finite fields. It improves upon a previous result by D. Y. Grigoriev, M. Karpinski, and M. F. Singer (1990, SIAM J. Comput.19, 1059–1063) and is by far the most time efficient algorithm (time and processor efficient parallel algorithm) for the problem when the finite field is large. As applications, we obtain Monte Carlo-randomized parallel algorithms for sparse multivariate polynomial factorization and GCD over finite fields. The efficiency of these algorithms improves upon that of the previously known algorithms for the respective problems.     

Stokes and Navier–Stokes equations with nonhomogeneous boundary conditions

In this paper, we study the existence and regularity of solutions to the Stokes and Oseen equations with nonhomogeneous Dirichlet boundary conditions with low regularity. We consider boundary conditions for which the normal component is not equal to zero. We rewrite the Stokes and the Oseen equations in the form of a system of two equations. The first one is an evolution equation satisfied by Pu, the projection of the solution on the Stokes space – the space of divergence free vector fields with a normal trace equal to zero – and the second one is a quasi-stationary elliptic equation satisfied by (I−P)u, the projection of the solution on the orthogonal complement of the Stokes space. We establish optimal regularity results for Pu and (I−P)u. We also study the existence of weak solutions to the three-dimensional instationary Navier–Stokes equations for more regular data, but without any smallness assumption on the initial and boundary conditions.     

Some Asymptotic Formulae for Gaussian Distributions

This paper considers asymptotic expansions of certain expectations which appear in the theory of large deviation for Gaussian random vectors with values in a separable real Hilbert space. A typical application is to calculation of the “tails” of distributions of smooth functionals,p(r)=P{Φ(r⁻¹ξ)0},r→∞, e.g., the probability that a centered Gaussian random vector hits the exterior of a large sphere surrounding the origin. The method provides asymptotic formulae for the probability itself and not for its logarithm in a situation, where it is natural to expect thatp(r)=c′r^D exp{−c″r²}. Calculations are based on a combination of the method of characteristic functionals with the Laplace method used to find asymptotics of integrals containing a fast decaying function with “small” support.     

Topological group criterion for in compact-open-like topologies, II

We continue from “part I” our address of the following situation. For a Tychonoff space Y, the “second epi-topology” σ is a certain topology on C(Y), which has arisen from the theory of categorical epimorphisms in a category of lattice-ordered groups. The topology σ is always Hausdorff, and σ interacts with the point-wise addition + on C(Y) as: inversion is a homeomorphism and + is separately continuous. When is + jointly continuous, i.e. σ is a group topology? This is so if Y is Lindelöf and Čech-complete, and the converse generally fails. We show in the present paper: under the Continuum Hypothesis, for Y separable metrizable, if σ is a group topology, then Y is (Lindelöf and) Čech-complete, i.e. Polish. The proof consists in showing that if Y is not Čech-complete, then there is a family of compact sets in βY which is maximal in a certain sense.     

Fast pattern-matching on indeterminate strings

In a string x on an alphabet Σ, a position i is said to be indeterminate iff x[i] may be any one of a specified subset {λ₁,λ₂,…,λ_j} of Σ, 2j|Σ|. A string x containing indeterminate positions is therefore also said to be indeterminate. Indeterminate strings can arise in DNA and amino acid sequences as well as in cryptological applications and the analysis of musical texts. In this paper we describe fast algorithms for finding all occurrences of a pattern p=p[1..m] in a given text x=x[1..n], where either or both of p and x can be indeterminate. Our algorithms are based on the Sunday variant of the Boyer–Moore pattern-matching algorithm, one of the fastest exact pattern-matching algorithms known. The methodology we describe applies more generally to all variants of Boyer–Moore (such as Horspool's, for example) that depend only on calculation of the δ (“rightmost shift”) array: our method therefore assumes that Σ is indexed (essentially, an integer alphabet), a requirement normally satisfied in practice.     

Algebraic K-theory of non-linear projective spaces

In the spirit of “The Fundamental Theorem for the algebraic K-theory of spaces: I” (J. Pure Appl. Algebra 160 (2001) 21–52) we introduce a category of sheaves of topological spaces on n-dimensional projective space and present a calculation of its K-theory, a “non-linear” analogue of Quillen's isomorphism K_i(P_Rⁿ)₀ⁿK_i(R).     

Embeddings in Spaces of Lipschitz Type, Entropy and Approximation Numbers, and Applications

We consider the embeddings of certain Besov and Triebel–Lizorkin spaces in spaces of Lipschitz type. The prototype of such embeddings arises from the result of H. Brézis and S. Wainger (1980, Comm. Partial Differential Equations5, 773–789) about the “almost” Lipschitz continuity of elements of the Sobolev spaces H^1+n/p_p( ⁿ) when 1<p<∞. Two-sided estimates are obtained for the entropy and approximation numbers of a variety of related embeddings. The results are applied to give bounds for the eigenvalues of certain pseudo-differential operators and to provide information about the mapping properties of these operators.     

Multiple objective fractional programming involving semilocally type I-preinvex and related functions

Sufficient optimality conditions are obtained for a nonlinear multiple objective fractional programming problem involving η-semidifferentiable type I-preinvex and related functions. Furthermore, a general dual is formulated and duality results are proved under the assumptions of generalized semilocally type I-preinvex and related functions. Our result generalize the results of Preda [V. Preda, Optimality and duality in fractional multiple objective programming involving semilocally preinvex and related functions, J. Math. Anal. Appl. 288 (2003) 365–382] and Stancu-Minasian [I.M. Stancu-Minasian, Optimality and duality in fractional programming involving semilocally preinvex and related functions, J. Inform. Optim. Sci. 23 (2002) 185–201].     

Numerical comparison of nonlinear subgridscale models via adaptive mesh refinement

In this paper, we provide a method of evaluating the efficacy of nonlinear subgridscale models for use in the large eddy simulation of incompressible viscous flow problems. We compare subgridscale “artificial” viscosity models using a posteriori error estimation and adaptive mesh refinement. Specifically, we compare α-Laplacian based subgridscale models and discuss the benefits and limitations of different values of α for some standard benchmark problems for the Navier–Stokes equations.