Related papers: A Generalization of the "Raboter" Operation
We give a general method for rounding linear programs that combines the commonly used iterated rounding and randomized rounding techniques. In particular, we show that whenever iterated rounding can be applied to a problem with some slack,…
This paper is a contribution to the theory of dynamical sampling. Our purpose is twofold. We first consider representations of sequences in a Hilbert space in terms of iterated actions of a bounded linear operator. This generalizes recent…
We prove the theorems which are equivalent to the Roland's results such that a new form of them allows to consider some generalizations. In particular, we give generators of primes more than a fixed prime.
We describe the orbit structure for the action of the centralizer group of a linear operator on a finite-dimensional complex vector space. The main application is to the classification of solutions to a system of first-order ODEs with…
We generalize the Umbral Calculus of G-C. Rota by studying not only sequences of polynomials and inverse power series, or even the logarithms studied in, but instead we study sequences of formal expressions involving the iterated logarithms…
We study the properties of different type of transforms by means of operational methods and discuss the relevant interplay with many families of special functions. We consider in particular the binomial transform and its generalizations. A…
The comprehensive generalization of summation-by-parts of Del Rey Fern\'andez et al.\ (J. Comput. Phys., 266, 2014) is extended to approximations of second derivatives with variable coefficients. This enables the construction of…
We define a function on the $C^{\ast}$-algebra of all bounded linear Hilbert space operators, which generalizes the operator radii, and we present some basic properties of this function. Our results extend several results in the literature.
We describe arithmetic computations in terms of operations on some well known free algebras (S1S, S2S and ordered rooted binary trees) while emphasizing the common structure present in all them when seen as isomorphic with the set of…
The aim of this paper is to generalise the construction of $n$-ary Hom-Lie bracket by means of an $(n-2)$-cochain of given Hom-Lie algebra to super case inducing a $n$-Hom-Lie superalgebras. We study the notion of generalized derivation and…
In this paper we define generalizations of boson normal ordering. These are based on the number of contractions whose vertices are next to each other in the linear representation of the boson operator function. Our main motivation is to…
Summation-by-parts (SBP) operators are popular building blocks for systematically developing stable and high-order accurate numerical methods for time-dependent differential equations. The main idea behind existing SBP operators is that the…
In this paper we study the action of a generalization of the Binomial interpolated operator on the set of linear recurrent sequences. We find how the zeros of characteristic polynomials are changed and we prove that a subset of these…
A new understanding of the notion of regularizer is proposed. It is argued that this new notion is more realistic than the old one and better fits the practical computational needs. An example of the regularizer in the new sense is given. A…
In this paper, we introduce the Theta Partial operator $\theta(y\mathbf{D}_{\lambda})$, based on the $\lambda$-derivative operator $\mathbf{D}_{\lambda}$, and use it to define the following generalization of the Lambert series…
Sorting is a common and ubiquitous activity for computers. It is not surprising that there exist a plethora of sorting algorithms. For all the sorting algorithms, it is an accepted performance limit that sorting algorithms are linearithmic…
The convergence of a new general variable metric algorithm based on compositions of averaged operators is established. Applications to monotone operator splitting are presented.
A certain analysis of all possible associative binary operations on N is presented. This is equivalent with an analysis of all possible monoid structures on N. Several results and a conjecture in this regard are given.
Although the vectorization operation is known and well-defined, it is only defined for 2-D matrices, and its inverse isn't as well-popularized. This work proposes to generalize the vectorization to higher dimensions, and define…
In these notes we generalize the theory of graphical functions from scalar theories to theories with spin.