相关论文: A Class of Recursive Sets
We study links between first-order formulas and arbitrary properties for families of theories, classes of structures and their isomorphism types. Possibilities for ranks and degrees for formulas and theories with respect to given properties…
We consider posets of lattice paths (endowed with a natural order) and begin the study of such structures. We give an algebraic condition to recognize which ones of these posets are lattices. Next we study the class of Dyck lattices (i.e.,…
Recursive calls over recursive data are useful for generating probability distributions, and probabilistic programming allows computations over these distributions to be expressed in a modular and intuitive way. Exact inference is also…
We discuss a recursive formula for number of spanning trees in a graph. The paper is written primary for school students.
We introduce a class of rational functions $A:\,\mathbb C\mathbb P^1\rightarrow \mathbb C\mathbb P^1$ which can be considered as a natural extension of the class of Latt\`es maps and establish basic properties of functions from this class.
In this paper we introduce the concept of completeness of sets. We study this property on the set of integers. We examine how this property is preserved as we carry out various operations compatible with sets. We also introduce the problem…
In this paper we firstly review how to \textit{explicitly} solve a system of $3$ \textit{first-order linear recursions }and outline the main properties of these solutions. Next, via a change of variables, we identify a class of systems of…
We construct an infinite family of real cyclotomic fields with non-trivial class group. This result generalizes the result in [1] in the sense that our family includes theirs.
Recently, Neural Networks have been proven extremely effective in many natural language processing tasks such as sentiment analysis, question answering, or machine translation. Aiming to exploit such advantages in the Ontology Learning…
Set-valued prediction is a well-known concept in multi-class classification. When a classifier is uncertain about the class label for a test instance, it can predict a set of classes instead of a single class. In this paper, we focus on…
We study recursive-cube-of-rings (RCR), a class of scalable graphs that can potentially provide rich inter-connection network topology for the emerging distributed and parallel computing infrastructure. Through rigorous proof and validating…
We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…
In this paper, we study three applications of recursion to problems in coding and random permutations. First, we consider locally recoverable codes with partial locality and use recursion to estimate the minimum distance of such codes. Next…
Reproducibility is a confused terminology. In this paper, I take a fundamental view on reproducibility rooted in the scientific method. The scientific method is analysed and characterised in order to develop the terminology required to…
We obtain a complete classification of complex-valued sequences which are both multiplicative and automatic.
In this work, we present a method to generate probability distributions and classes of probability distributions, which broadens a process of probability distribution construction. In this method, distribution classes are built from…
This article discuss a class of tractable model in the form of polynomial type.
In this paper we give a generalization of injective and projective complexes.
Motivated by the application problem of sensor fusion the author introduced the concept of graded set. It is reasoned that in classification problem arising in an information system (represented by information table), a novel set called…
We provide a recursive construction of all the semi-Heyting algebras that can be defined on a chain with $n$ elements. This construction allows us to count them easily. We also compare the formula for the number of semi-Heyting chains thus…