Related papers: Combinatorial reciprocity for non-intersecting pat…
We prove a spectral reciprocity formula for automorphic forms on $\mathrm{GL}(2)$ over a number field that is remininscent of the one found by Blomer and Khan. Our approach uses period representations of $L$-functions and the language of…
Reciprocity in social networks helps understand information exchange between two individuals, and indicates interaction patterns between pairs of users. A recent study indicates the reciprocity coefficient of a classical directed…
Interaction nets are a form of restricted graph rewrite system that can serve as a graphical or textual programming language. As such, benefits include one-step confluence, ease of parallelism and explicit garbage collection. However, some…
This document presents a combinatorial framework for analyzing assembly systems using generating functions. We explore the theory through concrete examples, such as linear polymers, and develop recursive equations to characterize valid…
We present a new proof of the celebrated quadratic reciprocity law. Our proof is based on group theory.
We use Grothendieck theorem to prove a structure theorem for multicorrelation sequences of length two, associated with two (not necessarily commuting) measure preserving actions on a probability space. We use this to deduce a multiple…
In enumerative combinatorics, it is often a goal to enumerate both labeled and unlabeled structures of a given type. The theory of combinatorial species is a novel toolset which provides a rigorous foundation for dealing with the…
We conjecture an explicit formula for the higher dimensional Dirichlet character; the formula is based on the K-theory of the so-called noncommutative tori. It is proved, that our conjecture is true for the two-dimensional and…
We study the backward scatterings of plane waves by reciprocal scatterers and reveal that $n$-fold ($n\geq3$) rotation symmetry is sufficient to secure invariant backscattering for arbitrarily-polarized incident plane waves. It is further…
A well-known combinatorial theorem says that a set of n non-collinear points in the plane determines at least n distinct lines. Chen and Chv\'atal conjectured that this theorem extends to metric spaces, with an appropriated definition of…
We define new families of noncommutative symmetric functions and quasi-symmetric functions depending on two matrices of parameters, and more generally on parameters associated with paths in a binary tree. Appropriate specializations of both…
In this paper we prove a sufficient condition for the existence of matchings in arbitrary groups and its linear analogue, which lead to some generalizations of the existing results in the theory of matchings in groups and central extensions…
We give a combinatorial interpretation of a certain positivity conjecture of Chern-Schwartz-MacPherson classes, as stated by P. Aluffi and the author in a previous paper. It translates into a positivity property for a sum of p by p…
We prove some functional equations involving the (classical) matching polynomials of path and cycle graphs and the $d$-matching polynomial of a cycle graph. A matching in a (finite) graph $G$ is a subset of edges no two of which share a…
We generalize the shuffle theorem and its $(km,kn)$ version, as conjectured by Haglund et al. and Bergeron et al., and proven by Carlsson and Mellit, and Mellit, respectively. In our version the $(km,kn)$ Dyck paths on the combinatorial…
We consider the problem of enumeration of planar maps and revisit its one-matrix model solution in the light of recent combinatorial techniques involving conjugated trees. We adapt and generalize these techniques so as to give an…
We discuss, on general grounds, how two subgraphs of a given Feynman graph can overlap with each other. For this, we use the notion of connecting and returning lines that describe how any subgraph is inserted within the original graph.…
The purpose of this paper is to extend the scope of the Ehrhart theory to periodic graphs. We give sufficient conditions for the growth sequences of periodic graphs to be a quasi-polynomial and to satisfy the reciprocity laws. Furthermore,…
Using the reflection formula of the Gamma function, we derive a new formula for the Taylor coefficients of the reciprocal Gamma function. The new formula provides effective asymptotic values for the coefficients even for very small values…
We consider the inverse boundary value problem in the case of discrete electrical networks containing nonlinear (non-ohmic) resistors. Generalizing work of Curtis, Ingerman, Morrow, Colin de Verdiere, Gitler, and Vertigan, we characterize…