A tall space with a small bottom

We introduce a general method of constructing locally compact scattered spaces from certain families of sets and then, with the help of this method, we prove that if , then there is such a space of height with only many isolated points. This implies that there is a locally compact scattered space of height with isolated points in ZFC, solving an old problem of the first author.

     

Lattice tensor products. III - Congruences

G. Grätzer and F. Wehrung introduced the lattice tensor product, A?B, of the lattices Aand B. In Part I of this paper, we showed that for any finite lattice A, we can "coordinatize" A?B, that is, represent A?,B as a subset A of B ^A, and provide an effective criteria to recognize the A-tuples of elements of B that occur in this representation. To show the utility of this coordinatization, we prove, for a finite lattice A and a bounded lattice B, the isomorphism Con A ≌ (Con A)B>, which is a special case of a recent result of G. Grätzer and F. Wehrung and a generalization of a 1981 result of G. Grätzer, H. Lakser, and R.W. Quackenbush.     

First Alexandroff Decomposition Theorem for Topological Lattice Group Valued Measures

Let (X, F) be an Alexandroff space, let A(F) be the Boolean subalgebra of 2 ^X generated by F, let G be a Hausdorff commutative topological lattice group and let rba_F(A(F), G) denote the set of all order bounded F-inner regular finitely additive set functions from A(F) into G. Using some special properties of the elements of rba_F(A(F), G), we extend to this setting the first decomposition theorem of Alexandroff.     

Sub-semigroups determined by the zero-divisor graph

In this paper we study sub-semigroups of a finite or an infinite zero-divisor semigroup S determined by properties of the zero-divisor graph Γ(S). We use these sub-semigroups to study the correspondence between zero-divisor semigroups and zero-divisor graphs. In particular, we discover a class of sub-semigroups of reduced semigroups and we study properties of sub-semigroups of finite or infinite semilattices with the least element. As an application, we provide a characterization of the graphs which are zero-divisor graphs of Boolean rings. We also study how local property of Γ(S) affects global property of the semigroup S, and we discover some interesting applications. In particular, we find that no finite or infinite two-star graph has a corresponding nil semigroup.     

An improvement on the complexity of factoring read-once Boolean functions

Read-once functions have gained recent, renewed interest in the fields of theory and algorithms of Boolean functions, computational learning theory and logic design and verification. In an earlier paper [M.C. Golumbic, A. Mintz, U. Rotics, Factoring and recognition of read-once functions using cographs and normality, and the readability of functions associated with partial k-trees, Discrete Appl. Math. 154 (2006) 1465-1677], we presented the first polynomial-time algorithm for recognizing and factoring read-once functions, based on a classical characterization theorem of Gurvich which states that a positive Boolean function is read-once if and only if it is normal and its co-occurrence graph is P₄-free.In this note, we improve the complexity bound by showing that the method can be modified slightly, with two crucial observations, to obtain an O(n|f|) implementation, where |f| denotes the length of the DNF expression of a positive Boolean function f, and n is the number of variables in f. The previously stated bound was O(n²k), where k is the number of prime implicants of the function. In both cases, f is assumed to be given as a DNF formula consisting entirely of the prime implicants of the function.     

Generalizations of ?wierczkowski’s lemma and the arity gap of finite functions

?wierczkowski’s lemma-as it is usually formulated-asserts that if f:Aⁿ→A is an operation on a finite set A, n≥4, and every operation obtained from f by identifying a pair of variables is a projection, then f is a semiprojection. We generalize this lemma in various ways. First, it is extended to B-valued functions on A instead of operations on A and to essentially at most unary functions instead of projections. Then we characterize the arity gap of functions of small arities in terms of quasi-arity, which in turn provides a further generalization of ?wierczkowski’s lemma. Moreover, we explicitly classify all pseudo-Boolean functions according to their arity gap. Finally, we present a general characterization of the arity gaps of B-valued functions on arbitrary finite sets A.     

Dimension of complete simple games with minimum

Weighted majority games have the property that players are totally ordered by the desirability relation (introduced by Isbell in [J.R. Isbell, A class of majority games, Quarterly Journal of Mathematics, 7 (1956) 183–187]) because weights induce it. Games for which this relation is total are called complete simple games. Taylor and Zwicker proved in [A.D. Taylor, W.S. Zwicker, Weighted voting, multicameral representation, and power, Games and Economic Behavior 5 (1993) 170–181] that every simple game (or monotonic finite hypergraph) can be represented by an intersection of weighted majority games and consider the dimension of a game as the needed minimum number of them to get it. They provide the existence of non-complete simple games of every dimension and left open the problem for complete simple games.     

Inclusion–exclusion principle for belief functions

The inclusion–exclusion principle is a well-known property in probability theory, and is instrumental in some computational problems such as the evaluation of system reliability or the calculation of the probability of a Boolean formula in diagnosis. However, in the setting of uncertainty theories more general than probability theory, this principle no longer holds in general. It is therefore useful to know for which families of events it continues to hold. This paper investigates this question in the setting of belief functions. After exhibiting original sufficient and necessary conditions for the principle to hold, we illustrate its use on the uncertainty analysis of Boolean and non-Boolean systems in reliability.     

线性函数的性质及其应用 线性函数的性质及其应用

给出了线性函数、部分线性函数和线性变量的定义,提出了它们的性质.根据上述定义,利用布尔代数中的基本定理和公式以及自双反函数和对称函数的定义对这些性质给出了证明.最后讨论了它们在逻辑综合以及计算逻辑函数的布尔差分中的应用.     

逻辑函数在布尔减、布尔除、非代数系统中的规范展开式

证明了布尔减与非运算、布尔除与非运算均构成完备集，并根据布尔除、布尔减的运算规则和性质，从最小项、最大项展开式出发，推导了任意逻辑函数在这两个完备集中的规范展开式。得到的展开式形式简单，容易记忆，与函数在与、或、非代数系统中的规范展开式之间的转换非常便捷。本文的工作对进一步完善布尔代数的四则运算理论具有一定的意义。