Zobrazeno 1 - 10
of 34
pro vyhledávání: '"Stephen M. Tanny"'
Publikováno v:
Journal of Difference Equations and Applications. 25:481-503
We show how to modify the tree-based methodology to construct a combinatorial interpretation for certain non-monotonic solutions to recursions in the generalized Golomb family gs,j,λ(n)=gs,j,λ(n−s−...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d855d6a935b1771cf6f126661702f661
https://doi.org/10.1080/10236198.2019.1582648
https://doi.org/10.1080/10236198.2019.1582648
Autor:
Stephen M. Tanny, Matthew Sunohara
Publikováno v:
Journal of Difference Equations and Applications. 24:1273-1294
We explore the nature of the solution space for the Golomb nested recursion g(n)=g(n-g(n-1))+1 . On this solution space, we define a natural equivalence relation and restrict our attention to non-e...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e98d1446f1ebb654fb479540a343ae0b
https://doi.org/10.1080/10236198.2018.1471471
https://doi.org/10.1080/10236198.2018.1471471
Publikováno v:
SIAM Journal on Discrete Mathematics. 30:1128-1147
A recurring theme in nested recursions research has been the search for recursion families. By a recursion family we mean a collection of recursions with a common or at least highly similar structure, and where, with appropriate (but usually differen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::da682bb7d82bb55f31b04d561962b3af
https://doi.org/10.1137/15m1040505
https://doi.org/10.1137/15m1040505
Publikováno v:
Journal of Difference Equations and Applications. 19:372-383
Golomb showed that for k, a fixed positive integer, one solution of the nested recursion is the Beatty sequence , where is the positive root of the quadratic polynomial . We prove a natural generalization of this result: if r is any real root of some
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4a81f03f159be366cb9c54e00692b0a6
https://doi.org/10.1080/10236198.2011.644927
https://doi.org/10.1080/10236198.2011.644927
Publikováno v:
Journal of Difference Equations and Applications. 18:1967-1977
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 tree. For
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c53789f6701ab90a0c8eb3aa09c0fd07
https://doi.org/10.1080/10236198.2011.605358
https://doi.org/10.1080/10236198.2011.605358
A nondecreasing sequence of positive integers is $(\alpha,\beta)$-Conolly, or Conolly-like for short, if for every positive integer $m$ the number of times that $m$ occurs in the sequence is $\alpha + \beta r_m$, where $r_m$ is $1$ plus the 2-adic va
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1777ecfc52871fb2ed7f5da6612988a7
http://arxiv.org/abs/1509.02613
http://arxiv.org/abs/1509.02613
Publikováno v:
SIAM Journal on Discrete Mathematics. 18:794-824
A family of meta-Fibonacci sequences is defined by the k-term recursion $$ T_{a,k}(n) :=\sum_{i=0}^{k-1}T_{a,k}({n-i-a-T_{a,k}(n-i-1)}), \quad n>a+k,\,k\ge2, $$ with initial conditions $T_{a,k}(n)=1$ for $1\le n \le a+k$. Some partial results are obt
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f40ee0334fa2682f2f736d66ebab5e48
https://doi.org/10.1137/s0895480103421397
https://doi.org/10.1137/s0895480103421397
Publikováno v:
Journal of Business Strategy. 25:25-30
Providing customers with value is often not enough for a company to operate profitably. While ensuring that a product or service offers value to users and customers, there must be a conscious plan to capture a portion of that value. This is called mo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6ef44402eb0729231bb72e6b8bb82c94
https://doi.org/10.1108/02756660410547368
https://doi.org/10.1108/02756660410547368
Publikováno v:
Journal of Business Strategy. 25:50-54
For many companies, raising prices can result in customer defections and reduced volumes. The right strategy for increasing prices can result in increased customer satisfaction and fewer defections. Several approaches for raising prices involve chang
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::64b864cd0a3cb4a830a5e3c49d8caeee
https://doi.org/10.1108/02756660410537008
https://doi.org/10.1108/02756660410537008
Publikováno v:
The Electronic Journal of Combinatorics. 21
We apply a tree-based methodology to solve new, very broadly defined families of nested recursions of the general form R(n)=sum_{i=1}^k R(n-a_i-sum_{j=1}^p R(n-b_{ij})), where a_i are integers, b_{ij} are natural numbers, and k,p are natural numbers
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a3bc8b183ac6df91ac0886d8f6c2b447
https://doi.org/10.37236/3053
https://doi.org/10.37236/3053