Related papers: Affine permutations and rational slope parking fun…
This paper is an exploration in a functional programming framework of {\em isomorphisms} between elementary data types (natural numbers, sets, multisets, finite functions, permutations binary decision diagrams, graphs, hypergraphs,…
We introduce a bi-graded polynomial that encodes the cohomology groups of the wild Hitchin system of type~$A_{n-1}$, constructed using an irregular singularity (determined by an integer~$m$) and an arbitrary regular singularity~$f$. When…
We use intuitive results from algebraic topology and intersection theory to clarify the pullback action on cohomology by compositions of rational maps. We use these techniques to prove a simple sufficient criterion for functoriality of a…
Partition functions, also known as homomorphism functions, form a rich family of graph invariants that contain combinatorial invariants such as the number of k-colourings or the number of independent sets of a graph and also the partition…
We generalize in a combinatorial way the notion of the affine energy function of type $A$ to the case of a more general class of modules over a general linear Lie superalgebra $\mathfrak{g}$ based on a Howe duality of type…
The dual stable Grothendieck polynomials are a deformation of the Schur functions, originating in the study of the K-theory of the Grassmannian. We generalize these polynomials by introducing a countable family of additional parameters, and…
A new set of symmetric correction functions is presented for high-order flux reconstruction, that expands upon, while incorporating, all previous correction function sets and opens the possibility for improved performance. By considering FR…
The deep interconnection between linear algebra and graph theory allows one to interpret classical matrix invariants through combinatorial structures. To each square matrix A over a commutative ring K, one can associate a weighted directed…
High-dimensional interpolation problems appear in various applications of uncertainty quantification, stochastic optimization and machine learning. Such problems are computationally expensive and request the use of adaptive grid generation…
We consider a generalization of a functional equation that models the learning process in various animal species. The equation can be considered nonlocal, as it is built with a convex combination of the unknown function evaluated at mixed…
There are two rather distinct approaches to Morse theory nowadays: smooth and discrete. We propose to study a real valued function by assembling all associated sections in a topological category. From this point of view, Reeb functions on…
We introduce a family of sequence transformations, defined via partial Bell polynomials, that may be used for a systematic study of a wide variety of problems in enumerative combinatorics. This family includes some of the transformations…
Given a nonnegative integer $m$ and a finite collection ${\mathcal A}$ of linear forms on ${\mathbb Q}^d$, the arrangement of affine hyperplanes in ${\mathbb Q}^d$ defined by the equations $\alpha(x) = k$ for $\alpha \in {\mathcal A}$ and…
An \emph{$(r,k)$-parking function} of length $n$ may be defined as a sequence $(a_1,\dots,a_n)$ of positive integers whose increasing rearrangement $b_1\leq\cdots\leq b_n$ satisfies $b_i\leq k+(i-1)r$. The case $r=k=1$ corresponds to…
We discuss three distinct topics of independent interest; one in enumerative combinatorics, one in symmetric function theory, and one in algebraic geometry. The topic in enumerative combinatorics concerns a q-analog of a generalization of…
We construct three new combinatorial Hopf algebras based on the Loday-Ronco operations on planar binary trees. The first and second algebras are defined on planar trees and labeled planar trees extending the Loday-Ronco and…
This dissertation investigates the geometric combinatorics of convex polytopes and connections to the behavior of the simplex method for linear programming. We focus our attention on transportation polytopes, which are sets of all tables of…
A classical parking function of length $n$ is a list of positive integers $(a_1, a_2, \ldots, a_n)$ whose nondecreasing rearrangement $b_1 \leq b_2 \leq \cdots \leq b_n$ satisfies $b_i \leq i$. The convex hull of all parking functions of…
In prior joint work with Lewis, we developed a theory of enriched set-valued $P$-partitions to construct a $K$-theoretic generalization of the Hopf algebra of peak quasisymmetric functions. Here, we situate this object in a diagram of six…
We study combinatorial aspects of the Schubert calculus of the affine Grassmannian Gr associated with SL(n,C). Our main results are: 1) Pieri rules for the Schubert bases of H^*(Gr) and H_*(Gr), which expresses the product of a special…