Related papers: Some results about Linear Recurrence Relation Homo…
A general definition of a linear connection in noncommutative geometry has been recently proposed. Two examples are given of linear connections in noncommutative geometries which are based on matrix algebras. They both possess a unique…
Suppose M is a complex manifold of dimension $n+1$ and K is a hypersurface in M. By Poincar\'e duality we define a residue morphism $res:H^{k+1}(M\setminus K)\longrightarrow H_{2n-k}(K)$ which generalizes the classical Leray residue…
We study a new type of sequences whose elements are defined in terms of the position, sign and magnitude of another element of the sequence. The name ultra-recursive comes from the fact that these sequences possess terms that are generated…
We provide a simple method to recognize classical orthogonal polynomials on lattices defined only by their coefficients of the three term recurrence relation.
In this short note, we give a new sufficient condition for a linear map from a product of copies of a field to endomorphisms of a finite dimensional vector space over the same field to be an algebra homomorphism. We expect that this result…
In this work we present a definition for coherence and compatibility of multilinear mappings and homogenous polynomial classes. These definitions are more restricted than the ones proposed before. We began analyzing this new definition in a…
We establish three-term recurrence relations for the ${}_1\phi_1$ and ${}_0\phi_1$ basic hypergeometric series involving multiplicative shifts of the parameters and the variable by integer powers of q. The coefficients of these recurrence…
We consider a certain linear recursive relation with integer parameters and study some of its algebraic and geometric properties, with the purpose of estimating the number of chains of valences in the Farey series.
Let $ \prod_{i=1}^d (X-\alpha_i Y) \in{\mathbb C}[X,Y]$ be a binary form and let $\epsilon_1,\dots,\epsilon_d$ be nonzero complex numbers. We consider the family of binary forms $ \prod_{i=1}^d (X-\alpha_i \epsilon_i^aY)$, $a\in {\mathbb…
Lines and circles pose significant scalability challenges in synthetic geometry. A line with $n$ points implies ${n \choose 3}$ collinearity atoms, or alternatively, when lines are represented as functions, equality among ${n \choose 2}$…
We provide a classification of the homogeneous 3-dimensional permutation structures, i.e. homogeneous structures in a language of 3 linear orders, partially answering a question of Cameron. We also arrive at a natural description of all…
Roughly speaking, a recurrence relation is nested if it contains a subexpression of the form ... A(...A(...)...). Many nested recurrence relations occur in the literature, and determining their behavior seems to be quite difficult and…
All possible products of all elements of an odd order finite group are considered. A set of all such products is called as a K-set. A hypothesis of K-set coincidence of any group of an odd order with its commutant is proposed and the…
In this paper, we shall find a new connection between $n$th degree polynomial mod $p$ congruence with $n$ roots and higher-order Fibonacci and Lucas sequences. We shall first discuss the recent work been done in sequences and their…
Linear recursions of degree $k$ are determined by evaluating the sequence of Generalized Fibonacci Polynomials, $\{F_{k,n}(t_1,...,t_k)\}$ (isobaric reflects of the complete symmetric polynomials) at the integer vectors $(t_1,...,t_k)$. If…
A sequence is called $C$-finite if it satisfies a linear recurrence with constant coefficients. We study sequences which satisfy a linear recurrence with $C$-finite coefficients. Recently, it was shown that such $C^2$-finite sequences…
We deliver here second new $\textit{H(x)}-binomials'$ recurrence formula, were $H(x)-binomials' $ array is appointed by $Ward-Horadam$ sequence of functions which in predominantly considered cases where chosen to be polynomials . Secondly,…
Recursion formulae are derived for the calculation of two centre matrix elements of a radial function in relativistic quantum mechanics. The recursions are obtained between not necessarily diagonal radial eigensates using arbitrary radial…
Labeled infinite trees provide combinatorial interpretations for many integer sequences generated by nested recurrence relations. Typically, such sequences are monotone increasing. Several of these sequences also have straightforward…
A simple recurrence relation for the even order moments of the Fabius function is proven. Also, a very similar formula for the odd order moments in terms of the even order moments is proved. The matrices corresponding to these formulas (and…