Related papers: A Generalization of the "Raboter" Operation
Rhaly operators, as generalizations of the Ces\`aro operator, are studied from the standpoint of view of spectral theory and invariant subspaces, extending previous results by Rhaly and Leibowitz to a framework where generalized Ces\`aro…
A nonlinear equation in a Banach space is written as a linear equation with a linear operator depending on the unknown solution. This method, which we call a global linearization method, differs essentially from the local linearization…
We introduce generalised orbit algebras. The purpose here is to measure how some combinatorial properties can characterize the action of a group of permutations on the subsets. The similarity with orbit algebras is such that it took the…
Recently, we have shown how the interpretation of quantum mechanics due to Lande' can be used to derive from first principles generalized formulas for the operators and some eigenvectors for spin 1/2 Though we gave the operators for all the…
BSS RAMs over first-order structures help to characterize algorithms for processing objects by means of useful operations and relations. They are the result of a generalization of several types of abstract machines. We want to discuss…
Unifying several directions of the development of the study of summing multilinear operators between Banach spaces, we construct a general framework that studies, under one single definition, multilinear operators that are summing with…
We show that several known facts concerning roots of matrices generalize to operator algebras and Banach algebras. We show for example that the so-called Newton, binomial, Visser, and Halley iterative methods converge to the root in Banach…
Let $\alpha$ and $\beta$ be two nonnegative integers such that $\beta < \alpha$. For an arbitrary sequence $\{a_n\}_{n\geqslant 1}$ of complex numbers, we consider the generalized Lambert series in order to investigate linear combinations…
The operator algebra is introduced based on the framework of logarithmic representation of infinitesimal generators. In conclusion a set of generally-unbounded infinitesimal generators is characterized as a module over the Banach algebra.
Some techniques for the use of bitwise operations are described in the article. As an example, an open problem of isomorphism-free generations of combinatorial objects is discussed. An equivalence relation on the set of square binary…
This note is a survey and collection of results, as well as presenting some original research. For Bessel sequences and frames, the analysis, synthesis and frame operators as well as the Gram matrix are well-known, bounded operators. We…
The purpose of this paper is to generalize a very famous result on products of normal operators, due to I. Kaplansky. The context of generalization is that of bounded hyponormal and unbounded normal operators on complex separable Hilbert…
Sequence rotation consists of a circular shift of the sequence's elements by a given number of positions. We present the four classic algorithms to rotate a sequence; the loop invariants underlying their correctness; detailed correctness…
In the present paper we generate binary pseudorandom sequences using generalized polynomials. A generalized polynomial is a function in whose description we not only allow addition and product (as it is the case in usual polynomials) but…
Let $\{\lambda_n\}_n \in \ell^\infty(\mathbb{N})$. In 1960, R. Schatten \cite{SCHATTEN} studied operators of the form $\sum_{n=1}^{\infty}\lambda_n (x_n\otimes \bar{y_n})$, where $\{x_n\}_n$, $\{y_n\}_n$ are orthonormal sequences in a…
In the paper we investigate an algorithmic associative binary operation $*$ on the set $\mathcal{LR}_1$ of Littlewood-Richardson tableaux with entries equal to one. We extend $*$ to an algorithmic nonassociative binary operation on the set…
We propose several procedures for creating new families of integer sequences based on the method of Cantor diagonalization. Then we modify and generalize this method. The paper includes explicit formulas for most proposed families of…
In this paper we outline the most general and universal algorithmic approach to reduction of loop integrals to basic integrals. The approach is based on computation of Groebner bases for recurrence relations derived from the integration by…
A derived operation is a bilinear operation on a commutative associative algebra $A$ defined intrinsically out of its product and several derivations of the product. We show that operators of left (or right) multiplications of a derived…
The Euclidean algorithm makes possible a simple but powerful generalization of Taylor's theorem. Instead of expanding a function in a series around a single point, one spreads out the spectrum to include any number of points with given…