中文
相关论文

相关论文: A digit reversal property for an analogue of Stern…

200 篇论文

We consider the following polynomial generalization of Stern's diatomic series: let $s_1(x,y)=1$, and for $n\geq 1$ set $s_{2n}(x,y)=s_n(x,y)$ and $s_{2n+1}(x,y)=x\,s_n(x,y)+y\,s_{n+1}(x,y)$. The coefficient $[x^iy^j]s_n(x,y)$ is the number…

数论 · 数学 2017-11-16 Lukas Spiegelhofer

Stern's diatomic sequence is a well-studied and simply defined sequence with many fascinating characteristics. The binary signed-digit (BSD) representation of integers is used widely in efficient computation, coding theory and other…

数论 · 数学 2021-08-31 Laura Monroe

We study a recently introduced base $b$ polynomial analog of Stern's diatomic sequence, which generalizes Stern polynomials of Klavar, Dilcher, Ericksen, Mansour, Stolarsky, and others. We lift some basic properties of base $2$ Stern…

Stern's diatomic sequence is a well-studied and simply defined sequence with many fascinating characteristics. The binary signed-digit representation of integers is an alternative representation of integers with much use in efficient…

数论 · 数学 2021-10-07 Laura Monroe

In this paper we study the sequences defined by the last and the last non-zero digits of $n^n$ in base $b$. For the sequence given by the last digits of $n^n$ in base $b$, we prove its periodicity using different techniques than those used…

数论 · 数学 2012-03-20 José María Grau , Antonio M. Oller-Marcén

Let $d_N=ND_N(\omega)$ be the discrepancy of the Van der Corput sequence in base $2$. We improve on the known bounds for the number of indices $N$ such that $d_N\leq \log N/100$. Moreover, we show that the summatory function of $d_N$…

数论 · 数学 2017-10-05 Lukas Spiegelhofer

The binary signed-digit representation of integers is used for efficient computation in various settings. The Stern polynomial is a polynomial extension of the well-studied Stern diatomic sequence, and has itself has been investigated in…

数论 · 数学 2021-08-30 Laura Monroe

Let $(s_2(n))_{n=0}^\infty$ denote Stern's diatomic sequence. For $n\geq 2$, we may view $s_2(n)$ as the number of partitions of $n-1$ into powers of $2$ with each part occurring at most twice. More generally, for integers $b,n\geq 2$, let…

组合数学 · 数学 2015-06-26 Colin Defant

We show that the number of short binary signed-digit representations of an integer $n$ is equal to the $n$-th term in the Stern sequence. Various proofs are provided, including direct, bijective, and generating function proofs. We also show…

组合数学 · 数学 2023-08-16 Katie Anders , Madeline Locus Dawsey , Rajat Gupta , Joseph Vandehey

Let $B_{n}(t)$ be a $n$-th Stern polynomial and let $e(n)=\op{deg}B_{n}(t)$ be its degree. In this note we continue our study started in \cite{Ul} of the arithmetic properties of the sequence of Stern polynomials and the sequence…

组合数学 · 数学 2011-02-28 Maciej Ulas

In this paper we consider integers in base 10 like $abc$, where $a$, $b$, $c$ are digits of the integer, such that $abc^2 - (abc \cdot cba) \; = \; \pm n^2$, where $n$ is a positive integer, as well as equations $abc^2 - (abc \cdot cba) \;…

数论 · 数学 2016-02-23 Geoffrey B. Campbell , Aleksander Zujev

We define a triangular array closely related to Stern's diatomic array and show that for a fixed integer $r\geq 1$, the sum $u_r(n)$ of the $r$th powers of the entries in row $n$ satisfy a linear recurrence with constant coefficients. The…

组合数学 · 数学 2019-01-16 Richard P. Stanley

We prove several theorems concerning arithmetic properties of Stern polynomials defined in the following way: $B_{0}(t)=0, B_{1}(t)=1, B_{2n}(t)=tB_{n}(t)$, and $B_{2n+1}(t)=B_{n}(t)+B_{n+1}(t)$. We study also the sequence…

组合数学 · 数学 2011-02-28 Maciej Ulas , Oliwia Ulas

In a recent paper, Roland Bacher conjectured three identities concerning Stern's sequence and its twist. In this paper we prove Bacher's conjectures. Possibly of independent interest, we also give a way to compute the Stern value (or…

数论 · 数学 2010-10-19 Michael Coons

Let $B_{n}(t)$ be the $n$th Stern polynomial, i.e., the $n$th term of the sequence defined recursively as $B_{0}(t)=0, B_{1}(t)=1$ and $B_{2n}(t)=tB_{n}(t), B_{2n+1}(t)=B_{n}(t)+B_{n-1}(t)$ for $n\in\N$. It is well know that $i$th…

数论 · 数学 2019-09-25 Maciej Ulas

We prove a conjecture of Northshield by determining the maximal order of his analogue of Stern's sequence for $\mathbb{Z}[\sqrt{2}]$. In particular, if $b$ is Northshield's analogue, we prove that…

组合数学 · 数学 2017-09-08 Michael Coons

Using the sum invariance property of Benford random variables, we prove that an $n$-digit Benford variable converges to a Benford variable as $n$ approaches infinity.

概率论 · 数学 2016-04-04 Azar Khosravani , Constantin Rasinariu

We prove that the Stern diatomic sequence is asymptotically distributed according to a normal law, on a logarithmic scale. This is obtained by studying complex moments, and the analytic properties of a transfer operator.

数论 · 数学 2019-05-07 Sandro Bettin , Sary Drappeau , Lukas Spiegelhofer

We investigate the Stern polynomials defined by $B_0 ( t ) =0,B_1 ( t ) =1$, and for $n \geq 2$ by the recurrence relations $B_{2n}( t) =tB_{n}( t) ,$ $B_{2n+1}( t) =B_n( t) +B_{n+1}( t) $. We prove that all possible rational roots of that…

组合数学 · 数学 2014-01-16 Maciej Gawron

To investigate hyperbinary expansions of a nonnegative integer~$n$, an edge-labeled directed graph $A(n)$ has recently been introduced. After pointing out some new simple facts about its cyclomatic number, we give a relatively simple…

组合数学 · 数学 2025-07-28 Alessandro De Paris
‹ 上一页 1 2 3 10 下一页 ›