Related papers: Strongly k-recursive sequences

We present algorithms that learn certain classes of function-free recursive logic programs in polynomial time from equivalence queries. In particular, we show that a single k-ary recursive constant-depth determinate clause is learnable.…

Consider a totally disconnected group G, which is covirtually cyclic, i.e., contains a normal compact open subgroup L such that G/L is infinite cyclic. We establish a Wang sequence, which computes the algebraic K-groups of the Hecke algebra…

Recurrent Networks are one of the most powerful and promising artificial neural network algorithms to processing the sequential data such as natural languages, sound, time series data. Unlike traditional feed-forward network, Recurrent…

We prove that random hypergraphs are asymptotically almost surely resiliently Hamiltonian. Specifically, for any $\gamma>0$ and $k\ge3$, we show that asymptotically almost surely, every subgraph of the binomial random $k$-uniform hypergraph…

A set is called recurrent if its minimal automaton is strongly connected and birecurrent if it is recurrent as well as its reversal. We prove a series of results concerning birecurrent sets. It is already known that any birecurrent set is…

We develop some basic results about full amalgamation classes with intrinsic trascendentals. These classes have generics whose models may have finite subsets whose intrinsic closure is not contained in its algebraic closure. We will show…

Categorical skew lattices are a variety of skew lattices on which the natural partial order is especially well behaved. While most skew lattices of interest are categorical, not all are. They are characterized by a countable family of…

In this work we extend our study on a link between automaticity and certain algebraic power series over finite fields. Our starting point is a family of sequences in a finite field of characteristic $2$, recently introduced by the first…

We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence…

A grammar logic refers to an extension to the multi-modal logic K in which the modal axioms are generated from a formal grammar. We consider a proof theory, in nested sequent calculus, of grammar logics with converse, i.e., every modal…

For a continuous flow on a compact metric space, the aim of this paper is to prove a Conley-type decomposition of the strong chain recurrent set. We first discuss in details the main properties of strong chain recurrent sets. We then…

We define and study the categorical sequence of a space, which is a new formalism that streamlines the computation of the Lusternik-Schnirelmann category of a space X by induction on its CW skeleta. The k-th term in the categorical sequence…

Let (F_n^{(k)})_{n\geq -(k-2)} be the k-generalized Fibonacci sequence, defined as the linear recurrence sequence whose first k terms are \(0, 0, \ldots, 0, 1\), and whose subsequent terms are determined by the sum of the preceding k terms.…

In this article we consider exceptional sequences of invertible sheaves on smooth complete rational surfaces. We show that to every such sequence one can associate a smooth complete toric surface in a canonical way. We use this structural…

Following ideas of Lawvere and Linton we prove that classical varieties are precisely the exact categories with a varietal generator. This means a strong generator which is abstractly finite and regularly projective. An analogous…

We introduce strong group coalgebras, as a generalization of strongly graded coalgebras. We give several characterizations, and study two special types of strong group coalgebras, namely cleft group algebras (or crossed coproduct group…

Given an algebraically closed field $K$, a dynamical sequence over $K$ is a $K$-valued sequence of the form $a(n):= f(\phi^n(x_0))$, where $\phi\colon X\to X$ and $f\colon X\to\mathbb{A}^1$ are rational maps defined over $K$, and $x_0\in X$…

We develop a new analysis for the length of controlled bad sequences in well-quasi-orderings based on Higman's Lemma. This leads to tight multiply-recursive upper bounds that readily apply to several verification algorithms for…

In this paper, we define and study the concept of traceable regressions. These are sequences of regressions in joint or single responses for which a corresponding regression graph captures not only an independence structure but represents,…

We classify extensions of certain classifiable C*-algebras using the six term exact sequence in K-theory together with the positive cone of the K_0-groups of the distinguished ideal and quotient. We then apply our results to a class of…