Pub Date : 2021-12-15DOI: 10.33581/2520-6508-2021-3-68-83
Evgeniya A. Blinova, P. Urbanovich
The description of the steganographic method for embedding the digital watermark into image vector files of the SVG format is given. Vector images in SVG format can include elements based on Bezier curves. The proposed steganographic method is based on the splitting of cubic Bezier curves. Embedding hidden information involves splitting cubic Bezier curves according to the digital watermark given as numerical sequence. Algorithms of direct and reverse steganographic transformation are considered for proving the authenticity and integrity of a digital vector image. The StegoSVG library has been developed to implement forward and reverse steganographic transformations. The developed desktop application that implements the method is briefly described.
{"title":"Steganographic method based on hidden messages embedding into Bezier curves of SVG images","authors":"Evgeniya A. Blinova, P. Urbanovich","doi":"10.33581/2520-6508-2021-3-68-83","DOIUrl":"https://doi.org/10.33581/2520-6508-2021-3-68-83","url":null,"abstract":"The description of the steganographic method for embedding the digital watermark into image vector files of the SVG format is given. Vector images in SVG format can include elements based on Bezier curves. The proposed steganographic method is based on the splitting of cubic Bezier curves. Embedding hidden information involves splitting cubic Bezier curves according to the digital watermark given as numerical sequence. Algorithms of direct and reverse steganographic transformation are considered for proving the authenticity and integrity of a digital vector image. The StegoSVG library has been developed to implement forward and reverse steganographic transformations. The developed desktop application that implements the method is briefly described.","PeriodicalId":36323,"journal":{"name":"Zhurnal Belorusskogo Gosudarstvennogo Universiteta. Matematika. Informatika","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41635328","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-12-15DOI: 10.33581/2520-6508-2021-3-34-50
V. Beresnevich, V. Bernik, F. Götze, E. V. Zasimovich, N. Kalosha
The article is devoted to the latest results in metric theory of Diophantine approximation. One of the first major result in area of number theory was a theorem by academician Jonas Kubilius. This paper is dedicated to centenary of his birth. Over the last 70 years, the area of Diophantine approximation yielded a number of significant results by great mathematicians, including Fields prize winners Alan Baker and Grigori Margulis. In 1964 academician of the Academy of Sciences of BSSR Vladimir Sprindžuk, who was a pupil of academician J. Kubilius, solved the well-known Mahler’s conjecture on the measure of the set of S-numbers under Mahler’s classification, thus becoming the founder of the Belarusian academic school of number theory in 1962.
{"title":"Contribution of Jonas Kubilius to the metric theory of Diophantine approximation of dependent variables","authors":"V. Beresnevich, V. Bernik, F. Götze, E. V. Zasimovich, N. Kalosha","doi":"10.33581/2520-6508-2021-3-34-50","DOIUrl":"https://doi.org/10.33581/2520-6508-2021-3-34-50","url":null,"abstract":"The article is devoted to the latest results in metric theory of Diophantine approximation. One of the first major result in area of number theory was a theorem by academician Jonas Kubilius. This paper is dedicated to centenary of his birth. Over the last 70 years, the area of Diophantine approximation yielded a number of significant results by great mathematicians, including Fields prize winners Alan Baker and Grigori Margulis. In 1964 academician of the Academy of Sciences of BSSR Vladimir Sprindžuk, who was a pupil of academician J. Kubilius, solved the well-known Mahler’s conjecture on the measure of the set of S-numbers under Mahler’s classification, thus becoming the founder of the Belarusian academic school of number theory in 1962.","PeriodicalId":36323,"journal":{"name":"Zhurnal Belorusskogo Gosudarstvennogo Universiteta. Matematika. Informatika","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43646417","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-12-14DOI: 10.33581/2520-6508-2021-3-84-97
A. Prihozhy
The problem of synthesis and optimisation of logical reversible and quantum circuits from functional descriptions represented as decision diagrams is considered. It is one of the key problems being solved with the aim of creating quantum computing technology and quantum computers. A new method of stepwise transformation of the initial functional specification to a quantum circuit is proposed, which provides for the following project states: reduced ordered binary decision diagram, if-decision diagram, functional if-decision diagram, reversible circuit and quantum circuit. The novelty of the method consists in extending the Shannon and Davio expansions of a Boolean function on a single variable to the expansions of the same Boolean function on another function with obtaining decomposition products that are represented by incompletely defined Boolean functions. Uncertainty in the decomposition products gives remarkable opportunities for minimising the graph representation of the specified function. Instead of two outgoing branches of the binary diagram vertex, three outgoing branches of the if-diagram vertex are generated, which increase the level of parallelism in reversible and quantum circuits. For each transformation step, appropriate mapping rules are proposed that reduce the number of lines, gates and the depth of the reversible and quantum circuit. The comparison of new results with the results given by the known method of mapping the vertices of binary decision diagram into cascades of reversible and quantum gates shows a significant improvement in the quality of quantum circuits that are synthesised by the proposed method.
{"title":"Synthesis of quantum circuits based on incompletely specified functions and if-decision diagrams","authors":"A. Prihozhy","doi":"10.33581/2520-6508-2021-3-84-97","DOIUrl":"https://doi.org/10.33581/2520-6508-2021-3-84-97","url":null,"abstract":"The problem of synthesis and optimisation of logical reversible and quantum circuits from functional descriptions represented as decision diagrams is considered. It is one of the key problems being solved with the aim of creating quantum computing technology and quantum computers. A new method of stepwise transformation of the initial functional specification to a quantum circuit is proposed, which provides for the following project states: reduced ordered binary decision diagram, if-decision diagram, functional if-decision diagram, reversible circuit and quantum circuit. The novelty of the method consists in extending the Shannon and Davio expansions of a Boolean function on a single variable to the expansions of the same Boolean function on another function with obtaining decomposition products that are represented by incompletely defined Boolean functions. Uncertainty in the decomposition products gives remarkable opportunities for minimising the graph representation of the specified function. Instead of two outgoing branches of the binary diagram vertex, three outgoing branches of the if-diagram vertex are generated, which increase the level of parallelism in reversible and quantum circuits. For each transformation step, appropriate mapping rules are proposed that reduce the number of lines, gates and the depth of the reversible and quantum circuit. The comparison of new results with the results given by the known method of mapping the vertices of binary decision diagram into cascades of reversible and quantum gates shows a significant improvement in the quality of quantum circuits that are synthesised by the proposed method.","PeriodicalId":36323,"journal":{"name":"Zhurnal Belorusskogo Gosudarstvennogo Universiteta. Matematika. Informatika","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49022718","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-12-08DOI: 10.33581/2520-6508-2021-3-104-108
Viktor P. Kochyn, A. V. Zherelo
The article discusses the main approaches to the design and development of an automated information system for a secure cloud repository of paperworks of students and employees of educational and research organisations (abstracts, essays, term papers and theses, master’s theses, deposited articles), providing secure storage and secure mobile access to stored data. The research and development of architectural solutions to ensure reliable and secure data storage using cloud technologies are described. The main problems of designing a secure repository and ways to solve them are considered. The cloud repository of written works is built on the basis of the Ceph distributed file system, which uses the NextCloud system and the virtual computing resources of the virtual network infrastructure of the Belarusian State University as a platform for building a cloud interface.
{"title":"Designing a secure fail-safe cloud repository of paperworks of students and employees of educational institutions","authors":"Viktor P. Kochyn, A. V. Zherelo","doi":"10.33581/2520-6508-2021-3-104-108","DOIUrl":"https://doi.org/10.33581/2520-6508-2021-3-104-108","url":null,"abstract":"The article discusses the main approaches to the design and development of an automated information system for a secure cloud repository of paperworks of students and employees of educational and research organisations (abstracts, essays, term papers and theses, master’s theses, deposited articles), providing secure storage and secure mobile access to stored data. The research and development of architectural solutions to ensure reliable and secure data storage using cloud technologies are described. The main problems of designing a secure repository and ways to solve them are considered. The cloud repository of written works is built on the basis of the Ceph distributed file system, which uses the NextCloud system and the virtual computing resources of the virtual network infrastructure of the Belarusian State University as a platform for building a cloud interface.","PeriodicalId":36323,"journal":{"name":"Zhurnal Belorusskogo Gosudarstvennogo Universiteta. Matematika. Informatika","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47705555","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-11-19DOI: 10.33581/2520-6508-2021-3-6-24
P. Patseika, Y. Rouba
Approximations on the segment [−1, 1] of Markov functions by Abel – Poisson sums of a rational integral operator of Fourier type associated with the Chebyshev – Markov system of algebraic fractions in the case of a fixed number of geometrically different poles are investigated. An integral representation of approximations and an estimate of uniform approximations are found. Approximations of Markov functions in the case when the measure µ satisfies the conditions suppµ = [1, a], a > 1, dµ(t) = φ(t)dt and φ(t) ≍ (t − 1)α on [1, a], a are studied and estimates of pointwise and uniform approximations and the asymptotic expression of the majorant of uniform approximations are obtained. The optimal values of the parameters at which the majorant has the highest rate of decrease are found. As a corollary, asymptotic estimates of approximations on the segment [−1, 1] are given by the method of rational approximation of some elementary Markov functions under study.
{"title":"On rational Abel – Poisson means on a segment and approximations of Markov functions","authors":"P. Patseika, Y. Rouba","doi":"10.33581/2520-6508-2021-3-6-24","DOIUrl":"https://doi.org/10.33581/2520-6508-2021-3-6-24","url":null,"abstract":"Approximations on the segment [−1, 1] of Markov functions by Abel – Poisson sums of a rational integral operator of Fourier type associated with the Chebyshev – Markov system of algebraic fractions in the case of a fixed number of geometrically different poles are investigated. An integral representation of approximations and an estimate of uniform approximations are found. Approximations of Markov functions in the case when the measure µ satisfies the conditions suppµ = [1, a], a > 1, dµ(t) = φ(t)dt and φ(t) ≍ (t − 1)α on [1, a], a are studied and estimates of pointwise and uniform approximations and the asymptotic expression of the majorant of uniform approximations are obtained. The optimal values of the parameters at which the majorant has the highest rate of decrease are found. As a corollary, asymptotic estimates of approximations on the segment [−1, 1] are given by the method of rational approximation of some elementary Markov functions under study.","PeriodicalId":36323,"journal":{"name":"Zhurnal Belorusskogo Gosudarstvennogo Universiteta. Matematika. Informatika","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48747688","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-11-19DOI: 10.33581/2520-6508-2021-3-98-103
S. M. Sheshko
A scheme is constructed for the numerical solution of a singular integral equation with a logarithmic kernel by the method of orthogonal polynomials. The proposed schemes for an approximate solution of the problem are based on the representation of the solution function in the form of a linear combination of the Chebyshev orthogonal polynomials and spectral relations that allows to obtain simple analytical expressions for the singular component of the equation. The expansion coefficients of the solution in terms of the Chebyshev polynomial basis are calculated by solving a system of linear algebraic equations. The results of numerical experiments show that on a grid of 20 –30 points, the error of the approximate solution reaches the minimum limit due to the error in representing real floating-point numbers.
{"title":"Numerical solution of a weakly singular integral equation by the method of orthogonal polynomials","authors":"S. M. Sheshko","doi":"10.33581/2520-6508-2021-3-98-103","DOIUrl":"https://doi.org/10.33581/2520-6508-2021-3-98-103","url":null,"abstract":"A scheme is constructed for the numerical solution of a singular integral equation with a logarithmic kernel by the method of orthogonal polynomials. The proposed schemes for an approximate solution of the problem are based on the representation of the solution function in the form of a linear combination of the Chebyshev orthogonal polynomials and spectral relations that allows to obtain simple analytical expressions for the singular component of the equation. The expansion coefficients of the solution in terms of the Chebyshev polynomial basis are calculated by solving a system of linear algebraic equations. The results of numerical experiments show that on a grid of 20 –30 points, the error of the approximate solution reaches the minimum limit due to the error in representing real floating-point numbers.","PeriodicalId":36323,"journal":{"name":"Zhurnal Belorusskogo Gosudarstvennogo Universiteta. Matematika. Informatika","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42059417","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-11-19DOI: 10.33581/2520-6508-2021-3-57-67
A. Chigarev, M. Zhuravkov, Vitaliy A. Chigarev
The mathematical SIR model generalisation for description of the infectious process dynamics development by adding a testing model is considered. The proposed procedure requires the expansion of states’ space dimension due to variables that cannot be measured directly, but allow you to more adequately describe the processes that occur in real situations. Further generalisation of the SIR model is considered by taking into account randomness in state estimates, forecasting, which is achieved by applying the stochastic differential equations methods associated with the application of the Fokker – Planck – Kolmogorov equations for posterior probabilities. As COVID-19 practice has shown, the widespread use of modern means of identification, diagnosis and monitoring does not guarantee the receipt of adequate information about the individual’s condition in the population. When modelling real epidemic processes in the initial stages, it is advisable to use heuristic modelling methods, and then refine the model using mathematical modelling methods using stochastic, uncertain-fuzzy methods that allow you to take into account the fact that flow, decision-making and control occurs in systems with incomplete information. To develop more realistic models, spatial kinetics must be taken into account, which, in turn, requires the use of systems models with distributed parameters (for example, models of continua mechanics). Obviously, realistic models of epidemics and their control should include models of economic, sociodynamics. The problems of forecasting epidemics and their development will be no less difficult than the problems of climate change forecasting, weather forecast and earthquake prediction.
{"title":"Deterministic and stochastic models of infection spread and testing in an isolated contingent","authors":"A. Chigarev, M. Zhuravkov, Vitaliy A. Chigarev","doi":"10.33581/2520-6508-2021-3-57-67","DOIUrl":"https://doi.org/10.33581/2520-6508-2021-3-57-67","url":null,"abstract":"The mathematical SIR model generalisation for description of the infectious process dynamics development by adding a testing model is considered. The proposed procedure requires the expansion of states’ space dimension due to variables that cannot be measured directly, but allow you to more adequately describe the processes that occur in real situations. Further generalisation of the SIR model is considered by taking into account randomness in state estimates, forecasting, which is achieved by applying the stochastic differential equations methods associated with the application of the Fokker – Planck – Kolmogorov equations for posterior probabilities. As COVID-19 practice has shown, the widespread use of modern means of identification, diagnosis and monitoring does not guarantee the receipt of adequate information about the individual’s condition in the population. When modelling real epidemic processes in the initial stages, it is advisable to use heuristic modelling methods, and then refine the model using mathematical modelling methods using stochastic, uncertain-fuzzy methods that allow you to take into account the fact that flow, decision-making and control occurs in systems with incomplete information. To develop more realistic models, spatial kinetics must be taken into account, which, in turn, requires the use of systems models with distributed parameters (for example, models of continua mechanics). Obviously, realistic models of epidemics and their control should include models of economic, sociodynamics. The problems of forecasting epidemics and their development will be no less difficult than the problems of climate change forecasting, weather forecast and earthquake prediction.","PeriodicalId":36323,"journal":{"name":"Zhurnal Belorusskogo Gosudarstvennogo Universiteta. Matematika. Informatika","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49146711","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-11-19DOI: 10.33581/2520-6508-2021-3-51-56
M. Vaskouski
Asymptotic properties of random walks on minimal Cayley graphs of complex reflection groups are investigated. The main result of the paper is theorem on fast mixing for random walks on Cayley graphs of complex reflection groups. Particularly, bounds of diameters and isoperimetric constants, a known result on fast fixing property for expander graphs play a crucial role to obtain the main result. A constructive way to prove a special case of Babai’s conjecture on logarithmic order of diameters for complex reflection groups is proposed. Basing on estimates of diameters and Cheeger inequality, there is obtained a non-trivial lower bound for spectral gaps of minimal Cayley graphs on complex reflection groups.
{"title":"Random walks on Cayley graphs of complex reflection groups","authors":"M. Vaskouski","doi":"10.33581/2520-6508-2021-3-51-56","DOIUrl":"https://doi.org/10.33581/2520-6508-2021-3-51-56","url":null,"abstract":"Asymptotic properties of random walks on minimal Cayley graphs of complex reflection groups are investigated. The main result of the paper is theorem on fast mixing for random walks on Cayley graphs of complex reflection groups. Particularly, bounds of diameters and isoperimetric constants, a known result on fast fixing property for expander graphs play a crucial role to obtain the main result. A constructive way to prove a special case of Babai’s conjecture on logarithmic order of diameters for complex reflection groups is proposed. Basing on estimates of diameters and Cheeger inequality, there is obtained a non-trivial lower bound for spectral gaps of minimal Cayley graphs on complex reflection groups.","PeriodicalId":36323,"journal":{"name":"Zhurnal Belorusskogo Gosudarstvennogo Universiteta. Matematika. Informatika","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46397083","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-08-05DOI: 10.33581/2520-6508-2021-2-17-28
A. P. Shilin
The paper provides an exact analytical solution to a hypersingular inregro-differential equation of arbitrary order. The equation is defined on a closed curve in the complex plane. A characteristic feature of the equation is that if is written using determinants. From the view of the traditional classification of the equations, it should be classified as linear equations with vatiable coefficients of a special form. The method of analytical continuation id applied. The equation is reduced to a boundary value problem of linear conjugation for analytic functions with some additional conditions. If this problem is solvable, if is required to solve two more linear differential equations in the class of analytic functions. The conditions of solvability are indicated explicitly. When these conditions are met, the solution can also be written explicitly. An example is given.
{"title":"Solution of one hypersingular integro-differential equation defined by determinants","authors":"A. P. Shilin","doi":"10.33581/2520-6508-2021-2-17-28","DOIUrl":"https://doi.org/10.33581/2520-6508-2021-2-17-28","url":null,"abstract":"The paper provides an exact analytical solution to a hypersingular inregro-differential equation of arbitrary order. The equation is defined on a closed curve in the complex plane. A characteristic feature of the equation is that if is written using determinants. From the view of the traditional classification of the equations, it should be classified as linear equations with vatiable coefficients of a special form. The method of analytical continuation id applied. The equation is reduced to a boundary value problem of linear conjugation for analytic functions with some additional conditions. If this problem is solvable, if is required to solve two more linear differential equations in the class of analytic functions. The conditions of solvability are indicated explicitly. When these conditions are met, the solution can also be written explicitly. An example is given.","PeriodicalId":36323,"journal":{"name":"Zhurnal Belorusskogo Gosudarstvennogo Universiteta. Matematika. Informatika","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48183332","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-08-05DOI: 10.33581/2520-6508-2021-2-6-16
V. Bakhtin, Bruno Sadok
We consider a space of infinite signals composed of letters from a finite alphabet. Each signal generates a sequence of empirical measures on the alphabet and the limit set corresponding to this sequence. The space of signals is partitioned into narrow basins consisting of signals with identical limit sets for the sequence of empirical measures and for each narrow basin its packing dimension is computed. Furthermore, we compute packing dimensions for two other types of basins defined in terms of limit behaviour of the empirical measures.
{"title":"Packing dimensions of basins generated by distributions on a finite alphabet","authors":"V. Bakhtin, Bruno Sadok","doi":"10.33581/2520-6508-2021-2-6-16","DOIUrl":"https://doi.org/10.33581/2520-6508-2021-2-6-16","url":null,"abstract":"We consider a space of infinite signals composed of letters from a finite alphabet. Each signal generates a sequence of empirical measures on the alphabet and the limit set corresponding to this sequence. The space of signals is partitioned into narrow basins consisting of signals with identical limit sets for the sequence of empirical measures and for each narrow basin its packing dimension is computed. Furthermore, we compute packing dimensions for two other types of basins defined in terms of limit behaviour of the empirical measures.","PeriodicalId":36323,"journal":{"name":"Zhurnal Belorusskogo Gosudarstvennogo Universiteta. Matematika. Informatika","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69454956","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：