Related papers: Combinators: A Centennial View
We consider an integral transform introduced by Prabhakar, involving generalised multi-parameter Mittag-Leffler functions, which can be used to introduce and investigate several different models of fractional calculus. We derive a new…
In 1980, Lusztig introduced the periodic Kazhdan-Lusztig polynomials, which are conjectured to have important information about the characters of irreducible modules of a reductive group over a field of positive characteristic, and also…
We present an analogue of the differential calculus in which the role of polynomials is played by certain ordered sets and trees. Our combinatorial calculus has all nice features of the usual calculus and has an advantage that the elements…
The K-theoretic quiver component formula expresses the K-polynomial of a type A quiver locus as an alternating sum of products of double Grothendieck polynomials. This formula was conjectured by A. Buch and R. Rim\'anyi and later proved by…
For integers $n,k \geq 1$, let $S_k(n)$ denote the power sum $1^k +2^k + \cdots + n^k$. In this note, we first recall the minimal recurrence relation connecting $S_k(n)$ and $S_{k-1}(n)$ established by Abramovich (1973). We then discuss an…
This article presents a new set representation named the hybrid zonotope that is equivalent to the union of $2^N$ constrained zonotopes -- convex polytopes -- through the addition of $N$ binary zonotope factors. The major contribution of…
Products of shifted characteristic polynomials, and ratios of such products, averaged over the classical compact groups are of great interest to number theorists as they model similar averages of L-functions in families with the same…
Let $\fg$ be the Lie superalgebra $\fgl(m,n).$ Algorithms for computing the composition factors and multiplicities of Kac modules for $\fg$ were given by the second author in 1996, and by J. Brundan in 2003. We give a combinatorial proof of…
Let $K$ be a finite, connected, abstract simplicial complex. The Morse complex of $K$, first introduced by Chari and Joswig, is the simplicial complex constructed from all gradient vector fields on $K$. We show that if $K$ is neither the…
We implement a novel representation of model search spaces as diagrams over a category of models, where we have restricted attention to a broad class of models whose structure is presented by \C-sets. (Co)limits in these diagram categories…
Bi-partite ribbon graphs arise in organising the large $N$ expansion of correlators in random matrix models and in the enumeration of observables in random tensor models. There is an algebra $\mathcal{K}(n)$, with basis given by bi-partite…
Inspired by long-standing open problems in algebraic combinatorics, we show that modern machine learning can meaningfully contribute to verifiable mathematical discoveries. In particular, we focus on the construction of simple mathematical…
The existence and uniqueness (up to equivalence) of code loops was first established by R. Griess. Nevertheless, the explicit construction of code loops remained open until T. Hsu introduced the notion of symplectic cubic spaces and their…
For a given graph G and integers b,f >= 0, let S be a subset of vertices of G of size b+1 such that the subgraph of G induced by S is connected and S can be separated from other vertices of G by removing f vertices. We prove that every…
Providing an abstract representation of natural and human complex structures is a challenging problem. Accounting for the system heterogenous components while allowing for analytical tractability is a difficult balance. Here I introduce…
Efficient computation methods are devised for the perturbative solution of Schwinger--Dyson equations for propagators. We show how a simple computation allows to obtain the dominant contribution in the sum of many parts of previous…
Invention has been commonly conceptualized as a search over a space of combinatorial possibilities. Despite the existence of a rich literature, spanning a variety of disciplines, elaborating on the recombinant nature of invention, we lack a…
This paper introduces an algebraic combinatorial approach to simplicial cone decompositions, a key step in solving inhomogeneous linear Diophantine systems and counting lattice points in polytopes. We use constant term manipulation on the…
In computer experiments, a mathematical model implemented on a computer is used to represent complex physical phenomena. These models, known as computer simulators, enable experimental study of a virtual representation of the complex…
This is an introduction to algebraic combinatorics, written for a quarter-long graduate course. It starts with a rigorous introduction to formal power series with some combinatorial applications, then discusses integer partitions (proving…