Notes on subtlety and ineffability in P κ λ

A type of subtlety for P_κλ called “strongly subtle” is introduced to show almost ineffability is consistencywise stronger than Shelah property. The following are also shown: is strongly subtle” has rather strong consequences. (ii) The ideal is not strongly subtle} is not λ-saturated , and completely ineffable ideal is not precipitous. (iii) In case that λ^<κ=2^λ, almost λ-ineffability coincides with λ-ineffability. (iv) It is not provable that κ is λ^<κ-ineffable whenever κ is λ-ineffable.Research partially supported by “Grant-in-Aid for Scientific research (C), The Ministry of Education, Science, Sports and Culture of Japan 09640299”, and “Japan Society for the Promotion of Science 14540142”.The author is very grateful to the referee for his correcting many errors and helpful suggestions.     

A new characterization of supercompactness and applications

We give a new characterization of λ-supercompact cardinal κ in terms of (κ,λ)-Solovay pairs. We give some applications of (κ,λ)-Solovay pairs.     

Abelian torsion groups with a countably compact group topology

Comfort and Remus [W.W. Comfort, D. Remus, Abelian torsion groups with a pseudocompact group topology, Forum Math. 6 (3) (1994) 323–337] characterized algebraically the Abelian torsion groups that admit a pseudocompact group topology using the Ulm–Kaplansky invariants.We show, under a condition weaker than the Generalized Continuum Hypothesis, that an Abelian torsion group (of any cardinality) admits a pseudocompact group topology if and only if it admits a countably compact group topology. Dikranjan and Tkachenko [D. Dikranjan, M. Tkachenko, Algebraic structure of small countably compact Abelian groups, Forum Math. 15 (6) (2003) 811–837], and Dikranjan and Shakhmatov [D. Dikranjan, D. Shakhmatov, Forcing hereditarily separable compact-like group topologies on Abelian groups, Topology Appl. 151 (1–3) (2005) 2–54] showed this equivalence for groups of cardinality not greater than .We also show, from the existence of a selective ultrafilter, that there are countably compact groups without non-trivial convergent sequences of cardinality κ^ω, for any infinite cardinal κ. In particular, it is consistent that for every cardinal κ there are countably compact groups without non-trivial convergent sequences whose weight λ has countable cofinality and λ>κ.     

More on the revised GCH and the black box

We strengthen the revised GCH theorem by showing, e.g., that for , for all but finitely many regular κ<_ω, it holds that “λ is accessible on cofinality κ” in some weak sense (see below).As a corollary, λ=2^μ=μ⁺>_ω implies that the diamond holds on λ when restricted to cofinality κ for all but finitely many .We strengthen previous results on the black box and the middle diamond: previously it was established that these principles hold on for sufficiently large n; here we succeed in replacing a sufficiently large _n with a sufficiently large _n.The main theorem, concerning the accessibility of λ on cofinality κ, Theorem 3.1, implies as a special case that for every regular λ>_ω, for some κ<_ω, we can find a sequence such that , , and we can fix a finite set of “exceptional” regular cardinals θ<_ω so that if Aλ satisfies |A|<_ω, there is a pair-coloring so that for every -monochromatic BA with no last element, letting δ:=supB it holds that —provided that is not one of the finitely many “exceptional” members of .     

The representability number of a chain

For each pair of linear orderings (L,M), the representability number repr_M(L) of L in M is the least ordinal α such that L can be order-embedded into the lexicographic power . The case is relevant to utility theory. The main results in this paper are as follows. (i) If κ is a regular cardinal that is not order-embeddable in M, then repr_M(κ)=κ; as a consequence, for each κω₁. (ii) If M is an uncountable linear ordering with the property that A×_lex2 is not order-embeddable in M for each uncountable AM, then for any ordinal α; in particular, . (iii) If L is either an Aronszajn line or a Souslin line, then .     

A new approach to Euler splines

Starting from the exponential Euler polynomials discussed by Euler in “Institutions Calculi Differentialis,” Vol. II, 1755, the author introduced in “Linear operators and approximation,” Vol. 20, 1972, the so-called exponential Euler splines. Here we describe a new approach to these splines. Let t be a constant such that t=|t|e^iα, −π<α<π,t≠0,t≠1.. Let S₁(x:t) be the cardinal linear spline such that S₁(v:t) = t^v for all v ε Z. Starting from S₁(x:t) it is shown that we obtain all higher degree exponential Euler splines recursively by the averaging operation . Here S_n(x:t) is a cardinal spline of degree n if n is odd, while is a cardinal spline if n is even. It is shown that they have the properties S_n(v:t) = t^v for v ε Z.     

