12 research outputs found
Finite Eulerian posets which are binomial or Sheffer
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
Classification and enumeration of special classes of posets and polytopes
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2010.Cataloged from PDF version of thesis.Includes bibliographical references (p. 91-93).This thesis concerns combinatorial and enumerative aspects of different classes of posets and polytopes. The first part concerns the finite Eulerian posets which are binomial, Sheffer or triangular. These important classes of posets are related to the theory of generating functions and to geometry. Ehrenborg and Readdy [ER2] gave a complete classification of the factorial functions of infinite Eulerian binomial posets and infinite Eulerian Sheffer posets, where infinite posets are those posets which contain an infinite chain. We answer questions asked by R. Ehrenborg and M. Readdy [ER2]. We completely determine the structure of Eulerian binomial posets and, as a conclusion, we are able to classify factorial functions of Eulerian binomial posets; We give an almost complete classification of factorial functions of Eulerian Sheffer posets by dividing the original question into several cases; 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. This work is also motivated by the work of R. Stanley about recognizing the boolean lattice by looking at smaller intervals. In the second topic concerns lattice path matroid polytopes. The theory of matroid polytopes has gained prominence due to its applications in algebraic geometry, combinatorial optimization, Coxeter group theory, and, most recently, tropical geometry. In general matroid polytopes are not well understood. Lattice path matroid polytopes (LPMP) belong to two famous classes of polytopes, sorted closed matroid polytopes [LP] and polypositroids [Pos]. We study several properties of LPMPs and build a new connection between the theories of matroid polytopes and lattice paths. I investigate many properties of LPMPs, including their face structure, decomposition, and triangulations, as well as formulas for calculating their Ehrhart polynomial and volume.by Hoda Bidkhori.Ph.D
Classification of the factorial functions of Eulerian binomial and Sheffer posets
We give a complete classification of the factorial functions of Eulerian
binomial posets. The factorial function B(n) either coincides with , the
factorial function of the infinite Boolean algebra, or , 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 has Sheffer factorial function D(n) identical to
that of the infinite Boolean algebra, the infinite Boolean algebra with two new
coatoms inserted, or the infinite cubical poset. Moreover, we are able to
classify the Sheffer factorial functions of Eulerian Sheffer posets with
binomial factorial function as the doubling of an upside down
tree with ranks 1 and 2 modified.
When we impose the further condition that a given Eulerian binomial or
Eulerian Sheffer poset is a lattice, this forces the poset to be the infinite
Boolean algebra or the infinite cubical lattice . We also
include several poset constructions that have the same factorial functions as
the infinite cubical poset, demonstrating that classifying Eulerian Sheffer
posets is a difficult problem.Comment: 23 pages. Minor revisions throughout. Most noticeable is title
change. To appear in JCT
A selected survey of umbral calculus
We survey the mathematical literature on umbral calculus (otherwise known as the calculus of finite differences) from its roots in the 19th century (and earlier) as a set of "magic rules" for lowering and raising indices, through its rebirth in the 1970’s as Rota’s school set it on a firm logical foundation using operator methods, to the current state of the art with numerous generalizations and applications. The survey itself is complemented by a fairly complete bibliography (over 500 references) which we expect to update regularly
Counting Matrices Over Finite Fields
This project was submitted to the Mathematics department in partial fulfillment of the requirements for the degree of Master of Arts
Finite Eulerian posets which are binomial or Sheffer
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 boolean lattice by looking at smaller intervals
Finite Eulerian posets which are binomial or Sheffer
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.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
LIPIcs, Volume 251, ITCS 2023, Complete Volume
LIPIcs, Volume 251, ITCS 2023, Complete Volum