Johann Cigler
Due to some results by John P. D Angelo and Dusty Grundmeier about CR- mappings the main results of my 2001 paper about recurrences for some sequences of binomial sums can be simplified.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We give a simplified presentation of some results about recurrences of certain sequences of binomial sums in terms of (generalized) Fibonacci and Lucas polynomials.
We deliver here H(x)binomials recurrence formula appointed by Ward Horadam sequence of functions which in mostly considered since decades cases where chosen to be polynomials .
Recently we had derived a new type generalized binomials mixed recurrence for primordial sequence case . Here we report on this new type mixed V and U binomials recurrence in brief.
We give some results and conjectures about recurrence relations for certain sequences of binomial sums.
The looked for V-binomials recurrence for Lucas companion to $U_n$ sequence $V_n$ is delivered
Binomial-Eulerian polynomials were introduced by Postnikov, Reiner and Williams. In this paper, properties of the binomial-Eulerian polynomials, including recurrence relations and generating functions are studied. We present three constructive proofs of the recurrence relations for binomial-Eulerian polynomials. Moreover, we give a combinatorial interpretation of the Betti number of the complement of the k-equal real hyperplane arrangement.
Abstract. We generalize the $b$-ary binomial coefficients with negative entries, which is based on the generating function obtained in early work. Besides an explicit expression involving the restricted partition, several properties such as symmetry, congruence and Pascal-like recurrence are studies. Finally, we also provide two different generalizations, partially satisfying Pascal-like recurrences.
We deliver here second new $\textit{H(x)}-binomials'$ recurrence formula, were $H(x)-binomials' $ array is appointed by $Ward-Horadam$ sequence of functions which in predominantly considered cases where chosen to be polynomials . Secondly, we supply a review of selected related combinatorial interpretations of generalized binomial coefficients. We then propose also a kind of transfer of interpretation of $p,q-binomial $ coefficients onto $q-binomial$ coefficients interpretations thus bringing us back to $Gy{ö}rgy Pólya $ and Donald Ervin Knuth relevant investigation decades ago.
The q-binomial coefficients were assumed to be unimodal as early as the 1850's, but it remained unproven until Sylvester's 1878 proof using invariant theory. In 1982, Proctor gave an "elementary" proof using linear algebra. Finally, in 1989, Kathy O'Hara provided a combinatorial proof of the unimodality of the q-binomial coefficients. Very soon thereafter, Doron Zeilberger translated the argument into an elegant recurrence. We introduce several perturbations to the recurrence to create a larger family of unimodal polynomials. We analyze how these perturbations affect the final polynomial and a…
The binomial interpolated transform of a sequence is a generalization of the well-known binomial transform. We examine a Pascal-like triangle, on which a binomial interpolated transform works between the left and right diagonals, focusing on binary recurrences. We give the sums of the elements in rows and in rising diagonals, further we define two special classes of these arithmetical triangles.
Sums of powers of binomials, their Apéry limits, and Franel's suspicions
本文显式确定了二项式系数幂和的Apéry极限，并在假设递归可通过创造性望远镜法获得的前提下，证明了关于这些序列递归阶的Franel猜想的最小阶版本。
In this paper we prove that a matrix property of nettedness (all 2x2 cells satisfy a recurrence) is preserved for powers of such a matrix, where the coefficients are all instances of the same sequence. Also, we find an n-dimensional analog of the Q-matrix for the general Pell(Fibonacci) sequence. We close by giving a conjecture about the spectral properties of the binomial matrix we found.
Modular binomials with an application to periodic sequences
本文利用二项式系数模素数幂的新递推关系研究模周期序列原语的演化，证明可归结为常数序列情形，并将其应用于分析维耶鲁《调式之书》中序列的原语动力学。
Modifying an idea of E. Brietzke we give simple proofs for the recurrence relations of some sequences of binomial sums which have previously been obtained by other more complicated methods.
In this paper, we show that the solution to a large class of "tiling" problems is given by a polynomial sequence of binomial type. More specifically, we show that the number of ways to place a fixed set of polyominos on an $n\times n$ toroidal chessboard such that no two polyominos overlap is eventually a polynomial in $n$, and that certain sets of these polynomials satisfy binomial-type recurrences. We exhibit generalizations of this theorem to higher dimensions and other lattices. Finally, we apply the techniques developed in this paper to resolve an open question about the structure of coef…
For a fixed integer N, and fixed numbers b_1,...,b_N, we consider sequences, the nth term (a_n) of which is the sum of the squares of the terms in the expansion of (b_1 + ... + b_N)^n. In the case all b_i=1, we give a formula for a recurrence relation for the a_n. Otherwise we give an algorithm for finding a recurrence relation. As an application, we give the Picard-Fuchs equations for certain families of elliptic curves.
In this study, we apply the binomial transforms to Tribonacci and Tribonacci-Lucas sequences. Also, the Binet formulas, summations, generating functions of these transforms are found using recurrence relations. Finally, we illustrate the relation between these transforms by deriving new formulas.
In this paper we study recurrences concerning the combinatorial sum $[n,r]_m=\sum_{k\equiv r (mod m)}\binom {n}{k}$ and the alternate sum $\sum_{k\equiv r (mod m)}(-1)^{(k-r)/m}\binom{n}{k}$, where m>0, $n\ge 0$ and r are integers. For example, we show that if $n\ge m-1$ then $$\sum_{i=0}^{\lfloor(m-1)/2\rfloor}(-1)^i\binom{m-1-i}i [n-2i,r-i]_m=2^{n-m+1}.$$ We also apply such results to investigate Bernoulli and Euler polynomials. Our approach depends heavily on an identity established by the author [Integers 2(2002)].
Recurrence Relations for Some Integer Sequences Related to Ward Numbers
本文研究了与Ward数相关的整数序列，给出了Ward-Lah数、变型Ward数和二项式Ward数等多种序列的三角递推关系、水平递推关系、生成函数及高阶递推关系。
On the binomial transforms of Apéry-like sequences
本文研究了15个类Apéry序列在$u_n\equiv α^n \pmod{N_α}$形式下的同余问题，通过二项式变换这一统一方法确定了所有序列的$\max\{N_α|α\in \mathbb{Z}\}$值。
Sums of products of binomial coefficients mod 2 and run length transforms of sequences
该研究推导了二项式系数乘积之和模2的递推关系，证明其生成序列为已知基本序列的游程长度变换，并给出正整数、斐波那契数等序列游程长度变换的公式。
Recurrence Relations for k-Fold Nested Power Sums
本文推导了k重嵌套幂和的递推关系，并讨论了其与已有研究成果的关联。
In this paper we find closed form for the generating function of powers of any non-degenerate second-order recurrence sequence, completing a study begun by Carlitz and Riordan in 1962. Moreover, we generalize a theorem of Horadam on partial sums involving such sequences. Also, we find closed forms for weighted (by binomial coefficients) partial sums of powers of any non-degenerate second-order recurrence sequences. As corollaries we give some known and seemingly unknown identities and derive some very interesting congruence relations involving Fibonacci and Lucas sequences.
Sums of products of binomial coefficients mod 2 and 2-regular sequences
本文证明了模2二项式系数乘积之和对应的线性递推序列游程长度变换是2-正则序列，从而利用计算机程序 Walnut 复现并扩展了 Wu 的结果，免去了冗长的技术证明。
Matrix products of binomial coefficients and unsigned Stirling numbers
本文研究二项式系数与无符号斯特林数构成的矩阵乘积和式，分析其闭式表达、组合解释、递推关系及多项式基变换系数意义。
On some series involving the binomial coefficients $\binom{3n}{n}$
该研究利用简单变换简化了Necdet Batir提出的含二项式系数$\binom{3n}{n}$的级数形式，给出新求值结果，建立其与Fibonacci数、黄金比例的关联，还推导了含该系数倒数的Fibonacci与Lucas级数。
The sequence of higher order Mersenne numbers and associated binomial transforms
本文提出高阶 Mersenne 整数序列，系统推导其 Binet 公式、恒等式、生成函数、求和关系及矩阵表示，并研究其二项式变换序列。
MacMahon's definition of self-inverse composition is extended to $n$-colour self-inverse composition. This introduces four new sequences which satisfy the same recurrence relation with different initial conditions like the famous Fibonacci and Lucas sequences. For these new sequences explicit formulas, recurrence relations, generating functions and a summation formula are obtained. Two new binomial identities with combinatorial meaning are also given.
We study a recursion that generates real sequences depending on a parameter $x$. Given a negative $x$ the growth of the sequence is very difficult to estimate due to canceling terms. We reduce the study of the recursion to a problem about a family of integral operators, and prove that for every parameter value except -1, the growth of the sequence is factorial. In the combinatorial part of the proof we show that when $x=-1$ the resulting recurrence yields the sequence of alternating Catalan numbers, and thus has exponential growth. We expect our methods to be useful in a variety of similar sit…
Multiple binomial sums
本文研究多重二项式和的生成函数有理函数积分表示，证明单变量序列为多重二项式和的充要条件，并提出判定其相等、计算递推的算法，规避离散创造性望远镜法的相关问题。
In this paper, we undertake a systematic study of recurrences x_{m+n}x_{m} = P(x_{m+1}, ..., x_{m+n-1}) which exhibit the Laurent phenomenon. Some of the most famous among these sequences come from the Somos and the Gale-Robinson recurrences. Our approach is based on finding period 1 seeds of Laurent phenomenon algebras of Lam-Pylyavskyy. We completely classify polynomials P that generate period 1 seeds in the cases of n=2,3 and of mutual binomial seeds. We also find several other interesting families of polynomials P whose generated sequences exhibit the Laurent phenomenon. Our classification…
Let s and t be variables. Define polynomials {n} in s, t by {0}=0, {1}=1, and {n}=s{n-1}+t{n-2} for n >= 2. If s, t are integers then the corresponding sequence of integers is called a Lucas sequence. Define an analogue of the binomial coefficients by C{n,k}={n}!/({k}!{n-k}!) where {n}!={1}{2}...{n}. It is easy to see that C{n,k} is a polynomial in s and t. The purpose of this note is to give two combinatorial interpretations for this polynomial in terms of statistics on integer partitions inside a k by n-k rectangle. When s=t=1 we obtain combinatorial interpretations of the fibonomial coeffic…
The Behavior of a Three-Term Hofstadter-Like Recurrence with Linear Initial Conditions
本文研究三项类Hofstadter递归在两类线性初始条件下的行为，发现当初始项数N足够大时可完全刻画序列，且序列均为有限。
Tuenter [Fibonacci Quarterly 40 (2002), 175-180] and other authors have considered centred binomial sums of the form \[S_r(n) = \sum_k \binom{2n}{k}|n-k|^r,\] where $r$ and $n$ are non-negative integers. We consider sums of the form \[U_r(n) = \sum_k \binom{n}{k}|n/2-k|^r\] which are a generalisation of Tuenter's sums as $S_r(n) = U_r(2n)$ but $U_r(n)$ is also well-defined for odd arguments $n$. $U_r(n)$ may be interpreted as a moment of a symmetric Bernoulli random walk with $n$ steps. The form of $U_r(n)$ depends on the parities of both $r$ and $n$. In fact, $U_r(n)$ is the product of a poly…
Some applications of a result, which is proved recently, is considered. We first prove three determinantal identities concerning the binomial coefficient and Stirling numbers of the first and the second kind. We also easily obtain the inverse of the Vandermonde matrix. Then we derive a recurrence formula for sums of powers, which is similar to the well-known Newton identity. In the last section, we consider some sequences given by a homologous linear recurrence equation. A determinantal identity for the Fibonacci numbers of higher order is proved. We finish with an expression of the generalize…
In this study, depending on the upper and the lower indices of the hyperharmonic number $h_{n}^{(r)}$, nonlinear recurrence relations are obtained. It is shown that generalized harmonic number and hyperharmonic number can be obtained from derivatives of the binomial coefficients. Taking into account of difference and derivative operators, several identities of the harmonic and hyperharmonic numbers are given. Negative-ordered hyperharmonic number is defined and its alternative representations are given.
This paper is devoted to the study of the log-convexity of combinatorial sequences. We show that the log-convexity is preserved under componentwise sum, under binomial convolution, and by the linear transformations given by the matrices of binomial coefficients and Stirling numbers of two kinds. We develop techniques for dealing with the log-convexity of sequences satisfying a three-term recurrence. We also introduce the concept of $q$-log-convexity and establish the connection with linear transformations preserving the log-convexity. As applications of our results, we prove the log-convexity …
We study a polynomial sequence $C_n(x|q)$ defined as a solution of a $q$-difference equation. This sequence, evaluated at $q$-integers, interpolates Carlitz-Riordan's $q$-ballot numbers. In the basis given by some kind of $q$-binomial coefficients, the coefficients are again some $q$-ballot numbers. We obtain in a combinatorial way another curious recurrence relation for these polynomials.
We study two families of sequences, listed in the On-Line Encyclopedia of Integer Sequences (OEIS), which are associated to invariant theory of Lie algebras. For the first family, we prove combinatorially that the sequences A059710 and A108307 are related by a binomial transform. Based on this, we present two independent proofs of a recurrence equation for A059710, which was conjectured by Mihailovs. Besides, we also give a direct proof of Mihailovs' conjecture by the method of algebraic residues. As a consequence, closed formulae for the generating function of sequence A059710 are obtained in…
This paper is about counting the number of distinct (scattered) subwords occurring in a given word. More precisely, we consider the generalization of the Pascal triangle to binomial coefficients of words and the sequence $(S(n))_{n\ge 0}$ counting the number of positive entries on each row. By introducing a convenient tree structure, we provide a recurrence relation for $(S(n))_{n\ge 0}$. This leads to a connection with the $2$-regular Stern-Brocot sequence and the sequence of denominators occurring in the Farey tree. Then we extend our construction to the Zeckendorf numeration system based on…
A polynomial triangle is an array whose inputs are the coefficients in integral powers of a polynomial. Although polynomial coefficients have appeared in several works, there is no systematic treatise on this topic. In this paper we plan to fill this gap. We describe some aspects of these arrays, which generalize similar properties of the binomial coefficients. Some combinatorial models enumerated by polynomial coefficients, including lattice paths model, spin chain model and scores in a drawing game, are introduced. Several known binomial identities are then extended. In addition, we calculat…
q-Parikh Matrices and q-deformed binomial coefficients of words
本文引入并研究了词的q-二项式系数和q-Parikh矩阵，推广了经典Parikh矩阵结果，证明了收敛性、递推关系及子式性质，并比较了任意词与规范词的矩阵。
Three short proofs of Mathar's 2014 conjecture for OEIS A002627
本文通过三种简短方法证明了OEIS A002627序列的二阶齐次递推关系，展示了通过恒等式消去常数、指数生成函数和二项式求和形式的推导过程。
$m$-Bell and $m$-Stirling numbers: Iterated binomial transforms, hyper-Bessel functions, and moments of the Conway--Maxwell--Poisson distribution
该研究推广贝尔数得到m-贝尔数，构造m-斯特林三角阵列并证明相关结构定理，还揭示m-贝尔数对应康威-麦克斯韦-泊松分布（ν=m）的矩，拓展了相关数论与概率分布的联系。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。