Related papers: The enumeration of fully commutative affine permut…
We show how Andrews' generating functions for generalized Frobenius partitions can be understood within the theory of Eichler and Zagier as specific coefficients of certain Jacobi forms. This reformulation leads to a recursive process which…
A simple permutation is one which maps no proper non-singleton interval onto an interval. We consider the enumeration of simple permutations from several aspects. Our results include a straightforward relationship between the ordinary…
We prove that every sufficiently long simple permutation contains two long almost disjoint simple subsequences. This result has applications to the enumeration of restricted permutations. For example, it immediately implies a result of Bona…
In this article, we study algebraic decompositions and secondary constructions of almost perfect nonlinear (APN) functions. In many cases, we establish precise criteria which characterize when certain modifications of a given APN function…
Let $K$ be a finite field of characteristic $p$. We study a certain class of functions $K\rightarrow K$ that agree with an $\mathbb{F}_p$-affine function $K\rightarrow K$ on each coset of a given additive subgroup $W$ of $K$ - we call them…
In this thesis, I present an associative diagram algebra that is a faithful representation of a particular Temperley--Lieb algebra of type affine $C$, which has a basis indexed by the fully commutative elements of the Coxeter group of the…
We enumerate derangements with descents in prescribed positions. A generating function was given by Guo-Niu Han and Guoce Xin in 2007. We give a combinatorial proof of this result, and derive several explicit formulas. To this end, we…
We construct an uncountable family of well-quasi-ordered permutation classes, each with a distinct enumeration sequence. This disproves a conjecture that all well-quasi-ordered permutation classes have algebraic generating functions, and in…
We prove the equidimensionality of affine Deligne-Lusztig varieties in mixed characteristic. This verifies a conjecture made by Rapoport and implies that the results of Nie and Zhou-Zhu can be extended to the whole irreducible components of…
Since their introduction by Andrews, generalized Frobenius partitions have interested a number of authors, many of whom have worked out explicit formulas for their generating functions in specific cases. This has uncovered interesting…
We study the unique maximal decomposition of an arbitrary affine permutation into a product of cyclically decreasing elements, providing a new perspective on work of Thomas Lam. This decomposition is closely related to the affine code,…
We show that affine Hecke algebras of rank two with generic parameters are affine cellular in the sense of Koenig-Xi.
In this note, I review an aspect of some new techniques introduced recently in collaboration with Miguel \'Angel Barja and Rita Pardini: the construction of the continuous rank function. I give a sketch of how to use this function to prove…
We study generating functions in the context of Rota-Baxter algebras. We show that exponential generating functions can be naturally viewed in a very special case of complete free commutative Rota-Baxter algebras. This allows us to use free…
We generalize the work of Fomin, Greene, Reiner, and Shimozono on balanced labellings in two directions: (1) we define the diagrams of affine permutations and the balanced labellings on them; (2) we define the set-valued version of the…
We construct generating trees with one, two, and three labels for some classes of permutations avoiding generalized patterns of length 3 and 4. These trees are built by adding at each level an entry to the right end of the permutation,…
We give several explicit combinatorial formulas for the expansion of k-Schur functions indexed by maximal rectangles in terms of the standard basis of the affine nilCoxeter algebra. Using our result, we also show a commutation relation of…
We propose several techniques to construct complete permutation polynomials of finite fields by virtue of complete permutations of subfields. In some special cases, any complete permutation polynomials over a finite field can be used to…
We show that all permutations in $S_n$ can be generated by affine unicritical polynomials. We use the $\operatorname{PGL}$ group structure to compute the cycle structure of permutations with low Carlitz rank. The tree structure of the group…
Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…