Related papers: Variations of Independence in Boolean Algebras

We construct a complex entire function with arbitrary number of variables which has the following property: The infinite set consisting of all the values of all its partial derivatives of any orders at all algebraic points, including zero…

We introduce a notion of non-commutative joint independence for multiple algebras in a non-commutative probability space. The pairwise relationships between these algebras are encoded by a graph with two edge sets -- a combinatorial…

Let $G = (V,E)$ be a graph and $k \ge 0$ an integer. A $k$-independent set $S \subseteq V$ is a set of vertices such that the maximum degree in the graph induced by $S$ is at most $k$. With $\alpha_k(G)$ we denote the maximum cardinality of…

Let "ex" be the cardinality of the smallest independent family of subsets of omega (independent means that all nontrivial Boolean combinations are infinite) which cannot be extended to a homogeneous independent family. "Homogeneous" means…

We give another proof that for every lambda >= beth_omega for every large enough regular kappa < beth_omega we have lambda^{[kappa]}= lambda, dealing with sufficient conditions for replacing beth_omega by aleph_omega. In section 2 we show…

We prove that for any superatomic Boolean Algebra of cardinality >beth_omega there is an automorphism moving uncountably many atoms. Similarly for larger cardinals. Any of those results are essentially best possible.

In this note we develop and clarify some of the basic combinatorial properties of the new notion of $n$-dependence (for $1\leq n < \omega$) recently introduced by Shelah. In the same way as dependence of a theory means its inability to…

Unlike classical and free independence, the boolean and monotone notions of independence lack of the property of independent constants. In the scalar case, this leads to restrictions for the central limit theorems, as observed by F.…

The present paper introduces a modified version of cyclic-monotone independence which originally arose in the context of random matrices, and also introduces its natural analogy called cyclic-Boolean independence. We investigate formulas…

In an earlier work, the author observed that Boolean inverse semi-groups, with semigroup homomorphisms preserving finite orthogonal joins, form a congruence-permutable variety of algebras, called biases. We give a full description of…

The independence polynomial of a graph is the generating polynomial for the number of independent sets of each cardinality and its roots are called independence roots. We investigate here purely imaginary independence roots. We show that…

We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…

We develop a theory of boundary functions for ideals in trivially analytic subalgebras of simple AF C*-algebras with an injective 0-cocycle, a class which includes all full nest algebras. Boundary functions are maps from the spectrum of the…

This is a survey of recent progress in several areas of combinatorial algebra. We consider combinatorial problems about free groups, polynomial algebras, free associative and Lie algebras. Our main idea is to study automorphisms and, more…

We consider numbers and sizes of independent sets in graphs with minimum degree at least $d$, when the number $n$ of vertices is large. In particular we investigate which of these graphs yield the maximum numbers of independent sets of…

We study the zero sets of the independence polynomial on recursive sequences of graphs. We prove that for a maximally independent starting graph and a stable and expanding recursion algorithm, the zeros of the independence polynomial are…

The survey is devoted to the combinatorial and metric theory of filtrations, i.\,e., decreasing sequences of $\sigma$-algebras in measure spaces or decreasing sequences of subalgebras of certain algebras. One of the key notions, that of…

Let $M_n$ be a sequence of finite factors with $\dim(M_n)\rightarrow \infty$ and denote $\text{\bf M}=\Pi_\omega M_n$ their ultraproduct over a free ultrafilter $\omega$. We prove that if $\text{\bf Q}\subset \text{\bf M}$ is either an…

Let $G=(V,E)$ be a graph and $n$ a positive integer. Let $I_n(G)$ be the abstract simplicial complex whose simplices are the subsets of $V$ that do not contain an independent set of size $n$ in $G$. We study the collapsibility numbers of…

We give some general theorems on free algebras of varieties of Boolean algebras with operators; a hitherto new result is obtained for Pinter's substitution algebras. For n\geq 3, and m>1, there is a generating set of the free algebra freely…