Results 101 to 110 of about 462 (185)
Journal of Combinatorial Theory, Series A, 1988 A poset of shuffles is defined as follows: Let \b{x}\(=x_ 1x_ 2...x_ m\) and \b{y}\(=y_ 1y_ 2...y_ m\) be words, where it is assumed that the letters occurring in \b{x} and \b{y} are all distinct. Let \(W_{\underline x,\underline y}\) denote the set of all words \b{w} with letters from \b{x} and \b{y} such that the restriction of \b{w} to the letters ...
openaire +2 more sources
Implication in finite posets with pseudocomplemented sections. [PDF]
Soft comput, 2022 Chajda I, Länger H.
europepmc +1 more source
An investigation on hyper S-posets over ordered semihypergroups
Open Mathematics, 2017 In this paper, we define and study the hyper S-posets over an ordered semihypergroup in detail. We introduce the hyper version of a pseudoorder in a hyper S-poset, and give some related properties.
Tang Jian, Davvaz Bijan, Xie Xiang-Yun
doaj +1 more source
Journal of Combinatorial Theory, Series A, 1993 One sure sign of a successful generalization of a particular theory is an extension of language and technique to a larger domain permitting one to reconstruct considerable parts of previous theory on such a new basis. Another such sign is to provide new interpretations and insights captured by such an extended theory, especially involving results ...
openaire +2 more sources
Discrete MathematicsWe propose a generalization of positional games, supplementing them with a restriction on the order in which the elements of the board are allowed to be claimed. We introduce poset positional games, which are positional games with an additional structure -- a poset on the elements of the board.
Bagan, Guillaume +7 more
openaire +7 more sources
Filters and congruences in sectionally pseudocomplemented lattices and posets. [PDF]
Soft comput, 2021 Chajda I, Länger H.
europepmc +1 more source
Sheffer operation in relational systems. [PDF]
Soft comput, 2022 Chajda I, Länger H.
europepmc +1 more source
On Boolean posets of numerical events. [PDF]
Adv Comput Intell, 2021 Dorninger D, Länger H.
europepmc +1 more source
On Quillenʼs Theorem A for posets
Journal of Combinatorial Theory, Series A, 2011 7 pages.
openaire +2 more sources