Related papers: Linear recurrences for cylindrical networks

In this article, we prove a representation theorem that any generic line arrangement in the plane over an ordered field which has global cyclicity can be represented isomorphically by a line arrangement with a given set of distinct slopes…

We prove a combinatorial reciprocity theorem for the enumeration of non-intersecting paths in a linearly growing sequence of acyclic planar networks. We explain two applications of this theorem: reciprocity for fans of bounded Dyck paths,…

We show that given any tiling of Euclidean space, any geometric patterns of points, we can find a patch of tiles (of arbitrarily large size) so that copies of this patch appear in the tiling nearly centered on a scaled and translated…

This paper is concerned with the concept of linear repetitivity in the theory of tilings. We prove a general uniform subadditive ergodic theorem for linearly repetitive tilings. This theorem unifies and extends various known (sub)additive…

In this paper we study the inverse Dirichlet-to-Neumann problem for certain cylindrical electrical networks. We define and study a birational transformation acting on cylindrical electrical networks called the electrical $R$-matrix. We use…

We show that any graph polynomial from a wide class of graph polynomials yields a recurrence relation on an infinite class of families of graphs. The recurrence relations we obtain have coefficients which themselves satisfy linear…

In 2015, Chen, Liang and Wang provided several sufficient conditions for the total positivity of Riordan arrays and asked for combinatorial proofs of these results. In this paper, we present such proofs by constructing suitable planar…

We present a multidimensional generalization of Zeckendorf's Theorem (any positive integer can be written uniquely as a sum of non-adjacent Fibonacci numbers) to a large family of linear recurrences. This extends work of Anderson and…

We provide a proof of the Alpern multi-tower theorem for Z^d actions. We reformulate the theorem as a problem of measurably tiling orbits of a Z^d action by a collection of rectangles whose corresponding sides have no non-trivial common…

We use the homological perturbation lemma to give an explicit proof of the cyclic Eilenberg-Zilber theorem for cylindrical modules.

We define a triangular array closely related to Stern's diatomic array and show that for a fixed integer $r\geq 1$, the sum $u_r(n)$ of the $r$th powers of the entries in row $n$ satisfy a linear recurrence with constant coefficients. The…

We extend the authors' previous work on Wiener-Wintner double recurrence theorem to the case of polynomials.

The linear transports along paths in vector bundles introduced in Ref. [1] are applied to the special case of tensor bundles over a given differentiable manifold. Links with the transports along paths generated by derivations of tensor…

We complete the proof of a theorem we announced and partly proved in [Math. Nachr. 271 (2004), 69-90, math.AG/0111299]. The theorem concerns a family of curves on a family of surfaces. It has two parts. The first was proved in that paper.…

A tuple (s1,t1,s2,t2) of vertices in a simple undirected graph is 2-linked when there are two vertex-disjoint paths respectively from s1 to t1 and s2 to t2. A graph is 2-linked when all such tuples are 2-linked. We give a new and simple…

We formulate and prove a general recurrence relation that applies to integrals involving orthogonal polynomials and similar functions. A special case are connection coefficients between two sets of orthonormal polynomials, another example…

We use a construction which we call generalized cylinders to give a new proof of the fundamental theorem of hypersurface theory. It has the advantage of being very simple and the result directly extends to semi-Riemannian manifolds and to…

Many polynomial invariants are defined on graphs for encoding the combinatorial information and researching them algebraically. In this paper, we introduce the cycle polynomial and the path polynomial of directed graphs for counting cycles…

We prove a stronger version of Jarden's Theorem for recurrence of powers of recursive functions

The multitime multiple recurrences are common in analysis of algorithms, computational biology, information theory, queueing theory, filters theory, statistical physics etc. The theoretical part about them is little or not known. That is…