Results 31 to 40 of about 619 (166)
On properties of posets of MM-type (1,3,5)
Науковий вісник Ужгородського університету. Серія: Математика і інформатика, 2018 We introduce the notion of poset of MM-type P, where P is a fixed poset, and calculate the coefficient of transitiveness for all posets of $MM$-type (1,3,5).
В. М. Бондаренко +1 more
doaj +1 more source
Stokes posets and serpent nests [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 30 pages, 12 ...
Frédéric Chapoton
doaj +1 more source
Graphs and Combinatorics, 2012 The notion of level posets is introduced. This class of infinite posets has the property that between every two adjacent ranks the same bipartite graph occurs. When the adjacency matrix is indecomposable, we determine the length of the longest interval one needs to check to verify Eulerianness.
Ehrenborg, Richard +2 more
openaire +2 more sources
SIAM Journal on Discrete Mathematics, 2023 36 pages, 1 figure. Added a reference to Daykin--Daykin--Paterson inequality that were previously presented as Conjecture 4.19 in ...
Chan, Swee Hong +2 more
openaire +2 more sources
On Finding Two Posets that Cover Given Linear Orders
Algorithms, 2019 The Poset Cover Problem is an optimization problem where the goal is to determine a minimum set of posets that covers a given set of linear orders. This problem is relevant in the field of data mining, specifically in determining directed networks or ...
Ivy Ordanel +2 more
doaj +1 more source
Algorithmica, 2012 We describe an algorithm for compressing a partially ordered set, or \emph{poset}, so that it occupies space matching the information theory lower bound (to within lower order terms), in the worst case. Using this algorithm, we design a succinct data structure for representing a poset that, given two elements, can report whether one precedes the other ...
Munro, J., Nicholson, P.
openaire +3 more sources
Intuitionistic-like unsharp implication and negation defined on a poset [PDF]
Mathematica BohemicaThe aim of the present paper is to show that the concepts of the intuitionistic implication and negation formalized by means of a Heyting algebra can be generalized in such a way that these concepts are formalized by means of a bounded poset.
Ivan Chajda, Helmut Länger
doaj +1 more source
The topology of the permutation pattern poset [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 The set of all permutations, ordered by pattern containment, forms a poset. This extended abstract presents the first explicit major results on the topology of intervals in this poset.
Peter McNamara, Einar Steingrımsson
doaj +1 more source
The Equivalence of Two Modes of Order Convergence
MathematicsIt is well known that if a poset satisfies Property A and its dual form, then the o-convergence and o2-convergence in the poset are equivalent. In this paper, we supply an example to illustrate that a poset in which the o-convergence and o2-convergence ...
Tao Sun, Nianbai Fan
doaj +1 more source
Pattern-avoiding Dyck paths [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 We introduce the notion of $\textit{pattern}$ in the context of lattice paths, and investigate it in the specific case of Dyck paths. Similarly to the case of permutations, the pattern-containment relation defines a poset structure on the set of all Dyck
Antonio Bernini +3 more
doaj +1 more source