Compactness and the axiom of choice

In the absence of the axiom of choice four versions of compactness (A-, B-, C-, and D-compactness) are investigated. Typical results:

1. C-compact spaces form the epireflective hull in Haus of A-compact completely regular spaces.
2. Equivalent are:
3. the axiom of choice,
4. A-compactness = D-compactness,
5. B-compactness = D-compactness,
6. C-compactness = D-compactness and complete regularity,
7. products of spaces with finite topologies are A-compact,
8. products of A-compact spaces are A-compact,
9. products of D-compact spaces are D-compact,
10. powers X ^k of 2-point discrete spaces are D-compact,
11. finite products of D-compact spaces are D-compact,
12. finite coproducts of D-compact spaces are D-compact,
13. D-compact Hausdorff spaces form an epireflective subcategory of Haus,
14. spaces with finite topologies are D-compact.

1. Equivalent are:
2. the Boolean prime ideal theorem,
3. A-compactness = B-compactness,
4. A-compactness and complete regularity = C-compactness,
5. products of spaces with finite underlying sets are A-compact,
6. products of A-compact Hausdorff spaces are A-compact,
7. powers X ^k of 2-point discrete spaces are A-compact,
8. A-compact Hausdorff spaces form an epireflective subcategory of Haus.

1. Equivalent are:
2. either the axiom of choice holds or every ultrafilter is fixed,
3. products of B-compact spaces are B-compact.

1. Equivalent are:
2. Dedekind-finite sets are finite,
3. every set carries some D-compact Hausdorff topology,
4. every T ₁-space has a T ₁-D-compactification,
5. Alexandroff-compactifications of discrete spaces and D-compact.

     

Coherence classes of ideals of normal lattices with applications to C(X)

Given a topological space X, Jenkins and McKnight have shown how ideals of the ring C(X) are partitioned into equivalence classes — called coherence classes — defined by declaring ideals to be equivalent if their pure parts are identical. In this paper we consider a similar partitioning of the lattice of ideals of a normal bounded distributive lattice. We then apply results obtained herein to augment some of those of Jenkins and McKnight. In particular, for Tychonoff spaces, new results include the following:

1. all members of any coherence class have the same annihilator
2. every ideal is alone in its coherence class if and only if the space is a P-space.

     

Regular principal factors in free objects in varieties in the interval [B 2 ,NB 2 ∨G n ]

The author has shown previously how to associate a completely 0-simple semigroup with a connected bipartite graph containing labelled edges and how to describe the regular principal factors in the free objects in the Rees-Sushkevich varieties RS _n generated by all completely 0-simple semigroups over groups from the Burnside variety G _n of groups of exponent dividing a positive integer n by employing this graphical construction. Here we consider the analogous problem for varieties containing the variety B ₂ , generated by the five element Brandt semigroup B ₂, and contained in the variety NB ₂ ∨G _n where NB ₂ is the variety generated by all left and right zero semigroups together with B ₂. The interval [NB ₂ ,NB ₂ ∨G _n ] is of particular interest as it is an important interval, consisting entirely of varieties generated by completely 0-simple semigroups, in the lattice of subvarieties of RS _n .     

Über Deformationen von analytischen Abbildungskeimen

The notion of deformations of germs of k-analytic mappings generalizes the one of deformations of germs of k-analytic spaces. Using algebraic terms, we prove:

1. The morphism f: A→B of analytic algebras is rigid, iff it is infinitesimally rigid. Moreover, this is equivalent to Ex_A (B,B)=0. This theorem generalizes a result of SCHUSTER [11].
2. Let A be a regular analytic algebra. Then f is rigid iff there exists a rigid analytic algebra B_o such that f is equivalent to the canonic injection A→A?B_o.
3. If f is “almost everywhere” rigid or smooth, then the injection Ext _B ^l (Ω_B|A, Bⁿ)→Ex_A(B, Bⁿ) is an isomorphism.

     

Δ2 degrees without Σ1 induction

In this paper, we study the structure of Turing degrees below 0′ in the theory that is a fragment of Peano arithmetic without Σ₁ induction, with special focus on proper d-r.e. degrees and non-r.e. degrees. We prove:

1. P ^? + BΣ₁ + Exp ? There is a proper d-r.e. degree.
2. P ^? +BΣ₁+ Exp ? IΣ₁ ? There is a proper d-r.e. degree below 0′.
3. P ^? + BΣ₁ + Exp ? There is a non-r.e. degree below 0′.

     

A compactness criterion for translation invariant Banach spaces of functions

