36 research outputs found
Height counting of unlabeled interval and N-free posets
AbstractThis paper enumerates according to height the classes of unlabeled N-free posets, interval orders, and posets that are both N-free and interval orders. The last two classes are enumerated according to height in terms of generating functions. We apply an algorithmic method for height counting of connected N-free posets. Numerical results for n-element posets of height k, 1⩽k⩽n⩽14, are included
Enumeration of Graded (3+1)-Avoiding Posets
The notion of (3+1)-avoidance has shown up in many places in enumerative
combinatorics. The natural goal of enumeration of all (3+1)-avoiding posets
remains open. In this paper, we enumerate graded (3+1)-avoiding posets for both
reasonable definitions of the word "graded." Our proof consists of a number of
structural theorems followed by some generating function magic. We also provide
asymptotics for the growth rate of the number of graded (3 + 1)-avoiding
posets.Comment: 28 pages, 10 figures. Many changes and corrections thanks to referee
comments. Final versio
Congruences for Taylor expansions of quantum modular forms
Recently, a beautiful paper of Andrews and Sellers has established linear
congruences for the Fishburn numbers modulo an infinite set of primes. Since
then, a number of authors have proven refined results, for example, extending
all of these congruences to arbitrary powers of the primes involved. Here, we
take a different perspective and explain the general theory of such congruences
in the context of an important class of quantum modular forms. As one example,
we obtain an infinite series of combinatorial sequences connected to the
"half-derivatives" of the Andrews-Gordon functions and with Kashaev's invariant
on torus knots, and we prove conditions under which the sequences
satisfy linear congruences modulo at least of primes of primes
A study of discrepancy results in partially ordered sets
In 2001, Fishburn, Tanenbaum, and Trenk published a pair of papers that introduced the notions of linear and weak discrepancy of a partially ordered set or poset. Linear discrepancy for a poset is the least k such that for any ordering of the points in the poset there is a pair of incomparable points at least distance k away in the ordering. Weak discrepancy is similar to linear discrepancy except that the distance is observed over weak labelings (i.e. two points can have the same label if they are incomparable, but order is still preserved). My thesis gives a variety of results pertaining to these properties and other forms of discrepancy in posets. The first chapter of my thesis partially answers a question of Fishburn, Tanenbaum, and Trenk that was to characterize those posets with linear discrepancy two. It makes the characterization for those posets with width two and references the paper where the full characterization is given. The second chapter introduces the notion of t-discrepancy which is similar to weak discrepancy except only the weak labelings with
at most t copies of any label are considered. This chapter shows that determining a poset's t-discrepancy is NP-Complete. It also gives the t-discrepancy for the disjoint sum of chains and provides a polynomial time algorithm for determining t-discrepancy of semiorders. The third chapter presents another notion of discrepancy namely total discrepancy which minimizes the average distance between incomparable elements. This chapter proves that finding this value can be done in polynomial time unlike linear discrepancy and t-discrepancy. The final chapter answers another question of Fishburn, Tanenbaum, and Trenk that asked to characterize those posets that have equal linear and weak discrepancies. Though determining the answer of whether the weak discrepancy and linear discrepancy of a poset are equal is an NP-Complete problem, the set of minimal posets that have this property are given. At the end of the thesis I discuss two other open problems not mentioned in the previous chapters that relate to linear discrepancy. The first asks if there is a link between a poset's dimension and its linear discrepancy. The second refers to approximating linear discrepancy and possible ways to do it.Ph.D.Committee Chair: Trotter, William T.; Committee Member: Dieci, Luca; Committee Member: Duke, Richard; Committee Member: Randall, Dana; Committee Member: Tetali, Prasa
COMBINATORIAL ASPECTS OF EXCEDANCES AND THE FROBENIUS COMPLEX
In this dissertation we study the excedance permutation statistic. We start by extending the classical excedance statistic of the symmetric group to the affine symmetric group eSn and determine the generating function of its distribution. The proof involves enumerating lattice points in a skew version of the root polytope of type A. Next we study the excedance set statistic on the symmetric group by defining a related algebra which we call the excedance algebra. A combinatorial interpretation of expansions from this algebra is provided. The second half of this dissertation deals with the topology of the Frobenius complex, that is the order complex of a poset whose definition was motivated by the classical Frobenius problem. We determine the homotopy type of the Frobenius complex in certain cases using discrete Morse theory. We end with an enumeration of Q-factorial posets. Open questions and directions for future research are located at the end of each chapter