Related papers: On Pasting and Reversing operations over some ring…
The efficient inversion of matrix polynomials is a critical challenge in computational mathematics. We design a procedure to determine the inverse of matrices polynomial of multidimensional Laplace matrices. The method is based on…
In this paper, a transform approach is used for polycyclic and serial codes over finite local rings in the case that the defining polynomials have no multiple roots. This allows us to study them in terms of linear algebra and invariant…
In this paper we study the action of the Binomial and Invert (interpolated) operators on the set of linear recurrent sequences. We prove that these operators preserve this set, and we determine how they change the characteristic…
This paper investigates the randomness properties of a function of the divisor pairs of a natural number. This function, the antecedents of which go to very ancient times, has randomness properties that can find applications in…
Inverse spectral problems are studied for first-order integro-differential operators on a finite interval. These problems consist in recovering some components of the kernel from one or multiple spectra. Uniqueness theorems are proved for…
The point-splitting regularization technique for composite operators is discussed in connection with anomaly calculation. We present a pedagogical and self-contained review of the topic with an emphasis on the technical details. We also…
The paper is devoted to the index theory of orbital and transverse elliptic operators on manifolds with a proper Lie group action. It corrects errors of my previous paper (published in JNCG in 2016) on transverse operators and contains new…
The reversal of a positive integer $A$ is the number obtained by reading $A$ backwards in its decimal representation. A pair $(A,B)$ of positive integers is said to be palindromic if the reversal of the product $A \times B$ is equal to the…
A random number of items each independently marked with one of a collection of colours gives rise to the multinomial marking, which generalises binomial thinning. A multivariate version, where previously marked items are then re-marked, has…
We develop algorithms to turn quotients of rings of rings of integers into effective Euclidean rings by giving polynomial algorithms for all fundamental ring operations. In addition, we study normal forms for modules over such rings and…
We consider a stack sorting algorithm where only the appropriate output values are popped from the stack and then any remaining entries in the stack are run through the stack in reverse order. We identify the basis for the $2$-reverse pass…
In this work, we construct commutative rings of two variable matrix differential operators that are isomorphic to a ring of meromorphic functions on a rational manifold obtained from the $CP^1\times CP^1$ by identification of two lines with…
Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…
The notion of the weighted core inverse in a ring with involution was introduced, recently [Mosic et al. Comm. Algebra, 2018; 46(6); 2332-2345]. In this paper, we explore new representation and characterization of the weighted core inverse…
We consider the notions of the replicators, including the duplicator and triplicator, of a binary operad. As in the closely related notions of di-Var-algebra and tri-Var-algebra in [14], they provide a general operadic definition for the…
Planar polynomial automorphisms are polynomial maps of the plane whose inverse is also a polynomial map. A map is reversible if it is conjugate to its inverse. Here we obtain a normal form for automorphisms that are reversible by an…
There is a commutative algebra of differential-difference operators, with two parameters, associated to any dihedral group with an even number of reflections. The intertwining operator relates this algebra to the algebra of partial…
One can find lists of whole numbers having equal sum and product. We call such a creature a bioperational multiset. No one seems to have seriously studied them in areas outside whole numbers such as the rationals, Gaussian integers, or…
In this paper we present a recurrent relation for counting meaningful compositions of the higher-order differential operations on the space $R^{n}$ (n=3,4,...) and extract the non-trivial compositions of order higher than two.
We discuss various formalisms to describe string-to-string transformations. Many are based on automata and can be seen as operational descriptions, allowing direct implementations when the input scanner is deterministic. Alternatively, one…