Pub Date : 2024-02-04DOI: 10.3103/s027864192304012x
A. A. Voronenko
Abstract
It was shown earlier that product (xy) for (k=6lpm 1) is a universalfunction in the class of linear functions of two variables, and there exist no universal polynomials for even (k) in classes of linear functions of two variables. This work proves that polynomial (xy+xz+yz) is universal for classes of linear functions of three variables for arbitrary odd (k) and polynomial (xy+zw) is universal for classes of linear functions of four variables for arbitrary (k).
Abstract It was previously shown that product(xy) for (k=6lpm 1) is a universalfunction in the class of linear functions of two variables, and there exist no universal polynomials for even (k) in classes of linear functions of two variables.这项工作证明了多项式(xy+xz+yz)对于任意奇数(k)的三变量线性函数类是通用的,多项式(xy+zw)对于任意(k)的四变量线性函数类是通用的。
{"title":"Universal Polynomials of Several Variables for Classes of Linear Functions","authors":"A. A. Voronenko","doi":"10.3103/s027864192304012x","DOIUrl":"https://doi.org/10.3103/s027864192304012x","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>It was shown earlier that product <span>(xy)</span> for <span>(k=6lpm 1)</span> is a universalfunction in the class of linear functions of two variables, and there exist no universal polynomials for even <span>(k)</span> in classes of linear functions of two variables. This work proves that polynomial <span>(xy+xz+yz)</span> is universal for classes of linear functions of three variables for arbitrary odd <span>(k)</span> and polynomial <span>(xy+zw)</span> is universal for classes of linear functions of four variables for arbitrary <span>(k)</span>.</p>","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"39 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139679713","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 : 2023-12-01DOI: 10.3103/s0278641923040167
Abstract
The problem of maximizing the horizontal coordinate of a mass point moving in a vertical plane driven by gravity, viscous drag, curve reaction force, and thrust is considered. It is assumed that inequality-type constraints are imposed on the angle of inclination of the trajectory. The system of equations belongs to a certain type that allows us to reduce the optimal control problem with constraints on the state variable to the optimal control problem with control constraints. The sequence and the number of switchings of the state constraints along the optimal trajectory are determined, and a scheme for optimal control is designed.
{"title":"A Modified Brachistochrone Problem with State Constraints and Thrust","authors":"","doi":"10.3103/s0278641923040167","DOIUrl":"https://doi.org/10.3103/s0278641923040167","url":null,"abstract":"<span> <h3>Abstract</h3> <p>The problem of maximizing the horizontal coordinate of a mass point moving in a vertical plane driven by gravity, viscous drag, curve reaction force, and thrust is considered. It is assumed that inequality-type constraints are imposed on the angle of inclination of the trajectory. The system of equations belongs to a certain type that allows us to reduce the optimal control problem with constraints on the state variable to the optimal control problem with control constraints. The sequence and the number of switchings of the state constraints along the optimal trajectory are determined, and a scheme for optimal control is designed.</p> </span>","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"17 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139679707","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 : 2023-12-01DOI: 10.3103/s0278641923040118
Abstract
A study is performed of a single-channel queuing system with two classes of priority requests, a relative priority discipline, a Poisson incoming flow with random intensity, and an infinite number of waiting places. The intensity is selected at the moment the countdown begins until the next request arrives, and the intensity does not change with a predetermined probability. The limit distribution of the number of requests of the lowest priority class at a critical system load is found.
{"title":"Queue Length in a System with an Autoregressive Hyperexponential Incoming Flow at a Critical Load","authors":"","doi":"10.3103/s0278641923040118","DOIUrl":"https://doi.org/10.3103/s0278641923040118","url":null,"abstract":"<span> <h3>Abstract</h3> <p>A study is performed of a single-channel queuing system with two classes of priority requests, a relative priority discipline, a Poisson incoming flow with random intensity, and an infinite number of waiting places. The intensity is selected at the moment the countdown begins until the next request arrives, and the intensity does not change with a predetermined probability. The limit distribution of the number of requests of the lowest priority class at a critical system load is found.</p> </span>","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"37 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139679880","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 : 2023-02-07DOI: 10.3103/s0278641922040069
I. V. Savitskii
Abstract
It is shown that the class of dictionary functions defined on the basis of bounded prefix concatenation coincides with the familiar complexity class (textrm{TC}^{0}).
{"title":"On the Coincidence of Complexity Classes BPC and TC $${}^{0}$$","authors":"I. V. Savitskii","doi":"10.3103/s0278641922040069","DOIUrl":"https://doi.org/10.3103/s0278641922040069","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>It is shown that the class of dictionary functions defined on the basis of bounded prefix concatenation coincides with the familiar complexity class <span>(textrm{TC}^{0})</span>.</p>","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"7 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138544107","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}