Results 21 to 30 of about 6,492 (203)
Gallery Posets of Supersolvable Arrangements [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 We introduce a poset structure on the reduced galleries in a supersolvable arrangement of hyperplanes. In particular, for Coxeter groups of type A or B, we construct a poset of reduced words for the longest element whose Hasse diagram is the graph of ...
Thomas McConville
doaj +1 more source
Mediterranean Journal of Mathematics, 2020 We introduce Cayley posets as posets arising naturally from pairs ...
García-Marco, Ignacio +2 more
openaire +4 more sources
Discrete & Computational Geometry, 2004 Given a locally finite partially ordered set \(Q\), a second poset \(T(Q)\) is described. When \(Q\) is an Eulerian poset, often the same is true of \(T(Q)\). The main objects of study, the finite Eulerian posets \(T_n\) (for \(n = 1, 2, \ldots\)), are then obtained as intervals in the Eulerian poset \(T(P)\), where \(P\) is a certain relatively simple
openaire +1 more source
Scott convergence and fuzzy Scott topology on L-posets
Open Mathematics, 2017 We firstly generalize the fuzzy way-below relation on an L-poset, and consider its continuity by means of this relation. After that, we introduce a kind of stratified L-generalized convergence structure on an L-poset.
Liu Hongping, Chen Ling
doaj +1 more source
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
Covering energy of posets and its bounds [PDF]
Mathematica Bohemica, 2023 The concept of covering energy of a poset is known and its McClelland type bounds are available in the literature. In this paper, we establish formulas for the covering energy of a crown with $2n$ elements and a fence with $n$ elements. A lower bound for
Vandana P. Bhamre, Madhukar M. Pawar
doaj +1 more source
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
The Electronic Journal of Combinatorics, 2019 We define a family of combinatorial objects, which we call Baxter posets. We prove that Baxter posets are counted by the Baxter numbers by showing that they are the adjacency posets of diagonal rectangulations. Given a diagonal rectangulation, we describe the cover relations in the associated Baxter poset.
openaire +4 more sources
Intervals as Domain Constructor
Trends in Computational and Applied Mathematics, 2001 In this work we use an inteval constructor on posets which when applied to a poset D gives a new poset whose elements are intervals of D.
R. Callejas Bedregal +1 more
doaj +1 more source
Homomesy in products of two chains [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 Many cyclic actions $τ$ on a finite set $\mathcal{S}$ ; of combinatorial objects, along with a natural statistic $f$ on $\mathcal{S}$, exhibit ``homomesy'': the average of $f$ over each $τ$-orbit in $\mathcal{S} $ is the same as the average of $f$ over ...
James Propp, Tom Roby
doaj +1 more source