Related papers: A Class of Recursive Sets
Machines whose main purpose is to permute and sort data are studied. The sets of permutations that can arise are analysed by means of finite automata and avoided pattern techniques. Conditions are given for these sets being enumerated by…
In this article, we study the structure, and in particular the Grundy values, of a family of games known as memgames.
We define the operation of composing two hereditary classes of permutations using the standard composition of permutations as functions and we explore properties and structure of permutation classes considering this operation. We mostly…
In this article some difficulties are deduced from the set of natural numbers. By using the method of transfinite recursion we define an iterative process which is designed to deduct all the non-greatest elements of the set of natural…
A system of nested dichotomies is a method of decomposing a multi-class problem into a collection of binary problems. Such a system recursively splits the set of classes into two subsets, and trains a binary classifier to distinguish…
A simple recursive scheme for parameterisation of n-by-n unitary matrices is presented.
A method of using recursive functions to describe state change is applied to process switching in UNIX-like operating systems.
The powers of generating functions and its properties are analyzed. A new class of functions is introduced, based on the application of compositions of an integer $n$, called composita. The methods for obtaining reciprocal and reverse…
Two types of recurrence sets are introduced for inverse semigroup partial actions in topological spaces. We explore their connections with similar notions for related types of imperfect symmetries (prefix inverse semigroup expansions,…
We provide new families of minimal codes in any characteristic. Also, an inductive construction of minimal codes is presented.
The aim of this paper is to present a recursive construction of simple t-designs for arbitrary t. The construction is of purely combinatorial nature and it requires finding solutions for the indices of the ingredient designs that satisfy a…
The purpose of these notes is to collect in one place some facts on the category of finite totally ordered sets and some related categories. More specifically, we collect some results on them which will be useful for the study of iteratedly…
Sequential recommender systems are an important and demanded area of research. Such systems aim to use the order of interactions in a user's history to predict future interactions. The premise is that the order of interactions and…
An elementary approach to the construction of Coxeter group representations is presented.
Through the following, we establish the conditions which allow us to express recursive sequences of real numbers, enumerated through the recurrence relation a_{n+1} = Aa_n + Ba_{n-1}, by means of algebraic equations in two variables of…
In this paper we study the problem of constructing non-trivial subtowers and supertowers of recursive towers of function fields over finite fields.
Using ideas from synthetic topology, a new approach to descriptive set theory is suggested. Synthetic descriptive set theory promises elegant explanations for various phenomena in both classic and effective descriptive set theory.…
We introduce a subclass of linear recurrence sequences which we call poly-rational sequences because they are denoted by rational expressions closed under sum and product. We show that this class is robust by giving several…
An approach is proposed which, given a family of linearly independent functions, constructs the appropriate biorthogonal set so as to represent the orthogonal projector operator onto the corresponding subspace. The procedure evolves…
In this article we are interested in a differential inclusion defined by an isotropic compact set.