Nonparametric Approach for Non-Gaussian Vector Stationary Processes

Suppose that {z(t)} is a non-Gaussian vector stationary process with spectral density matrixf(λ). In this paper we consider the testing problemH: ∫^π_−π K{f(λ)} dλ=cagainstA: ∫^π_−π K{f(λ)} dλ≠c, whereK{·} is an appropriate function andcis a given constant. For this problem we propose a testT_nbased on ∫^π_−π K{f(λ)} dλ=c, wheref(λ) is a nonparametric spectral estimator off(λ), and we define an efficacy ofT_nunder a sequence of nonparametric contiguous alternatives. The efficacy usually depnds on the fourth-order cumulant spectraf₄^Zofz(t). If it does not depend onf₄^Z, we say thatT_nis non-Gaussian robust. We will give sufficient conditions forT_nto be non-Gaussian robust. Since our test setting is very wide we can apply the result to many problems in time series. We discuss interrelation analysis of the components of {z(t)} and eigenvalue analysis off(λ). The essential point of our approach is that we do not assume the parametric form off(λ). Also some numerical studies are given and they confirm the theoretical results.     

An analytic approximation to the cardinal functions of Gaussian radial basis functions on an infinite lattice

Gaussian radial basis functions (RBFs) have been very useful in computer graphics and for numerical solutions of partial differential equations where these RBFs are defined, on a grid with uniform spacing h, as translates of the “master” function (x;α,h)≡exp(-[α²/h²]x²) where α is a user-choosable constant. Unfortunately, computing the coefficients of (x-jh;α,h) requires solving a linear system with a dense matrix. It would be much more efficient to rearrange the basis functions into the equivalent “Lagrangian” or “cardinal” basis because the interpolation matrix in the new basis is the identity matrix; the cardinal basis C_j(x;α,h) is defined by the set of linear combinations of the Gaussians such that C_j(kh)=1 when k=j and C_j(kh)=0 for all integers . We show that the cardinal functions for the uniform grid are C_j(x;h,α)=C(x/h-j;α) where C(X;α)≈(α²/π)sin(πX)/sinh(α²X). The relative error is only about 4exp(-2π²/α²) as demonstrated by the explicit second order approximation. It has long been known that the error in a series of Gaussian RBFs does not converge to zero for fixed α as h→0, but only to an “error saturation” proportional to exp(-π²/α²). Because the error in our approximation to the master cardinal function C(X;α) is the square of the error saturation, there is no penalty for using our new approximations to obtain matrix-free interpolating RBF approximations to an arbitrary function f(x). The master cardinal function on a uniform grid in d dimensions is just the direct product of the one-dimensional cardinal functions. Thus in two dimensions . We show that the matrix-free interpolation can be extended to non-uniform grids by a smooth change of coordinates.     

Small subsets of groups

Given an infinite group G and an infinite cardinal κ|G|, we say that a subset A of G is κ-large (κ-small) if there exists F[G]^<κ such that G=FA (GFA is κ-large for each F[G]^<κ). The subject of the paper is the family of all κ-small subsets. We describe the left ideal of the right topological semigroup βG determined by . We study interrelations between κ-small and other (P_κ-small and κ-thin) subsets of groups, and prove that G can be generated by some 2-thin subsets. We partition G in countable many subsets which are κ-small for each κω. We show that [G]^<κ is dual to provided that either κ is regular and κ=|G|, or G is Abelian and κ is a limit cardinal, or G is a divisible Abelian group.     

A bijective proof of the hook-length formula

A well-known theorem of Frame, Robinson, and, Thrall states that if λ is a partition of n, then the number of Standard Young Tableaux of shape λ is n! divided by the product of the hook-lengths. We give a new combinatorial proof of this formula by exhibiting a bijection between the set of unsorted Young Tableaux of shape λ, and the set of pairs (T, S), where T is a Standard Young Tableau of shape λ and S is a “Pointer” Tableau of shape λ.     