Установлено, что для и нвариантных относит ельно сдвига банаховых про странствВ (классов) измеримых фу нкций на локально ком пактной группе, удовлетворяю щих некоторым дополнительным усло виям, справедлив след ующий критерий компактнос ти. Замкнутое подмножествоМ?В яв ляется компактным вВ тогда и только тогда, к огда оно удовлетворя ет условиям:

1. М ограничено вВ;
2. для каждого ?>0 сущест вуетkε?(G) такое, что ∥k*f-f∥_BfεМ;
3. для каждого ?0 существ уетh??(G) такое, что ∥hf - f ∥_BfεМ.

     

Algorithms for the vector maximization problem

We consider a convex setB inR ⁿ described as the intersection of halfspacesa _i ^T x ≦b _i (i ∈ I) and a set of linear objective functionsf _j =c _j ^T x (j ∈ J). The index setsI andJ are allowed to be infinite in one of the algorithms. We give the definition of theefficient points ofB (also called functionally efficient or Pareto optimal points) and present the mathematical theory which is needed in the algorithms. In the last section of the paper, we present algorithms that solve the following problems:

1. To decide if a given point inB is efficient.
2. To find an efficient point inB.
3. To decide if a given efficient point is the only one that exists, and if not, find other ones.
4. The solutions of the above problems do not depend on the absolute magnitudes of thec _j. They only describe the relative importance of the different activitiesx _i. Therefore we also consider $$\begin{gathered} \max G^T x \hfill \\ x efficient \hfill \\ \end{gathered} $$ for some vectorG.

     

On the limit superior of sequences of sets

qVЕРхНИИ пРЕДЕл пОслЕД ОВАтЕльНОстИ МНОжЕс тВA _n ОпРЕДЕльЕтсь сООтНО шЕНИЕМ \(\mathop {\lim sup}\limits_{n \to \infty } A_n = \mathop \cap \limits_{k = 1}^\infty \mathop \cup \limits_{n = k}^\infty A_n . B\) стАтьЕ РАссМАтРИВА Етсь слЕДУУЩИИ ВОпРО с: ЧтО МОжНО скАжАть О ВЕРхНИх пРЕДЕлАх \(\mathop {\lim sup}\limits_{k \to \infty } A_{n_k }\) , еслИ ИжВЕстНО, ЧтО пРЕсЕЧЕНИь \(\mathop \cap \limits_{k = 1}^\infty A_{n_k }\) «МАлы» Дль кАж-ДОИ пОДпОслЕДОВАтЕльНОстИ \((A_{n_k } )\) ? ДОкАжыВАЕтсь, Ч тО

1. ЕслИ \(\mathop \cap \limits_{k = 1}^\infty A_{n_k }\) — кОНЕЧНОЕ МНО жЕстВО Дль кАжДОИ пОДпОслЕДОВАтЕльНОстИ \((A_{n_k } )\) , тО НАИДЕтсь тАкАь пОДпО слЕДОВАтЕльНОсть, Дл ь кОтОРОИ МНОжЕстВО \(\mathop {\lim sup}\limits_{k \to \infty } A_{n_k }\) сЧЕтНО;
2. ЕслИ \(2^{\aleph _0 } = \aleph _1\) , тО сУЩЕстВУЕ т тАкАь пОслЕДОВАтЕл ьНОсть (A_n), ЧтО \(\mathop \cap \limits_{k = 1}^\infty A_{n_k }\) — сЧЕтНОЕ МНОжЕстВО Дль лУБОИ п ОДпОслЕДОВАтЕльНОстИ \((A_{n_k } )\) , НО \(\mathop {\lim sup}\limits_{k \to \infty } A_{n_k }\) ИМЕЕт МОЩ-НОсть кОНтИНУУМА;
3. ЕслИA _n — БОРЕлЕ ВскИЕ МНОжЕстВА В НЕкОтОРО М пОлНОМ сЕпАРАБЕльНО М МЕтРИЧЕскОМ пРОстРАНстВЕ, И \(\mathop \cap \limits_{k = 1}^\infty A_{n_k }\) — сЧЕт НОЕ МНОжЕстВО Дль кАж ДОИ пОДпОслЕДОВАтЕльНОстИ \((A_{n_k } )\) , тО сУЩЕстВУЕт тАкАь п ОДпОслЕДОВАтЕльНОсть, ЧтО \(\mathop {\lim sup}\limits_{k \to \infty } A_{n_k }\) — сЧЕтНОЕ МНОжЕстВО. кРОМЕ тОгО, ДОкАжАНО, Ч тО В слУЧАьх А) И В) В пОслЕДОВАтЕльНОстИ (A _n ) сУЩЕстВУЕт схОДьЩА ьсь пОДпОслЕДОВАтЕльНО сть.

