Weak Hausdorff Gaps and the 𝔭 ≤ t Problem

We find topological characterizations of the pseudointersection number ?? and the tower number t of the real line and we show that ?? < t iff there exists a compact separable T₂ space X of π-weight < ?? that can be covered by < t nowhere dense sets iff there exists a weak Hausdorff gap of size K < t, i. e., a pair ({A : i ≠ k}, {B_J : j ε K}) C [W]^W X [U]W such that A = {A_i : i ε K} is a decreasing tower, B = {B_j : j ε K) is a family of pseudointersections of A, and there is no pseudointersection S of A meeting each member of B in an infinite set.     

Simultaneous solutions of Sylvester equations and idempotent matrices separating the joint spectrum

We investigate simultaneous solutions of the matrix Sylvester equations A_iX-XB_i=C_i,i=1,2,…,k, where {A₁,…,A_k} and {B₁,…,B_k} are k-tuples of commuting matrices of order m×m and p×p, respectively. We show that the matrix Sylvester equations have a unique solution X for every compatible k-tuple of m×p matrices {C₁,…,C_k} if and only if the joint spectra σ(A₁,…,A_k) and σ(B₁,…,B_k) are disjoint. We discuss the connection between the simultaneous solutions of Sylvester equations and related questions about idempotent matrices separating disjoint subsets of the joint spectrum, spectral mapping for the differences of commuting k-tuples, and a characterization of the joint spectrum via simultaneous solutions of systems of linear equations.     

A note on the coefficient rings of polynomial rings

LetA andB be two reduced commutative rings with finitely many minimal prime ideals. If the polynomial algebrasA[X ₁ …X _n ]=B[Y ₁ …Y _n ] whereX _i ,Y _iF are variables overA andB respectively, then there exists an injective ring homomorphism ϕ:A→B such thatB is finitely generated over ϕ(A).     

Affine cross-polytopes inscribed in a convex body

Let X be an affine cross-polytope, i.e., the convex hull of n segments A ₁ B ₁,…, A _n B _n in \mathbbRⁿ {\mathbb{R}^n} that have a common midpoint O and do not lie in a hyperplane. The affine flag F(X) of X is the chain O ∈ L ₁ ⊂⋯ ⊂ L _n = \mathbbRⁿ {\mathbb{R}^n} , where L _k is the k-dimensional affine hull of the segments A ₁ B ₁,…, A _k B _k , k ≤ n. It is proved that each convex body K ⊂ \mathbbRⁿ {\mathbb{R}^n} is circumscribed about an affine cross-polytope X such that the flag F(X) satisfies the following condition for each k ∈{2,…, n}:the (k−1)-planes of support at A _k and B _k to the body L _k ∩ K in the k-plane L _k are parallel to L _k −1.Each such X has volume at least V(K)/2 ^n(n−1)/2. Bibliography: 5 titles.     

On three-designs of small order

For positive integers t?k?v and λ we define a t-design, denoted B_i[k,λ;v], to be a pair (X,B) where X is a set of points and B is a family, (B_i:i?I), of subsets of X, called blocks, which satisfy the following conditions: (i) |X|=v, the order of the design, (ii) |B_i|=k for each i?I, and (iii) every t-subset of X is contained in precisely λ blocks. The purpose of this paper is to investigate the existence of 3-designs with 3?k?v?32 and λ>0.Wilson has shown that there exists a constant N(t, k, v) such that designs B_t[k,λ;v] exist provided λ>N(t,k,v) and λ satisfies the trivial necessary conditions. We show that N(3,k,v)=0 for most of the cases under consideration and we give a numerical upper bound on N(3, k, v) for all 3?k?v?32. We give explicit constructions for all the designs needed.     

Sharp kernel clustering algorithms and their associated Grothendieck inequalities

