Related papers: Combinators: A Centennial View

Let $w$ be a word in alphabet $\{x,D\}$ with $m$ $x$'s and $n$ $D$'s. Interpreting "$x$" as multiplication by $x$, and "$D$" as differentiation with respect to $x$, the identity $wf(x) = x^{m-n}\sum_k S_w(k) x^k D^k f(x)$, valid for any…

We review the history of the road to a manifestly covariant perturbative calculus within quantum electrodynamics from the early semi-classical results of the mid-twenties to the complete formalism of Stueckelberg in 1934. We chose as our…

Based on results by Brugall\'e and Mikhalkin, Fomin and Mikhalkin give formulas for computing classical Severi degrees $N^{d, \delta}$ using long-edge graphs. In 2012, Block, Colley and Kennedy considered the logarithmic version of a…

An elimination tree for a connected graph $G$ is a rooted tree on the vertices of $G$ obtained by choosing a root $x$ and recursing on the connected components of $G-x$ to produce the subtrees of $x$. Elimination trees appear in many guises…

The classical matrix-tree theorem was discovered by G.~Kirchhoff in 1847. It relates the principal minor of the Laplace (nxn)-matrix to a particular sum of monomials indexed by the set of trees with n vertices. The aim of this paper is to…

We establish a new simple explicit description of combinatorial wall-crossing for the rational Cherednik algebra applied to the trivial representation. In this way we recover a theorem of P. Dimakis and G. Yue. We also present two…

We motivate and give semantics to theory presentation combinators as the foundational building blocks for a scalable library of theories. The key observation is that the category of contexts and fibered categories are the ideal theoretical…

In this paper, we apply the combinatorial proof technique of Description, Involution, Exceptions (DIE) to prove various known identities for the joint cumulant. Consider a set of random variables $S = \{X_1,..., X_n\} $. Motivated by the…

Let F(X,n):= X^n-\Delta be the complementary of the union \Delta of the diagonals of X^n and let U be a quotient of F(X,n) (possibly trivial) by a subgroup of the symmetric group S_n. We construct compactifications of U in products of…

Let $|A|$ denote the cardinality of a finite set $A$. For any real number $x$ define $t(x)=x$ if $x\geq1$ and 1 otherwise. For any finite sets $A,B$ let $\delta(A,B)$ $=$ $\log_{2}(t(|B\cap\bar{A}||A|))$. We define {This appears as…

Higher order free moments and cumulants, introduced by Collins, Mingo, \'Sniady and Speicher in 2006, describe the fluctuations of unitarily invariant random matrices in the limit of infinite size. The functional relations between their…

Combinatorics is a fundamental mathematical discipline as well as an essential component of many mathematical areas, and its study has experienced an impressive growth in recent years. One of the main reasons for this growth is the tight…

We show that observables in QED-type theories can be realized in terms of a combinatorial structure called chord diagrams. One advantage of this combinatorial representation is that it simplifies the study of the asymptotic behavior of…

We present a way of computing Kronecker coefficients that uses a new family of rational convex polytopes, called column-row polytopes. We give several different formulas for the computation. They are alternating sums of numbers of integer…

The main goal of this paper is to extend two fundamental combinatorial results in Schubert calculus on flag manifolds from equivariant cohomology and $K$-theory to equivariant elliptic cohomology. The foundations of elliptic Schubert…

We consider some known and some new properties of the family of polynomials introduced by Ted Suffridge in 1969. We begin by giving a brief overview of their extremal properties in classic and more recent work. We also give a compact form…

The pentagram map that associates to a projective polygon a new one formed by intersections of short diagonals was introduced by R. Schwartz and was shown to be integrable by V. Ovsienko, R. Schwartz and S. Tabachnikov. Recently, M. Glick…

Polynomial multiplication is a fundamental problem in symbolic computation. There are efficient methods for the multiplication of two univariate polynomials. However, there is rarely efficiently nontrivial method for the multiplication of…

Many problems in Physics and Chemistry are formulated as the minimization of a functional. Therefore, methods for solving these problems typically require differentiating maps whose input and/or output are functions -- commonly referred to…

We give combinatorial descriptions of the terms occurring in continuants of general continued fractions that diverge to three limits. Equating these with the usual combinatorial descriptions due to Euler, Sylvester, and Minding induces…