Results 11 to 20 of about 1,634,119 (265)
Characterization problems for graphs, partially ordered sets, lattices, and families of sets [PDF]
Discrete Mathematics, 1976 A standard problem in combinatorial theory is to characterize structures which satisfy a certain property by providing a minimum list of forbidden substructures, for example, Kuratowski's well known characterization of planar graphs. In this paper, we establish connections between characterization problems for interval graphs, circular are graphs ...
William T. Trotter, John I. Moore Jr.
openaire +3 more sources
Dualization in lattices given by ordered sets of irreducibles
Theoretical Computer Science, 2017 Dualization of a monotone Boolean function on a finite lattice can be represented by transforming the set of its minimal 1 to the set of its maximal 0 values. In this paper we consider finite lattices given by ordered sets of their meet and join irreducibles (i.e., as a concept lattice of a formal context).
Mikhail A. Babin, Sergei O. Kuznetsov
openaire +4 more sources
Some geometrical methods for constructing contradiction measures on Atanassov's intuitionistic fuzzy sets [PDF]
, 2011 Trillas et al. (1999, Soft computing, 3 (4), 197–199) and Trillas and Cubillo (1999, On non-contradictory input/output couples in Zadeh's CRI proceeding, 28–32) introduced the study of contradiction in the framework of fuzzy logic because of the ...
Torres Blanc, Carmen +5 more
core +1 more source
Order isomorphisms between bases of topologies
Extracta Mathematicae, 2022 In this paper we will study the representations of isomorphisms between bases of topological spaces. It turns out that the perfect setting for this study is that of regular open subsets of complete metric spaces, but we have been able to show some ...
Javier Cabello Sánchez
doaj
Compactness in asymmetrically normed lattices. [PDF]
, 2012 Includes abstract.Includes bibliographical references.The aim of the thesis is to investigate aspects of the theory of such spaces, concentrating mainly, but not exclusively, on nite dimensional spaces.
Mabula, Mokhwetha Daniel
core +1 more source
Cytoskeletal signaling: is memory encoded in microtubule lattices by CaMKII phosphorylation?
PLoS Computational Biology, 2012 Memory is attributed to strengthened synaptic connections among particular brain neurons, yet synaptic membrane components are transient, whereas memories can endure. This suggests synaptic information is encoded and 'hard-wired' elsewhere, e.g.
Travis J A Craddock +2 more
doaj +1 more source
Some properties of boolean ordered sets [PDF]
, 1993 summary:In the paper, the notion of relative polarity in ordered sets is introduced and the lattices of $R$-polars are studied.
Emanovský, Petr, Halaš, Radomír
core +1 more source
Latent Complete-Lattice Structure of Hilbert-Space Projectors
Quanta, 2019 To uncover the hidden complete-lattice structure of Hilbert-space projectors, which is not seen by the operator operations and relations (algebraically), resort is taken to the ranges of projectors (to subspaces—to geometry).
Fedor Herbut
doaj +1 more source
Pattern classes of permutations via bijections between linearly ordered sets [PDF]
, 2008 A pattern class is a set of permutations closed under pattern involvement or, equivalently, defined by certain subsequence avoidance conditions. Any pattern class X which is atomic, i.e.
Ruškuc, Nik +2 more
core +1 more source
Pseudocomplemented ordered sets [PDF]
, 1993 summary:The aim of this paper is to transfer the concept of pseudocomplement from lattices to ordered sets and to prove some basic results holding for pseudocomplemented ordered ...
Halaš, Radomír, Radomir Halas
core +1 more source