In the kernel clustering problem we are given a (large) n × n symmetric positive semidefinite matrix A = (a_ij) with \begin{align*}\sum_{i=1}^n\sum_{j=1}^n a_{ij}=0\end{align*} and a (small) k × k symmetric positive semidefinite matrix B = (b_ij). The goal is to find a partition {S₁,…,S_k} of {1,…n} which maximizes \begin{align*}\sum_{i=1}^k\sum_{j=1}^k \left(\sum_{(p,q)\in S_i\times S_j}a_{pq}\right)b_{ij}\end{align*}. We design a polynomial time approximation algorithm that achieves an approximation ratio of \begin{align*}\frac{R(B)^2}{C(B)}\end{align*}, where R(B) and C(B) are geometric parameters that depend only on the matrix B, defined as follows: if b_ij = 〈v_i,v_j〉 is the Gram matrix representation of B for some \begin{align*}v_1,\ldots,v_k\in \mathbb{R}^k\end{align*} then R(B) is the minimum radius of a Euclidean ball containing the points {v₁,…,v_k}. The parameter C(B) is defined as the maximum over all measurable partitions {A₁,…,A_k} of \begin{align*}\mathbb{R}^{k-1}\end{align*} of the quantity \begin{align*}\sum_{i=1}^k\sum_{j=1}^k b_{ij}\langle z_i,z_j\rangle\end{align*}, where for i∈{1,…,k} the vector \begin{align*}z_i\in \mathbb{R}^{k-1}\end{align*} is the Gaussian moment of A_i, i.e., \begin{align*}z_i=\frac{1}{(2\pi)^{(k-1)/2}}\int_{A_i}xe^{-\|x\|_2^2/2}dx\end{align*}. We also show that for every ε > 0, achieving an approximation guarantee of \begin{align*}(1-\varepsilon)\frac{R(B)^2}{C(B)}\end{align*} is Unique Games hard. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2013     

The Real Solutions to a System of Quaternion Matrix Equations with Applications

In this article we establish necessary and sufficient conditions for the existence and the expressions of the general real solutions to the classical system of quaternion matrix equations A ₁ XB ₁ = C ₁, A ₂ XB ₂ = C ₂. Moreover, formulas of the maximal and minimal ranks of four real matrices X ₁, X ₂, X ₃, and X ₄ in solution X = X ₁ + X ₂ i + X ₃ j + X ₄ k to the system mentioned above are derived. As applications, we give necessary and sufficient conditions for the quaternion matrix equations A ₁ XB ₁ = C ₁, A ₂ XB ₂ = C ₂, A ₃ XB ₃ = C ₃ to have common real solutions. In addition, the maximal and minimal ranks of four real matrices E, F, G, and H in the common generalized inverse of A ₁ + B ₁ i + C ₁ j + D ₁ k and A ₂ + B ₂ i + C ₂ j + D ₂ k, which can be expressed as E + Fi + Gj + Hk are also presented.     

An Asymptotic Property of Schachermayer's Space under Renorming

Let X be a Banach space with closed unit ball B. Given k , X is said to be k-β, respectively, (k + 1)-nearly uniformly convex ((k + 1)-NUC), if for every ε > 0 there exists δ, 0 < δ < 1, so that for every x B and every ε-separated sequence (x_n) B there are indices (n_i)^k_{i = 1}, respectively, (n_i)^{k + 1}_{i = 1}, such that (1/(k + 1))||x + ∑^k_{i = 1} x_ni|| ≤ 1 − δ, respectively, (1/(k + 1))||∑^{k + 1}_{i = 1} x_ni|| ≤ 1 − δ. It is shown that a Banach space constructed by Schachermayer is 2-β, but is not isomorphic to any 2-NUC Banach space. Modifying this example, we also show that there is a 2-NUC Banach space which cannot be equivalently renormed to be 1-β.     

