There is no compactification theorem for the small inductive dimension

We give an example of a perfectly normal first countable space X¹ with ind X¹ = 1 such that if Z is a Lindelöf space containing X¹. then ind Z=dim Z=∞. Under CH, there is a perfectly normal, hereditarily separable and first countable such space.     

There is no plus-capping degree

Summary Answering a question of Per Lindström, we show that there is no plus-capping degree, i.e. that for any incomplete r.e. degreew, there is an incomplete r.e. degreea>w such that there is no r.e. degreev>w withav=w.Mathematics subject classification: 03D30The authors would like to thank Per Lindström for raising the question and Carl Jockusch for communicating it to them. The first author was partially supported by a U.S./New Zealand binational grant. The second author was partially supported by NSF grant DMS-9100114 and the U.S./New Zealand binational NSF grant INT-9020558     

There is no fat orbit

We give a proof of a theorem of Harrington that there is no orbit of the lattice of recursively enumerable sets containing elements of each nonzero recursively enumerable degree. We also establish some degree theoretical extensions.     

There is no universal countable pentagon-free graph

No countable C_n-free graph contains every countable C_n-free graph as a subgraph, for n ≧ 4. For n = 4, this was proved earlier by J. Pach.     

A bilinear version of Orlicz-Pettis theorem

Given three Banach spaces X, Y and Z and a bounded bilinear map , a sequence x=n(xn)⊆X is called B-absolutely summable if is finite for any y∈Y. Connections of this space with are presented. A sequence x=n(xn)⊆X is called B-unconditionally summable if is finite for any y∈Y and z^∗∈Z^∗ and for any M⊆N there exists xM∈X for which _∑n∈M〈B(xn,y),z^∗〉=〈B(xM,y),z^∗〉 for all y∈Y and z^∗∈Z^∗. A bilinear version of Orlicz-Pettis theorem is given in this setting and some applications are presented.     

There is no fast method for finding monochromatic complete subgraphs

A general theorem on the complexity of a class of recognition problems is proved. As a particular case the following result is given: There is no algorithm which, for any 2-coloration of the infinite complete graph, can produce a monochromatic subgraph of k vertices within $\text{2}{}^{\mathrm{<mtext>k</mtext><mtext>2</mtext>}}$ steps (at each step the color of an arbitrary edge is questioned).     

A Quantitative Version of the Bishop–Phelps Theorem for Operators in Hilbert Spaces

In this paper, with the help of spectral integral, we show a quantitative version of the Bishop-Phelps theorem for operators in complex Hilbert spaces. Precisely, let H be a complex Hilbert space and 0 ε 1/2. Then for every bounded linear operator T : H → H and x0 ∈ H with ||T|| = 1 = ||x0|| such that ||Tx0|| 1 ε, there exist xε∈ H and a bounded linear operator S : H → H with||S|| = 1 = ||xε|| such that ||Sxε|| = 1, ||xε-x0|| ≤ (2ε)1/2 + 4(2ε)1/2, ||S-T|| ≤(2ε)1/2.     

There is no degree map for 0-cycles on Artin stacks

We show that there is no way to define degrees of 0-cycles on Artin stacks with proper good moduli spaces so that (1) the degree of an ordinary point is non-zero, and (1) degrees are compatible with closed immersions.     

A dominated ergodic theorem for some bilinear averages

Let T be a positive invertible linear operator with positive inverse on some Lp(μ), 1?p<∞, where μ is a σ-finite measure. We study the convergence in the Lp(μ)-norm and the almost everywhere convergence of the bilinear operators

     

There is no upper bound of small transfinite compactness degree in metrizable spaces

In [J.M. Aarts, T. Nishiura, Dimension and Extensions, North-Holland, Amsterdam, 1993], Aarts and Nishiura investigated several types of dimensions modulo a class P of spaces. These dimension functions have natural transfinite extensions. The small transfinite compactness degree trcmp is such transfinite dimension function extending the small compactness degree cmp. We shall prove that there is no upper bound for trcmp in the class of metrizable spaces, i.e. for each ordinal number α there exists a metrizable space Xα such that trcmpXα=α. We also give a characterization of the dimension dim of a separable (compact) metrizable space in terms of the function cmp of the product of this space with a nowhere locally compact zero-dimensional factor.     

There is no (46, 6, 1) block design*

Abstact: In this paper we show that a (46, 6, 1) design does not exist. This result was obtained by a computer search. In the incidence matrix of such a design, there must exist a “c4” configuration—6 rows and 4 columns, in which each pair of columns intersect exactly once, in distinct rows. There can also exist a “c5” configuration with 10 rows and 5 columns, in which each pair of columns intersect exactly once, in distinct rows. Thus the search for (46, 6, 1) designs can be subdivided into two cases, the first of which assumes there is no “c5”, and the second of which assumes there is a “c5”. After completing the searches for both cases, we found no (46, 6, 1) design. © 2000 John Wiley & Sons, Inc. J Combin Designs 9: 60–71, 2001     

There exist no Ramanujan congruences mod 6912

Let τ(n) be Ramanujan's function, $$x\prod _{m = 1}^\infty (1 - x^m )^{24} = \sum\nolimits_{n = 1}^\infty {\tau (n)x^n .} $$ In this paper it is shown that the Ramanujan congruence τ(n)=σ_d/nd¹¹ mod 691 cannot be improved mod 691². The following result is proved: for arbitrary r, s mod 691 the set of primes such that p ≡ r mod 691,τ (p) ≡ p¹¹+1+691 · s mod 691² has positive density.     

There is no ordering on the classes in the generalized high/low hierarchies

We prove that the existential theory of the Turing degrees, in the language with Turing reduction, 0, and unary relations for the classes in the generalized high/low hierarchy, is decidable. We also show that every finite poset labeled with elements of (where is the partition of induced by the generalized high/low hierarchy) can be embedded in preserving the labels. Note that no condition is imposed on the labels.     

There are no small odd perfect numbers

We prove that every odd perfect number N has at least 420 distinct prime divisors, and that N is greater than 1,9 × 10²⁵⁵⁰.     

A counterexample to the closed graph theorem for bilinear maps

The closed graph theorem allows one to assert that if a bounded transformation has an inverse, the inverse is bounded. The corresponding statement for bilinear maps is shown to be false, at least in the category of general Banach spaces. This problem arose in connection with the problem of writing every function in H¹ of the polydisc as a product of functions in H². The method of proof involves a covering of the unit sphere by neighborhoods which are products but in which the bounds involved in these products tend to infinity.     

On a multivariate central limit theorem for stationary bilinear processes

In 1957, Parzen proved a central limit theorem for a class of scalar processes which he called multilinear processes. In the present paper only stationary bilinear processes are considered, but the theory is generalized to the multivariate case.