Related papers: Integrality and the Laurent phenomenon for Somos 4…
Labeled infinite trees provide combinatorial interpretations for many integer sequences generated by nested recurrence relations. Typically, such sequences are monotone increasing. Several of these sequences also have straightforward…
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…
Let $\{U(m)\}_{m\in \N}$ and $\{V(n)\}_{n\in \N}$ be linear recurrence sequences. It is a well-known Diophantine problem to determine the finiteness of the set of natural numbers $n$ such that the ratio $U(n)/V(n)$ is an integer. We study…
Set coherence is a basis-independent relational form of quantum coherence: a finite family of quantum states is set incoherent exactly when all its members are diagonal in one common basis. We determine how much low-order Bargmann data are…
We prove various congruences for Catalan and Motzkin numbers as well as related sequences. The common thread is that all these sequences can be expressed in terms of binomial coefficients. Our techniques are combinatorial and algebraic:…
For almost a century, the decidability of the Skolem Problem - that is, the problem of finding whether a given linear recurrence sequence (LRS) has a zero term - has remained open. A breakthrough in the 1980s established that the Skolem…
We construct fast algorithms for evaluating transforms associated with families of functions which satisfy recurrence relations. These include algorithms both for computing the coefficients in linear combinations of the functions, given the…
We show that Laurent biorthogonal polynomials whose defining three-term recurrence have constant coefficients have coefficient arrays that are Riordan arrays. For each such family of Laurent biorthogonal polynomials we associate in a…
In the present paper, we are interested in classifying of Collatz sequences on based to the different behavior of these sequences when their lengths tend to infinity. A Collatz infinite sequence can be defined as an infinite ordered set of…
We consider a two dimensional extension of the so-called linearizable mappings. In particular, we start from the Heideman-Hogan recurrence, which is known as one of the linearizable Somos-like recurrences, and introduce one of its two…
Generalized quantum cluster algebras introduced in [1] are quantum deformation of generalized cluster algebras of geometric types. In this paper, we prove that the Laurent phenomenon holds in these generalized quantum cluster algebras. We…
We consider frieze sequences corresponding to sequences of cluster mutations for affine D and E type quivers. We show that the cluster variables satisfy linear recurrences with periodic coefficients, which imply the constant coefficient…
We provide an elementary proof to a conjecture by Robinson that multiples of (powers of) primes in the Somos-4 sequence are equally spaced. We also show, almost as a corollary, for the generalised Somos-4 sequence defined by…
We show that the coefficients of the three-term recurrence relation for orthogonal polynomials with respect to a semi-classical extension of the Laguerre weight satisfy the fourth Painlev\'e equation when viewed as functions of one of the…
Associated to any acyclic cluster algebra is a corresponding triangulated category known as the cluster category. It is known that there is a one-to-one correspondence between cluster variables in the cluster algebra and exceptional…
For rings R with identity, we define a class of nonlinear higher order recurrences on unitary left R-modules that include linear recurrences as special cases. We obtain conditions under which a recurrence of order k+1 in this class is…
This paper aims to employ a cluster-theoretic approach to provide a class of Diophantine equations whose solutions can be obtained by starting from initial solutions through mutations. We establish a novel framework bridging cluster theory…
Let $\Sigma$ be Laurent phenomenon (LP) seed of rank $n$, $\mathcal{A}(\Sigma)$, $\mathcal{U}(\Sigma)$ and $\mathcal{L}(\Sigma)$ be its corresponding Laurent phenomenon algebra, upper bound and lower bound respectively. We prove that each…
We answer the question in the title in the negative by providing four proofs.
We introduce a sequent calculus with a simple restriction of Lambek's product rules that precisely captures the classical Tamari order, i.e., the partial order on fully-bracketed words (equivalently, binary trees) induced by a…