Complexity of Recognizing Equal Unions in Families of Sets

A family of sets has the equal union property if there exist two nonempty disjoint subfamilies having equal unions and has the full equal union property if, in addition, all sets are included. Both recognition problems are NP-complete even when restricted to families for which the cardinality of every set is at most three. Both problems can be solved in polynomial time when restricted to families having a bounded number of sets with cardinality greater than two. A corollary is that deciding if a graph has two disjoint edge covers is in P.     

Amorphe Potenzen kompakter Räume

A set is amorphous, if it is not a union of two disjoint infinite subsets. The following variants of the Tychonoff product theorem are investigated in the hierarchy of weak choice principles. TA1: An amorphous power of a compactT ₂ space is compact. TA2: An amorphous power of a compactT ₂ space which as a set is wellorderable is compact. In ZF⁰TA1 is equivalent to the assertion, that amorphous sets are finite. RT is Ramsey's theorem, that every finite colouring of the set ofn-element subsets of an infinite set has an infinite homogeneous subset and PW is Rubin's axiom, that the power set of an ordinal is wellorderable. In ZF⁰RT+PW implies TA2. Since RT+PW is compatible with the existence of infinite amorphous sets, TA2 does not imply TA1 in ZF⁰. But TA2 cannot be proved in ZF⁰ alone. As an application, we prove a theorem of Stone, using a weak wellordering axiomD ₃ (a set is wellorderable, if each of its infinite subsets is structured) together with RT.

Diese Arbeit ist Teil der Habilitationsschrift des Verfassers im Fachgebiet Mathematische Analysis an der Technischen Universität Wien.     

On some subclasses of well-covered graphs

A set of points in a graph is independent if no two points in the set are adjacent. A graph is well covered if every maximal independent set is a maximum independent set or, equivalently, if every independent set is contained in a maximum independent set. The well-covered graphs are classified by the W_n property: For a positive integer n, a graph G belongs to class W_n if ≥ n and any n disjoint independent sets are contained in n disjoint maximum independent sets. Constructions are presented that show how to build infinite families of W_n graphs containing arbitrarily large independent sets. A characterization of W_n graphs in terms of well-covered subgraphs is given, as well as bounds for the size of a maximum independent set and the minimum and maximum degrees of points in W_n graphs.     

Almost disjoint large subsets of semigroups

There are several notions of largeness in a semigroup S that originated in topological dynamics. Among these are thick, central, syndetic and piecewise syndetic. Of these, central sets are especially interesting because they are partition regular and are guaranteed to contain substantial combinatorial structure. It is known that in (N,+) any central set may be partitioned into infinitely many pairwise disjoint central sets. We extend this result to a large class of semigroups (including (N,+)) by showing that if S is a semigroup in this class which has cardinality κ then any central set can be partitioned into κ many pairwise disjoint central sets. We also show that for this same class of semigroups, if there exists a collection of μ almost disjoint subsets of any member S, then any central subset of S contains a collection of μ almost disjoint central sets. The same statement applies if “central” is replaced by “thick”; and in the case that the semigroup is left cancellative, “central” may be replaced by “piecewise syndetic”. The situation with respect to syndetic sets is much more restrictive. For example, there does not exist an uncountable collection of almost disjoint syndetic subsets of N. We investigate the extent to which syndetic sets can be split into disjoint syndetic sets.     

Reconstruction of locally finite connected graphs with at least three infinite wings

Let G be a locally finite connected graph that can be expressed as the union of a finite subgraph and p disjoint infinite subgraphs, where 3 ≦ p < ∞, but cannot be expressed as the union of a finite subgraph and p + 1 disjoint infinite subgraphs. Then G is reconstructible.     

SMOOTHNESS PROPERTIES OF REAL-VALUED FUNCTIONS BASED ON THEIR OSCILLATION

Abstract

We consider the following two selection principles for topological spaces:

Principle 1: For each sequence of dense subsets, there is a sequence of points from the space, the n-th point coming from the n-th dense set, such that this set of points is dense in the space;

Principle 2: For each sequence of dense subsets, there is a sequence of finite sets, the n-th a subset of the n-th dense set, such that the union of these finite sets is dense in the space.

