Related papers: The Hadamard product and recursively defined seque…
The Hofstadter Q-sequence, with its simple definition, has defied all attempts at analyzing its behavior. Defined by a simple nested recurrence and an initial condition, the sequence looks approximately linear, though with a lot of noise.…
For an arbitrary homogeneous linear recurrence sequence of order d with constant coefficients, we derive recurrence relations for all subsequences with indices in arithmetic progression. The coefficients of these recurrences are given…
On the set of mappings of the given set, we define the product of mappings. If A is associative algebra, then we consider the set of matrices, whose elements are linear mappings of algebra A. In algebra of matrices of linear mappings we…
We consider a family of integer sequences generated by nonlinear recurrences of the second order, which have the curious property that the terms of the sequence, and integer multiples of the ratios of successive terms (which are also…
The classical quadratic formula and some of its lesser known variants for solving the quadratic equation are reviewed. Then, a new formula for the roots of a quadratic polynomial is presented.
Analytical periodic solutions for weakly Coupled Map Lattices are shown in an explicit form as well as in a recurrence relation. The results establish a link between a matricial representation and recurrence relations of the solutions.
We consider a self-convolutive recurrence whose solution is the sequence of coefficients in the asymptotic expansion of the logarithmic derivative of the confluent hypergeometic function $U(a,b,z)$. By application of the Hilbert transform…
Concise introduction to a relatively new subject of non-linear algebra: literal extension of text-book linear algebra to the case of non-linear equations and maps. This powerful science is based on the notions of discriminant…
We introduce a new iterative method for computing solutions of elliptic equations with random rapidly oscillating coefficients. Similarly to a multigrid method, each step of the iteration involves different computations meant to address…
Our work presents a new iterative scheme to approximate the fixed points of nonexpansive mapping. The proposed algorithm is constructed to enhance convergence efficiency while preserving theoretical robustness. Under appropriate assumptions…
We find a recursive formula for the motivic Milnor fiber of an irreducible plane curve, using the notions of a truncation and derived curve. We then apply natural transformations to obtain a similar recursion for the Hodge-theoretic…
We consider a long but finite (ladder) circuit with alternating connections of resistors in series and parallel and derive an explicit expression for its equivalent resistance as a function of the number of repeating blocks, $R_{\rm…
To approximate a simple root of an equation we construct families of iterative maps of higher order of convergence. These maps are based on model functions which can be written as an inner product. The main family of maps discussed is…
We present a new discretization for the Hadamard fractional derivative, that simplifies the computations. We then apply the method to solve a fractional differential equation and a fractional variational problem with dependence on the…
In this paper we use a design theoretical approach to construct new, previously unknown complex Hadamard matrices. Our methods generalize and extend the earlier results of de la Harpe--Jones and Munemasa--Watatani and offer a theoretical…
Many different types of fractional calculus have been defined, which may be categorised into broad classes according to their properties and behaviours. Two types that have been much studied in the literature are the Hadamard-type…
In this paper we give a new construction of parametric families of complex Hadamard matrices of square orders, and connect them to equiangular tight frames. The results presented here generalize some of the recent ideas of Bodmann et al.…
By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In…
New solution method for the systems of linear equations in commutative integral domains is proposed. Its complexity is the same that the complexity of the matrix multiplication.
A characterization of $\mathbb{Z} _t \times \mathbb{Z}_2^2$-cocyclic Hadamard matrices is described, depending on the notions of {\em distributions}, {\em ingredients} and {\em recipes}. In particular, these notions lead to the…