Nonadditive Set Functions on a Finite Set and Linear Inequalities

A set function is a function whose domain is the power set of a set, which is assumed to be finite in this paper. We treat a possibly nonadditive set function, i.e., a set function which does not satisfy necessarily additivity, ?(A) + ?(B) = ?(A ∪ B) forA ∩ B = ∅, as an element of the linear space on the power set. Then some of the famous classes of set functions are polyhedral in that linear space, i.e., expressed by a finite number of linear inequalities. We specify the sets of the coefficients of the linear inequalities for some classes of set functions. Then we consider the following three problems: (a) the domain extension problem for nonadditive set functions, (b) the sandwich problem for nonadditive set functions, and (c) the representation problem of a binary relation by a nonadditive set function, i.e., the problem of nonadditive comparative probabilities.     

Minimum recession-compatible subsets of closed convex sets

A subset B of a closed convex set A is recession-compatible with respect to A if A can be expressed as the Minkowski sum of B and the recession cone of A. We show that if A contains no line, then there exists a recession-compatible subset of A that is minimal with respect to set inclusion. The proof only uses basic facts of convex analysis and does not depend on Zorn’s Lemma. An application of this result to the error bound theory in optimization is presented.     

On Partial Classes Containig All Monotone and Zero-Preserving Total Boolean Functions

We describe sets of partial Boolean functions being closed under the operations of superposition. For any class A of total functions we define the set ??(A) consisting of all partial classes which contain precisely the functions of A as total functions. The cardinalities of such sets ??(A) can be finite or infinite. We state some general results on ??(A). In particular, we describe all 30 closed sets of partial Boolean functions which contain all monotone and zero-preserving total Boolean functions.     

Sumsets contained in infinite sets of integers

If the positive integers are partitioned into a finite number of cells, then Hindman proved that there exists an infinite set B such that all finite, nonempty sums of distinct elements of B all belong to one cell of the partition. Erdös conjectured that if A is a set of integers with positive asymptotic density, then there exist infinite sets B and C such that B + C ? A. This conjecture is still unproved. This paper contains several results on sumsets contained in finite sets of integers. For example, if A is a set of integers of positive upper density, then for any n there exist sets B and F such that B has positive upper density, F has cardinality n, and B + F ? A.     

Finite degree: algebras in general and semigroups in particular

An algebra A has finite degree if its term functions are determined by some finite set of finitary relations on A. We study this concept for finite algebras in general and for finite semigroups in particular. For example, we show that every finite nilpotent semigroup has finite degree (more generally, every finite algebra with bounded p _n -sequence), and every finite commutative semigroup has finite degree. We give an example of a five-element unary semigroup that has infinite degree. We also give examples to show that finite degree is not preserved in general under taking subalgebras, homomorphic images, direct products or subdirect factors.     

The semilattice tensor product of projective distributive lattices

Grant A. Fraser defined the semilattice tensor productA ⊗B of distributive latticesA, B and showed that it is a distributive lattice. He proved that ifA ⊗B is projective then so areA andB, that ifA andB are finite and projective thenA ⊗B is projective, and he gave two infinite projective distributive lattices whose semilattice tensor product is not projective. We extend these results by proving that ifA andB are distributive lattices with more than one element thenA ⊗B is projective if and only if bothA andB are projective and both have a greatest element. Presented by W. Taylor.     

Low sets without subsets of higher many‐one degree

Given a reducibility ?_r, we say that an infinite set A is r‐introimmune if A is not r‐reducible to any of its subsets B with |A\B| = ∞. We consider the many‐one reducibility ?_m and we prove the existence of a low₁ m‐introimmune set in Π⁰₁ and the existence of a low₁ bi‐m‐introimmune set.     

Minimally Supported Frequency Composite Dilation Wavelets

A composite dilation wavelet is a collection of functions generating an orthonormal basis for L ²(ℝ ⁿ ) under the actions of translations from a full rank lattice and dilations by products of elements of non-commuting groups A and B. A minimally supported frequency composite dilation wavelet has generating functions whose Fourier transforms are characteristic functions of a lattice tiling set. In this paper, we study the case where A is the group of integer powers of some expanding matrix while B is a finite subgroup of the invertible n×n matrices. This paper establishes that with any finite group B together with almost any full rank lattice, one can generate a minimally supported frequency composite dilation wavelet system. The paper proceeds by demonstrating the ability to find such minimally supported frequency composite dilation wavelets with a single generator.     

Minimally Supported Frequency Composite Dilation Parseval Frame Wavelets

A composite dilation Parseval frame wavelet is a collection of functions generating a Parseval frame for L ²(ℝ ⁿ ) under the actions of translations from a full rank lattice and dilations by products of elements of groups A and B. A minimally supported frequency composite dilation Parseval frame wavelet has generating functions whose Fourier transforms are characteristic functions of sets contained in a lattice tiling set. Constructive proofs are used to establish the existence of minimally supported frequency composite dilation Parseval frame wavelets in arbitrary dimension using any finite group B, any full rank lattice, and an expanding matrix generating the group A and normalizing the group B. Moreover, every such system is derived from a Parseval frame multiresolution analysis. Multiple examples are provided including examples that capture directional information.      

