Related papers: A Class of Recursive Sets
A class of determinants is introduced. Different kind of mathematical objects, such as Fibonacci, Lucas, Tchebychev, Hermite, Laguerre, Legendre polynomials, sums and covergents are represented as determinants from this class. A closed…
We propose a natural theory SO axiomatizing the class of sets of ordinals in a model of ZFC set theory. Both theories possess equal logical strength. Constructibility theory in SO corresponds to a natural recursion theory on ordinals.
A few notes about infinite trees in a descriptive set-theoretic setting.
Given an initial family of sets, we may take unions, intersections and complements of the sets contained in this family in order to form a new collection of sets; our construction process is done recursively until we obtain the last family.…
We introduce a concept called a collective: an interface with a protocol for aggregating contributions and distributing returns. Through such a protocol, many members may participate in a mutual endeavor. We present a variety of real-world…
The ensemble methods are meta-algorithms that combine several base machine learning techniques to increase the effectiveness of the classification. Many existing committees of classifiers use the classifier selection process to determine…
Recurrent neural networks for session-based recommendation have attracted a lot of attention recently because of their promising performance. repeat consumption is a common phenomenon in many recommendation scenarios (e.g., e-commerce,…
We provide an explicit method to construct dynamical systems which admit an a-priori prescribed attracting set. As application, we provide a method to construct perturbations of conservative dynamical systems, which admit an a-priori…
The concept of coreflexive set is introduced to study the structure of digraphs. New characterizations of line digraphs and nth-order line digraphs are given. Coreflexive sets also lead to another natural way of forming an intersection…
A class of random discrete distributions $P$ is introduced by means of a recursive splitting of unity. Assuming supercritical branching, we show that for partitions induced by sampling from such $P$ a power growth of the number of blocks is…
We prove recursive formulas for sums of squares and sums of triangular numbers in terms of sums of divisors functions and we give a variety of consequences of these formulas. Intermediate applications include statements about positivity of…
Random residue sequences (RR) may be used in many random number applications including those related to multiple access in communications. This paper investigates variations on an algorithm to generate RR sequences that was proposed earlier…
We consider arbitrary bounded discrete time series originating from dynamical system with recursivity. More precisely, we provide an explicit construction of recurrent neural networks which effectively approximate the corresponding discrete…
We consider the groups of regular circulant matrices over finite fields and integer residue class rings. In both cases we present a formula for the order of these groups. We also make a first step towards finding the algebraic structure of…
We develop a random model for relation algebras. We prove some preliminary results and pose questions that lay out a new direction of research.
In reinforcement learning, conducting task composition by forming cohesive, executable sequences from multiple tasks remains challenging. However, the ability to (de)compose tasks is a linchpin in developing robotic systems capable of…
The sets used to construct other mathematical objects are pure sets, which means that all of their elements are sets, which are themselves pure. One set may therefore be within another, not as an element, but as an element of an element, or…
Different constructions in the recursion theory use the so-called priority arguments. A general scheme was suggested by A.~Lachlan. Based on his work, we define the notion of a priority-closed class of requirements. Then, for a specific…
Time series analysis is relevant in various disciplines such as physics, biology, chemistry, and finance. In this paper, we present a novel neural network architecture that integrates elements from ResNet structures, while introducing the…
This work presents a recursive construction for simple $t$-designs using resolutions of the ingredient designs. The result extends a construction of $t$-designs in our recent paper [39]. Essentially, the method in [39] describes the blocks…