Related papers: Combinatorial reciprocity for non-intersecting pat…
We use a recently proved fluctuation theorem for the currents to develop the response theory of nonequilibrium phenomena. In this framework, expressions for the response coefficients of the currents at arbitrary orders in the thermodynamic…
The material gives a new combinatorial proof of the multiplicative property of the S-transform. In particular, several properties of the coefficients of its inverse are connected to non-crossing linked partitions and planar trees.
It is well known that the set of $m$-Dyck paths with a fixed height and a fixed amount of valleys is counted by the Fu{\ss}-Narayana numbers. In this article, we consider the set of $m$-Dyck paths that start with at least $t$ north steps.…
We consider the effect of non-reciprocity in a binary mixture of self-propelled particles with anti-aligning interactions, where a particle of type A reacts differently to a particle of type B than vice versa. Starting from a well-known…
Reciprocity is shown so far only when the scattering potential is either real or parity symmetric complex. We extend this result for parity violating complex potential by considering several explicit examples: (i) we show reciprocity for a…
We extend the Lee-Schiffler Dyck path model to give a proof of the Kontsevich non-commutative cluster positivity conjecture with unequal parameters.
Reciprocity is a second-order correlation that has been recently detected in all real directed networks and shown to have a crucial effect on the dynamical processes taking place on them. However, no current theoretical model generates…
The reciprocity principle is that, when an emitted wave gets scattered on an object, the scattering transition amplitude does not change if we interchange the source and the detector - in other words, if incoming waves are interchanged with…
We derive a series of results on random walks on a d-dimensional hypercubic lattice (lattice paths). We introduce the notions of terse and simple paths corresponding to the path having no backtracking parts (spikes). These paths label…
We derive self-reciprocity properties for a number of polyomino generating functions, including several families of column-convex polygons, three-choice polygons and staircase polygons with a staircase hole. In so doing, we establish a…
Although most of the real networks contain a mixture of directed and bidirectional (reciprocal) connections, the reciprocity $r$ has received little attention as a subject of theoretical understanding. We study the expected reciprocity of…
We construct a combinatorial model that is described by the cube recurrence, a nonlinear recurrence relation introduced by Propp, which generates families of Laurent polynomials indexed by points in $\mathbb{Z}^3$. In the process, we prove…
We sketch the construction of a derived enhancement of the reciprocity isomorphism of class field theory. Details will appear in a forthcoming joint paper of the authors with A. Raksit.
We show that the reciprocal of a partial sum with 2m terms of the alternating exponential series is the exponential generating function for permutations in which every increasing run has length congruent to 0 or 1 modulo 2m. More generally…
This work applies the ideas of Alekseev and Meinrenken's Non-commutative Chern-Weil Theory to describe a completely combinatorial and constructive proof of the Wheeling Theorem. In this theory, the crux of the proof is, essentially, the…
We study reciprocity laws involving complex line bundles on fibrations in oriented circles. In particularly, we prove the following reciprocity law. Let $B$ be a complex manifold and $\pi_i : M_i \to B$ be a fibration in oriented circles,…
In this paper, we derive several formulas of counting families of non-intersecting paths for two-sided ladder-shaped regions. As an application, we give a new proof to a combinatorial interpretation of Fibonacci numbers obtained by G.…
We prove that the number of Hamiltonian paths on the complement of an acyclic digraph is equal to the number of cycle covers. As an application, we obtain a new expansion of the chromatic symmetric function of incomparability graphs in…
A generating function for reciprocal binomial coefficients is written down, integral representations of this function are obtained, generating functions for sums of reciprocal binomial coefficients are derived, new identities are obtained,…
We introduce an equivalence relation on the set of Dyck paths and some operations on them. We determine a formula for the cardinality of those equivalence classes and use this information to obtain a combinatorial formula for the number of…