Related papers: Multiplicative automatic sequences
In the present paper we extend the multiplicative integral to complex-valued functions of complex variable. The main difficulty in this way, that is the multi-valued nature of the complex logarithm, is avoided by division of the interval of…
We find an abundance of Cremer Julia sets of an arbitrarily high computational complexity.
We study multiplicative nested sums, which are generalizations of harmonic sums, and provide a calculation through multiplication of index matrices. Special cases interpret the index matrices as stochastic transition matrices of random…
We produce a long exact sequence whose terms are unit groups of associative algebras that behave as inner automorphisms of a given tensor. Our sequence generalizes known sequences for associative and non-associative algebras. In a manner…
Automata with monitor counters, where the transitions do not depend on counter values, and nested weighted automata are two expressive automata-theoretic frameworks for quantitative properties. For a well-studied and wide class of…
This paper describes a construction of supermartingales realized as automatic functions. A capital of supermartingales is represented using automatic capital groups~(ACG). Properties of these automatic supermartingales are then studied.…
Set-valued prediction is a well-known concept in multi-class classification. When a classifier is uncertain about the class label for a test instance, it can predict a set of classes instead of a single class. In this paper, we focus on…
We describe a method to evaluate multivariate polynomials over a finite field and discuss its multiplicative complexity.
We give a complete complexity classification for the problem of finding a solution to a given system of equations over a fixed finite monoid, given that a solution over a more restricted monoid exists. As a corollary, we obtain a complexity…
In this paper we get two new classes of regular sequences in the polynomial ring over the field of complex numbers.
In the classic problem of sequence prediction, a predictor receives a sequence of values from an emitter and tries to guess the next value before it appears. The predictor masters the emitter if there is a point after which all of the…
In this paper we look at the automorphisms of the multiplicative group of finite nearfields. We find partial results for the actual automorphism groups. We find counting techniques for the size of all finite nearfields. We then show that…
In this paper, we prove that a class of regular sequences can be viewed as projections of fixed points of uniform morphisms on a countable alphabet, and also can be generated by countable states automata. Moreover, we prove that the…
The classification of complex data usually requires the composition of processing steps. Here, a major challenge is the selection of optimal algorithms for preprocessing and classification (including parameterizations). Nowadays, parts of…
We investigate the construction of $\pm1$-valued completely multiplicative functions that take the value $+1$ at at most $k$ consecutive integers, which we call length-$k$ functions. We introduce a way to extend the length based on the idea…
In this manuscript, we give a classification of all irreducible, unitary representations of complex spin groups.
Following up on a paper of Balamohan, Kuznetsov, and Tanny, we analyze a variant of Hofstadter's Q-sequence and show it is 2-automatic. An automaton computing the sequence is explicitly given.
We define a class of sequences ${a_n}$ by $a_1=a$ and $a_{n+1}=P(a_n)$, where $P(x)$ is a polynomial with real coefficients. We then find out for which values $a$ and for which polynomials $P(x)$ these sequences will be constant after a…
In studying the complexity of iterative processes it is usually assumed that the arithmetic operations of addition, multiplication, and division can be performed in certain constant times. This assumption is invalid if the precision…
A classification of the global structure of monic and centered one-variable complex polynomial vector fields is presented.