Dominique Foata, Doron Zeilberger
By practicing the philosophy of our beloved late master, Marco Schutzenberger, to whose memory this article is dedicated, we give an insightful bijective proof of the three-term recurrence satisfied by the Hipparchus-Schroeder numbers 1,1,3,11,45,197,903, ...
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
It is well known that the derangement numbers $d_n$, which count permutations of length $n$ with no fixed points, satisfy the recurrence $d_n=nd_{n-1}+(-1)^n$ for $n\ge1$. Combinatorial proofs of this formula have been given by Remmel, Wilf, Désarménien and Benjamin--Ornstein. Here we present yet another, arguably simpler, bijective proof.
We describe a recurrence formula for the plethysm $h_3[h_n]$. The proof is based on the original formula by Thrall.
A short proof of Mathar's 2013 recurrence conjecture for the reversible-binary-string sequence A032123
本文通过Burnside引理证明了A032123序列的递推猜想，推导出闭式表达式并验证了Mathar的五阶递推关系。
Stanley, building on work of Stern, defined an array of numbers by the recurrence $s(n, 2k) = s(n-1, k)$, $s(n, 2k+1) = s(n-1, k) + s(n-1, k+1)$. Stanley showed that, for each positive integer $r$, the sequence $s_n^r:= \sum_k s(n,k)^r$ obeys a homogeneous linear recurrence in $n$ of length $r/2+O(1)$. Numerical evidence, however, suggested that $s_n^r$ obeys shorter recurrences, of length $r/3+O(1)$. We prove Stanley's conjecture.
A short proof of Mathar's 2013 recurrence conjecture for the Laguerre sequence~A025166
本文给出 OEIS 序列 A025166 的递推关系的简短证明，通过生成函数和微分方程推导出 Mathar 的猜想。
PED and POD partitions: combinatorial proofs of recurrence relations
本文用组合方法重新证明了PED与POD分拆的多项递推关系、五边形数定理及Beck型恒等式，弥补了此前仅依赖解析证明的不足。
A short proof of the equivalence of the recurrence of non-backtracking random walk and that of simple random walk on regular infinite graphs is given. It is then shown how this proof can be extended in certain cases where the graph in question is not regular.
Combinatorial proofs on the joint distribution of descents and inverse descents
本文通过观察排列网格的内部结构，给出了 $A_{n,i,j}$ 递推关系的组合证明，并利用该构造性方法进一步得到对合数 $I_{n,k}$ 与不动点自由对合数 $J_{2n,k}$ 递推关系的组合解释。
Schreier-Type Sets and Linear Recurrences: Connections and Developments
本文展示多种从计数Schreier型集合中证明线性递归的技术，包括公式法、双射证明、数学归纳、容斥原理和特征多项式法，并研究了对称极大Schreier集、含指定整数的Schreier集及避免等差数列的Schreier集。
A short proof of Mathar's 2020 recurrence conjecture for the generalized-Stirling sequence A001711
本文提供了一个简短的证明，验证了Mathar对广义斯特林序列A001711的递推猜想，通过谐波数闭式表达式简化了递推关系，证明了其成立。
Naturally emerging maps for derangements and nonderangements
本文研究错排与非错排的递推式，提出基于递归映射的双射证明，揭示其组合解释与对合性质，并将错排双射证明转化为非错排情形。
We answer the question in the title in the negative by providing four proofs.
In this article we provide with combinatorial proofs of some recent identities due to Sury and McLaughlin. We show that, the solution of a general linear recurrence with constant coefficients can be interpreted as a determinant of a matrix. Also, we derive a determinantal expression of Fibonacci and Lucas numbers. We prove Binets formula for Fibonacci and Lucas numbers in a purely combinatorial way and in course of doing so, we find a determinantal identity, which we think to be new.
Riordan paths are Motzkin paths without horizontal steps on the x-axis. We establish a correspondence between Riordan paths and $(321,3\bar{1}42)$-avoiding derangements. We also present a combinatorial proof of a recurrence relation for the Riordan numbers in the spirit of the Foata-Zeilberger proof of a recurrence relation on the Schröder numbers.
We define the_hive ring_, which has a basis indexed by dominant weights for GL(n), and structure constants given by counting hives [KT1] (or equivalently honeycombs, or Berenstein-Zelevinsky patterns [BZ1]). We use the octahedron rule from [Robbins-Rumsey,Fomin-Zelevinsky,Propp,Speyer] to prove bijectively that this "ring" is indeed associative. This, and the Pieri rule, give a self-contained proof that the hive ring is isomorphic as a ring-with-basis to the representation ring of GL(n). In the honeycomb interpretation, the octahedron rule becomes "scattering" of the honeycombs. This recovers …
We give recurrence relations for any family of generalized Appell polynomials unifying so some known recurrences of many classical sequences of polynomials. Our main tool to get our goal is the Riordan group. We use the product of Riordan matrices to interpret some relationships between different families of polynomials. Moreover using the Hadamard product of series we get a general recurrence relation for the polynomial sequences associated to the so called generalized umbral calculus.
We provide guessed recurrence equations for the counting sequences of rook paths on d-dimensional chess boards starting at (0..0) and ending at (n..n), where d=2,3,...,12. Our recurrences suggest refined asymptotic formulas of these sequences. Rigorous proofs of the guessed recurrences as well as the suggested asymptotic forms are posed as challenges to the reader.
A short proof of Mathar's 2021 recurrence conjecture for the Lehmer-Comtet diagonal A045406
本文证明了Mathar 2021年提出的关于Lehmer-Comtet三角形A008296列2对角线A045406的二阶P-递推关系，利用Harmonic数闭形式简化了递推式，验证了其正确性。
We prove that the frieze sequences of cluster variables associated with the vertices of an affine quiver satisfy linear recurrence relations. In particular, we obtain a proof of a recent conjecture by Assem-Reutenauer-Smith.
Pisot sequences (sequences $a_n$ with initial terms $a_0=x, a_1=y$, and defined for $n>1$ by $a_n= \lfloor a_{n-1}^2/a_{n-2} + \frac{1}{2} \rfloor$) often satisfy linear recurrences with constant coefficients that are valid for all $n \geq 0$, but there are also cautionary examples where there is a linear recurrence that is valid for an initial range of values of $n$ but fails to be satisfied beyond that point, providing further illustrations of Richard Guy's celebrated "Strong Law of Small Numbers". In this paper we present a decision algorithm, fully implemented in an accompanying Maple prog…
We prove that the problem of deciding whether a given morphic sequence is uniformly recurrent is decidable. The proof uses decidability of HD0L periodicity problem, which was recently proved in papers of F.Durand and I.Mitrofanov.
In this note we present a proof of multiple recurrence for ergodic systems (and thereby of Szemerédi's theorem) being a mixture of three known proofs. It is based on a conditional version of the Jacobs-de Leeuw-Glicksberg decomposition and properties of the Gowers-Host-Kra uniformity seminorms.
In this paper we introduce the so-called truncated very-well-poised $_6ψ_6$ series and set up an explicit recurrence relation for it by means of the classical Abel lemma on summation by parts. This new recurrence relation implies an elementary proof of Bailey's well-known $_6ψ_6$ summation formula.
The On-Line Encyclopedia Of Integer Sequences , that wonderful resource that most combinatorialists, and many other mathematicians and scientists, use at least once a day, is a treasure trove of mathematical information, and, one of its charms is that it contains many intriguing conjectures. But one should be on one's guard, because some of the conjectures are either already theorems, or can be routinely proved. In this case study we demonstrate, and actually fully implement (in an accompanying Maple package), how to turn many conjectures made in the OEIS by R.J. Mathar, regarding linear recur…
We consider a family of nonlinear rational recurrences of odd order which was introduced by Heideman and Hogan. All of these recurrences have the Laurent property, implying that for a particular choice of initial data (all initial values set to 1) they generate an integer sequence. For these particular sequences, Heideman and Hogan gave a direct proof of integrality by showing that the terms of the sequence also satisfy a linear recurrence relation with constant coefficients. Here we present an analogous result for the general solution of each of these recurrences.
We propose a new definition of effective formulas for problems in enumerative combinatorics. We outline the proof of the fact that every linear recurrence sequence of integers has such a formula. It follows from a lower bound that can be deduced from the Skolem-Mahler-Lech theorem and the Subspace Theorem. We will give details of this deduction that is due to P. Corvaja in the full version of this extended abstract.
Recurrence properties of systems and associated sets of integers that suffice for recurrence are classical objects in topological dynamics. We describe relations between recurrence in different sorts of systems, study ways to formulate finite versions of recurrence, and describe connections to combinatorial problems. In particular, we show that sets of Bohr recurrence (meaning sets of recurrence for rotations) suffice for recurrence in nilsystems. Additionally, we prove an extension of this property for multiple recurrence in affine systems.
In 1975 Szemerédi proved the long-standing conjecture of Erdős and Turán that any subset of $\bbZ$ having positive upper Banach density contains arbitrarily long arithmetic progressions. Szemerédi's proof was entirely combinatorial, but two years later Furstenberg gave a quite different proof of Szemerédi's Theorem by first showing its equivalence to an ergodic-theoretic assertion of multiple recurrence, and then bringing new machinery in ergodic theory to bear on proving that. His ergodic-theoretic approach subsequently yielded several other results in extremal combinatorics, as well as revea…
The Hofstadter Q-sequence, with its simple definition, has defied all attempts at analyzing its behavior. Defined by a simple nested recurrence and an initial condition, the sequence looks approximately linear, though with a lot of noise. But, nobody even knows whether the sequence is infinite. In the years since Hofstadter published his sequence, various people have found variants with predictable behavior. Oftentimes, the resulting sequence looks complicated but provably grows linearly. Other times, the sequences are eventually linear recurrent. Proofs describing the behaviors of both types …
We exhibit proofs of two ergodic-theoretic results in the study of multiple recurrence using an analog of the density-increment argument of Roth and Gowers: Furstenberg's Multiple Recurrence Theorem (which implies Szemerédi's Theorem), and a two-dimensional special case of Furstenberg and Katznelson's multidimensional version of this theorem. The second of these requires also an analog of some recent finitary work by Shkredov. Many proofs of these multiple recurrence theorems are now known, but our main goal is to shed some further light on the heuristic correspondence principle that has grown…
The problem of counting ramified covers of a Riemann surface up to homeomorphism was proposed by Hurwitz in the late 1800's. This problem translates combinatorially into factoring a permutation of specified cycle type, with certain conditions on the cycle types of the factors, such as minimality and transitivity. Goulden and Jackson have given a proof for the number of minimal, transitive factorizations of a permutation into transpositions. This proof involves a partial differential equation for the generating series, called the Join-Cut equation. Recently, Bousquet-Mélou and Schaeffer have fo…
We consider the following question: Which real sequences (a(n)) that satisfy a linear recurrence with constant coefficients are positive for sufficiently large n? We show that the answer is negative for both (a(n)) and (-a(n)), if the dominating characteristic roots in the representation of a(n) as a generalized power sum comprise either two pairs of conjugate complex roots or one negative real root and one pair of conjugate complex roots. The proof uses results from Diophantine approximation and the geometry of numbers. Concerning the case of a real positive dominating root we show what the a…
The paper contains a combinatorial theorem (the sequence of Newton polygons of a reccurent sequence of polynomials is quasi-linear) and two applications of it in classical and quantum topology, namely in the behavior of the $A$-polynomial and a fixed quantum invariant (such as the Jones polynomial) under filling. Our combinatorial theorem, which complements results of Calegari-Walker \cite{CW} and the author \cite{Ga4}, occupies the bulk of the paper and its proof requires the Lech-Mahler-Skolem theorem of $p$-adic analytic number theory combined with basic principles in polyhedral and tropica…
Proof of Irvine's Conjecture via Mechanized Guessing
本文利用机械化猜测与验证方法，结合定理证明器Walnut，成功证明了Sean A. Irvine关于非线性递归的猜想。
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 descriptions in terms of how often each value in the sequence occurs. In this paper, we generalize the most classical examples to a larger family of sequences parametrized by linear recurrence relations. Each of our sequences can be constructed in three different ways: via a nested recurrence relation, from labeled infinite trees, or by using Zeckendorf-like strin…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。