相关论文: A Class of Recursive Sets

Let X be a subshift satisfy non-uniform structure. In this paper, we give quantitative estimate of the recurrence sets. These results can be applied to a large class of symbolic systems, including beta-shifts, S-gap shifts and their…

We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…

The main results of this paper are generalizations some classical theorems about transversals for families of finite sets to some cases of families of infinite sets.

Many graph polynomials, such as the Tutte polynomial, the interlace polynomial and the matching polynomial, have both a recursive definition and a defining subset expansion formula. In this paper we present a general, logic-based framework…

When humans perform inductive learning, they often enhance the process with background knowledge. With the increasing availability of well-formed collaborative knowledge bases, the performance of learning algorithms could be significantly…

In this paper 101 new integer sequences, sub-sequences, and sequences of sequences, together with related unsolved problems and conjectures, are presented. Also, definitions, examples, solved or open questions, and references for each…

This paper deals with the problem of classifying signals. The new method for building so called local classifiers and local features is presented. The method is a combination of the lifting scheme and the support vector machines. Its main…

We obtain solutions to the recursive sequences of the form $$x_{n + 1} = \frac{x_{n - 3}x_{n }}{x_{n - 2}(a_n + b_nx_{n -3}x_{n})}$$ where $a_n$ and $b_n$ are arbitrary sequences of real numbers, and the initial values are gives as;…

This communication records some observations made in the course of studying one-relator groups from the point of view of residual solvability. As a contribution to clas- sification efforts we single out some relator types that render the…

One-class recognition is traditionally approached either as a representation learning problem or a feature modeling problem. In this work, we argue that both of these approaches have their own limitations; and a more effective solution can…

In order to speed-up classification models when facing a large number of categories, one usual approach consists in organizing the categories in a particular structure, this structure being then used as a way to speed-up the prediction…

Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence in terms of relatively simple invariants. Where…

We present here an elementary construction of an aperiodic tile set. Although there already exist dozens of examples of aperiodic tile sets we believe this construction introduces an approach that is different enough to be interesting and…

We consider compositions of natural numbers when there are different types of each natural number. Several recursions as well as some closed formulas for the number of compositions is derived. We also find its relationships with some known…

By some new recursive algorithms, in this paper, we will give some improvements on Waring's problem.

In this paper we develop a classification of real functions based on growth rates of repeated iteration. We show how functions are naturally distinguishable when considering inverses of repeated iterations. For example, $n+2\to 2n\to 2^n\to…

A geometric grid class consists of those permutations that can be drawn on a specified set of line segments of slope \pm1 arranged in a rectangular pattern governed by a matrix. Using a mixture of geometric and language theoretic methods,…

In this note, we establish some new results on some special types of function algebras and also give new proofs to some existing ones

The problem of calculating multicanonical parameters recursively is discussed. I describe in detail a computational implementation which has worked reasonably well in practice.

For a set of nonnegative integers $A$, denote by $R_{A}(n)$ the number of unordered representations of the integer $n$ as the sum of two different terms from $A$. In this paper we partially describe the structure of the sets, which have…