We show that for separable metric space X one of these principles holds for the space C_p (X) of realvalued continuous functions equipped with the pointwise convergence topology if, and only if, a corresponding principle holds for a special family of open covers of X. An example is given to show that these equivalences do not hold in general for Tychonoff spaces. It is further shown that these two principles give characterizations for two popular cardinal numbers, and that these two principles are intimately related to an infinite game that was studied by Berner and Juhász.     

On resolvable primal spaces

A topological space is called resolvable if it is a union of two disjoint dense subsets, and is n-resolvable if it is a union of n mutually disjoint dense subsets. Clearly a resolvable space has no isolated points. If f is a selfmap on X, the sets A?X with f (A)?A are the closed sets of an Alexandroff topology called the primal topology 𝒫(f ) associated with f. We investigate resolvability for primal spaces (X, 𝒫(f)). Our main result is that an Alexandroff space is resolvable if and only if it has no isolated points. Moreover, n-resolvability and other related concepts are investigated for primal spaces.     

Effectively and Noneffectively Nowhere Simple Sets

R. Shore proved that every recursively enumerable (r. e.) set can be split into two (disjoint) nowhere simple sets. Splitting theorems play an important role in recursion theory since they provide information about the lattice ? of all r. e. sets. Nowhere simple sets were further studied by D. Miller and J. Remmel, and we generalize some of their results. We characterize r. e. sets which can be split into two (non) effectively nowhere simple sets, and r. e. sets which can be split into two r. e. non-nowhere simple sets. We show that every r. e. set is either the disjoint union of two effectively nowhere simple sets or two noneffectively nowhere simple sets. We characterize r. e. sets whose every nontrivial splitting is into nowhere simple sets, and r. e. sets whose every nontrivial splitting is into effectively nowhere simple sets. R. Shore proved that for every effectively nowhere simple set A, the lattice L* (A) is effectively isomorphic to ?*, and that there is a nowhere simple set A such that L*(A) is not effectively isomorphic to ?*. We prove that every nonzero r. e. Turing degree contains a noneffectively nowhere simple set A with the lattice L*(A) effectively isomorphic to ?*. Mathematics Subject Classification: 03D25, 03D10.     

On completely nonmeasurable unions

Assume that there is no quasi-measurable cardinal not greater than 2^ω . We show that for a c. c. c. σ -ideal 𝕀 with a Borel base of subsets of an uncountable Polish space, if 𝒜 is a point-finite family of subsets from 𝕀, then there is a subfamily of 𝒜 whose union is completely nonmeasurable, i.e. its intersection with every non-small Borel set does not belong to the σ -field generated by Borel sets and the ideal 𝕀. This result is a generalization of the Four Poles Theorem (see [1]) and a result from [3]. (© 2007 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Distributionally scrambled set and minimal set

We investigate the relation between distributional chaos and minimal sets, and discuss how to obtain various distributionally scrambled sets by using least and simplest minimal sets. We show: i) an uncountable extremal distributionally scrambled set can appear in a system with just one simple minimal set: a periodic orbit with period 2; ii) an uncountable dense invariant distributionally scrambled set can occur in a system with just two minimal sets: a fixed point and an infinite minimal set; iii) infinitely many minimal sets are necessary to generate a uniform invariant distributionally scrambled set, and an uncountable dense extremal invariant distributionally scrambled set can be constructed by using just countably infinitely many periodic orbits.     

Polynomial hulls and H￥H^\infty control for a hypoconvex constraint

We say that a subset of is hypoconvex if its complement is the union of complex hyperplanes. Let be the closed unit disk in , . We prove two conjectures of Helton and Marshall. Let be a smooth function on whose sublevel sets have compact hypoconvex fibers over . Then, with some restrictions on , if Y is the set where is less than or equal to 1, the polynomial convex hull of Y is the union of graphs of analytic vector valued functions with boundary in Y. Furthermore, we show that the infimum is attained by a unique bounded analytic f which in fact is also smooth on . We also prove that if varies smoothly with respect to a parameter, so does the unique f just found. Received: 18 December 1998 / Published online: 28 June 2000     

Groups isomorphic to all their non-trivial normal subgroups

A finite collectionP of finite sets tiles the integers iff the integers can be expressed as a disjoint union of translates of members ofP. We associate with such a tiling a doubly infinite sequence with entries fromP. The set of all such sequences is a sofic system, called a tiling system. We show that, up to powers of the shift, every shift of finite type can be realized as a tiling system. Some of this work was done at the Mathematical Sciences Research Institute (MSRI), where research is supported in part by NSF grant DMS-9701755. The first two authors thank K. Schmidt for useful conversations and ideas.     

