Related papers: Strongly k-recursive sequences
This paper aims to systematically study mystic reflection groups that emerged independently in the paper [Selecta Math. (N.S.) 14 (2009), 325-372, arXiv:0806.0867] by the authors and in the paper [Algebr. Represent. Theory 13 (2010),…
In this paper, we extend some classes of structured matrices to higher order tensors. We discuss their relationships with positive semi-definite tensors and some other structured tensors. We show that every principal sub-tensor of such a…
This paper shows how Long Short-term Memory recurrent neural networks can be used to generate complex sequences with long-range structure, simply by predicting one data point at a time. The approach is demonstrated for text (where the data…
In this paper, we have constructed the higher order k-bonacci matrices and studied some of their basic properties. We have also shown that these matrices satisfying some new and interesting relations in k-bonacci recurrence. This is the…
An automatic sequence is a letter-to-letter coding of a fixed point of a uniform morphism. More generally, we have morphic sequences, which are letter-to-letter codings of fixed points of arbitrary morphisms. There are many examples where…
We present an overview of the notions of exact sequences of Hopf algebras and tensor categories and their connections. We also present some examples illustrating their main features; these include simple fusion categories and a natural…
We define recurrence matrices and study a few properties (links with automatic sequences, branch groups etc.) of them.
Deterministic one-way time-bounded multi-counter automata are studied with respect to their ability to perform reversible computations, which means that the automata are also backward deterministic and, thus, are able to uniquely step the…
In this paper we use the Recursion Theorem to show the existence of various infinite sequences and sets. Our main result is that there is an increasing sequence e_0, e_1, e_2 .. such that W_{e_n}={e_{n+1}} for every n. Similarly, we prove…
A Hankel tensor is called a strong Hankel tensor if the Hankel matrix generated by its generating vector is positive semi-definite. It is known that an even order strong Hankel tensor is a sum-of-squares tensor, and thus a positive…
Non-classical negations may fail to be contradictory-forming operators in more than one way, and they often fail also to respect fundamental meta-logical properties such as the replacement property. Such drawbacks are witnessed by intricate…
This paper presents a class of random orthogonal sequences associated with the number theoretic Hilbert transform. We present a constructive procedure for finding the random sequences for different modulus values. These random sequences…
We show that a well-known exact sequence in K-theory for quotients of triangulated categories descends to numerical K-groups provided that the category, the quotient and the category we take the quotient with has a numerical K-group, and if…
Deep neural networks are revolutionizing the way complex systems are developed. However, these automatically-generated networks are opaque to humans, making it difficult to reason about them and guarantee their correctness. Here, we propose…
It is well-known that there exist infinite sequences that are the fixed point of non-uniform morphisms, but not $k$-automatic for any $k$. In this note we show that every $k$-automatic sequence is the image of a fixed point of a {\it…
For an integer $q\ge2$, a $q$-recursive sequence is defined by recurrence relations on subsequences of indices modulo some powers of~$q$. In this article, $q$-recursive sequences are studied and the asymptotic behavior of their summatory…
We prove that a sequence is primitive substitutive if and only if the set of its derived sequences is finite; we defined these sequences here.
Deep Learning models enjoy considerable success in Natural Language Processing. While deep architectures produce useful representations that lead to improvements in various tasks, they are often difficult to interpret. This makes the…
An increasing sequence $(a_n)$ of positive integers which satisfies $\frac{a_{n+1}}{a_n}>1+\eta$ for some positive $\eta$ is called a lacunary sequence. It has been known for over twenty years that every lacunary sequence is strong sweeping…
We propose a new definition of effective formulas for problems in enumerative combinatorics. We outline the proof of the fact that every linear recurrence sequence of integers has such a formula. It follows from a lower bound that can be…