On extensions of countable filterbases to ultrafilters and ultrafilter compactness

We show in the Zermelo-Fraenkel set theory ZF without the axiom of choice:

1. Given an infinite set X, the Stone space S(X) is ultrafilter compact.

2. For every infinite set X, every countable filterbase of X extends to an ultra-filter i? for every infinite set X, S(X) is countably compact.

3. ω has a free ultrafilter i? every countable, ultrafilter compact space is countably compact.

   We also show the following:

4. There are a permutation model 𝒩 and a set X ∈ 𝒩 such that X has no free ultrafilters and S(X) is not compact but S(X) is countably compact and every countable filterbase of X extends to an ultrafilter.

5. It is relatively consistent with ZF that every countable filterbase of ω extends to an ultrafilter but there exists a countable filterbase of ? which does not extend to an ultrafilter. Hence, it is relatively consistent with ZF that ? has free ultrafilters but there exists a countable filterbase of ? which does not extend to an ultrafilter.

     

Nonlinear Eigenvalue Problems of Schrödinger Type Admitting Eigenfunctions with Given Spectral Characteristics

The following work is an extension of our recent paper [10]. We still deal with nonlinear eigenvalue problems of the form in a real Hilbert space ℋ︁ with a semi‐bounded self‐adjoint operator A₀, while for every y from a dense subspace X of ℋ︁, B(y ) is a symmetric operator. The left‐hand side is assumed to be related to a certain auxiliary functional ψ, and the associated linear problems are supposed to have non‐empty discrete spectrum (y ∈ X). We reformulate and generalize the topological method presented by the authors in [10] to construct solutions of (∗︁) on a sphere S_R ≔ {y ∈ X | ∥y∥_ℋ︁ = R} whose ψ‐value is the n‐th Ljusternik‐Schnirelman level of ψ| and whose corresponding eigenvalue is the n‐th eigenvalue of the associated linear problem (∗︁∗︁), where R > 0 and n ∈ ℕ are given. In applications, the eigenfunctions thus found share any geometric property enjoyed by an n‐th eigenfunction of a linear problem of the form (∗︁∗︁). We discuss applications to elliptic partial differential equations with radial symmetry.     

The Vector Space Kinna‐Wagner Principle is Equivalent to the Axiom of Choice

We show that the axiom of choice AC is equivalent to the Vector Space Kinna‐Wagner Principle, i.e., the assertion: “For every family 𝒱= {V_i : i ∈ k} of non trivial vector spaces there is a family ℱ = {F_i : i ∈ k} such that for each i ∈ k, F_i is a non empty independent subset of V_i”. We also show that the statement “every vector space over ℚ has a basis” implies that every infinite well ordered set of pairs has an infinite subset with a choice set, a fact which is known not to be a consequence of the axiom of multiple choice MC.     

On the integral dependence of power series rings

We prove the following results: (1) Let R ? S be two commutative rings. Suppose that dim R = 0.If f(X) ∈ S[[X]]is integral over R[[X]], then every coefficient of f(X) is integral over R. (2) Let dim R ≥ 1. There exists a ring S containing R and a power series f(X) ∈ S[[X]]such that f(X) is integral over R[[X]], but not all coefficients of f(X) are integral over R. (3) Let k ? R. Suppose that R is algebraic over the field k. Then R[[X]] is integral over k[[X]] if and only if the nilradical of R is nilpotent and the separable degree and the inseparable exponent of R _red over k are finite.     

A Problem in Linear Matrix Approximation

Let A be a normal operator in ??(H), H a complex Hilbert space, and let ? _A = ? {AX - XA:X ∈ ??(H)} be the commutator subspace of ??(H) associated with A. If B in ??(H) commutes with A, then B is orthogonal to ?_A with respect to the spectral norm; i.e., the null operator is an element of best approximation of B in ? _A. This was proved by J. Anderson in 1973 and extended by P. J. Maher with respect to the Schatten p-norm recently. We take a look at their result from a more approximation theoretical point of view in the finite dimensional setting; in particular, we characterize all elements of best approximation of B in R_A and prove that the metric projection of H onto ?_A is continuous.     

Robust characterizations of k‐wise independence over product spaces and related testing results

