Pub Date : 2024-08-06DOI: 10.3103/s1066369x24700221
V. V. Gorbatsevich
Abstract
The article considers decompositions of nilpotent Lie algebras and nilpotent Lie groups, and connections between them. Also, descriptions of irreducible transitive actions of nilpotent Lie groups on the plane and on three-dimensional space are given.
{"title":"On Decompositions and Transitive Actions of Nilpotent Lie Groups","authors":"V. V. Gorbatsevich","doi":"10.3103/s1066369x24700221","DOIUrl":"https://doi.org/10.3103/s1066369x24700221","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>The article considers decompositions of nilpotent Lie algebras and nilpotent Lie groups, and connections between them. Also, descriptions of irreducible transitive actions of nilpotent Lie groups on the plane and on three-dimensional space are given.</p>","PeriodicalId":46110,"journal":{"name":"Russian Mathematics","volume":"14 1","pages":""},"PeriodicalIF":0.4,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141934843","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-06DOI: 10.3103/s1066369x24700245
V. E. Kruglov
Abstract
With the help of the formula for the general solution of a difference equation with constant coefficients, it is shown that the set of solutions to this equation contains classical solutions of the type ({{k}^{m}}{{lambda }^{k}}). We present necessary and sufficient conditions on the coefficients of the equation and the initial parameters under which such solutions are obtained.
{"title":"Conditions for the Existence of Power Solutions to a Linear Difference Equation with Constant Coefficients","authors":"V. E. Kruglov","doi":"10.3103/s1066369x24700245","DOIUrl":"https://doi.org/10.3103/s1066369x24700245","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>With the help of the formula for the general solution of a difference equation with constant coefficients, it is shown that the set of solutions to this equation contains classical solutions of the type <span>({{k}^{m}}{{lambda }^{k}})</span>. We present necessary and sufficient conditions on the coefficients of the equation and the initial parameters under which such solutions are obtained.</p>","PeriodicalId":46110,"journal":{"name":"Russian Mathematics","volume":"40 1","pages":""},"PeriodicalIF":0.4,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141934943","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-06DOI: 10.3103/s1066369x24700294
Sh. T. Ishmukhametov, B. G. Mubarakov, R. G. Rubtsova, E. V. Oleinikova
Abstract
The Baillie PSW conjecture was formulated in 1980 and was named after its authors Baillie, Pomerance, Selfridge, and Wagstaff, Jr. The conjecture is related to the problem of the existence of odd numbers (n equiv pm 2;(bmod ;5)), which are both Fermat and Lucas pseudoprimes (in short, FL‑pseudoprimes). A Fermat pseudoprime to base a is composite number n satisfying the condition ({{a}^{{n - 1}}} equiv 1)(mod n). Base a is chosen to be equal to 2. A Lucas pseudoprime is a composite n satisfying ({{F}_{{n - e(n)}}} equiv 0)(mod n), where e(n) is the Legendre symbol (e(n) = left( begin{gathered} n hfill 5 hfill end{gathered} right)) and ({{F}_{m}}) is the mth term of the Fibonacci series. According to the Baillie PSW conjecture, there are no FL pseudoprimes. If the conjecture is true, the combined primality test checking Fermat and Lucas conditions for odd numbers not divisible by 5 gives the correct answer for all numbers of the form (n equiv pm 2;(bmod ;5)), which generates a new deterministic polynomial primality test detecting the primality of 60 percent of all odd numbers in just two checks. In this work, we continue the study of FL pseudoprimes, started in our article “On a combined primality test” published in Russian Mathematics in 2012. We have established new restrictions on probable FL pseudoprimes and described new algorithms for checking FL primality, and, using them, we proved the absence of such numbers up to the boundary (B = {{10}^{{21}}}), which is more than 30 times larger than the previously known boundary 264 found by Gilchrist in 2013. An inaccuracy in the formulation of Theorem 4 in the mentioned article has also been corrected.
{"title":"On the Baillie PSW Conjecture","authors":"Sh. T. Ishmukhametov, B. G. Mubarakov, R. G. Rubtsova, E. V. Oleinikova","doi":"10.3103/s1066369x24700294","DOIUrl":"https://doi.org/10.3103/s1066369x24700294","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>The Baillie PSW conjecture was formulated in 1980 and was named after its authors Baillie, Pomerance, Selfridge, and Wagstaff, Jr. The conjecture is related to the problem of the existence of odd numbers <span>(n equiv pm 2;(bmod ;5))</span>, which are both Fermat and Lucas pseudoprimes (in short, FL‑pseudoprimes). A Fermat pseudoprime to base <i>a</i> is composite number <i>n</i> satisfying the condition <span>({{a}^{{n - 1}}} equiv 1)</span>(mod <i>n</i>). Base <i>a</i> is chosen to be equal to 2. A Lucas pseudoprime is a composite <i>n</i> satisfying <span>({{F}_{{n - e(n)}}} equiv 0)</span>(mod <i>n</i>), where <i>e</i>(<i>n</i>) is the Legendre symbol <span>(e(n) = left( begin{gathered} n hfill 5 hfill end{gathered} right))</span> and <span>({{F}_{m}})</span> is the <i>m</i>th term of the Fibonacci series. According to the Baillie PSW conjecture, there are no FL pseudoprimes. If the conjecture is true, the combined primality test checking Fermat and Lucas conditions for odd numbers not divisible by 5 gives the correct answer for all numbers of the form <span>(n equiv pm 2;(bmod ;5))</span>, which generates a new deterministic polynomial primality test detecting the primality of 60 percent of all odd numbers in just two checks. In this work, we continue the study of FL pseudoprimes, started in our article “On a combined primality test” published in <i>Russian Mathematics</i> in 2012. We have established new restrictions on probable FL pseudoprimes and described new algorithms for checking FL primality, and, using them, we proved the absence of such numbers up to the boundary <span>(B = {{10}^{{21}}})</span>, which is more than 30 times larger than the previously known boundary 2<sup>64</sup> found by Gilchrist in 2013. An inaccuracy in the formulation of Theorem 4 in the mentioned article has also been corrected.</p>","PeriodicalId":46110,"journal":{"name":"Russian Mathematics","volume":"175 1","pages":""},"PeriodicalIF":0.4,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141934948","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}