相关论文: Three analogues of Stern's diatomic sequence

Log-atomic numbers are surreal numbers whose iterated logarithms are monomials, and consequently have a trivial expansion as transseries. Presenting surreal numbers as sign sequences, we give the sign sequence formula for log-atomic…

The distribution of a given sequence in the set of all sequences with n ones and m = M - n zeros are found by relating the problem to the partitions of a natural number in m natural summands, taking into account the order. The formulas…

We present a new survey of the radial oscillation modes of neutron stars. This study complements and corrects earlier studies of radial oscillations. We present an extensive list of frequencies for the most common equations of state and…

Using a direct algebraic approach we derive convolution identities for second order sequences, hereby distinguishing between sequences obeying the same or different recurrence relations. We also state a general convolution for Horadam…

We consider a sequence of sums of powers of the the roots of the cubic equation characterizing the Tribonacci sequences and derive its relationship with a particular Tribonacci sequence. Then we make a conjecture on the possible…

In a delightful article, Richard Stanley derived, algebraically, the surprisingly simple formula, 3 times 7 to the power n-1, for the sum of the cubes of the n-th row of Stern's diatomic array. In this note, we find an elegant bijective…

We define a quantum analogue of a class of generalized cluster algebras which can be viewed as a generalization of quantum cluster algebras defined in \cite{berzel}. In the case of rank two, we extend some structural results from the…

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

We can give a slight improvement for a result related to the distribution of squares in Piatetski-Shapiro sequences of Liu-Shparlinski-Zhang \cite{lsz} by involving three different ideas.

Diophantine quadruples are sets of four distinct positive integers such that the product of any two is one less than a square. All known examples belong to an infinite set which can be constructed recursively. Some observations on these…

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…

The aim of this paper is twofold. The first is to give a quantitative version of Schmidt's subspace theorem for arbitrary families of higher degree polynomials. The second is to give a generalization of the subspace theorem for arbitrary…

In this paper, we study numbers $n$ that can be factored in three different ways as $n = A_1 B_1 = A_2 B_2 = A_3 B_3$ where $A_1$, $A_2$, $A_3$ are close to each other and $B_1$, $B_2$, $B_3$ are close to each other.

The Stern-Gerlach splitting of spinor condensates is explained based on the total spin-states with specified SU(2) and permutation symmetries.

1 : We use properties of the Stern Sequence for numerical computations of moments $\int^1_0 t^n d?(t)$ associated to Minkowski's Question Mark function.

We show that for any n divisible by 3, almost all order-n Steiner triple systems have a perfect matching (also known as a parallel class or resolution class). In fact, we prove a general upper bound on the number of perfect matchings in a…

We generalize the Giveon-Kutasov duality by adding possible Chern-Simons interactions for the $U(N)$ gauge group. Some of the generalized dualities are known in the literature and many others are new to the best of our knowledge. The…

In array-based DNA synthesis, multiple strands of DNA are synthesized in parallel to reduce the time cost from the sum of their lengths to the length their shortest common supersequences. To maximize the amount of information that can be…

We determine the average number of distinct subsequences in a random binary string, and derive an estimate for the average number of distinct subsequences of a particular length.

For a simple graph we introduce notions of the double star sequence, the double star frequently sequence and prove that these sequences are inverses of each other. As a consequence, we express the general second Zagreb index in terms of the…