Results 41 to 50 of about 48,121,096 (211)
Order polynomial product formulas and poset dynamics [PDF]
We survey all known examples of finite posets whose order polynomials have product formulas, and we put forward a heuristic which says that these are the same posets which have good dynamical behavior.
S. Hopkins
semanticscholar +1 more source
Stanley's conjectures on the Stern poset [PDF]
The Stern poset $\mathcal{S}$ is a graded infinite poset naturally associated to Stern's triangle, which was defined by Stanley analogously to Pascal's triangle. Let $P_n$ denote the interval of $\mathcal{S}$ from the unique element of row $0$ of Stern's
A. Yang
semanticscholar +1 more source
A study on strongly convex hyper S-subposets in hyper S-posets
In this paper, we study various strongly convex hyper S-subposets of hyper S-posets in detail. To begin with, we consider the decomposition of hyper S-posets.
Tang Jian, Xie Xiang-Yun, Davvaz Bijan
doaj +1 more source
The colored symmetric and exterior algebras [PDF]
In this extended abstract we present colored generalizations of the symmetric algebra and its Koszul dual, the exterior algebra. The symmetric group Sn acts on the multilinear components of these algebras.
Rafael S. Gonzalez D'Leon
doaj +1 more source
An extension of Tamari lattices [PDF]
For any finite path $v$ on the square lattice consisting of north and east unit steps, we construct a poset Tam$(v)$ that consists of all the paths lying weakly above $v$ with the same endpoints as $v$.
Louis-François Préville-Ratelle +1 more
doaj +1 more source
Poset topology of $s$ weak order via SB-labelings [PDF]
Ceballos and Pons generalized weak order on permutations to a partial order on certain labeled trees, thereby introducing a new class of lattices called $s$-weak order.
Stephen Lacina
semanticscholar +1 more source
The Möbius function of separable and decomposable permutations [PDF]
We give a recursive formula for the Moebius function of an interval $[\sigma,\pi]$ in the poset of permutations ordered by pattern containment in the case where $\pi$ is a decomposable permutation, that is, consists of two blocks where the first one ...
Jelínek, Vít +7 more
core +3 more sources
Boxicity and Poset Dimension [PDF]
Let G be a simple, undirected, finite graph with vertex set V(G) and edge set E(C). A k-dimensional box is a Cartesian product of closed intervals a(1), b(1)] x a(2), b(2)] x ... x a(k), b(k)]. The boxicity of G, box(G) is the minimum integer k such that
Chandran, Sunil L +6 more
core +1 more source
Enumerative Combinatorics of Intervals in the Dyck Pattern Poset [PDF]
We initiate the study of the enumerative combinatorics of the intervals in the Dyck pattern poset. More specifically, we find some closed formulas to express the size of some specific intervals, as well as the number of their covering relations.
Antonio Bernini +3 more
semanticscholar +1 more source
Haar graphical representations of finite groups and an application to poset representations [PDF]
Let $R$ be a group and let $S$ be a subset of $R$. The Haar graph $\mathrm{Haar}(R,S)$ of $R$ with connection set $S$ is the graph having vertex set $R\times\{-1,1\}$, where two distinct vertices $(x,-1)$ and $(y,1)$ are declared to be adjacent if and ...
Joy Morris, Pablo Spiga
semanticscholar +1 more source