The Discrete Spectrum in the Spectral Gaps of Semibounded Operators with Non-sign-definite Perturbations

Given two self-adjoint operators A and V = V₊  − V₋ , we study the motion of the eigenvalues of the operator A(t) = A − tV as t increases. Let α > 0 and let λ be a regular point for A. We consider the quantities N₊ (V; λ, α), N₋ (V; λ, α), and N₀(V; λ, α) defined as the number of eigenvalues of the operator A(t) that pass point λ from the right to the left, from the left to the right, or change the direction of their motion exactly at point λ, respectively, as t increases from 0 to α > 0. We study asymptotic characteristics of these quantities as α → ∞. In the present paper, the results obtained previously [O. L. Safronov, Comm. Math. Phys.193 (1998), 233–243] are extended and given new applications to differential operators.     

Super-connectivity and super-edge-connectivity for some interconnection networks

Let G=(V,E) be a k-regular graph with connectivity κ and edge connectivity λ. G is maximum connected if κ=k, and G is maximum edge connected if λ=k. Moreover, G is super-connected if it is a complete graph, or it is maximum connected and every minimum vertex cut is {x|(v,x)E} for some vertex vV; and G is super-edge-connected if it is maximum edge connected and every minimum edge disconnecting set is {(v,x)|(v,x)E} for some vertex vV. In this paper, we present three schemes for constructing graphs that are super-connected and super-edge-connected. Applying these construction schemes, we can easily discuss the super-connected property and the super-edge-connected property of hypercubes, twisted cubes, crossed cubes, möbius cubes, split-stars, and recursive circulant graphs.     

Limit theorems for sums of random exponentials

We study limiting distributions of exponential sums as t→∞, N→∞, where (X_i) are i.i.d. random variables. Two cases are considered: (A) ess sup X_i = 0 and (B) ess sup X_i = ∞. We assume that the function h(x)= -log P{X_i>x} (case B) or h(x) = -log P {X_i>-1/x} (case A) is regularly varying at ∞ with index 1 < ϱ <∞ (case B) or 0 < ϱ < ∞ (case A). The appropriate growth scale of N relative to t is of the form , where the rate function H₀(t) is a certain asymptotic version of the function (case B) or (case A). We have found two critical points, λ₁<λ₂, below which the Law of Large Numbers and the Central Limit Theorem, respectively, break down. For 0 < λ < λ₂, under the slightly stronger condition of normalized regular variation of h we prove that the limit laws are stable, with characteristic exponent α = α (ϱ, λ) ∈ (0,2) and skewness parameter β ≡ 1.Research supported in part by the DFG grants 436 RUS 113/534 and 436 RUS 113/722.Mathematics Subject Classification (2000): 60G50, 60F05, 60E07     

Second-Order Properties of a Two-Stage Fixed-Size Confidence Region for the Mean Vector of a Multivariate Normal Distribution

We consider the classical fixed-size confidence region estimation problem for the mean vectorμin theN_p(μ, Σ) population where Σ is unknown but positive definite. We writeλ₁for the largest characteristic root of Σ and assume thatλ₁is simple. Moreover, we suppose that, in many practical applications, we will often have available a numberλ*(>0) and that we can assumeλ₁>λ*. Given this addi- tional, and yet very minimal, knowledge regardingλ₁, the two-stage procedure of Chatterjee (Calcutta Statist. Assoc. Bull.8(1959a), 121–148;9(1959b), 20–28;11(1962), 144–159) is revised appropriately. The highlight in this paper involves the verification ofsecond-order propertiesassociated with such revised two-stage estimation techniques, along with the maintenance of the nominal confidence coefficient.     

Second-order boundary value problems with nonhomogeneous boundary conditions (II)

Sufficient conditions are given for the existence of solutions of the following nonlinear boundary value problem with nonhomogeneous multi-point boundary condition

We prove that the whole plane is divided by a “continuous decreasing curve” Γ into two disjoint connected regions Λ^E and Λ^N such that the above problem has at least one solution for (λ₁,λ₂)Γ, has at least two solutions for (λ₁,λ₂)Λ^EΓ, and has no solution for (λ₁,λ₂)Λ^N. We also find explicit subregions of Λ^E where the above problem has at least two solutions and two positive solutions, respectively.     

Intervals in Lattices of κ-Meet-Closed Subsets

