Related papers: Variations of Independence in Boolean Algebras

We introduce the general polynomial algebras characterizing a class of higher order superintegrable systems that separate in Cartesian coordinates. The construction relies on underlying polynomial Heisenberg algebras and their defining…

A variety of associative algebras over a field of characteristic 0 is called minimal if its codimension sequence grows much faster than the codimension sequence of any of its proper subvarieties. By the results of Giambruno and Zaicev it…

This article is devoted to two different generalizations of projective Boolean algebras: openly generated Boolean algebras and tightly sigma-filtered Boolean algebras. We show that for every uncountable regular cardinal kappa there are…

Let $n>1$ be an integer. The algebras of the title, which we abbreviate as algebras of type $n$, are infinite-dimensional graded Lie algebras $L= \bigoplus_{i=1}^{\infty}L_i$, which are generated by an element of degree $1$ and an element…

The principal observation of the present paper is that an inner isotopy (i.e. a principal isotopy defined by an algebra endomorphism) is a very helpful instrument in constructing and studying interesting classes of nonassociative algebras.…

The tree-independence number of a graph is the minimum, over all tree-decompositions of the graph, of the maximum size of an independent set contained in a bag. Graph classes of bounded tree-independence number have strong structural and…

Ultrahomogeneity and $\omega$-categoricity are two central concepts arising from model theory, with strong connections with oligomorphic permutation groups and quantifier elimination. In particular, both are conditions on the automorphism…

Known and new results on free Boolean topological groups are collected. An account of properties which these groups share with free or free Abelian topological groups and properties specific of free Boolean groups is given. Special emphasis…

The main result is Theorem: Let A be an R-algebra, mu, lambda be cardinals such that |A|<=mu=mu^{aleph_0}<lambda<=2^mu. If A is aleph_0-cotorsion-free or A is countably free, respectively, then there exists an aleph_0-cotorsion-free or a…

For a graph $G$, a vertex subset $S$ is called a maximum generalized $k$-independent set if the induced subgraph $G[S]$ does not contain a $k$-tree as its subgraph, and the subset has maximum cardinality. The generalized $k$-independence…

Let $\mathfrak{R}$ be a weakly noetherian variety of unitary associative algebras (over a field $K$ of characteristic 0), i.e., every finitely generated algebra from $\mathfrak{R}$ satisfies the ascending chain condition for two-sided…

There has been a great deal of attention recently to graphs whose vertex set is a group, defined using the group structure. (The commuting graph, where two elements are joined if they commute, is the oldest and most famous example.) The…

We investigate a construction which associates a finite von Neumann algebra $M(\Gamma,\mu)$ to a finite weighted graph $(\Gamma,\mu)$. Pleasantly, but not surprisingly, the von Neumann algebra associated to to a `flower with $n$ petals' is…

This work concerns notions of multi-algebra independence introduced by Liu and how they can be studied in the context of bi-free probability. In particular, we show how the free-free-Boolean independence for triples of algebras can be…

Algebraic immunity has been proposed as an important property of Boolean functions. To resist algebraic attack, a Boolean function should possess high algebraic immunity. It is well known now that the algebraic immunity of an $n$-variable…

Let $\Gamma$ be a simple graph and $I_\Gamma(x)$ its multivariate independence polynomial. The main result of this paper is the characterization of chordal graphs as the only $\Gamma$ for which the power series expansion of…

We present a new effective Nullstellensatz with bounds for the degrees which depend not only on the number of variables and on the degrees of the input polynomials but also on an additional parameter called the {\it geometric degree of the…

The method of imsets, introduced by Studen\'y, provides a geometric and combinatorial description of conditional independence statements. Elementary conditional independence statements over a finite set of discrete random variables…

Cardinal characteristics of the continuum represent the boundaries in size between the countable and the continuum with respect to certain properties of sets. They are often defined as the minimum sizes of families of reals that meet some…

We develop a notion of containment for independent sets in hypergraphs. For every $r$-uniform hypergraph $G$, we find a relatively small collection $C$ of vertex subsets, such that every independent set of $G$ is contained within a member…