Related papers: The Stern diatomic sequence via generalized Chebys…
A countable dense set of directions is sufficient for Steiner symmetrization, but the order of directions matters.
The generalized sequence of numbers is defined by W_{n}=pW_{n-1}+qW_{n-2} with initial conditions W_{0}=a and W_{1}=b for a,b,p,q\inZ and n\geq2, respectively. Let W_{n}=circ(W_{1},W_{2},...,W_{n}). The aim of this paper is to establish…
We study monic polynomials $Q_n(x)$ generated by a high order three-term recursion $xQ_n(x)=Q_{n+1}(x)+a_{n-p} Q_{n-p}(x)$ with arbitrary $p\geq 1$ and $a_n>0$ for all $n$. The recursion is encoded by a two-diagonal Hessenberg operator $H$.…
We provide a method for solving the roots of the general polynomial equation a[n]*x^n+a[n-1]*x^(n-1)+..+a1*x+a0=0. To do so, we express x as a powerseries of s, and calculate the first n-2 coefficients. We turn the polynomial equation into…
Given a sequence $S=(s_1,\dots,s_m) \in [0, 1]^m$, a block $B$ of $S$ is a subsequence $B=(s_i,s_{i+1},\dots,s_j)$. The size $b$ of a block $B$ is the sum of its elements. It is proved in [1] that for each positive integer $n$, there is a…
We prove a general theorem to bound the total variation distance between the distribution of an integer valued random variable of interest and an appropriate discretized normal distribution. We apply the theorem to 2-runs in a sequence of…
Recent numerical work by Wilson, Mathews, and Marronetti [J. R. Wilson, G. J. Mathews and P. Marronetti, Phys. Rev. D 54, 1317 (1996)] on the coalescence of massive binary neutron stars shows a striking instability as the stars come close…
We prove that the permutations of $\{1,\dots, n\}$ having an increasing (resp., decreasing) subsequence of length $n-r$ index a subset of the set of all $r$th Kronecker powers of $n \times n$ permutation matrices which is a basis for the…
It is known that for an arbitrary positive integer \(n\) the sequence \(S(x^n)=(1^n, 2^n, \ldots)\) is complete, meaning that every sufficiently large integer is a sum of distinct \(n\)th powers of positive integers. We prove that every…
In this paper we introduce the polynomials $\{d_n^{(r)}(x)\}$ and $\{D_n^{(r)}(x)\}$ given by $d_n^{(r)}(x)=\sum_{k=0}^n\binom{x+r+k}k\binom{x-r}{n-k} \ (n\ge 0)$, $D_0^{(r)}(x)=1,\ D_1^{(r)}(x)=x$ and…
The motion of binary star systems is re-examined in the presence of perturbations from the theory of general relativity. The Kepler problem is regularized and linearized with quaternions. In this way first order perturbation results are…
Let A be an n by n matrix with entries in an arbitrary field, and c_1,...,c_n be scalars. We prove that if A is not a scalar multiple of the identity matrix, then the condition c_1+...+c_n=tr(A) is necessary and sufficient for A to be…
We discuss an equivalence relation on the set of square binary matrices with the same number of 1's in each row and each column. Each binary matrix is represented using ordered n-tuples of natural numbers. We give a few starting values of…
This is the second in a series of papers which intend to explore conceptual ways of distinguishing between families in the $q$-Askey scheme and uniform ways of parametrizing the families. For a system of polynomials $p_n(x)$ in the…
We introduce a family of block-additive automatic sequences, that are obtained by allocating a weight to each couple of digits, and defining the $n$th term of the sequence as being the total weight of the integer $n$ written in base $k$.…
A general formula is calculated for the connection of a central metric w.r.t.\ a noncommutative spacetime of Lie-algebraic type. This is done by using the framework of linear connections on central bi-modules. The general formula is further…
We consider sequences of the type $A_n=6A_{n-1}-A_{n-2}, A_0=r, A_1=s$ ($r$ and $s$ integers) and show that all sequences that solve particular cases of the Pell generalized equation are expressible as a constant times one of four…
The Sturm sequence is generated by a pair of polynomials $P(x)$ and $P'(x)$, where $P(x)$ is assumed to have simple real roots. Euclidean algorithm generates then a finite sequence of polynomials orthogonal on the grid $x_s$ of roots of the…
We introduce a method to obtain self-consistent, axially symmetric, thin disklike stellar models in the first post-Newtonian (1PN) approximation. The models obtained are fully analytical and corresponds to the post-Newtonian generalizations…
The distance matrix of a connected graph is defined as the matrix in which the entries are the pairwise distances between vertices. The distance spectrum of a graph is the set of eigenvalues of its distance matrix. A graph is said to be…