Displaying similar documents to “Generalised irredundance in graphs: Nordhaus-Gaddum bounds”

Linear preserver of n × 1 Ferrers vectors

Leila Fazlpar, Ali Armandnejad (2023)

Czechoslovak Mathematical Journal

Similarity:

Let A = [ a i j ] m × n be an m × n matrix of zeros and ones. The matrix A is said to be a Ferrers matrix if it has decreasing row sums and it is row and column dense with nonzero ( 1 , 1 ) -entry. We characterize all linear maps perserving the set of n × 1 Ferrers vectors over the binary Boolean semiring and over the Boolean ring 2 . Also, we have achieved the number of these linear maps in each case.

The rings which are Boolean

Ivan Chajda, Filip Švrček (2011)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

We study unitary rings of characteristic 2 satisfying identity x p = x for some natural number p. We characterize several infinite families of these rings which are Boolean, i.e., every element is idempotent. For example, it is in the case if p = 2 n - 2 or p = 2 n - 5 or p = 2 n + 1 for a suitable natural number n. Some other (more general) cases are solved for p expressed in the form 2 q + 2 m + 1 or 2 q + 2 m where q is a natural number and m 1 , 2 , . . . , 2 q - 1 .

Counterexamples to Hedetniemi's conjecture and infinite Boolean lattices

Claude Tardif (2022)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

We prove that for any c 5 , there exists an infinite family ( G n ) n of graphs such that χ ( G n ) > c for all n and χ ( G m × G n ) c for all m n . These counterexamples to Hedetniemi’s conjecture show that the Boolean lattice of exponential graphs with K c as a base is infinite for c 5 .

Coherent ultrafilters and nonhomogeneity

Jan Starý (2015)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

We introduce the notion of a coherent P -ultrafilter on a complete ccc Boolean algebra, strengthening the notion of a P -point on ω , and show that these ultrafilters exist generically under 𝔠 = 𝔡 . This improves the known existence result of Ketonen [On the existence of P -points in the Stone-Čech compactification of integers, Fund. Math. 92 (1976), 91–94]. Similarly, the existence theorem of Canjar [On the generic existence of special ultrafilters, Proc. Amer. Math. Soc. 110 (1990), no. 1,...

FKN Theorem on the biased cube

Piotr Nayar (2014)

Colloquium Mathematicae

Similarity:

We consider Boolean functions defined on the discrete cube - γ , γ - 1 equipped with a product probability measure μ n , where μ = β δ - γ + α δ γ - 1 and γ = √(α/β). This normalization ensures that the coordinate functions ( x i ) i = 1 , . . . , n are orthonormal in L ( - γ , γ - 1 , μ n ) . We prove that if the spectrum of a Boolean function is concentrated on the first two Fourier levels, then the function is close to a certain function of one variable. Our theorem strengthens the non-symmetric FKN Theorem due to Jendrej, Oleszkiewicz and Wojtaszczyk. Moreover,...

Cardinal sequences of length < ω₂ under GCH

István Juhász, Lajos Soukup, William Weiss (2006)

Fundamenta Mathematicae

Similarity:

Let (α) denote the class of all cardinal sequences of length α associated with compact scattered spaces (or equivalently, superatomic Boolean algebras). Also put λ ( α ) = s ( α ) : s ( 0 ) = λ = m i n [ s ( β ) : β < α ] . We show that f ∈ (α) iff for some natural number n there are infinite cardinals λ i > λ > . . . > λ n - 1 and ordinals α , . . . , α n - 1 such that α = α + + α n - 1 and f = f f . . . f n - 1 where each f i λ i ( α i ) . Under GCH we prove that if α < ω₂ then (i) ω ( α ) = s α ω , ω : s ( 0 ) = ω ; (ii) if λ > cf(λ) = ω, λ ( α ) = s α λ , λ : s ( 0 ) = λ , s - 1 λ i s ω - c l o s e d i n α ; (iii) if cf(λ) = ω₁, λ ( α ) = s α λ , λ : s ( 0 ) = λ , s - 1 λ i s ω - c l o s e d a n d s u c c e s s o r - c l o s e d i n α ; (iv) if cf(λ) > ω₁, λ ( α ) = α λ . This yields a complete characterization of the classes (α) for all...

A tight quantitative version of Arrow’s impossibility theorem

Nathan Keller (2012)

Journal of the European Mathematical Society

Similarity:

The well-known Impossibility Theorem of Arrow asserts that any generalized social welfare function (GSWF) with at least three alternatives, which satisfies Independence of Irrelevant Alternatives (IIA) and Unanimity and is not a dictatorship, is necessarily non-transitive. In 2002, Kalai asked whether one can obtain the following quantitative version of the theorem: For any ϵ > 0 , there exists δ = δ ( ϵ ) such that if a GSWF on three alternatives satisfies the IIA condition and its probability of...

Laslett’s transform for the Boolean model in d

Rostislav Černý (2006)

Kybernetika

Similarity:

Consider a stationary Boolean model X with convex grains in d and let any exposed lower tangent point of X be shifted towards the hyperplane N 0 = { x d : x 1 = 0 } by the length of the part of the segment between the point and its projection onto the N 0 covered by X . The resulting point process in the halfspace (the Laslett’s transform of X ) is known to be stationary Poisson and of the same intensity as the original Boolean model. This result was first formulated for the planar Boolean model (see N. Cressie...

Combinatorics of dense subsets of the rationals

B. Balcar, F. Hernández-Hernández, M. Hrušák (2004)

Fundamenta Mathematicae

Similarity:

We study combinatorial properties of the partial order (Dense(ℚ),⊆). To do that we introduce cardinal invariants , , , , , describing properties of Dense(ℚ). These invariants satisfy ≤ ℚ ≤ ℚ ≤ ℚ ≤ ℚ ≤ ℚ . W e c o m p a r e t h e m w i t h t h e i r a n a l o g u e s i n t h e w e l l s t u d i e d B o o l e a n a l g e b r a ( ω ) / f i n . W e s h o w t h a t ℚ = p , ℚ = t a n d ℚ = i , w h e r e a s ℚ > h a n d ℚ > r a r e b o t h s h o w n t o b e r e l a t i v e l y c o n s i s t e n t w i t h Z F C . W e a l s o i n v e s t i g a t e c o m b i n a t o r i c s o f t h e i d e a l n w d o f n o w h e r e d e n s e s u b s e t s o f , . I n p a r t i c u l a r , w e s h o w t h a t non(M)=min||: ⊆ Dense(R) ∧ (∀I ∈ nwd(R))(∃D ∈ )(I ∩ D = ∅) and cof(M) = min||: ⊆ Dense(ℚ) ∧ (∀I ∈ nwd)(∃D ∈ )(I ∩ = ∅). We use these facts to show that cof(M) ≤ i, which improves a result of S. Shelah.

Possible isolation number of a matrix over nonnegative integers

LeRoy B. Beasley, Young Bae Jun, Seok-Zun Song (2018)

Czechoslovak Mathematical Journal

Similarity:

Let + be the semiring of all nonnegative integers and A an m × n matrix over + . The rank of A is the smallest k such that A can be factored as an m × k matrix times a k × n matrix. The isolation number of A is the maximum number of nonzero entries in A such that no two are in any row or any column, and no two are in a 2 × 2 submatrix of all nonzero entries. We have that the isolation number of A is a lower bound of the rank of A . For A with isolation number k , we investigate the possible values of the...