Related papers: Combinatorial reciprocity for non-intersecting pat…
For an arithmetical function $f$, its Ramanujan expansion is a series expansion in the form $f(n)=\sum\limits_{k=1}^{\infty}a(k) c_k(n)$ where $a(k)$ are complex numbers and $c_k(n):= \sum\limits_{\substack{m=1\\(m, k)=1}}^{k}e^{\frac{2\pi…
Overrepresentation of bidirectional connections in local cortical networks has been repeatedly reported and is in the focus of the ongoing discussion of non-random connectivity. Here we show in a brief mathematical analysis that in a…
We prove a combination theorem for PD(n)-pairs.
For an acyclic quiver with three vertices, we consider the canonical decomposition of a non-Schurian root and associate certain representations of a generalized Kronecker quiver. These representations correspond to points contained in the…
We relate the combinatorics of periodic generalized Dyck and Motzkin paths to the cluster coefficients of particles obeying generalized exclusion statistics, and obtain explicit expressions for the counting of paths with a fixed number of…
Evolutionary game theory predicts that cooperation in social dilemma games is promoted when agents are connected as a network. However, when networks are fixed over time, humans do not necessarily show enhanced mutual cooperation. Here we…
We consider shifts of a set $A\subseteq\mathbb{N}$ by elements from another set $B\subseteq\mathbb{N}$, and prove intersection properties according to the relative asymptotic size of $A$ and $B$. A consequence of our main theorem is the…
In this paper, we mainly consider a combinatoric explanation for block Pfaffians in terms of non-intersecting paths, as a generalization of results obtained by Stembridge. As applications, we demonstrate how are generating functions of…
We make a systematic study of a new combinatorial construction called a dual equivalence graph. We axiomatize these graphs and prove that their generating functions are symmetric and Schur positive. This provides a universal method for…
We present a probabilistic generative model and efficient algorithm to model reciprocity in directed networks. Unlike other methods that address this problem such as exponential random graphs, it assigns latent variables as community…
We prove a conjecture of A. Goncharov concerning strong Suslin reciprocity law. The main idea of the proof is the construction of the norm map on so-called lifted reciprocity maps. This construction is similar to the construction of the…
Reciprocal arcs represent the lowest order cycle possible to find in directed graphs without self-loops. Representing also a measure of feed-back between vertices, it is interesting to understand how reciprocal arcs influence other…
A new proof for adjoint systems of linear equations is presented. The argument is built on the principles of Algorithmic Differentiation. Application to scalar multiplication sets the base line. Generalization yields adjoint inner vector,…
Considering commutator monomials of the non-commutative associative variables $X_1,\ldots,X_n$; we determine the maximal possible number of alternating associative monomials in their noncommutative polynomial expansions. This is achieved by…
In his Ph.D. thesis, Ira Gessel proved a reciprocity formula for noncommutative symmetric functions which enables one to count words and permutations with restrictions on the lengths of their increasing runs. We generalize Gessel's theorem…
We evaluate in closed form several classes of finite trigonometric sums. Two general methods are used. The first is new and involves sums of roots of unity. The second uses contour integration and extends a previous method used by two of…
Schutzenberger's theorem for the ordinary RSK correspondence naturally extends to Chen et. al's correspondence for matchings and partitions. Thus the counting of bilaterally symmetric $k$-noncrossing partitions naturally arises as an…
In this paper, we establish some reciprocity formulas for certain generalized Hardy-Berndt sums by using the Fourier series technique and some properties of the periodic zeta function and the Lerch zeta function. It turns out that one of…
We analyze the mixing properties of growing networks and find that, in some cases, the assortativity patterns are reversed once links' direction is considered: the disassortative behavior observed in such networks is a spurious effect, and…
In this paper, we study the graph polynomial that counts spanning rooted forests f_g of a given graph. This polynomial has a remarkable reciprocity property. We give a new bijective proof for this theorem which has Prufer coding as a…