We study abstract properties of intervals in the complete lattice of all κ-meet-closed subsets (κ-subsemilattices) of a κ-(meet-)semilattice S, where κ is an arbitrary cardinal number. Any interval of that kind is an extremally detachable closure system (that is, for each closed set A and each point x outside A, deleting x from the closure of A∪{x} leaves a closed set). Such closure systems have many pleasant geometric and lattice-theoretical properties; for example, they are always weakly atomic, lower locally Boolean and lower semimodular, and each member has a decomposition into completely join-irreducible elements. For intervals of κ-subsemilattices, we describe the covering relation, the coatoms, the ∨-irreducible and the ∨-prime elements in terms of the underlying κ-semilattices. Although such intervals may fail to be lower continuous, they are strongly coatomic if and only if every element has an irredundant (and even a least) join-decomposition. We also characterize those intervals which are Boolean, distributive (equivalently: modular), or semimodular. Mathematics Subject Classifications (2000) Primary: 06A12; Secondary: 06B05, 06A23, 52A01.     

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.     

A general framework of compactly supported splines and wavelets

Let {V_k} be a nested sequence of closed subspaces that constitute a multiresolution analysis of L²( ). We characterize the family Φ = {φ} where each φ generates this multiresolution analysis such that the two-scale relation of φ is governed by a finite sequence. In particular, we identify the ε Φ that has minimum support. We also characterize the collection Ψ of functions η such that each η generates the orthogonal complementary subspaces W_k of V_k, . In particular, the minimally supported ψ ε Ψ is determined. Hence, the “B-spline” and “B-wavelet” pair (, ψ) provides the most economical and computational efficient “spline” representations and “wavelet” decompositions of L² functions from the “spline” spaces V_k and “wavelet” spaces W_k, k . A very general duality principle, which yields the dual bases of both {(·−j):j and {η(·−j):j } for any η ε Ψ by essentially interchanging the pair of two-scale sequences with the pair of decomposition sequences, is also established. For many filtering applications, it is very important to select a multiresolution for which both and ψ have linear phases. Hence, “non-symmetric” and ψ, such as the compactly supported orthogonal ones introduced by Daubechies, are sometimes undesirable for these applications. Conditions on linear-phase φ and ψ are established in this paper. In particular, even-order polynomial B-splines and B-wavelets φ_m and ψ_m have linear phases, but the odd-order B-wavelet only has generalized linear phases.     

Maximum likelihood estimation of a change-point in the distribution of independent random variables: General multiparameter case

In a sequence ofn independent random variables the pdf changes fromf(x, 0) tof(x, 0 + δv_n⁻¹) after the firstnλ variables. The problem is to estimateλ (0, 1 ), where 0 and δ are unknownd-dim parameters andv_n → ∞ slower thann^1/2. Let_n denote the maximum likelihood estimator (mle) ofλ. Analyzing the local behavior of the likelihood function near the true parameter values it is shown under regularity conditions that ifn_n²(− λ) is bounded in probability asn → ∞, then it converges in law to the timeT_(δjδ)^1/2 at which a two-sided Brownian motion (B.M.) with drift1/2(δ′Jδ)^1/2ton(−∞, ∞) attains its a.s. unique minimum, whereJ denotes the Fisher-information matrix. This generalizes the result for small change in mean of univariate normal random variables obtained by Bhattacharya and Brockwell (1976,Z. Warsch. Verw. Gebiete37, 51–75) who also derived the distribution ofT_μ forμ > 0. For the general case an alternative estimator is constructed by a three-step procedure which is shown to have the above asymptotic distribution. In the important case of multiparameter exponential families, the construction of this estimator is considerably simplified.     

Local analytic solutions of a functional differential equation

In this paper, we are concerned with the existence of analytic solution of a functional differential equation αz+βx^′(z)=x(az+bx^″(z)), where are four complex numbers. We first discuss the existence of analytic solutions for some special cases of the above equation. Then, by reducing the equation with the Schröder transformation to the another functional equation with proportional delay, an existence theorem is established for analytic solutions of the original equation. For the constant λ given in the Schröder transformation, we discuss the case 0<|λ|<1 and λ on the unit circle S¹, i.e., |λ|=1. We study λ is at resonance, i.e., at a root of the unity and λ is near resonance under the Brjuno condition.