An approach to the transformation of periodic sequences

2017 ◽  
Vol 27 (1) ◽  
pp. 1-6
Author(s):  
Vladimir G. Chirskii ◽  
Aleksey Yu. Nesterenko

AbstractWe consider a periodic sequence

Earlier papers in this series have discussed the interaction between two coplanar dislocation-type cracks and between coplanar cracks that form an infinite periodic sequence, the stability criteria being determined. This paper examines the stability of an infinite periodic sequence of noncoplanar dislocation-type cracks, particular consideration being given to the determination of the complete fracture criterion. Unlike the situation that exists for coplanar dislocation-type cracks, some aspects of the results are radically different depending on whether the mode of deformation is anti-plane strain, plane strain shear, or plane strain tension, and the different characteristics of the three models are emphasized. With the anti-plane strain model exact solutions can be obtained, but with both plane strain shear and plane strain tension models, the governing singular integral equations can only be solved when the cracks are widely spaced.


2014 ◽  
Vol 2014 ◽  
pp. 1-4 ◽  
Author(s):  
Yongfang Wang ◽  
Akbar Zada ◽  
Nisar Ahmad ◽  
Dhaou Lassoued ◽  
Tongxing Li

We prove that the discrete systemζn+1=Anζnis uniformly exponentially stable if and only if the unique solution of the Cauchy problemζn+1=Anζn+eiθn+1zn+1, n∈Z+,ζ0=0,is bounded for any real numberθand anyp-periodic sequencez(n)withz(0)=0. Here,Anis a sequence of bounded linear operators on Banach spaceX.


2015 ◽  
Vol 67 (1) ◽  
pp. 90-106
Author(s):  
Thierry Bousch

AbstractLet x = (x0; x1; … ) be a N-periodic sequence of integers (N ≥ 1), and s a sturmian sequence with the same barycenter (and also N-periodic, consequently). It is shown that, for affine functions ∝: RN(N) → R which are increasing relatively to some order ≤2 on RN(N) (the space of all N-periodic sequences), the average of |∝| on the orbit of x is greater than its average on the orbit of s.


2016 ◽  
Vol 66 (1) ◽  
Author(s):  
Michal Veselý ◽  
Petr Hasil

AbstractWe consider limit periodic sequences and functions with values in pseudometric spaces. We construct limit periodic sequences and functions with given values. For any totally bounded countable set, we find a limit periodic sequence which attains each value from this set periodically. A corresponding result concerning such a construction of limit periodic functions is proved as well. For any totally bounded countable set which is dense in itself, we construct a limit periodic bijective map from the integers into this set. As corollaries, we obtain new results about non-almost periodic solutions of almost periodic transformable difference systems.


2019 ◽  
Vol 73 (1) ◽  
pp. 9-18
Author(s):  
Milan Paštéka

Abstract In the first part we associate a periodic sequence with a partition and study the connection the distribution of elements of uniform limit of the sequences. Then some facts of statistical independence of these limits are proved.


Author(s):  
Галина Николаевна Жукова ◽  
Михаил Васильевич Ульянов

В статье рассмотрена задача восстановления символьных периодических последовательностей, искаженных шумами вставки, а также замены и удаления символов. Поскольку степень детализации символьного описания процесса определяется мощностью алфавита, представляет интерес исследование влияния степени детализации символьного описания на возможность восстановления полной информации об исходной периодической последовательности. Представлено экспериментальное исследование зависимости характеристик качества предложенного авторами метода восстановления периода от мощности алфавита. Для алфавитов разной мощности приводятся доля последовательностей с удовлетворительно восстановленным периодом и относительная погрешность определения длины периода. Качество восстановления оценивается отношением редакционного расстояния от восстановленной периодической последовательности до исходной строго периодической последовательности The relevance of this study is associated with the presence of a wide range of applied problems in real-world data processing and analysis. It is sensible to encode information using symbols from a finite alphabet in such problems. By varying the cardinality of the alphabet, in the description of the process, the symbolic representation provides a level of detail sufficient for real-world data analysis. However, for a number of subject areas in which it is possible to use symbolic coding of trajectories of the examined processes researchers face the presence of distortions, noise, and fragmentation of information. This occurs in bioinformatics, medicine, digital economy, time series forecasting and analysis of business processes. Periodic processes are widely represented in these subject areas. Without noise, these processes correspond to periodic symbolic sequences, i.e. words over a finite alphabet. A researcher often receives a sequence distorted by noises of various origins as the experimental data, instead of the expected periodic symbolic sequence. Under these conditions, when solving the problem of identifying the periodicity, which includes both the determination of a periodically repeating symbolic fragment and its length, hereinafter called the period, the problem requires reducing the effect of noise on the experimental results. The article deals with the problem of recovering periodic sequences, distorted by presence of noise along the replaced and deleted symbols. Since the level of detail in the description of the process depends on the cardinality of the alphabet, it is of interest to study the influence of the level of detail in the symbolic description on the possibility of recovering complete information about the initially periodic sequences. The article experimentally examines the dependence of the cardinality of the alphabet on the quality characteristics of the period recovery method proposed by the authors. For alphabets of different cardinalities, the proportion of sequences with a satisfactorily reconstructed period and the relative error in determining the length of the period are given. The quality of reconstruction of a periodically repeating fragment is estimated by the ratio of the editing distance from the reconstructed periodic sequence to the original sequence distorted by noise


2014 ◽  
Vol 10 (03) ◽  
pp. 623-636 ◽  
Author(s):  
FLORIAN LUCA ◽  
YOHEI TACHIYA

Let q be an integer with |q| > 1 and {an}n≥1 be an eventually periodic sequence of rational numbers, not identically zero from some point on. Then the number [Formula: see text] is irrational. In particular, if the periodic sequences [Formula: see text] of rational numbers are linearly independent over ℚ, then so are the following m + 1 numbers: [Formula: see text] This generalizes a result of Erdős who treated the case of m = 1 and [Formula: see text]. The method of proof is based on the original approaches of Chowla and Erdős, together with some results about primes in arithmetic progressions with large moduli of Ahlford, Granville and Pomerance.


Author(s):  
C. Porkodi ◽  
SR.Muthu Bharathi

The arithmetic properties of prime numbers are hard to predict and it is one of the fundamental problem in number theory. In this paper, with Sieve of Eratosthenes as basis a periodic sequence of numbers is generated. This periodic pattern is used to understand the prime numbers in a better way.


Sign in / Sign up

Export Citation Format

Share Document