An optimal bound on the tail distribution of the number of recurrences of an event in product spaces

 Let X ₁ ,X ₂ ,... be independent random variables and a a positive real number. For the sake of illustration, suppose A is the event that |X _i+1 +...+X _j |≥a for some integers 0≤i<j<∞. For each k≥2 we upper-bound the probability that A occurs k or more times, i.e. that A occurs on k or more disjoint intervals, in terms of P(A), the probability that A occurs at least once. More generally, let X=(X ₁ ,X ₂ ,...)Ω=Π _{j ≥1}Ω _j be a random element in a product probability space (Ω,ℬ,P=⊗ _{j ≥1} P _j ). We are interested in events AB that are (at most contable) unions of finite-dimensional cylinders. We term such sets sequentially searchable. Let L(A) denote the (random) number of disjoint intervals (i,j] such that the value of X _(i,j] =(X _i+1 ,...,X _j ) ensures that XA. By definition, for sequentially searchable A, P(A)≡P(L(A)≥1)=P(𝒩_{−ln (P(Ac))} ≥1), where 𝒩_γ denotes a Poisson random variable with some parameter γ>0. Without further assumptions we prove that, if 0<P(A)<1, then P(L(A)≥k)<P(𝒩_{−ln (P(Ac))} ≥k) for all integers k≥2. An application to sums of independent Banach space random elements in l ^∞ is given showing how to extend our theorem to situations having dependent components. Received: 8 June 2001 / Revised version: 30 October 2002 Published online: 15 April 2003 RID="*" ID="*" Supported by NSF Grant DMS-99-72417. RID="†" ID="†" Supported by the Swedish Research Council. Mathematics Subject Classification (2000): Primary 60E15, 60G50 Key words or phrases: Tail probability inequalities – Hoffmann-Jo rgensen inequality – Poisson bounds – Number of event recurrences – Number of entrance times – Product spaces     

Local linear operators and multicontour solutions of homogeneous coupled map lattices

Theorems are proved establishing a relationship between the spectra of the linear operators of the formA+Ωg _iB_ig_i ⁻¹ andA+B _i, whereg _i∈G, andG is a group acting by linear isometric operators. It is assumed that the closed operatorsA andB _i possess the following property: ‖B _iA⁻¹gB_jA⁻¹‖→0 asd(e,g)→∞. Hered is a left-invariant metric onG ande is the unit ofG. Moreover, the operatorA is invariant with respect to the action of the groupG. These theorems are applied to the proof of the existence of multicontour solutions of dynamical systems on lattices. Translated fromMatematicheskie Zametki, Vol. 65, No. 1, pp. 37–47, January, 1999.     

Lyubeznik numbers of projective schemes

Let X be a projective scheme over a field k and let A be the local ring at the vertex of the affine cone of X under some embedding . We prove that, when char(k)>0, the Lyubeznik numbers λi,j(A) are intrinsic numerical invariants of X, i.e., λi,j(A) depend only on X, but not on the embedding.     

Chaos caused by a strong-mixing measure-preserving transformation

The chaos caused by a strong-mixing preserving transformation is discussed and it is shown that for a topological spaceX satisfying the second axiom of countability and for an outer measurem onX satisfying the conditions: (i) every non-empty open set ofX ism-measurable with positivem-measure; (ii) the restriction ofm on Borel σ-algebra ℬ(X) ofX is a probability measure, and (iii) for everyY⊂X there exists a Borel setB⊂ℬ(X) such thatB⊃Y andm(B) =m(Y), iff:X→X is a strong-mixing measure-preserving transformation of the probability space (X, ℬ(X),m), and if {m}, is a strictly increasing sequence of positive integers, then there exists a subsetC⊂X withm (C) = 1, finitely chaotic with respect to the sequence {m _i}, i.e. for any finite subsetA ofC and for any mapF:A→X there is a subsequencer _i such that lim_i→∞ f ^r i(a) =F(a) for anya ∈A. There are some applications to maps of one dimension. the National Natural Science Foundation of China.     

Simultaneous quasidiagonalization of complex matrices

Let

be the complex algebra generated by a pair of n × n Hermitian matrices A, B. A recent result of Watters states that A, B are simultaneously unitarily quasidiagonalizable [i.e., A and B are simultaneously unitarily similar to direct sums C₁⊕…⊕C_t,D₁⊕…⊕D_t for some t, where C_i, D_i are k_i × k_i and k_i?2(1?i?t)] if and only if [p(A, B), A]² and [p(A, B), B]² belong to the center of

for all polynomials p(x, y) in the noncommuting variables x, y. In this paper, we obtain a finite set of conditions which works. In particular we show that if A, B are positive semidefinite, then A, B are simultaneously quasidiagonalizable if (and only if) [A, B]², [A², B]² and [A, B²]² commute with A, B.     

Graph decompositions without isolated vertices III

