The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying 81 – 100 of 204

Showing per page

Linear operators preserving maximal column ranks of nonbinary boolean matrices

Seok-Zun Song, Sung-Dae Yang, Sung-Min Hong, Young-Bae Jun, Seon-Jeong Kim (2000)

Discussiones Mathematicae - General Algebra and Applications

The maximal column rank of an m by n matrix is the maximal number of the columns of A which are linearly independent. We compare the maximal column rank with rank of matrices over a nonbinary Boolean algebra. We also characterize the linear operators which preserve the maximal column ranks of matrices over nonbinary Boolean algebra.

Maximal free sequences in a Boolean algebra

J. D. Monk (2011)

Commentationes Mathematicae Universitatis Carolinae

We study free sequences and related notions on Boolean algebras. A free sequence on a BA A is a sequence a ξ : ξ < α of elements of A , with α an ordinal, such that for all F , G [ α ] < ω with F < G we have ξ F a ξ · ξ G - a ξ 0 . A free sequence of length α exists iff the Stone space Ult ( A ) has a free sequence of length α in the topological sense. A free sequence is maximal iff it cannot be extended at the end to a longer free sequence. The main notions studied here are the spectrum function 𝔣 sp ( A ) = { | α | : A has an infinite maximal free sequence of length α } and the associated min-max function 𝔣 ( A ) = min ( 𝔣 sp ( A ) ) . Among the results...

Minimal generics from subvarieties of the clone extension of the variety of Boolean algebras

Jerzy Płonka (2008)

Colloquium Mathematicae

Let τ be a type of algebras without nullary fundamental operation symbols. We call an identity φ ≈ ψ of type τ clone compatible if φ and ψ are the same variable or the sets of fundamental operation symbols in φ and ψ are nonempty and identical. For a variety of type τ we denote by c the variety of type τ defined by all clone compatible identities from Id(). We call c the clone extension of . In this paper we describe algebras and minimal generics of all subvarieties of c , where is the variety of...

More set-theory around the weak Freese–Nation property

Sakaé Fuchino, Lajos Soukup (1997)

Fundamenta Mathematicae

We introduce a very weak version of the square principle which may hold even under failure of the generalized continuum hypothesis. Under this weak square principle, we give a new characterization (Theorem 10) of partial orderings with κ-Freese-Nation property (see below for the definition). The characterization is not a ZFC theorem: assuming Chang’s Conjecture for ω , we can find a counter-example to the characterization (Theorem 12). We then show that, in the model obtained by adding Cohen reals,...

Currently displaying 81 – 100 of 204