Related papers: How to prove that a sequence is not automatic
We consider self-averaging sequences in which each term is a weighted average over previous terms. For several sequences of this kind it is known that they do not converge to a limit. These sequences share the property that $n$th term is…
We study certain sequences involving sums of powers of positive integers and in connection with this, we give examples to show that power majorization does not imply majorization.
For a proper subfield $K$ of $\QQ$ we show the existence of an algebraic number $\alpha$ such that no power $\alpha^n$, $n\geq 1$, lies in $K$. As an application it is shown that these numbers, multiplied by convenient Gaussian numbers, can…
The Hofstadter Q-sequence, with its simple definition, has defied all attempts at analyzing its behavior. Defined by a simple nested recurrence and an initial condition, the sequence looks approximately linear, though with a lot of noise.…
In many expert and everyday reasoning contexts it is very useful to reason on the basis of defeasible assumptions. For instance, if the information at hand is incomplete we often use plausible assumptions, or if the information is…
We illustrate a general technique for enumerating factors of k-automatic sequences by proving a conjecture on the number f(n) of unbordered factors of the Thue-Morse sequence. We show that f(n) <= n for n >= 4 and that f(n) = n infinitely…
The proofs first generated by automated theorem provers are far from optimal by any measure of simplicity. In this paper I describe a technique for simplifying automated proofs. Hopefully this discussion will stimulate interest in the…
We prove, in a quantitative form, linear independence results for values of a certain class of q-series, which generalize classical q-hypergeometric series. These results refine our recent estimates.
An infinite binary sequence is deemed to be random if it has all definable properties that hold almost surely for the usual probability measure on the set of infinite binary sequences. There are only countably many such properties, so it…
We discuss an interesting sequence defined recursively; namely, sequence A105774 from the On-Line Encyclopedia of Integer Sequences, and study some of its properties. Our main tools are Fibonacci representation, finite automata, and the…
An infinite permutation $\alpha$ is a linear ordering of $\mathbb N$. We study properties of infinite permutations analogous to those of infinite words, and show some resemblances and some differences between permutations and words. In this…
Let $\mathbb{F}_q$ denote the finite fields with $q$ elements. The permutation behavior of several classes of infinite families of permutation polynomials over finite fields have been studied in recent years. In this paper, we continue with…
We introduce a combinatorial criterion for verifying whether a formula is not the conjunction of an equation and a co-equation. Using this, we give a proof for the nonequationality of the free group. Furthermore, we generalize the latter…
In this paper, we study the weighted difference substitutions from geometrical views. First, we give the geometric meanings of the weighted difference substitutions, and introduce the concept of convergence of the sequence of substitution…
We prove the consistency of the existence of a $Q$-set whose square is not a $\Delta$-set and that if there is a $\Delta$-set, then there exists a $\Delta$-set whose all finite powers are $\Delta$-sets.
The question of whether quantum real-time one-counter automata (rtQ1CAs) can outperform their probabilistic counterparts has been open for more than a decade. We provide an affirmative answer to this question, by demonstrating a…
Quantum cellular automata consist in arrays of identical finite-dimensional quantum systems, evolving in discrete-time steps by iterating a unitary operator G. Moreover the global evolution G is required to be causal (it propagates…
In the setting of nonstandard analysis we introduce the notion of flexible sequence. The terms of flexible sequences are external numbers. These are a sort of analogue for the classical \emph{O$ (\cdot ) $} and \emph{o$ (\cdot ) $} notation…
We give a new graph-theoretic proof of Cobham's Theorem which says that the support of an automatic sequence is either sparse or grows at least like $N^\alpha$ for some $\alpha > 0$. The proof uses the notions of tied vertices and cycle…
We address a problem posed in [1] by demonstrating through an example that, in the absence of separability, the property of sequential cone compactness does not generally imply cone compactness.