Related papers: On repetitive right application of B-terms
This article aims to be a self-contained account of the history of the B. B. Newman Spelling Theorem, including the historical context in which it arose. First, an account of B. B. Newman and how he came to prove his Spelling Theorem is…
A recurrence relations for sums of powers of complex functions can be written as a system of linear equation AX=B. Using properties of determinant and Cramer's rule for solving systems of linear equation, this paper presents an absolutely…
The properties of a system of n = 3 coupled oscillators with linear terms in the velocities (magnetic terms) depending in two parameters are studied. We proved the existence of a bi-Hamiltonian structure arising from a non-symplectic…
This work is a study of polynomial compositions having a fixed number of terms. We outline a recursive method to describe these characterizations, give some particular results and discuss the general case. In the final sections, some…
The purpose of this paper is to clarify the relationship between various conditions implying essential undecidability: our main result is that there exists a theory $T$ in which all partially recursive functions are representable, yet $T$…
We present a unified theory for formal mathematical systems including recursive systems closely related to formal grammars, including the predicate calculus as well as a formal induction principle. We introduce recursive systems generating…
The \emph{Continuity Problem} is the question whether effective operators are continuous, where an effective operator $F$ is a function on a space of constructively given objects $x$, defined by mapping construction instructions for $x$ to…
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…
The transfer property for the generalized Browder's theorem both of the tensor product and of the left-right multiplication operator will be characterized in terms of the $B$-Weyl spectrum inclusion. In addition, the isolated points of…
We consider a class of generalized binomials emerging in fractional calculus. After establishing some general properties, we focus on a particular yet relevant case, for which we provide several ready-for-use combinatorial identities,…
A criterion to obtain frequent hypercyclicity for a sequence of convolution operators on the space of entire functions on the complex plane is provided. The criterion involves that the generating functions of the operators do not vanish on…
The compactness lemma in programming language theory states that any recursive function can be simulated by a finite unrolling of the function. One important use case it has is in the logical relations proof technique for proving properties…
The theory of two binary relations has the strong amalgamation property when the first relation is assumed to be coarser than the second relation, and each relation satisfies a chosen set of properties from the following list: transitivity,…
The article focuses on word (or string) attractors, which are sets of positions related to the text compression efficiency of the underlying word. The article presents two combinatorial algorithms based on Suffix automata or Directed…
An operator $T \in \mathcal{B}(X)$ defined on a Banach space $X$ satisfies property $(gb)$ if the complement in the approximate point spectrum $\sigma_{a}(T)$ of the upper semi-B-Weyl spectrum $\sigma_{SBF_{+}^{-}}(T)$ coincides with the…
We use high girth, high chromatic number hypergraphs to show that there are finite models of the equational theory of the semiring of nonnegative integers whose equational theory has no finite axiomatisation, and show this also holds if…
We recall the concept of Baxterisation of an R-matrix, or of a monodromy matrix, which corresponds to build, from one point in the $ R$-matrix parameter space, the algebraic variety where the spectral parameter(s) live. We show that the…
Structured recursion schemes such as folds and unfolds have been widely used for structuring both functional programs and program semantics. In this context, it has been customary to implement denotational semantics as folds over an…
Conditional term rewriting is an intuitive yet complex extension of term rewriting. In order to benefit from the simpler framework of unconditional rewriting, transformations have been defined to eliminate the conditions of conditional term…
The clone of term operations of an algebraic structure consists of all operations that can be expressed by a term in the language of the structure. We consider bounds for the length and the height of the terms expressing these functions,…