{"title":"Syzygies,固定等级,甚至更多","authors":"Marc Härkönen , Lisa Nicklasson , Bogdan Raiţă","doi":"10.1016/j.jsc.2023.102274","DOIUrl":null,"url":null,"abstract":"<div><p><span>We study linear PDE<span> with constant coefficients. The constant rank condition on a system of linear PDEs with constant coefficients is often used in the theory of compensated compactness. While this is a purely linear algebraic condition, the nonlinear algebra concept of </span></span>primary decomposition<span> is another important tool for studying such system of PDEs. In this paper we investigate the connection between these two concepts. From the nonlinear analysis<span> point of view, we make some progress in the study of weak lower semicontinuity of integral functionals defined on sequences of PDE constrained fields, when the PDEs do not have constant rank.</span></span></p></div>","PeriodicalId":50031,"journal":{"name":"Journal of Symbolic Computation","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2023-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Syzygies, constant rank, and beyond\",\"authors\":\"Marc Härkönen , Lisa Nicklasson , Bogdan Raiţă\",\"doi\":\"10.1016/j.jsc.2023.102274\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p><span>We study linear PDE<span> with constant coefficients. The constant rank condition on a system of linear PDEs with constant coefficients is often used in the theory of compensated compactness. While this is a purely linear algebraic condition, the nonlinear algebra concept of </span></span>primary decomposition<span> is another important tool for studying such system of PDEs. In this paper we investigate the connection between these two concepts. From the nonlinear analysis<span> point of view, we make some progress in the study of weak lower semicontinuity of integral functionals defined on sequences of PDE constrained fields, when the PDEs do not have constant rank.</span></span></p></div>\",\"PeriodicalId\":50031,\"journal\":{\"name\":\"Journal of Symbolic Computation\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2023-11-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Symbolic Computation\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0747717123000883\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Symbolic Computation","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0747717123000883","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
We study linear PDE with constant coefficients. The constant rank condition on a system of linear PDEs with constant coefficients is often used in the theory of compensated compactness. While this is a purely linear algebraic condition, the nonlinear algebra concept of primary decomposition is another important tool for studying such system of PDEs. In this paper we investigate the connection between these two concepts. From the nonlinear analysis point of view, we make some progress in the study of weak lower semicontinuity of integral functionals defined on sequences of PDE constrained fields, when the PDEs do not have constant rank.
期刊介绍:
An international journal, the Journal of Symbolic Computation, founded by Bruno Buchberger in 1985, is directed to mathematicians and computer scientists who have a particular interest in symbolic computation. The journal provides a forum for research in the algorithmic treatment of all types of symbolic objects: objects in formal languages (terms, formulas, programs); algebraic objects (elements in basic number domains, polynomials, residue classes, etc.); and geometrical objects.
It is the explicit goal of the journal to promote the integration of symbolic computation by establishing one common avenue of communication for researchers working in the different subareas. It is also important that the algorithmic achievements of these areas should be made available to the human problem-solver in integrated software systems for symbolic computation. To help this integration, the journal publishes invited tutorial surveys as well as Applications Letters and System Descriptions.