кРОМЕ тОгО, ДОкАжАНО, Ч тО В слУЧАьх А) И В) В пОслЕДОВАтЕльНОстИ (А _n ) сУЩЕстВУЕт схОДьЩ Аьсь пОДпОслЕДОВАтЕльНО сть.     

Flat modules and rings finitely generated as modules over their center

A module is called distributive (is said to be a chain module) if the lattice of all its submodules is distributive (is a chain). Let a ringA be a finitely generated module over its unitary central subringR. We prove the equivalence of the following conditions:

1. A is a right or left distributive semiprime ring;
2. for any maximal idealM of a subringR central inA, the ring of quotientsA _M is a finite direct product of semihereditary Bézout domains whose quotient rings by the Jacobson radicals are finite direct products of skew fields;
3. all right ideals and all left ideals of the ringA are flat (right and left) modules over the ringA, andA is a distributive ring, without nonzero nilpotent elements, all of whose quotient rings by prime ideals are semihereditary orders in skew fields.

     

Fixed point theory and product,sub-, super-spaces

In this paper, we definen-segmentwise metric spaces and then we prove the following results:

1. (i)|Let (X, d) be ann-segmentwise metric space. ThenX ⁿ has the fixed point property with respect to uniformly continuous bounded functions if and only if, for any continuous functionF: C ^*(X) → C^*(X) and for anyn-tuple of distinct points x₁, x₂, ?, x_n ∈X, there exists anh ∈C ^*(X) such that $$F(h)(x_1 ) = h(x_1 ),i = 1,2,...,n;$$ whereC ^*(X) has either the uniform topology or the subspace product (Tychonoff) topology \((C^ * (X) \subseteq X^X )\) .
2. LetX _i (i = 1, 2, ?) be countably compact Hausdorff spaces such thatX ₁ × ? × X_n has the fixed point property for alln ∈N Then the product spaceX ₁ × X₂ × ? has the fixed point property. We shall also discuss several problems in the Fixed Point Theory and give examples if necessary. Among these examples, we have:
3. There exists a connected metric spaceX which can be decomposed as a disjoint union of a closed setA and an open setB such thatA andB have the fixed point property andX does not have.
4. There exists a locally compact metrizable spaceX which has the fixed point property but its one-point compactificationX ⁺ does not have the fixed point property.

Other relevant results and examples will be presented in this paper.     

Group inverse for a class of 2×2 anti-triangular block matrices over skew fields

Suppose K is a skew field. Let K ^m×n denote the set of all m×n matrices over K. In this paper, we give necessary and sufficient conditions for the existence and explicit representations of the group inverses of the block matrices in the following three cases, respectively:

1. $\mathrm{rank}(S)=\mathrm{rank}(B^{\pi}A)$ ;
2. $\mathrm{rank}(S)=\mathrm{rank}(AB^{\pi})$ ;
3. $\mathrm{rank}(S)=\mathrm{rank}(B^{\pi}A)=\mathrm{rank}(AB^{\pi})$ ,

where A,B,C??K ^n×n , B ^# exists, R(B)=R(C), N(B)=N(C) and S=B ^?? AB ^?? . The paper??s conclusions generalized some related results of Zhao and Bu (Electron. J. Linear Algebra 21:63?C75, 2010).     

On the number of non-isomorphic subgraphs

Let $\mathcal{K}$ be the family of graphs on ω₁ without cliques or independent subsets of sizew ₁. We prove that

1. it is consistent with CH that everyGε $\mathcal{K}$ has 2^ω many pairwise non-isomorphic subgraphs,
2. the following proposition holds in L: (*)there is a Gε $\mathcal{K}$ such that for each partition (A, B) of ω₁ either G?G[A] orG?G[B],
3. the failure of (*) is consistent with ZFC.

     

On the exactness of certain inequalities in approximation theory

We prove the following: for every sequence {F_v}, F_v ? 0, F_v > 0 there exists a functionf such that

1. E_n(f)?F_n (n=0, 1, 2, ...) and
2. A_kn^?k? _v=1 ⁿ v^k?1 F_v?1?Ω_k (f, n^?1) (n=1, 2, ...).

     

О рядах по системе Фра нклина

In this paper some basis properties are proved for the series with respect to the Franklin system, which are analogous to those of the series with respect to the Haar system. In particular, the following statements hold:

