Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Finite Eulerian pose ...
Conference paper

Finite Eulerian posets which are binomial or Sheffer

Hoda Bidkhori (1)
(1) North Carolina State University [Raleigh]
Download article
Open on HAL
Imported on
January 31, 2017
Published on
December 31, 2010
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)
Proceedings
DOI
10.46298/dmtcs.2899
License
https://about.hal.science/hal-authorisation-v1
Indicators
640
Views
743
Downloads

Finite Eulerian posets which are binomial or Sheffer

Hoda Bidkhori (1)
(1) North Carolina State University [Raleigh]
Abstract
English
In this paper we study finite Eulerian posets which are binomial or Sheffer. These important classes of posets are related to the theory of generating functions and to geometry. The results of this paper are organized as follows: (1) We completely determine the structure of Eulerian binomial posets and, as a conclusion, we are able to classify factorial functions of Eulerian binomial posets; (2) We give an almost complete classification of factorial functions of Eulerian Sheffer posets by dividing the original question into several cases; (3) In most cases above, we completely determine the structure of Eulerian Sheffer posets, a result stronger than just classifying factorial functions of these Eulerian Sheffer posets. We also study Eulerian triangular posets. This paper answers questions posed by R. Ehrenborg and M. Readdy. This research is also motivated by the work of R. Stanley about recognizing the \emphboolean lattice by looking at smaller intervals.
French
Nous étudions les ensembles partiellement ordonnés finis (EPO) qui sont soit binomiaux soit de type Sheffer (deux notions reliées aux séries génératrices et à la géométrie). Nos résultats sont les suivants: (1) nous déterminons la structure des EPO Euleriens et binomiaux; nous classifions ainsi les fonctions factorielles de tous ces EPO; (2) nous donnons une classification presque complète des fonctions factorielles des EPO Euleriens de type Sheffer; (3) dans la plupart de ces cas, nous déterminons complètement la structure des EPO Euleriens et Sheffer, ce qui est plus fort que classifier leurs fonctions factorielles. Nous étudions aussi les EPO Euleriens triangulaires. Cet article répond à des questions de R. Ehrenborg and M. Readdy. Il est aussi motivé par le travail de R. Stanley sur la reconnaissance du treillis booléen via l'étude des petits intervalles.
Keywords
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • Eulerian poset
  • binomial poset
  • Sheffer poset
Preview
Loading PDF preview...