偏序集的连通性和连通分支

本文引入了偏序集连通性的概念,给出了连通分支的构造,证明了偏序集可唯一地分解为连通分支的不交并,偏序集的连通子集是连通分支当且仅当它是分支并。     

Polynomial recognition of equal unions in hypergraphs with few vertices of large degree

A family of nonempty sets has the equal union property if there exist two nonempty disjoint subfamilies having equal unions. If every point belongs to the unions, then we say the family has the full equal union property. Recognition of both properties is NP-complete even when restricted to families for which the degree of every point is at most three. In this paper we show that both recognition problems can be solved in polynomial time for families in which there is a bound on the number of points whose degree exceeds two.     

A note on equal unions in families of sets

A family of sets has the equal union property if and only if there exist two nonempty disjoint subfamilies having the same union. We prove that any n nonempty subsets of an n-element set have the equal union property if the sum of their cardinalities exceeds n(n+1)/2. This bound is tight. Among families in which the sum of the cardinalities equals n(n+1)/2, we characterize those having the equal union property.     

A dedekind finite borel set

In this paper we prove three theorems about the theory of Borel sets in models of ZF without any form of the axiom of choice. We prove that if ${B\subseteq 2^\omega}$ is a G _??? -set then either B is countable or B contains a perfect subset. Second, we prove that if 2 ^?? is the countable union of countable sets, then there exists an F _??? set ${C\subseteq 2^\omega}$ such that C is uncountable but contains no perfect subset. Finally, we construct a model of ZF in which we have an infinite Dedekind finite ${D\subseteq 2^\omega}$ which is F _??? .     

On the Boolean algebras of definable sets in weakly o‐minimal theories

We consider the sets definable in the countable models of a weakly o‐minimal theory T of totally ordered structures. We investigate under which conditions their Boolean algebras are isomorphic (hence T is p‐ω‐categorical), in other words when each of these definable sets admits, if infinite, an infinite coinfinite definable subset. We show that this is true if and only if T has no infinite definable discrete (convex) subset. We examine the same problem among arbitrary theories of mere linear orders. Finally we prove that, within expansions of Boolean lattices, every weakly o‐minimal theory is p‐ω‐categorical. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Some remarks on a question of D. H. Fremlin regarding ε-density

We show the relative consistency of ℵ₁ satisfying a combinatorial property considered by David Fremlin (in the question DU from his list) in certain choiceless inner models. This is demonstrated by first proving the property is true for Ramsey cardinals. In contrast, we show that in ZFC, no cardinal of uncountable cofinality can satisfy a similar, stronger property. The questions considered by D. H. Fremlin are if families of finite subsets of ω₁ satisfying a certain density condition necessarily contain all finite subsets of an infinite subset of ω₁, and specifically if this and a stronger property hold under MA + ?CH. Towards this we show that if MA + ?CH holds, then for every family ? of ℵ₁ many infinite subsets of ω₁, one can find a family ? of finite subsets of ω₁ which is dense in Fremlins sense, and does not contain all finite subsets of any set in ?. We then pose some open problems related to the question. Received: 2 June 1999 / Revised version: 2 February 2000 / Published online: 18 July 2001     

On tree‐decompositions of one‐ended graphs

A graph is one‐ended if it contains a ray (a one way infinite path) and whenever we remove a finite number of vertices from the graph then what remains has only one component which contains rays. A vertex v dominates a ray in the end if there are infinitely many paths connecting v to the ray such that any two of these paths have only the vertex v in common. We prove that if a one‐ended graph contains no ray which is dominated by a vertex and no infinite family of pairwise disjoint rays, then it has a tree‐decomposition such that the decomposition tree is one‐ended and the tree‐decomposition is invariant under the group of automorphisms. This can be applied to prove a conjecture of Halin from 2000 that the automorphism group of such a graph cannot be countably infinite and solves a recent problem of Boutin and Imrich. Furthermore, it implies that every transitive one‐ended graph contains an infinite family of pairwise disjoint rays.     

Antichain cutsets

A subset A of an ordered set P is a cutset if each maximal chain of P meets A; if, in addition, A is an antichain call it an antichain cutset. Our principal result is a characterization, by means of a forbidden configuration, of those finite ordered sets, which can be expressed as the union of antichain cutsets.