1. The Franklin series \(\mathop \Sigma \limits_{n = 0}^\infty a_n f_n (x)\) converges a.e. onE if and only if \(\mathop \Sigma \limits_{n = 0}^\infty a_n^2 f_n^2 (x)< + \infty \) a.e. onE;
2. If the series \(\mathop \Sigma \limits_{n = 0}^\infty a_n f_n (x)\) , with coefficients ¦a _n ¦↓0, converges on a set of positive measure, then it is the Fourier-Franklin series of some function from \(\bigcap\limits_{p< \infty } {L_p } \) ;
3. The absolute convergence at a point for Fourier—Franklin series is a local property;
4. If an integrable function (fx) has a discontinuity of the first kind atx=x ₀, then its Fourier-Franklin series diverges atx=x ₀.

     

Analytische Fortsetzbarkeit von zufälligen Potenzreihen bezüglich abhängiger Zufallsvariabler

Рассматриваются слу чайная величина \(\mathfrak{X} = (X_n (\omega ))\) , удовлетворяющая усл овиюE(X _n ⁴ )≦M, и соответствующ ий случайный степенн ой ряд \(f_x (z;\omega ) = \mathop \sum \limits_{n = 0}^\infty a_n X_n (\omega )z^n\) . Устанавливаются тео ремы непродолжимост и почти наверное:

1. дляf _x при условиях с лабой мультипликати вности на \(\mathfrak{X}\) ,
2. для \(f_{\tilde x}\) , где \(\mathop \mathfrak{X}\limits^ \sim = (\mathop X\limits^ \sim _n )\) есть подп оследовательность в \(\mathfrak{X}\) ,
3. для по крайней мере од ного из рядовf _x′ илиf _x″ , где \(\mathfrak{X}'\) и \(\mathfrak{X}''\) — некоторые п ерестановки \(\mathfrak{X}\) , выбираемые универс ально, т. е. независимо от коэффициентовa _n .

     

On projective planes admitting elations and homologies

We consider projective planes Π of ordern with abelian collineation group Γ of ordern(n?1) which is generated by (A, m)-elations and (B, l)-homologies wherem =AB andA εl. We prove

1. Ifn is even thenn=2^e and the Sylow 2-subgroup of Γ is elementary abelian.
2. Ifn is odd then the Sylow 2-subgroup of Γ is cyclic.
3. Ifn is a prime then Π is Desarguesian.
4. Ifn is not a square thenn is a prime power.

     

On an Ulam's problem

The existence and the uniqueness (with respect to a filtration-equivalence) of a vector flowX on ? ⁿ ,n≥3, such that:

1. X has not any stationary points on ? ⁿ ;
2. all orbits ofX are bounded;
3. there exists a filtration forX are proved in the present note.

     

Solving matching problems with linear programming

In this paper we describe an implementation of a cutting plane algorithm for the perfect matching problem which is based on the simplex method. The algorithm has the following features:

-It works on very sparse subgraphs ofK _n which are determined heuristically, global optimality is checked using the reduced cost criterion.

-Cutting plane recognition is usually accomplished by heuristics. Only if these fail, the Padberg-Rao procedure is invoked to guarantee finite convergence.

Our computational study shows that—on the average—very few variables and very few cutting planes suffice to find a globally optimal solution. We could solve this way matching problems on complete graphs with up to 1000 nodes. Moreover, it turned out that our cutting plane algorithm is competitive with the fast combinatorial matching algorithms known to date.     

Identities for Bernoulli polynomials and Bernoulli numbers

We prove that if m and \({\nu}\) are integers with \({0 \leq \nu \leq m}\) and x is a real number, then

1. $$\sum_{k=0 \atop k+m \, \, odd}^{m-1} {m \choose k}{k+m \choose \nu} B_{k+m-\nu}(x) = \frac{1}{2} \sum_{j=0}^m (-1)^{j+m} {m \choose j}{j+m-1 \choose \nu} (j+m) x^{j+m-\nu-1},$$ where B _n (x) denotes the Bernoulli polynomial of degree n. An application of (1) leads to new identities for Bernoulli numbers B _n . Among others, we obtain
2. $$\sum_{k=0 \atop k+m \, \, odd}^{m -1} {m \choose k}{k+m \choose \nu} {k+m-\nu \choose j}B_{k+m-\nu-j} =0 \quad{(0 \leq j \leq m-2-\nu)}. $$ This formula extends two results obtained by Kaneko and Chen-Sun, who proved (2) for the special cases j = 1, \({\nu=0}\) and j = 3, \({\nu=0}\) , respectively.