中文
相关论文

相关论文: Identities involving Narayana numbers

200 篇论文

Let $\Bbb Z$ be the set of integers. For positive integers $a,b,c$ and $n$ let $N(a,b,c;n)$ be the number of representations of $n$ by $ax^2+by^2+cz^2$, and let $t(a,b,c;n)$ be the number of representations of $n$ by…

数论 · 数学 2018-12-12 Zhi-Hong Sun

We present a lovely connection between the Fibonacci numbers and the sums of inverses of $(0,1)-$ triangular matrices, namely, a number $S$ is the sum of the entries of the inverse of an $n \times n$ $(n \geq 3)$ $(0,1)-$ triangular matrix…

历史与综述 · 数学 2013-06-13 Miriam Farber , Abraham Berman

Let a tribonacci sequence be a sequence of integers satisfying $a_k=a_{k-1}+a_{k-2}+a_{k-3}$ for all $k\ge 4$. For any positive integers $k$ and $n$, denote by $f_k(n)$ the number of tribonacci sequences with $a_1, a_2, a_3>0$ and with…

数论 · 数学 2023-01-31 Luke Pebody

Reproduction studies reported in NLP provide individual data points which in combination indicate worryingly low levels of reproducibility in the field. Because each reproduction study reports quantitative conclusions based on its own,…

计算与语言 · 计算机科学 2025-05-26 Anya Belz

A circulant nut graph is a non-trivial simple graph such that its adjacency matrix is a circulant matrix whose null space is spanned by a single vector without zero elements. Regarding these graphs, the order-degree existence problem can be…

组合数学 · 数学 2025-06-09 Ivan Damnjanović

Consider the linear congruence equation $x_1+\ldots+x_k \equiv b\,(\text{mod } n)$ for $b,n\in\mathbb{Z}$. By $(a,b)_s$, we mean the largest $l^s\in\mathbb{N}$ which divides $a$ and $b$ simultaneously. For each $d_j|n$, define…

数论 · 数学 2017-08-16 K Vishnu Namboothiri

The Raney numbers $R_{p,r}(k)$ are a two-parameter generalization of the Catalan numbers. In this paper, we obtain a recurrence relation for the Raney numbers which is a generalization of the recurrence relation for the Catalan numbers.…

组合数学 · 数学 2015-12-29 Robin DaPao Zhou

We provide new interpretations for a subset of Raney numbers, involving threshold sequences and Motzkin-like paths with long up and down steps. Given three integers n, k, l such that n >= 1, k >= 2 and 0 <= l <= k-2, a (k,l)-threshold…

组合数学 · 数学 2021-09-14 Irena Rusu

We convert, within polynomial-time and sequential processing, NP-Complete Problems into a problem of deciding feasibility of a given system S of linear equations with constants and coefficients of binary-variables that are 0, 1, or -1. S is…

计算复杂性 · 计算机科学 2012-10-23 Deepak Ponvel Chermakani

Nagata has conjectured that the following statement (N_r) holds for all $r\geq 10$: (N_r) if $P_1,...P_r \in {\mathbb P}^2$ are generic points then any plane curve $C$ satisfies $\sum_1^r mult_{P_i}(C)\leq \sqrt{r} deg(C)$. Nagata proved…

代数几何 · 数学 2013-05-09 Ziv Ran

The van der Laan-Padovan sequence $P_n ~ (n=0, 1, \ldots)$ is defined by $P_0=1, P_1=P_2=0$, and $P_{n+3}=P_{n+1}+P_n$ for $n=0, 1, \ldots$. We determine all pairs $(P_m, P_n)$ satisfying $P_m^b=2^{g_1} 3^{g_2} 5^{g_3} 7^{g_4} P_n^a$ for…

数论 · 数学 2025-10-14 Tomohiro Yamada

For a set $A$ of non-negative integers, let $R_A(n)$ denote the number of solutions to the equation $n=a+a'$ with $a$, $a'\in A$. Denote by $\chi_A(n)$ the characteristic function of $A$. Let $b_n>0$ be a sequence satisfying $\limsup_{n\to…

数论 · 数学 2020-09-09 Csaba Sándor

We derive the double recurrence $e_n = \frac{1}{2}(a_{n-1}+5b_{n-1}); f_{n} = \frac{1}{2}(a_{n-1}+b_{n-1})$ with $e_0=2;f_0=0$ for the Fibonacci numbers, leading to an extremely simple and fast implementation. Though the recurrence is…

数论 · 数学 2021-12-22 Jeroen van de Graaf

Fibonacci chains are special diatomic, harmonic chains with uniform nearest neighbour interaction and two kinds of atoms (mass-ratio $r$) arranged according to the self-similar binary Fibonacci sequence $ABAABABA...$, which is obtained by…

凝聚态物理 · 物理学 2007-05-23 Wolfdieter Lang

It is known that, for given integers s \geq 0 and j > 0, the nested recursion R(n) = R(n - s - R(n - j)) + R(n - 2j - s - R(n - 3j)) has a closed form solution for which a combinatorial interpretation exists in terms of an infinite, labeled…

组合数学 · 数学 2011-07-21 Rafal Drabek , Abraham Isgur , Vitaly Kuznetsov , Stephen Tanny

The Springer numbers are defined in connection with the irreducible root systems of type $B_n$, which also arise as the generalized Euler and class numbers introduced by Shanks. Combinatorial interpretations of the Springer numbers have…

组合数学 · 数学 2010-09-14 William Y. C. Chen , Neil J. Y. Fan , Jeffrey Y. T. Jia

We prove that the difference between the $n$-th hyperfibonacci number of $r$-th generation and its two consecutive predecessors is the $n$-th regular $(r-1)$-topic number. Using this fact we provide an equivalent recursive definition of…

组合数学 · 数学 2016-06-21 Ligia Loretta Cristea , Ivica Martinjak , Igor Urbiha

We obtain solutions to the recursive sequences of the form $$x_{n + 1} = \frac{x_{n - 3}x_{n }}{x_{n - 2}(a_n + b_nx_{n -3}x_{n})}$$ where $a_n$ and $b_n$ are arbitrary sequences of real numbers, and the initial values are gives as;…

动力系统 · 数学 2019-02-19 Mensah Folly-Gbetoula , Darlison Nyirenda

Let $F_n$ be the $n$th Fibonacci number. Let $m, n$ be positive integers. Define a sequence $(G(k,n,m))_{k\geq 1}$ by $G(1,n,m) = F^m_n$, and $G(k+1,n,m) = F_{nG(k,n,m)}$ for all $k\geq 1$. We show that $F_n^{k+m-1}\mid G(k,n,m)$ for all…

数论 · 数学 2014-05-29 Kritkajohn Onphaeng , Prapanpong Pongsriiam

For functions $f$ of a continuous variable in $\mathbb{R}^{+}$ we show that the Hirsch function $h_f$ equals $f$ iff $(f(f(x)) = x f(x))$ on $\mathbb{R}^{+}$, leading for continuous $f$ to $f$ = $\emptyset$ or the power function $f(x)$ =…

综合数学 · 数学 2023-03-23 Leo Egghe