A discrete distribution D over Σ₁ ×··· ×Σ_n is called (non‐uniform) k ‐wise independent if for any subset of k indices {i₁,…,i_k} and for any z₁∈Σ,…,z_k∈Σ, Pr_X～D[X···X = z₁···z_k] = Pr_X～D[X = z₁]···Pr_X～D[X = z_k]. We study the problem of testing (non‐uniform) k ‐wise independent distributions over product spaces. For the uniform case we show an upper bound on the distance between a distribution D from k ‐wise independent distributions in terms of the sum of Fourier coefficients of D at vectors of weight at most k. Such a bound was previously known only when the underlying domain is {0,1}ⁿ. For the non‐uniform case, we give a new characterization of distributions being k ‐wise independent and further show that such a characterization is robust based on our results for the uniform case. These results greatly generalize those of Alon et al. (STOC'07, pp. 496–505) on uniform k ‐wise independence over the Boolean cubes to non‐uniform k ‐wise independence over product spaces. Our results yield natural testing algorithms for k ‐wise independence with time and sample complexity sublinear in terms of the support size of the distribution when k is a constant. The main technical tools employed include discrete Fourier transform and the theory of linear systems of congruences.© 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2013     

Triangle‐free subgraphs in the triangle‐free process

Consider the triangle‐free process, which is defined as follows. Start with G(0), an empty graph on n vertices. Given G(i ‐ 1), let G(i) = G(i ‐ 1) ∪{g(i)}, where g(i) is an edge that is chosen uniformly at random from the set of edges that are not in G(i ? 1) and can be added to G(i ‐ 1) without creating a triangle. The process ends once a maximal triangle‐free graph has been created. Let H be a fixed triangle‐free graph and let X_H(i) count the number of copies of H in G(i). We give an asymptotically sharp estimate for ??(X_H(i)), for every \begin{align*}1 \ll i \le 2^{-5} n^{3/2} \sqrt{\ln n}\end{align*}, at the limit as n →∞. Moreover, we provide conditions that guarantee that a.a.s. X_H(i) = 0, and that X_H(i) is concentrated around its mean.© 2011 Wiley Periodicals, Inc. Random Struct. Alg., 2011     

How many normal measures can ℵ carry?

Relative to the existence of a supercompact cardinal with a measurable cardinal above it, we show that it is consistent for ?₁ to be regular and for ? to be measurable and to carry precisely τ normal measures, where τ ≥ ? is any regular cardinal. This extends the work of [2], in which the analogous result was obtained for ?_{ω +1} using the same hypotheses (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

The Ultrafilter Closure in ZF

It is well known that, in a topological space, the open sets can be characterized using ?lter convergence. In ZF (Zermelo‐Fraenkel set theory without the Axiom of Choice), we cannot replace filters by ultrafilters. It is proven that the ultra?lter convergence determines the open sets for every topological space if and only if the Ultrafilter Theorem holds. More, we can also prove that the Ultra?lter Theorem is equivalent to the fact that u_X = k_X for every topological space X, where k is the usual Kuratowski closure operator and u is the Ultra?lter Closure with u_X (A):= {x ∈ X: (? U ultrafilter in X)[U converges to x and A ∈ U ]}. However, it is possible to built a topological space X for which u_X ≠ k_X, but the open sets are characterized by the ultra?lter convergence. To do so, it is proved that if every set has a free ultra?lter, then the Axiom of Countable Choice holds for families of non‐empty finite sets. It is also investigated under which set theoretic conditions the equality u = k is true in some subclasses of topological spaces, such as metric spaces, second countable T0‐spaces or {?} (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Sharp bounds for the number of 3‐independent partitions and the chromaticity of bipartite graphs

Given a graph G and an integer k ≥ 1, let α(G, k) denote the number of k‐independent partitions of G. Let ??^?s(p,q) (resp., ??₂^?s(p,q)) denote the family of connected (resp., 2‐connected) graphs which are obtained from the complete bipartite graph K_p,q by deleting a set of s edges, where p ≥ q ≥ 2. This paper first gives a sharp upper bound for α(G,3), where G ∈ ?? ^?s(p,q) and 0 ≤ s ≤ (p ? 1)(q ? 1) (resp., G ∈ ?? ₂^?s(p,q) and 0 ≤ s ≤ p + q ? 4). These bounds are then used to show that if G ∈ ?? ^?s(p,q) (resp., G ∈ ?? ₂^?s (p,q)), then the chromatic equivalence class of G is a subset of the union of the sets ??^?s_i(p+i,q?i) where max and s_i = s ? i(p?q+i) (resp., a subset of ??₂^?s(p,q), where either 0 ≤ s ≤ q ? 1, or s ≤ 2q ? 3 and p ≥ q + 4). By applying these results, we show finally that any 2‐connected graph obtained from K_p,q by deleting a set of edges that forms a matching of size at most q ? 1 or that induces a star is chromatically unique. © 2001 John Wiley & Sons, Inc. J Graph Theory 37: 48–77, 2001     

Edge-colored saturated graphs

A graph G is (k₁, k₂, …, k_t)-saturated if there exists a coloring C of the edges of G in t colors 1, 2, …, t in such a way that there is no monochromatic complete k_i-subgraph K of color i, 1 ? i ? t, but the addition of any new edge of color i, joining two nonadjacent vertices in G, with C, creates a monochromatic K of color i, 1 ? i ? t. We determine the maximum and minimum number of edges in such graphs and characterize the unique extremal graphs.     

The existence of positive solutions to a non‐local singular boundary value problem

We consider the non‐local singular boundary value problem (1) where q ∈ C⁰([0,1]) and f, h ∈ C⁰((0,∞)), limf(x)=?∞, limh(x)=∞. We present conditions guaranteeing the existence of a solution x ∈ C¹([0,1]) ∩ C²((0,1]) which is positive on (0,1]. The proof of the existence result is based on regularization and sequential techniques and on a non‐linear alternative of Leray–Schauder type. Copyright © 2005 John Wiley & Sons, Ltd.     

Covering arrays with mixed alphabet sizes

Covering arrays with mixed alphabet sizes, or simply mixed covering arrays, are natural generalizations of covering arrays that are motivated by applications in software and network testing. A (mixed) covering array A of type is a k × N array with the cells of row i filled with elements from ? and having the property that for every two rows i and j and every ordered pair of elements (e,f) ∈ ? × ?, there exists at least one column c, 1 ≤ c ≤ N, such that A_i,c = e and A_j,c = f. The (mixed) covering array number, denoted by , is the minimum N for which a covering array of type with N columns exists. In this paper, several constructions for mixed covering arrays are presented, and the mixed covering array numbers are determined for nearly all cases with k = 4 and for a number of cases with k = 5. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 413–432, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10059     

Some infinite families of large sets of Kirkman triple systems

A large set of Kirkman triple systems of order v, denoted by LKTS(v), is a collection {(X, B_i) : 1 ≤ i ≤ v ? 2}, where every (X,B_i) is a KTS(v) and all B_i form a partition of all triples on X. Many researchers have studied the existence of LKTS(v) for a long time. In [13], the author introduced a concept—large set of generalized Kirkman systems (LGKS), which plays an important role in the discussion of LKTS. In this article, we give a new construction for LGKS and obtain some new results of LKTS, that is, there exists an LKTS(6u + 3) for u = qⁿ, where n ≥ 1, q ≡ 7 (mod 12) and q is a prime power. © 2007 Wiley Periodicals, Inc. J Combin Designs 16: 202–212, 2008     

Dyson's nonintersecting Brownian motions with a few outliers

Consider n nonintersecting Brownian particles on ? (Dyson Brownian motions), all starting from the origin at time t = 0 and forced to return to x = 0 at time t = 1. For large n, the average mean density of particles has its support, for each 0 < t < 1, on the interval ±√2nt(1 ? t). The Airy process ??(τ) is defined as the motion of these nonintersecting Brownian motions for large n but viewed from the curve ?? : y = √2nt(1 ? t) with an appropriate space‐time rescaling. Assume now a finite number r of these particles are forced to a different target point, say a = ρ₀√n/2 > 0. Does it affect the Brownian fluctuations along the curve ?? for large n? In this paper, we show that no new process appears as long as one considers points (y, t) ∈ ?? such that 0 < t < (1 + ρ)^?1, which is the t‐coordinate of the point of tangency of the tangent to the curve passing through (ρ₀√n/2, 1). At this point the fluctuations obey a new statistics, which we call the Airy process with r outliers ??^(r)(τ) (in short, r‐Airy process). The log of the probability that at time τ the cloud does not exceed x is given by the Fredholm determinant of a new kernel (extending the Airy kernel), and it satisfies a nonlinear PDE in x and τ, from which the asymptotic behavior of the process can be deduced for τ → ?∞. This kernel is closely related to one found by Baik, Ben Arous, and Péché in the context of multivariate statistics. © 2008 Wiley Periodicals, Inc.     

Directions of uniform rotundity in direct sums of normed spaces

Let {(X_i,|| · || _i)}_{i ? I},\{(X_i,\left \| {\cdot } \right \| _{i})\}_{i\in I}, be an arbitrary family of normed spaces and let (E,|| · || _E)(E,\left \| {\cdot } \right \| _{E}) be a monotonic normed space of real functions on the set I that is an ideal in \Bbb R^I{\Bbb R}^I. We prove a sufficient condition for the direct sum space E(X_i) to be uniformly rotund in a direction. We show that this condition is also necessary for E=l_￥E=\ell _{\infty }, and it is not necessary for E=l₁E=\ell _1. When E is either uniformly rotund in every direction and has compact order intervals, or weakly uniformly rotund respect to its evaluation functionals, we reestablish as a corollary the result that reads: E(X_i)E(X_i) is uniformly rotund in every direction if and only if so are all the X_i.     

A note on the Picard bundle over a moduli space of vector bundles

Let ??(n , d ) be a coprime moduli space of stable vector bundles of rank n ≥ 2 and degree d over a complex irreducible smooth projective curve X of genus g ≥ 2 and ??_ξ ? ??(n , d ) a fixed determinant moduli space. Assuming that the degree d is sufficiently large, denote by ?? the vector bundle over X ×??(n , d ) defined by the kernel of the evaluation map H ⁰(X , E ) → E_x , where E ∈??(n , d ) and x ∈ X . We prove that ?? and its restriction ??_ξ to X × ??ξ are stable. The space of all infinitesimal deformations of ?? over X ×??(n , d ) is proved to be of dimension 3g and that of ??ξ over X × ??ξ of dimension 2g , assuming that g ≥ 3 and if g = 3 then n ≥ 4 and if g = 4 then n ≥ 3. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A Characterization of a Certain Class of Compact Metric Spaces

Compact metric spaces χ of such a kind, that ??_f =??(X), are characterized, ??(X) is the σ-field of BOREL sets and ??_f(X) is the field generated by all open subset of X. Our main result is Theorem 5: If χ is a compact metric space, then the following conditions are equivalent:

• 1 ??_f(X) =??(X).
• 2 card (X) ≦x₀ and there are k, m?N such that card (X^(k)) = m.
• 3 There are k, m?N such that χ is homeomorphic to ω^k · m + 1.

     

On the genus of a random graph

Let p = p(n) be a function of n with 0<p<1. We consider the random graph model ??(n, p); that is, the probability space of simple graphs with vertex-set {1, 2,…, n}, where two distinct vertices are adjacent with probability p. and for distinct pairs these events are mutually independent. Archdeacon and Grable have shown that if p²(1 ? p²) ?? 8(log n)⁴/n. then the (orientable) genus of a random graph in ??(n, p) is (1 + o(1))pn²/12. We prove that for every integer i ? 1, if n^?i/(i + 1) «p «n^{?(i ? 1)/i}. then the genus of a random graph in ??(n, p) is (1 + o(1))i/4(i + 2) pn². If p = cn^?(i?1)/o, where c is a constant, then the genus of a random graph in ??(n, p) is (1 + o(1))g(i, c, n)pn² for some function g(i, c, n) with 1/12 ? g(i, c, n) ? 1. but for i > 1 we were unable to compute this function.     

On the number of positive solutions of elliptic systems

The paper deals with the existence, multiplicity and nonexistence of positive radial solutions for the elliptic system div(|?|^{p –2}?) + λk_i (|x |) fⁱ (u₁, …,u_n) = 0, p > 1, R₁ < |x | < R₂, u_i (x) = 0, on |x | = R₁ and R₂, i = 1, …, n, x ∈ ?^N , where k_i and fⁱ, i = 1, …, n, are continuous and nonnegative functions. Let u = (u₁, …, u_n), φ (t) = |t |^{p –2}t, fⁱ₀ = lim_{‖ u ‖→0}((fⁱ ( u ))/(φ (‖ u ‖))), fⁱ_∞= lim_{‖ u ‖→∞}((fⁱ ( u ))/(φ (‖ u ‖))), i = 1, …, n, f = (f¹, …, fⁿ), f ₀ = ∑ⁿ _{i =1} fⁱ ₀ and f _∞ = ∑ⁿ _{i =1} fⁱ _∞. We prove that either f ₀ = 0 and f _∞ = ∞ (superlinear), or f ₀ = ∞and f _∞ = 0 (sublinear), guarantee existence for all λ > 0. In addition, if fⁱ ( u ) > 0 for ‖ u ‖ > 0, i = 1, …, n, then either f ₀ = f _∞ = 0, or f ₀ = f _∞ = ∞, guarantee multiplicity for sufficiently large, or small λ, respectively. On the other hand, either f₀ and f_∞ > 0, or f₀ and f_∞ < ∞ imply nonexistence for sufficiently large, or small λ, respectively. Furthermore, all the results are valid for Dirichlet/Neumann boundary conditions. We shall use fixed point theorems in a cone. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)