Related papers: Combinatorial reciprocity for non-intersecting pat…

Given a specific collection of curves on an oriented surface with punctures, we associate a power series by counting its intersections with multicurves. This paper presents a reciprocity formula on the power series when multicurves with no…

The classical Chung-Feller theorem [2] tells us that the number of Dyck paths of length $n$ with $m$ flaws is the $n$-th Catalan number and independent on $m$. In this paper, we consider the refinements of Dyck paths with flaws by four…

Heckman and Opdam introduced a non-symmetric analogue of Jack polynomials using Cherednik operators. In this paper, we derive a simple recursion formula for these polynomials and formulas relating the symmetric Jack polynomials with the…

In this paper we present a combinatorial proof of the Kronecker--Weber Theorem for global fields of positive characteristic. The main tools are the use of Witt vectors and their arithmetic developed by H. L. Schmid. The key result is to…

In this article we prove several reciprocity theorems for some infinite-dimensional dual pairs of representations on Bargmann-Segal-Fock spaces.

In this work we introduce reciprocity functors, construct the associated K-group of a family of reciprocity functors, which itself is a reciprocity functor, and compute it in several different cases. It may be seen as a first attempt to get…

We introduce a notion of Dyck paths with coloured ascents. For several ways of colouring, we establish bijections between sets of such paths and other combinatorial structures, such as non-crossing trees, dissections of a convex polygon,…

Asymmetric relational data is increasingly prevalent across diverse fields, underscoring the need for directed network models to address the complex challenges posed by their unique structures. Unlike undirected models, directed models can…

One of the key contributions of the 1972 seminal paper by Willems was the analysis of symmetry (also called reciprocity) of input-state-output systems, both from an external (input-output) and internal (state) point of view. The developed…

On a Riemann surface there are relations among the periods of holomorphic differential forms, called Riemann's relations. If one looks carefully in Riemann's proof, one notices that he uses iterated integrals. What I have done in this paper…

This paper proves a reciprocity formula for modular inverses for non-zero integers and demonstrates some applications of the reciprocity formula in calculating or verifying some modular inverses of specific forms, including the modular…

Motivated by the problem of giving a bijective proof of the fact that the birational RSK correspondence satisfies the octahedron recurrence, we define interlacing networks, which are certain planar directed networks with a rigid structure…

The reciprocal class of a Markov path measure is the set of all mixtures of its bridges. We give characterizations of the reciprocal class of a continuous-time Markov random walk on a graph. Our main result is in terms of some reciprocal…

We prove Menger-type results in which the obtained paths are pairwise non-adjacent, both for graphs of bounded maximum degree and, more generally, for graphs excluding a topological minor. We further show better bounds in the subcubic case,…

Using noncommutative deformed canonical commutation relations, a model describing a noncommutative complex scalar field theory is considered. Using the path integral formalism, the noncommutative free and exact propagators are calculated to…

Keller's theorem relates the components of the macroscopic dielectric response of a binary two-dimensional composite system with those of the reciprocal system obtained by interchanging its components. We present a derivation of the theorem…

Nonreciprocal theories are used to model a broad array of non-equilibrium phenomena found in nature ranging from biological systems like networks of neurons to the behavior of overflowing water fountains. This includes systems broadly…

The notion of noncrossing linked partition arose from the study of certain transforms in free probability theory. It is known that the number of noncrossing linked partitions of [n+1] is equal to the n-th large Schroder number $r_n$, which…

In this paper we prove a combinatorial theorem for finite labellings of trees, and show that it is equivalent to a theorem for finite covers of metric trees and a fixed point theorem on metric trees. We trace how these connections mimic the…

We give a parity reversing involution on noncrossing trees that leads to a combinatorial interpretation of a formula on noncrossing trees and symmetric ternary trees in answer to a problem proposed by Hough. We use the representation of…