Related papers: A Class of Recursive Sets

In this paper, we give a class of reconstructible graphs.

In this paper, we give a new class of reconstructible graphs, which is an extension of my paper `A class of reconstructible graphs'.

Let $R$ be an associative ring with identity and let $N$ be a nil ideal of $R$. It is shown that units of $R/N$ can be lifted to units in $R$. Under some mild conditions on the ring, a procedure is given to determine those lifted units in a…

In this note we axiomatize the classes of rudimentary functions, primitive recursive functions, safe recursive set functions, and predicatively computable functions.

We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.

We define recurrence matrices and study a few properties (links with automatic sequences, branch groups etc.) of them.

A class of spherical functions is studied which can be viewed as the matrix generalization of Bessel functions. We derive a recursive structure for these functions. We show that they are only special cases of more general radial functions…

We consider estimation procedures which are recursive in the sense that each successive estimator is obtained from the previous one by a simple adjustment. We propose a wide class of recursive estimation procedures for the general…

In this paper we give a method, based on the characteristic function of a set, to solve some difficult problems of set theory in undergraduate research.

One of the most popular and studied recursive series is the Fibonacci sequence. It is challenging to see how Fibonacci numbers can be used to generate other recursive sequences. In our article, we describe some families of integer…

After a short review of the Method of Recursive Counting we introduce a general algebraic description of recursive lattice building. This provides a rigorous framework for discussion of method's limitations.

We continue the work begun in OEIS sequence A332636 which presents recursive sequences that have triangles that appear embedded in them. This paper i) generalizes the main result presented in A332636, ii) provides a complete set of…

We introduce the notion of an enriched set, as an abstraction of enriched categories, and a category of enriched sets. The set of enriched sets is itself described as a set enriched over the category of enriched sets. We introduce a method…

Complex functions have multiple uses in various fields of study, so analyze their characteristics it is of extensive interest to other sciences. This work begins with a particular class of rational functions of a complex variable; over this…

We construct a set of strong recurrence which is not a van der Corput set. This shows that the class of enhanced van der Corput sets is a proper subclass of sets of strong recurrence. In addition, we derive that the class of sets of strong…

We study a new type of sequences whose elements are defined in terms of the position, sign and magnitude of another element of the sequence. The name ultra-recursive comes from the fact that these sequences possess terms that are generated…

A recursive random number generator using prime reciprocals is described.

We use model theoretic techniques to construct explicit first-order axiomatizations for the classes of posets that can be represented as systems of sets, where the order relation is given by inclusion, and existing meets and joins of…

Characteristic points have been a primary tool in the study of a generating function defined by a single recursive equation. We investigate the proper way to adapt this tool when working with multi-equation recursive systems.

In several domains, data objects can be decomposed into sets of simpler objects. It is then natural to represent each object as the set of its components or parts. Many conventional machine learning algorithms are unable to process this…