中文
相关论文

相关论文: A short proof of Mathar's 2013 recurrence conjectu…

200 篇论文

In a recent article on overpartitions, Merca considered the auxiliary function $a(n)$ which counts the number of partitions of $n$ where odd parts are repeated at most twice (and there are no restrictions on the even parts). In the course…

数论 · 数学 2025-08-11 James A. Sellers

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…

组合数学 · 数学 2019-11-26 Alin Bostan , Jordan Tirrell , Bruce W. Westbury , Yi Zhang

We establish a generalization of Bourgain double recurrence theorem by proving that for any map $T$ acting on a probability space $(X,\mathcal{A},\mu)$, and for any non-constant polynomials $P, Q$ mapping natural numbers to themselves, for…

动力系统 · 数学 2020-08-12 el Houcein el Abdalaoui

Suppose we have a Nikishin system of $p$ measures with the $k$th generating measure of the Nikishin system supported on an interval $\Delta_k\subset\er$ with $\Delta_k\cap\Delta_{k+1}=\emptyset$ for all $k$. It is well known that the…

经典分析与常微分方程 · 数学 2023-08-30 Steven Delvaux , Abey López García , Guillermo López Lagomasino

In chemistry, Cyvin-Gutman enumerates Kekul\'{e} numbers for certain benzenoids and record it as $A050446$ on OEIS. This number is exactly the two variable array $T(n,m)$ defined by the recursion $T(n, m) = T(n, m-1) +…

组合数学 · 数学 2022-01-10 Guoce Xin , Yueming Zhong

Ordinary orthogonal polynomials are uniquely characterized by the three term recurrence relations up to an overall multiplicative constant. We show that the newly discovered M-indexed orthogonal polynomials satisfy 3+2M term recurrence…

数学物理 · 物理学 2015-06-15 Satoru Odake

Let $(a_n)_{n\ge 1}$ be the greedy self-generating sequence defined by $a_1=1$, $a_2=2$, and, for $k\ge 3$, by taking $a_k$ to be the least integer greater than $a_{k-1}$ that can be written as a sum of at least two consecutive earlier…

数论 · 数学 2026-03-24 Quanyu Tang

We show that it is provable in PA that there is an arithmetically definable sequence $\{\phi_{n}:n \in \omega\}$ of $\Pi^{0}_{2}$-sentences, such that - PRA+$\{\phi_{n}:n \in \omega\}$ is $\Pi^{0}_{2}$-sound and $\Pi^{0}_{1}$-complete - the…

逻辑 · 数学 2026-02-13 Rupert McCallum

Given a positive integer $r$ and a prime power $q$, we estimate the probability that the characteristic polynomial $f_{A}(t)$ of a random matrix $A$ in $\mathrm{GL}_{n}(\mathbb{F}_{q})$ is square-free with $r$ (monic) irreducible factors…

组合数学 · 数学 2022-09-09 Gilyoung Cheong , Jungin Lee , Hayan Nam , Myungjun Yu

We consider relations between the pairs of sequences, $(f, g_f)$, generated by the Lambert series expansions, $L_f(q) = \sum_{n \geq 1} f(n) q^n / (1-q^n)$, in $q$. In particular, we prove new forms of recurrence relations and matrix…

数论 · 数学 2017-07-06 Maxie D. Schmidt

On the set of positive integers, we consider the iterative process that maps $n$ to either $\frac{3n+1}{2}$ or $\frac{n}{2}$ depending on the parity of $n$. The Collatz conjecture states that all such sequences eventually enter the trivial…

综合数学 · 数学 2026-05-19 Olivier Rozier , Claude Terracol

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$…

组合数学 · 数学 2019-01-21 David E Speyer

Let $E_n(x)$ be Euler polynomial, $\nu_2(n)$ be $2-$adic order of $n,$ $\{g(n)\}$ be the characteristic sequence for $\{2^{n}-1\}_{n\geq1}.$ Recently Peter Luschny asked (cf. \cite{5}, sequence A290646): is for $n\geq1$ A290646=A135517?…

数论 · 数学 2017-09-06 Vladimir Shevelev

Let $A(n,r;3)$ be the total weight of the alternating sign matrices of order $n$ whose sole `1' of the first row is at the $r^{th}$ column and the weight of an individual matrix is $3^k$ if it has $k$ entries equal to -1. Define the…

数学物理 · 物理学 2007-05-23 Yu. G. Stroganov

An order-$s$ Davenport-Schinzel sequence over an $n$-letter alphabet is one avoiding immediate repetitions and alternating subsequences with length $s+2$. The main problem is to determine the maximum length of such a sequence, as a function…

组合数学 · 数学 2016-11-01 Julian Wellman , Seth Pettie

Let $s$ be a finite sequence over a field of length $n$. It is well-known that if $s$ satisfies a linear recurrence of order $d$ with non-zero constant term, then the reverse of $s$ also satisfies a recurrence of order $d$ (with…

信息论 · 计算机科学 2010-07-26 Graham H. Norton

In 1995 Magnus posed a conjecture about the asymptotics of the recurrence coefficients of orthogonal polynomials with respect to the weights on [-1,1] of the form $$ (1-x)^\alpha (1+x)^\beta |x_0 - x|^\gamma \times a jump at x_0, $$ with…

经典分析与常微分方程 · 数学 2009-05-19 A. Foulquie Moreno , A. Martinez-Finkelshtein , V. L. Sousa

Let $\zeta(.)$ denote the Riemann zeta function and let $a(.)$ and $A(.)$ respectively denote a multiplicative function and its corresponding summatory function. We consider the correlation $$ \langle a(n)A(n-1) \rangle (T) =…

数论 · 数学 2026-05-15 Gordon Chavez

In this paper, we confirm the following conjecture of Guo and Schlosser: for any odd integer $n>1$ and $M=(n+1)/2$ or $n-1$, $$ \sum_{k=0}^{M}[4k-1]_{q^2}[4k-1]^2\frac{(q^{-2};q^4)_k^4}{(q^4;q^4)_k^4}q^{4k}\equiv…

数论 · 数学 2020-06-01 Long Li , Su-Dan Wang

In a recent article, Donoso, Le, Moreira and Sun studied sets of recurrence for actions of the multiplicative semigroup $(\mathbb{N}, \times)$ and provided some sufficient conditions for sets of the form $S=\{(an+b)/(cn+d) \colon n \in…