Squaring the terms of an $\ell^{th}$ order linear recurrence
英文摘要:
We find an explicit formula for the generating function for the squaring the terms of an $\ell^{th}$ order linear recurrence.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。
Toufik Mansour
We find an explicit formula for the generating function for the squaring the terms of an $\ell^{th}$ order linear recurrence.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。
继续探索
Recurrence and congruences for the smallest parts function
本文基于Hecke迹研究最小部分函数的递归公式,并推导出同余表达式,同时证明了该函数的非同余性质。
We provide various counter examples for quantitative multiple recurrence problems for systems with more than one transformation. We show that $\bullet$ There exists an ergodic system $(X,\mathcal{X},μ,T_1,T_2)$ with two commuting transformations such that for every $0<\ell< 4$, there exists $A\in\mathcal{X}$ such that $$μ(A\cap T_{1}^{-n}A\cap T_{2}^{-n}A)<μ(A)^{\ell} \text{ for every } n\neq 0;$$ $\bullet$ There exists an ergodic system $(X,\mathcal{X},μ,T_1,T_2, T_{3})$ with three commuting transformations such that for every $\ell>0$, there exists $A\in\mathcal{X}$ such that $$μ(A\cap T_{1}…
Let $A\subseteq\{1,...,N\}$ and $P_1,...,P_\ell\in\Z[n]$ with $P_i(0)=0$ and $°P_i=k$ for every $1\leq i\leq\ell$. We show, using Fourier analytic techniques, that for every $\VE>0$, there necessarily exists $n\in\N$ such that \[\frac{|A\cap (A+P_i(n))|}{N}>(\frac{|A|}{N})^2-\VE\] holds simultaneously for $1\leq i\leq \ell$ (in other words all of the polynomial shifts of the set $A$ intersect $A$ "$\VE$-optimally"), as long as $N\geq N_1(\VE,P_1,...,P_\ell)$. The quantitative bounds obtained for $N_1$ are explicit but poor; we establish that $N_1$ may be taken to be a constant (depending only …
We consider systems A_\ell(t) y(q^\ell t) + ... + A_0(t) y(t) = b(t) of higher order q-recurrence equations with rational coefficients. We extend a method for finding a bound on the maximal power of t in the denominator of arbitrary rational solutions y(t) as well as a method for bounding the degree of polynomial solutions from the scalar case to the systems case. The approach is direct and does not rely on uncoupling or reduction to a first order system. Unlike in the scalar case this usually requires an initial transformation of the system.
We study the limiting behavior of multiple ergodic averages involving sequences of integers that satisfy some regularity conditions and have polynomial growth. We show that for "typical" choices of Hardy field functions $a(t)$ with polynomial growth, the averages $\frac{1}{N}\sum_{n=1}^N f_1(T^{[a(n)]}x)\cdot...\cdot f_\ell(T^{\ell [a(n)]}x)$ converge in the mean and we determine their limit. For example, this is the case if $a(t)=t^{3/2}, t\log{t},$ or $t^2+(\log{t})^2$. Furthermore, if ${a_1(t),...,a_\ell(t)}$ is a "typical" family of logarithmico-exponential functions of polynomial growth, …
Growth of recurrences with mixed multifold convolutions
本文研究一类推广 Catalan 数与 Schröder 数的混合多重卷积递推序列,证明其增长速率可任意精度计算,并给出上下界比值渐近收敛到 1 的显式不等式。
Limit of the octahedron recurrence with GUE boundary data
研究带GUE边界数据的八面体递推,证明其缩放后随机场收敛于确定性Lipschitz函数,并通过完美匹配公式给出表面张力变分刻画。
Length-generating functions for twisted involutions of Coxeter groups
本文证明了有限秩Coxeter系统中扭曲对合的长度生成函数为有理函数,推导了类似抛物子群生长级数的递推关系,并推广到封闭子集,为Lusztig的幂级数恒等式提供了新证明。
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.
We prove mean convergence, as $N\to\infty$, for the multiple ergodic averages $\frac{1}{N}\sum_{n=1}^N f_1(T_1^{p_1(n)}x)... f_\ell(T_\ell^{p_\ell(n)}x)$, where $p_1,...,p_\ell$ are integer polynomials with distinct degrees, and $T_1,...,T_\ell$ are commuting, invertible measure preserving transformations, acting on the same probability space. This establishes several cases of a conjecture of Bergelson and Leibman, that complement the case of linear polynomials, recently established by Tao. Furthermore, we show that, unlike the case of linear polynomials, for polynomials of distinct degrees, t…
Five simple guidelines are proposed to compute the generating function for the nonnegative integer solutions of a system of linear inequalities. In contrast to other approaches, the emphasis is on deriving recurrences. We show how to use the guidelines strategically to solve some nontrivial enumeration problems in the theory of partitions and compositions. This includes a strikingly different approach to lecture hall-type theorems, with new $q$-series identities arising in the process. For completeness, we prove that the guidelines suffice to find the generating function for any system of homo…
扫码添加微信好友,提出您的宝贵建议 👇
💡 备注请填写:网站反馈
发表机构由 AI 从论文文本抽取,如发现错误,欢迎反馈修正建议。