Related papers: Sequences close to periodic
Mathematicians tend to use the phrase "arbitrarily close" to mean something along the lines of "every neighborhood of a point intersects a set". Taking the latter statement as a technical definition for arbitrarily close leads to an…
Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…
We present a method that allows to distinguish between nearly periodic and strictly periodic time series. To this purpose, we employ a conservative criterion for periodicity, namely that the time series can be interpolated by a periodic…
In context of efforts of composing category-theoretic and logical methods in the area of knowledge representation we propose the notion of conceptory. We consider intersection/union and other constructions in conceptories as expressive…
Distributional semantics provides multi-dimensional, graded, empirically induced word representations that successfully capture many aspects of meaning in natural languages, as shown in a large body of work in computational linguistics;…
In this survey we overview known results and get several new results on digraph compositions which generalize several classes of digraphs, such as quasi-transitive digraphs. After an introductory section, the paper is divided into six…
This paper is to characterize piecewise continuous almost periodic functions as the product of Bohr almost periodic functions and sequences. As an application, the result is used to discuss piecewise continuous almost periodic solutions of…
In connection to the development of the field of Combinatorics on Words, we present a list of open problems and conjectures that were stated during the ten last meetings WORDS. We wish to continually update the present document by adding…
In this talk we introduce several topics in combinatorial number theory which are related to groups; the topics include combinatorial aspects of covers of groups by cosets, and also restricted sumsets and zero-sum problems on abelian…
A new numerical characterization of symbolic sequences is proposed. The partition of sequence based on Ke and Tong algorithm is a starting point. Algorithm decomposes original sequence into set of distinct subsequences - a patterns. The set…
This survey article is the outgrowth of two talks given at the Journ\'ees X-UPS "P\'eriodes et transcendance" at \'Ecole polytechnique. Periods are complex numbers whose real and imaginary parts can be written as integrals of rational…
This is a survey article on selected topics in approximation theory. The topics either use techniques from the theory of several complex variables or arise in the study of the subject. The survey is aimed at readers having an acquaintance…
We show that a set is almost periodic if and only if the associated exponential sum is concentrated in the minor arcs. Hence binary additive problems involving almost periodic sets can be solved using the circle method.
In this short note, we simply collect some known results about representing algebraic cycles by various kind of "nice" (e.g. smooth, local complete intersection, products of local complete intersection) algebraic cycles, up to rational…
A short survey about combinatorics on words and algorithmic methods in a ring. Special attention is given to Shirshov's results. Adopted for undegraduate students.
This paper begins with a comprehensive overview of combinatorics on words and symbolic dynamics, covering their historical origins, fundamental concepts, and interconnections. Building upon this foundation, we introduce novel mathematical…
This paper introduces almost partitionable sets to generalize the known concept of partitionable sets. These notions provide a unified frame to construct $\mathbb{Z}$-cyclic patterned starter whist tournaments and cyclic balanced sampling…
We present a new approach to formal language theory using Kolmogorov complexity. The main results presented here are an alternative for pumping lemma(s), a new characterization for regular languages, and a new method to separate…
These notes are a continuation of topics covered by V. Selegej in his article "Electronic Dictionaries and Computational lexicography". How can an electronic dictionary have as its object the description of closely related languages?…
In this paper, we first give the definition of random almost periodic solutions of random dynamical systems and give some examples. Then, we prove the existence of such random almost periodic solutions. Further, we introduce the definition…