For a connected graph G = (V,E), a set W ⊆ V is called a Steiner set of G if every vertex of G is contained in a Steiner W-tree of G. The Steiner number s(G) of G is the minimum cardinality of its Steiner sets and any Steiner set of cardinality s(G) is a minimum Steiner set of G. For a minimum Steiner set W of G, a subset T ⊆ W is called a forcing subset for W if W is the unique minimum Steiner set containing T. A forcing subset for W of minimum cardinality is a minimum forcing subset of W. The...
For a connected graph G = (V,E), a set W ⊆ V is called a Steiner set of G if every vertex of G is contained in a Steiner W-tree of G. The Steiner number s(G) of G is the minimum cardinality of its Steiner sets and any Steiner set of cardinality s(G) is a minimum Steiner set of G. For a minimum Steiner set W of G, a subset T ⊆ W is called a forcing subset for W if W is the unique minimum Steiner set containing T. A forcing subset for W of minimum cardinality is a minimum forcing subset of W. The...
Let , . We construct Dirichlet series where for each fixed in a half plane, , as a function of , is a non-synthesizable absolutely convergent Fourier series. Because of the way the frequencies in are chosen, we are motivated to introduce a class of synthesizable absolutely convergent Fourier series which are defined in terms of idele characters. We solve the “problem of analytic continuation” in this setting by constructing pseudo-measures, determined by idele characters, when .
A space is said to be nearly pseudocompact iff is dense in . In this paper relatively realcompact sets are defined, and it is shown that a space is nearly pseudocompact iff every relatively realcompact open set is relatively compact. Other equivalences of nearly pseudocompactness are obtained and compared to some results of Blair and van Douwen.
Download Results (CSV)