SOME RAMSEY THEORY IN BOOLEAN ALGEBRA FOR COMPLEXITY CLASSES

It is known that for two given countable sets of unary relations A and B on ω there exists an infinite set H ? ω on which A and B are the same. This result can be used to generate counterexamples in expressibility theory. We examine the sharpness of this result.     

Tensor products of closed operators on Banach spaces

Let A and B be closed operators on Banach spaces X and Y. Assume that A and B have nonempty resolvent sets and that the spectra of A and B are unbounded. Let α be a uniform cross norm on X ? Y. Using the Gelfand theory and resolvent algebra techniques, a spectral mapping theorem is proven for a certain class of rational functions of A and B. The class of admissable rational functions (including polynomials) depends on the spectra of A and B. The theory is applied to the cases A ? I + I ? B and A ? B where A and B are the generators of bounded holomorphic semigroups.     

Some more primitive group rings

In this paper, we show that the group rings of several families of groups are primitive. LetA andB be two groups with 1<|A|≦|B| andB infinite. Then the main result is that ifK is a field for whichK[A ^ω] is semiprimitive, thenK[A∫B] is primitive. In addition, the field may be replaced by a subdomian in caseA is not torsion orA is not locally finite andK has characteristic 0. Certain other wreath products and free products are discussed. Partially supported by the N.S.F.     

Menger’s theorem for infinite graphs

We prove that Menger’s theorem is valid for infinite graphs, in the following strong version: let A and B be two sets of vertices in a possibly infinite digraph. Then there exist a set of disjoint A–B paths, and a set S of vertices separating A from B, such that S consists of a choice of precisely one vertex from each path in . This settles an old conjecture of Erdős.     

Affine straight lines in family of bounded closed convex sets

We prove that affine straight lineϕ _A,B(t)=(1−t)A+tB going through bounded closed convex setsA andB is not injective if and only ifA−B is symmetric andA−A,B−B are homotetic.     

Bases for sets of integers

We are interested in expressing each of a given set of non-negative integers as the sum of two members of a second set, the second set to be chosen as economically as possible.So let us call B a basis for A if to every a ∈ A there exist b, b′ ∈ B such that a = b + b′. We concern ourselves primarily with finite sets, A, since the results for infinite sets generally follow from these by the familiar process of condensation.     

Elasticity and ramification

Let A ? Bbe an extension of domains and Xbe an indeterminate over B. In this paper, we study the elasticity of atomic domains of the form A+ XB[X] where A ? Bis an integral extension. First, we study the case where A = Zand, show that, whatever B, this elasticity is infinite. Finally, we investigate the case where Ais a discrete valuation ring with quotient field Kand Bits integral closure in a finite extension of K.     

On the Cohopficity of the Direct Product of Cohopfian Groups

Suppose both A and B are cohopfian groups. Then A × B is cohopfian if A is either extremely noncommutative and torsion free, or finite Abelian, or finite simple.     

The quasi-invariance property for the Gamma kernel determinantal measure

The Gamma kernel is a projection kernel of the form (A(x)B(y)−B(x)A(y))/(x−y), where A and B are certain functions on the one-dimensional lattice expressed through Euler's Γ-function. The Gamma kernel depends on two continuous parameters; its principal minors serve as the correlation functions of a determinantal probability measure P defined on the space of infinite point configurations on the lattice. As was shown earlier [A. Borodin, G. Olshanski, Adv. Math. 194 (2005) 141–202, arXiv:math-ph/0305043], P describes the asymptotics of certain ensembles of random partitions in a limit regime.Theorem: The determinantal measure P is quasi-invariant with respect to finitary permutations of the nodes of the lattice.This result is motivated by an application to a model of infinite particle stochastic dynamics.     

Hilbert's Theorem 90 for Hopf Galois Extensions

For a faithfully flat extension A/B and a right A-module M, we give a new characterization of the set of descent data on M. Assuming that B is a simple Artinian ring and A/B is H-Galois, for a certain finite dimensional Hopf algebra H, we prove that Sweedler's noncommutative cohomology H ¹(H?, A) is trivial as a pointed set.     

Bounded tightness for weak topologies

In every Hausdorff locally convex space for which there exists a strictly finer topology than its weak topology but with the same bounded sets (like for instance, all infinite dimensional Banach spaces, the space of distributions or the space of analytic functions in an open set , etc.) there is a set A such that 0 is in the weak closure of A but 0 is not in the weak closure of any bounded subset B of A. A consequence of this is that a Banach space X is finite dimensional if, and only if, the following property [P] holds: for each set and each x in the weak closure of A there is a bounded set such that x belongs to the weak closure of B. More generally, a complete locally convex space X satisfies property [P] if, and only if, either X is finite dimensional or linearly topologically isomorphic to . Received: 11 June 2003