Pub Date : 2024-08-15DOI: 10.1134/S1990478924020121
A. V. Pyatkin
The paper considers the following problem. Given a set of Euclidean vectors, find severalclusters with a restriction on the maximum scatter of each cluster so that the size of the minimumcluster would be maximum. Here the scatter is the sum of squared distances from the clusterelements to its centroid. The NP-hardness of this problem is proved in the case where thedimension of the space is part of the input.
{"title":"On the Complexity of the Problem of Choice\u0000of Large Clusters","authors":"A. V. Pyatkin","doi":"10.1134/S1990478924020121","DOIUrl":"10.1134/S1990478924020121","url":null,"abstract":"<p> The paper considers the following problem. Given a set of Euclidean vectors, find several\u0000clusters with a restriction on the maximum scatter of each cluster so that the size of the minimum\u0000cluster would be maximum. Here the scatter is the sum of squared distances from the cluster\u0000elements to its centroid. The NP-hardness of this problem is proved in the case where the\u0000dimension of the space is part of the input.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 2","pages":"312 - 315"},"PeriodicalIF":0.58,"publicationDate":"2024-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142186798","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 : 2024-08-15DOI: 10.1134/S199047892402008X
V. K. Gorbunov, A. G. Lvov
The aim of this paper is to acquaint applied mathematicians interested in the possibilitiesof applying methods for solving inverse problems in mathematical modeling in natural sciences andengineering to economic problems with our papers in this field. These papers refer to the problemof verifying the market demand theory, developed by the first author based on the revision of theunrealistic axiomatic neoclassical theory of individual demand within the framework of generalscientific methodology. At the same time, the artificial object of individual theory—arational and independent individual who maximizes his/her utility function—was replacedby a “statistical ensemble of consumers” of the market under study, and the postulates ofindividual theory became scientific hypotheses of the new theory. The verification of this theoryconsists in elucidating the question of rationalizing the statistical market demand by the collectiveutility function. This problem refers to the inverse problems of mathematical theories of realphenomena, which are usually ill posed and have many solutions. The solution of such problemsconsists in their regularization with involvement of additional information about the desiredsolution. Our method for verifying the market demand theory is a development of thenonparametric Afriat–Varian demand analysis with using “economic indices” of market demand asadditional information, which allows obtaining solutions with various substantive properties.
{"title":"The Problem of Verifying the Market Demand\u0000Theory","authors":"V. K. Gorbunov, A. G. Lvov","doi":"10.1134/S199047892402008X","DOIUrl":"10.1134/S199047892402008X","url":null,"abstract":"<p> The aim of this paper is to acquaint applied mathematicians interested in the possibilities\u0000of applying methods for solving inverse problems in mathematical modeling in natural sciences and\u0000engineering to economic problems with our papers in this field. These papers refer to the problem\u0000of verifying the market demand theory, developed by the first author based on the revision of the\u0000unrealistic axiomatic neoclassical theory of individual demand within the framework of general\u0000scientific methodology. At the same time, the artificial object of individual theory—a\u0000rational and independent individual who maximizes his/her utility function—was replaced\u0000by a “statistical ensemble of consumers” of the market under study, and the postulates of\u0000individual theory became scientific hypotheses of the new theory. The verification of this theory\u0000consists in elucidating the question of rationalizing the statistical market demand by the collective\u0000utility function. This problem refers to the inverse problems of mathematical theories of real\u0000phenomena, which are usually ill posed and have many solutions. The solution of such problems\u0000consists in their regularization with involvement of additional information about the desired\u0000solution. Our method for verifying the market demand theory is a development of the\u0000nonparametric Afriat–Varian demand analysis with using “economic indices” of market demand as\u0000additional information, which allows obtaining solutions with various substantive properties.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 2","pages":"253 - 270"},"PeriodicalIF":0.58,"publicationDate":"2024-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142186793","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 : 2024-08-15DOI: 10.1134/S1990478924020157
S. V. Solodusha
The problem of identifying Volterra kernels is an important stage in the construction ofintegral models of nonlinear dynamical systems based on the tool of Volterra series. The paperconsiders a new class of two-dimensional integral equations that arise when recoveringnonsymmetric kernels in a Volterra polynomial of the second degree, where( x(t) ) is the input vector function of time. The strategy for choosing test signalsused to solve this problem is based on applying piecewise linear functions (with a rising edge). Anexplicit inversion formula is constructed for the selected type of Volterra equations of the first kindwith variable integration limits. The questions of existence and uniqueness of solutions of thecorresponding equations in the class( C_{[0,T]} ) are studied.
{"title":"On Some Linear Two-Dimensional Volterra Integral Equations of\u0000the First Kind","authors":"S. V. Solodusha","doi":"10.1134/S1990478924020157","DOIUrl":"10.1134/S1990478924020157","url":null,"abstract":"<p> The problem of identifying Volterra kernels is an important stage in the construction of\u0000integral models of nonlinear dynamical systems based on the tool of Volterra series. The paper\u0000considers a new class of two-dimensional integral equations that arise when recovering\u0000nonsymmetric kernels in a Volterra polynomial of the second degree, where\u0000<span>( x(t) )</span> is the input vector function of time. The strategy for choosing test signals\u0000used to solve this problem is based on applying piecewise linear functions (with a rising edge). An\u0000explicit inversion formula is constructed for the selected type of Volterra equations of the first kind\u0000with variable integration limits. The questions of existence and uniqueness of solutions of the\u0000corresponding equations in the class\u0000<span>( C_{[0,T]} )</span> are studied.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 2","pages":"344 - 351"},"PeriodicalIF":0.58,"publicationDate":"2024-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142186797","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 : 2024-08-15DOI: 10.1134/S1990478924020066
P. V. Gilev, A. A. Papin
The paper considers a mathematical model of the filtration of two immiscibleincompressible fluids in deformable porous media. This model is a generalization of theMusket–Leverett model, in which porosity is a function of the space coordinates. The model understudy is based on the equations of conservation of mass of liquids and porous skeleton, Darcy’s lawfor liquids, accounting for the motion of the porous skeleton, Laplace’s formula for capillarypressure, and a Maxwell-type rheological equation for porosity and the equilibrium condition ofthe “system as a whole.” In the thin layer approximation, the original problem is reduced to thesuccessive determination of the porosity of the solid skeleton and its speed, and then theelliptic-parabolic system for the “reduced” pressure and saturation of the fluid phase is derived. Inview of the degeneracy of equations on the solution, the solution is understood in a weak sense.The proofs of the results are carried out in four stages: regularization of the problem, proof of themaximum principle, construction of Galerkin approximations, and passage to the limit in terms ofthe regularization parameters based on the compensated compactness principle.
{"title":"Filtration of Two Immiscible Incompressible Fluids\u0000in a Thin Poroelastic Layer","authors":"P. V. Gilev, A. A. Papin","doi":"10.1134/S1990478924020066","DOIUrl":"10.1134/S1990478924020066","url":null,"abstract":"<p> The paper considers a mathematical model of the filtration of two immiscible\u0000incompressible fluids in deformable porous media. This model is a generalization of the\u0000Musket–Leverett model, in which porosity is a function of the space coordinates. The model under\u0000study is based on the equations of conservation of mass of liquids and porous skeleton, Darcy’s law\u0000for liquids, accounting for the motion of the porous skeleton, Laplace’s formula for capillary\u0000pressure, and a Maxwell-type rheological equation for porosity and the equilibrium condition of\u0000the “system as a whole.” In the thin layer approximation, the original problem is reduced to the\u0000successive determination of the porosity of the solid skeleton and its speed, and then the\u0000elliptic-parabolic system for the “reduced” pressure and saturation of the fluid phase is derived. In\u0000view of the degeneracy of equations on the solution, the solution is understood in a weak sense.\u0000The proofs of the results are carried out in four stages: regularization of the problem, proof of the\u0000maximum principle, construction of Galerkin approximations, and passage to the limit in terms of\u0000the regularization parameters based on the compensated compactness principle.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 2","pages":"234 - 245"},"PeriodicalIF":0.58,"publicationDate":"2024-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142186832","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 : 2024-08-15DOI: 10.1134/S1990478924020091
V. V. Gusev
The paper examines the problem of the distribution of public space. We use the methodsof cooperative game theory to solve this problem. Players are districts, while the value of thecharacteristic function is the total number of people interested in a particular type of public spacein the areas under consideration. The axioms that are characteristic of the problem of division arecompiled. A special value of the cooperative game is derived that depends on the weights of theplayers. It is shown how to choose the weights by optimization methods.
{"title":"Cooperative Games with Preferences: Application\u0000of the Weight Rule to Problems of Public Space in St. Petersburg","authors":"V. V. Gusev","doi":"10.1134/S1990478924020091","DOIUrl":"10.1134/S1990478924020091","url":null,"abstract":"<p> The paper examines the problem of the distribution of public space. We use the methods\u0000of cooperative game theory to solve this problem. Players are districts, while the value of the\u0000characteristic function is the total number of people interested in a particular type of public space\u0000in the areas under consideration. The axioms that are characteristic of the problem of division are\u0000compiled. A special value of the cooperative game is derived that depends on the weights of the\u0000players. It is shown how to choose the weights by optimization methods.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 2","pages":"271 - 281"},"PeriodicalIF":0.58,"publicationDate":"2024-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142186791","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 : 2024-08-15DOI: 10.1134/S1990478924020042
D. B. Efimov
A general method for the enumeration of various classes of chord diagrams with even andodd numbers of chord intersections is considered. The method is based on the calculation of thePfaffian and Hafnian of the constraint matrix characterizing a class of diagrams.
{"title":"Enumeration of Even and Odd Chord\u0000Diagrams","authors":"D. B. Efimov","doi":"10.1134/S1990478924020042","DOIUrl":"10.1134/S1990478924020042","url":null,"abstract":"<p> A general method for the enumeration of various classes of chord diagrams with even and\u0000odd numbers of chord intersections is considered. The method is based on the calculation of the\u0000Pfaffian and Hafnian of the constraint matrix characterizing a class of diagrams.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 2","pages":"216 - 226"},"PeriodicalIF":0.58,"publicationDate":"2024-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142227653","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 : 2024-08-15DOI: 10.1134/S1990478924020108
A. I. Kozhanov, G. V. Namsaraeva
The aim of this paper is to study the solvability of inverse problems of determining,together with the solution of the heat equation, its right-hand side or an unknown externalinfluence. The specific feature of the problems studied is that the unknown external influence isdetermined by two functions of which one depends only on the spatial variable and the other, onlyon the time variable.
{"title":"Solvability Analysis of Problems of Determining External\u0000Influence of Combined Type in Processes Described\u0000by Parabolic Equations","authors":"A. I. Kozhanov, G. V. Namsaraeva","doi":"10.1134/S1990478924020108","DOIUrl":"10.1134/S1990478924020108","url":null,"abstract":"<p> The aim of this paper is to study the solvability of inverse problems of determining,\u0000together with the solution of the heat equation, its right-hand side or an unknown external\u0000influence. The specific feature of the problems studied is that the unknown external influence is\u0000determined by two functions of which one depends only on the spatial variable and the other, only\u0000on the time variable.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 2","pages":"282 - 293"},"PeriodicalIF":0.58,"publicationDate":"2024-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142224609","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 : 2024-08-15DOI: 10.1134/S1990478924020182
Yu. A. Zuev, P. G. Klyucharev
This paper is devoted to the construction of a time-optimal method for measuring themaximum permissible (critical) value of the supply voltage (as well as other parameters) of thedevice on which the cryptographic algorithm is performed. Knowledge of these values is necessaryfor successful conduct of error injection, as part of a fault attack. The method is based ondynamic programming.
{"title":"A Method for Optimal Value Measurement\u0000of Some Parameters of Fault Attacks\u0000on Cryptographic Algorithms","authors":"Yu. A. Zuev, P. G. Klyucharev","doi":"10.1134/S1990478924020182","DOIUrl":"10.1134/S1990478924020182","url":null,"abstract":"<p> This paper is devoted to the construction of a time-optimal method for measuring the\u0000maximum permissible (critical) value of the supply voltage (as well as other parameters) of the\u0000device on which the cryptographic algorithm is performed. Knowledge of these values is necessary\u0000for successful conduct of error injection, as part of a fault attack. The method is based on\u0000dynamic programming.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 2","pages":"371 - 377"},"PeriodicalIF":0.58,"publicationDate":"2024-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142224611","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 : 2024-04-26DOI: 10.1134/S1990478924010083
I. M. Kulikov
Rusanov’s scheme for solving hydrodynamic equations is one of the most robust in theclass of Riemann solvers. It was previously shown that Rusanov’s scheme based on piecewiseparabolic reconstruction of primitive variables gives a low-dissipative scheme relevant to Roe andHarten–Lax–Van Leer solvers when using a similar reconstruction. Moreover, unlike these solvers,the numerical solution is free from artifacts. In the case of equations of special relativisticmagnetohydrodynamics, the spectral decomposition for solving the Riemann problem is quitecomplex and does not have an analytical solution. The present paper proposes the development ofRusanov’s scheme using a piecewise parabolic reconstruction of primitive variables to use in theequations of special relativistic magnetohydrodynamics. The developed scheme was verified usingeight classical problems on the decay of an arbitrary discontinuity that describe the main featuresof relativistic magnetized flows.
{"title":"Using Piecewise Parabolic Reconstruction of Physical Variables\u0000in Rusanov’s Solver. II. Special Relativistic Magnetohydrodynamics Equations","authors":"I. M. Kulikov","doi":"10.1134/S1990478924010083","DOIUrl":"10.1134/S1990478924010083","url":null,"abstract":"<p> Rusanov’s scheme for solving hydrodynamic equations is one of the most robust in the\u0000class of Riemann solvers. It was previously shown that Rusanov’s scheme based on piecewise\u0000parabolic reconstruction of primitive variables gives a low-dissipative scheme relevant to Roe and\u0000Harten–Lax–Van Leer solvers when using a similar reconstruction. Moreover, unlike these solvers,\u0000the numerical solution is free from artifacts. In the case of equations of special relativistic\u0000magnetohydrodynamics, the spectral decomposition for solving the Riemann problem is quite\u0000complex and does not have an analytical solution. The present paper proposes the development of\u0000Rusanov’s scheme using a piecewise parabolic reconstruction of primitive variables to use in the\u0000equations of special relativistic magnetohydrodynamics. The developed scheme was verified using\u0000eight classical problems on the decay of an arbitrary discontinuity that describe the main features\u0000of relativistic magnetized flows.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 1","pages":"81 - 92"},"PeriodicalIF":0.58,"publicationDate":"2024-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140798787","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}
A convex continuation of an arbitrary Boolean function to the set( [0,1]^n ) is constructed. Moreover, it is proved that for any Boolean function( f(x_1,x_2,dots ,x_n) ) that has no neighboring points on the set( mathrm{supp} f ), the constructed function( f_C(x_1,x_2, dots ,x_n) ) is the only totally maximally convex continuation to( [0,1]^n ). Based on this, in particular, it is constructively stated that the problem ofsolving an arbitrary system of Boolean equations can be reduced to the problem of minimizing afunction any local minimum of which in the desired region is a global minimum, and thus for thisproblem the problem of local minima is completely resolved.
Abstract A convex continuation of an arbitrary Boolean function to the set( [0,1]^n ) is constructed.此外,还证明了对于任意布尔函数(f(x_1,x_2,dots ,x_n) )在集合(mathrm{supp} f )上没有邻接点,所构造的函数(f_C(x_1,x_2,dots ,x_n) )是到集合([0,1]^n )的唯一完全最大凸延续。在此基础上,可以构造性地指出,求解任意布尔方程组的问题可以简化为最小化一个函数的问题,这个函数在所需区域的任何局部最小值都是全局最小值,因此对于这个问题来说,局部最小值的问题是完全可以解决的。
{"title":"Convex Continuation of a Boolean Function\u0000and Its Applications","authors":"D. N. Barotov","doi":"10.1134/S1990478924010010","DOIUrl":"10.1134/S1990478924010010","url":null,"abstract":"<p> A convex continuation of an arbitrary Boolean function to the set\u0000<span>( [0,1]^n )</span> is constructed. Moreover, it is proved that for any Boolean function\u0000<span>( f(x_1,x_2,dots ,x_n) )</span> that has no neighboring points on the set\u0000<span>( mathrm{supp} f )</span>, the constructed function\u0000<span>( f_C(x_1,x_2, dots ,x_n) )</span> is the only totally maximally convex continuation to\u0000<span>( [0,1]^n )</span>. Based on this, in particular, it is constructively stated that the problem of\u0000solving an arbitrary system of Boolean equations can be reduced to the problem of minimizing a\u0000function any local minimum of which in the desired region is a global minimum, and thus for this\u0000problem the problem of local minima is completely resolved.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 1","pages":"1 - 9"},"PeriodicalIF":0.58,"publicationDate":"2024-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140804662","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}