Let G be a graph of order n, and n = Σ^k_i=1 a_i be a partition of n with a_i ≥ 2. In this article we show that if the minimum degree of G is at least 3k−2, then for any distinct k vertices v₁,…, v_k of G, the vertex set V(G) can be decomposed into k disjoint subsets A₁,…, A_k so that |A_i| = a_i,v_iisA_i is an element of A_i and “the subgraph induced by A_i contains no isolated vertices” for all i, 1 ≥ i ≥ k. Here, the bound on the minimum degree is sharp. © 1997 John Wiley & Sons, Inc.     

An Extension of Hall's Theorem

Let (A_i) _{i ? I} (A_i) _{i \in I} and (B_i) _{i ? I} (B_i) _ {i \in I} be two (possibly infinite) families of finite sets. Let cl(P) denote the closure of the set P : = { (A_i, B_i ): i ? I } P := \{ ({A_i}, {B_i} ): i \in I \} of the pairs with respect to the componentwise union and intersection operations. Then there exists an injective map è_{i ? I} A_i ? è_{i ? I} B_i {\displaystyle \bigcup _ {i \in I}} A_i \rightarrow {\displaystyle \bigcup _ {i \in I }} B_i such that f (A_i) í B_i f (A_i) \subseteq B_i for every i if, and only if, card (A) ￡ (A) \leq card (B) for every pair (A, B) ? cl (P) (A, B) \in cl (P) .     

Correlations of functions of normal variables

Let (X₁, X₂,…, X_k, Y₁, Y₂,…, Y_k) be multivariate normal and define a matrix C by C_ij = cov(X_i, Y_j). If (i) (X₁,…, X_k) = (Y₁,…, Y_k) and (ii) C is symmetric positive definite, then 0 < varf(X₁,…, X_k) < ∞ corr(f(X₁,…, X_k),f(Y₁,…, Y_k)) > 0. Condition (i) is necessary for the conclusion. The sufficiency of (i) and (ii) follows from an infinite-dimensional version, which can also be applied to a pair of jointly normal Brownian motions.     

Chains of Rings with Local Formal Fibers

Let (T, M) be a complete local domain containing the integers. Let p ₁ ? p ₂ ? ··· ? p _n be a chain of nonmaximal prime ideals of T such that T _{p n} is a regular local ring. We construct a chain of excellent local domains A _n  ? A _n?1 ? ··· ? A ₁ such that for each 1 ≤ i ≤ n, the completion of A _i is T, the generic formal fiber of A _i is local with maximal ideal p _i , and if I is a nonzero ideal of A _i then A _i /I is complete. We then show that if Q is a nonmaximal prime ideal of T and 1 ≤ h = ht _T Q, then there is a chain of excellent local domains B ₀ ? B ₁ ? ··· ? B _h  ? T such that for every i = 0, 1, 2,…, h we have ht(Q ∩ B _i ) = i, the completion of B _i is isomorphic to T[[X ₁, X ₂,…, X _i ]] where the X _j 's are indeterminants, and the formal fiber of Q ∩ B _i is local.     

Least squares X=±Xη* solutions to split quaternion matrix equation AXAη*=B

In the paper, the split quaternion matrix equation AXA^η*=B is considered, where the operator A^η* is the η-conjugate transpose of A, where η∈{i,j,k}. We propose some new real representations, which well exploited the special structures of the original matrices. By using this method, we obtain the necessary and sufficient conditions for AXA^η*=B to have X=±X^η* solutions and derive the general expressions of solutions when it is consistent. In addition, we also derive the general expressions of the least squares X=±X^η* solutions to it in case that this matrix equation is not consistent.     

The Grothendieck ring of varieties and piecewise isomorphisms

Let K ₀(Var _k ) be the Grothendieck ring of algebraic varieties over a field k. Let X, Y be two algebraic varieties over k which are piecewise isomorphic (i.e. X and Y admit finite partitions X ₁, ..., X _n , Y ₁, ..., Y _n into locally closed subvarieties such that X _i is isomorphic to Y _i for all i ≤ n), then [X] = [Y] in K ₀(Var _k ). Larsen and Lunts ask whether the converse is true. For characteristic zero and algebraically closed field k, we answer positively this question when dim X ≤ 1 or X is a smooth connected projective surface or if X contains only finitely many rational curves.