Related papers: D-finite Numbers
We define a class of functions termed "Computable in the Limit", based on the Machine Learning paradigm of "Identification in the Limit". A function is Computable in the Limit if it defines a property P_p of a recursively enumerable class A…
A finite semifield $D$ is a finite nonassociative ring with identity such that the set $D^*=D\setminus\{0\}$ is closed under the product. In this paper we obtain a computer-assisted description of all 64-element finite semifields, which…
We consider multivariate polynomials and investigate how many zeros of multiplicity at least $r$ they can have over a Cartesian product of finite subsets of a field. Here r is any prescribed positive integer and the definition of…
In this technical report, certain interesting classification of arithmetical functions is proposed. The notion of additively decomposable and multiplicatively decomposable arithmetical functions is proposed. The concepts of arithmetical…
In this paper, we prove two results related to the solutions of norm form equations. Firstly, we give a finiteness result for sums of terms of linear recurrence sequences appearing in the coordinates of solutions of norm form equations.…
An integer sequence that is defined by initial values and a linear recurrence with constant integer coefficients, can be represented by the difference of two arithmetic terms containing exponentiation. All constants occuring in the term are…
In formal languages and automata theory, the magic number problem can be formulated as follows: for a given integer n, is it possible to find a number d in the range [n,2^n] such that there is no minimal deterministic finite automaton with…
Our original results refer to multivariate recurrences: discrete multitime diagonal recurrence, bivariate recurrence, trivariate recurrence, solutions tailored to particular situations, second order multivariate recurrences, characteristic…
Algebraic characterizations of the computational aspects of functions defined over the real numbers provide very effective tool to understand what computability and complexity over the reals, and generally over continuous spaces, mean. This…
We define natural A_infinity-transformations and construct A_infinity-category of A_infinity-functors. The notion of non-strict units in an A_infinity-category is introduced. The 2-category of (unital) A_infinity-categories, (unital)…
Given a prime power $p^d$ with $p$ a prime and $d$ a positive integer, we classify the finite groups $G$ with $p^{2d}$ dividing $|G|$ in which all subgroups of order $p^d$ are complemented and the finite groups $G$ having a normal…
We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…
In this paper we look at normed spaces of differentiable functions on compact plane sets, including the spaces of infinitely differentiable functions originally considered by Dales and Davie. For many compact plane sets the classical…
It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their power series expansions. We show that the linear differential…
We study the complexity classes P and NP through a semigroup fP ("polynomial-time functions"), consisting of all polynomially balanced polynomial-time computable partial functions. Then P is not equal to NP iff fP is a non-regular…
Contrary to popular misconception, the question in the title is far from simple. It involves sets of numbers on the first level, sets of sets of numbers on the second level, and so on, endlessly. The infinite hierarchy of the levels…
This paper introduces the notion of referring forms as a new metric for analyzing sequential circuits from a functional perspective. Sequential circuits are modeled as causal stream functions, the outputs of which depend solely on the past…
The ring of dual numbers over a ring $R$ is $R[\alpha] = R[x]/(x^2)$, where $\alpha$ denotes $x+(x^2)$. For any finite commutative ring $R$, we characterize null polynomials and permutation polynomials on $R[\alpha]$ in terms of the…
Consider a sequence of real-valued functions of a real variable given by a homogeneous linear recursion with differentiable coefficients. We show that if the functions in the sequence are differentiable, then the sequence of derivatives…
We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. In addition to divisibility and irreducibility results we also consider…