Related papers: Variations of Independence in Boolean Algebras
Usual math sets have special types: countable, compact, open, occasionally Borel, rarely projective, etc. Each such set is described by a single Set Theory formula with parameters unrelated to other formulas. Exotic expressions involving…
An independent set in a graph is a set of pairwise non-adjacent vertices. Let $\alpha(G)$ denote the cardinality of a maximum independent set in the graph $G = (V, E)$. Gutman and Harary defined the independence polynomial of $G$ \[ I(G;x)…
A new approach is suggested to characterize algebraically automorphisms of the category of free algebras of a given variety. It gives in many cases an answer to the problem set by the first of authors, if automorphisms of such a category…
Notions of freedom and independence for hypergraphs of models of a theory are defined. Properties of these notions and their applications to some natural classes of theories are studied.
We describe the groups of inner and outer automorphisms of the free metabelian nilpotent Lie algebra of finite rank over a field of characteristic 0. To obtain this result we first describe the groups of inner and continuous outer…
The problem of inner vs outer conjugacy of subalgebras of certain graph C*-algebras is investigated. For a large class of finite graphs E, we show that whenever $\alpha$ is a vertex-fixing quasi-free automorphism of the corresponding graph…
The independence polynomial of a graph is the generating polynomial for the number of independent sets of each size. Two graphs are said to be \textit{independence equivalent} if they have equivalent independence polynomials. We extend…
We study equations over boolean algebras with distinguished elements. We prove the criteria, when a boolean algebra is equationally Noetherian, weakly equationally Noetherian, $\mathbf{q}_\omega$-compact or $\mathbf{u}_\omega$-compact. Also…
We investigate maximal free sequences in the Boolean algebra $\mathcal{P}(\omega)/\mathrm{fin}$, as defined by D. Monk. We provide some information on the general structure of these objects and we are particularly interested in the minimal…
We investigate the ideal structures of the C^*-algebras arising from topological graphs. We give the complete description of ideals of such C^*-algebras which are invariant under the so-called gauge action, and give the condition on…
The concepts of a conditional set, a conditional inclusion relation and a conditional Cartesian product are introduced. The resulting conditional set theory is sufficiently rich in order to construct a conditional topology, a conditional…
We generalize the usual relationship between irreducible Zariski closed subsets of the affine space, their defining ideals, coordinate rings, and function fields, to a non-commutative setting, where "varieties" carry a PGL_n-action, regular…
The independence polynomial of a graph is the generating polynomial for the number of independent sets of each size, and its roots are called {\em independence roots}. We investigate the stability of such polynomials, that is, conditions…
An important aspect in the theory of algebras with polynomial identities is the study of the asymptotic behavior of the codimension sequence $c_n(A),\, n\geq 1,$ which measures the growth of polynomial identities of a given algebra $A$. In…
Let inv denote the cardinal invariants Depth^+ and Length^+ on Boolean algebras. For many singular cardinals we create a strict inequality between the product of the inv values and the inv of the product algebra. The proof holds in ZFC.
A subset $A$ of a Boolean algebra $B$ is said to be $(n,m)$-reaped if there is a partition of unity $P \subset B$ of size $n$ such that the cardinality of $\{b \in P: b \wedge a \neq \emptyset\}$ is greater than or equal to $m$ for all…
Let k be a field of characteristic zero. We consider graded subalgebras A of k[x_1,...,x_m]/(x_1^2,...,x_m^2) generated by d linearly independant linear forms. Representations of matroids over k provide a natural description of the…
The goal of invariant theory is to find all the generators for the algebra of representations of a group that leave the group invariant. Such generators will be called \emph{basic invariants}. In particular, we set out to find the set of…
We prove that, to every abstract group $G$, we can associate a sequence of graphs $\Gamma_n$ such that the automorphism group of $\Gamma_n$ is isomorphic to $G$ and the genus of $\Gamma_n$ is an unbounded function of $n$.
Boolean ultrapowers extend the classical ultrapower construction to work with ultrafilters on any complete Boolean algebra, rather than only on a power set algebra. When they are well-founded, the associated Boolean ultrapower embeddings…