Displaying similar documents to “Maximal free sequences in a Boolean algebra”

Generalized free products

J. D. Monk (2001)

Colloquium Mathematicae

Similarity:

A subalgebra B of the direct product i I A i of Boolean algebras is finitely closed if it contains along with any element f any other member of the product differing at most at finitely many places from f. Given such a B, let B* be the set of all members of B which are nonzero at each coordinate. The generalized free product corresponding to B is the subalgebra of the regular open algebra with the poset topology on B* generated by the natural basic open sets. Properties of this product are...

On graphs G for which both g and G̅ are claw-free

Shinya Fujita (2005)

Discussiones Mathematicae Graph Theory

Similarity:

Let G be a graph with |V(G)| ≥ 10. We prove that if both G and G̅ are claw-free, then minΔ(G), Δ(G̅) ≤ 2. As a generalization of this result in the case where |V(G)| is sufficiently large, we also prove that if both G and G̅ are K 1 , t -free, then minΔ(G),Δ(G̅) ≤ r(t- 1,t)-1 where r(t-1,t) is the Ramsey number.

Multiplicative free square of the free Poisson measure and examples of free symmetrization

Melanie Hinz, Wojciech Młotkowski (2010)

Colloquium Mathematicae

Similarity:

We compute the moments and free cumulants of the measure ρ t : = π t π t , where π t denotes the free Poisson law with parameter t > 0. We also compute free cumulants of the symmetrization of ρ t . Finally, we introduce the free symmetrization of a probability measure on ℝ and provide some examples.

On the Lukacs property for free random variables

Kamil Szpojankowski (2015)

Studia Mathematica

Similarity:

The Lukacs property of the free Poisson distribution is studied. We prove that if free and are free Poisson distributed with suitable parameters, then + and ( + ) - 1 / 2 ( + ) - 1 / 2 are free. As an auxiliary result we compute the joint cumulants of and - 1 for free Poisson distributed . We also study the Lukacs property of the free Gamma distribution.

Ideal independence, free sequences, and the ultrafilter number

Kevin Selker (2015)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

We make use of a forcing technique for extending Boolean algebras. The same type of forcing was employed in Baumgartner J.E., Komjáth P., Boolean algebras in which every chain and antichain is countable, Fund. Math. 111 (1981), 125–133, Koszmider P., Forcing minimal extensions of Boolean algebras, Trans. Amer. Math. Soc. 351 (1999), no. 8, 3073–3117, and elsewhere. Using and modifying a lemma of Koszmider, and using CH, we obtain an atomless BA, A such that 𝔣 ( A ) = s mm ( A ) < 𝔲 ( A ) , answering questions raised...

A free stochastic partial differential equation

Yoann Dabrowski (2014)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

We get stationary solutions of a free stochastic partial differential equation. As an application, we prove equality of non-microstate and microstate free entropy dimensions under a Lipschitz like condition on conjugate variables, assuming also the von Neumann algebra R ω embeddable. This includes an N -tuple of q -Gaussian random variables e.g. for | q | N 0 . 13 .

k -free separable groups with prescribed endomorphism ring

Daniel Herden, Héctor Gabriel Salazar Pedroza (2015)

Fundamenta Mathematicae

Similarity:

We will consider unital rings A with free additive group, and want to construct (in ZFC) for each natural number k a family of k -free A-modules G which are separable as abelian groups with special decompositions. Recall that an A-module G is k -free if every subset of size < k is contained in a free submodule (we will refine this in Definition 3.2); and it is separable as an abelian group if any finite subset of G is contained in a free direct summand of G. Despite the fact that such a...

Fixed-point free maps of Euclidean spaces

R. Z. Buzyakova, A. Chigogidze (2011)

Fundamenta Mathematicae

Similarity:

Our main result states that every fixed-point free continuous self-map of ℝⁿ is colorable. This result can be reformulated as follows: A continuous map f: ℝⁿ → ℝⁿ is fixed-point free iff f̃: βℝⁿ → βℝⁿ is fixed-point free. We also obtain a generalization of this fact and present some examples