Related papers: Colored compositions, Invert operator and elegant …
In this paper we examine a number of term rewriting system for integer number representations, building further upon the datatype defining systems described in [2]. In particular, we look at automated methods for proving confluence and…
We establish necessary and sufficient conditions for the boundedness and compactness of weighted composition operators acting on weighted Dirichlet spaces and determine the spectrum of a certain class of such operators. Our results extend…
In this paper, first we characterize closedness of range of the finite sum of weighted composition operators between different Lp-spaces. Then we discuss polar decomposition and invertibility of these operators.
A structured approach for the Collatz conjecture is presented using just the odd integers that are, in turn, divided into categories based on the roles they play such as Starter, Intermediary and Terminal. The expression 4x+1 is used as a…
The coloring problem is studied in the paper for graph classes defined by two small forbidden induced subgraphs. We prove some sufficient conditions for effective solvability of the problem in such classes. As their corollary we determine…
We classify the twisted tensor products of a finite set algebra with a two elements set algebra using colored quivers obtained through considerations analogous to Ore extensions. This provides also a classification of entwining structures…
Composition theory can be used to analyze and enumerate the number of ways a dealer in Blackjack can reach any given point total. The rules of Blackjack provide several restrictions on the number of compositions of a given number. While…
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.
The number of inversions is a statistic on permutation groups measuring the degree to which the entries of a permutation are out of order. We provide a generalization of that statistic by introducing the statistic number of pseudoinversions…
Properties of compositions and convex combinations of averaged nonexpansive operators are investigated and applied to the design of new fixed point algorithms in Hilbert spaces. An extended version of the forward-backward splitting…
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…
The aim of this paper is to introduce Hom-Novikov color algebras and give some constructions of Hom-Novikov color algebras from a given one and a (weak) morphism. Other interesting constructions using averaging operators, centroids,…
This article is about applications of linear algebra to knot theory. For example, for odd prime p, there is a rule (given in the article) for coloring the arcs of a knot or link diagram from the residues mod p. This is a knot invariant in…
The $a$-number is an invariant of the isomorphism class of the $p$-torsion group scheme. We use the Cartier operator on $H^0(\mathcal{A}_2,\Omega^1)$ to find a closed formula for the $a$-number of the form $\mathcal{A}_2 =…
We show that for every finite colouring of the natural numbers there exists $a,b >1$ such that the triple $\{a,b,a^b\}$ is monochromatic. We go on to show the partition regularity of a much richer class of patterns involving exponentiation.…
In the recent years, a lot of attention has been paid to the development of solid foundations for the composition and inversion of schema mappings. In this paper, we review the proposals for the semantics of these crucial operators. For…
An effective way to design structured coherent wave interference patterns that builds on the theory of coherent lattices, is presented. The technique combines prime number factorization in the complex plane with moir\'e theory to provide a…
In this note devoted to some aspects of the inverse problem of representation theory the attention is concentrated on the interrelations between various algebraic structures (algebras with operators) unraveled by different solutions of the…
Strongly correlated electron systems require the development of new theoretical schemes in order to describe their unusual and unexpected properties. The usual perturbation schemes are inadequate and new concepts must be introduced. In our…
Color coding is an algorithmic technique used in parameterized complexity theory to detect "small" structures inside graphs. The idea is to derandomize algorithms that first randomly color a graph and then search for an easily-detectable,…