We give a complete classification of the factorial functions of Eulerian binomial posets. The factorial function B(n) either coincides with n!, the factorial function of the infinite Boolean algebra, or 2n−1, the factorial function of the infinite butterfly poset. We also classify the factorial functions for Eulerian Sheffer posets. An Eulerian Sheffer poset with binomial factorial function B(n...

In this manuscript we study type A nilpotent Hessenberg varieties equipped with a natural S1-action using techniques introduced by Tymoczko, Harada-Tymoczko, and Bayegan-Harada, with a particular emphasis on a special class of nilpotent Springer varieties corresponding to the partition λ = (n− 2, 2) for n ≥ 4. First we define the adjacent-pair matrix corresponding to any filling of a Young diag...

Poset game, which includes some famous games. e.g., Nim and Chomp as sub-games, is an important two-player impartial combinatorial game. The rule of the game is as follows: For a given poset (partial ordered set), each player intern chooses an element and the selected element and it’s descendants (elements succeeding it) are all removed from the poset. A player who choose the last element is th...

Hierarchical data, such as Partially Ordered Set (POSET) is tremendously used in relational databases, especially in data mining and data warehouse based-applications. Unfortunately, SQL (Structured Query Language) does not effectively support hierarchical data structure to manage this sort of data, for example, in Oracle, a CONNECT BY operator is used to query data organized into trees, howeve...

Let SN(P) be the poset obtained by adding a dummy vertex on each diagonal edge of the N’s of a finite poset P. We show that SN(SN(P)) is N-free. It follows that this poset is the smallest N-free barycentric subdivision of the diagram of P, poset whose existence was proved by P.A. Grillet. This is also the poset obtained by the algorithm starting with P0 := P and consisting at step m of adding a...

In this paper, after recalling the category {\bf PosAct}-$S$ of all poset acts over a pomonoid $S$; an $S$-act in Pos} posets, with action preserving monotone maps between them, some categorical properties are considered. particular, we describe limits and colimits such as products, coproducts, equalizers, coequalizers etc. category. Also, several kinds epimorphisms monomorphisms characterized ...

The monoid $Cb$ of name substitutions and the notion of finitely supported $Cb$-sets introduced by Pitts as a generalization of nominal sets. A simple finitely supported $Cb$-set is a one point extension of a cyclic nominal set. The support map of a simple finitely supported $Cb$-set is an injective map. Also, for every two distinct elements of a simple finitely supported $Cb$-set, there exists...

We give an algorithmic solution in a simple combinatorial data of Birkhoff′s type problem studied in [14], for the category repft(I, K[t]/(tm)) of filtered I-chains of modules over the K-algebra K[t]/(tm), where m ≥ 2, I is a finite poset with a unique maximal element, and K is an algebraically closed field.

We define posets of types B, C, and D. These encode the matrix forms certain Lie algebras which lie between upper-triangular diagonal matrices. Our primary concern is index spectral theories such type-B, D poset algebras. For an important restricted class, we develop combinatorial formulas and, in particular, characterize corresponding to Frobenius In this latter case show that spectrum binary;...

Let V be an n-dimensional vector space over a finite field Fq and P = {1, 2, . . . , n} a poset. We consider on V the poset-metric dP . In this paper, we give a complete description of groups of linear isometries of the metric space (V, dP ), for any poset-metric dP . We show that a linear isometry induces an automorphism of order in poset P , and consequently we show the existence of a pair of...