scholarly journals Periodic codings of Bratteli-Vershik systems

2020 ◽  
Vol 126 (2) ◽  
pp. 298-320
Author(s):  
Sarah Frick ◽  
Karl Petersen ◽  
Sandi Shields

We develop conditions for the coding of a Bratteli-Vershik system according to initial path segments to be periodic, equivalently for a constructive symbolic recursive scheme corresponding to a cutting and stacking process to produce a periodic sequence. This is a step toward understanding when a Bratteli-Vershik system can be essentially faithfully represented by means of a natural coding as a subshift on a finite alphabet.

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


1983 ◽  
Vol 133 ◽  
pp. 207-216 ◽  
Author(s):  
John W. Miles

The evolution of a weakly nonlinear, weakly dispersive gravity wave in water of depth d over a bottom of gradual slope δ and Chezy friction coefficient Cf is studied. It is found that an initially sinusoidal wave evolves into a periodic sequence of solitary waves with relative amplitude a/d = α1 = 15δ/4Cf if α1 < αb, where αb is the relative amplitude above which breaking occurs. This prediction is supported by observations (Wells 1978) of the evolution of swell over mudflats.


Author(s):  
Rong Ran ◽  
Hayoung Oh

AbstractSparse-aware (SA) detectors have attracted a lot attention due to its significant performance and low-complexity, in particular for large-scale multiple-input multiple-output (MIMO) systems. Similar to the conventional multiuser detectors, the nonlinear or compressive sensing based SA detectors provide the better performance but are not appropriate for the overdetermined multiuser MIMO systems in sense of power and time consumption. The linear SA detector provides a more elegant tradeoff between performance and complexity compared to the nonlinear ones. However, the major limitation of the linear SA detector is that, as the zero-forcing or minimum mean square error detector, it was derived by relaxing the finite-alphabet constraints, and therefore its performance is still sub-optimal. In this paper, we propose a novel SA detector, named single-dimensional search-based SA (SDSB-SA) detector, for overdetermined uplink MIMO systems. The proposed SDSB-SA detector adheres to the finite-alphabet constraints so that it outperforms the conventional linear SA detector, in particular, in high SNR regime. Meanwhile, the proposed detector follows a single-dimensional search manner, so it has a very low computational complexity which is feasible for light-ware Internet of Thing devices for ultra-reliable low-latency communication. Numerical results show that the the proposed SDSB-SA detector provides a relatively better tradeoff between the performance and complexity compared with several existing detectors.


2021 ◽  
Vol 2021 (4) ◽  
Author(s):  
James Drummond ◽  
Jack Foster ◽  
Ömer Gürdoğan ◽  
Chrysostomos Kalousios

Abstract We address the appearance of algebraic singularities in the symbol alphabet of scattering amplitudes in the context of planar $$ \mathcal{N} $$ N = 4 super Yang-Mills theory. We argue that connections between cluster algebras and tropical geometry provide a natural language for postulating a finite alphabet for scattering amplitudes beyond six and seven points where the corresponding Grassmannian cluster algebras are finite. As well as generating natural finite sets of letters, the tropical fans we discuss provide letters containing square roots. Remarkably, the minimal fan we consider provides all the square root letters recently discovered in an explicit two-loop eight-point NMHV calculation.


Author(s):  
Guiyang Xia ◽  
Yan Lin ◽  
Xiaobo Zhou ◽  
Weibin Zhang ◽  
Feng Shu ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document