{"title":"具有规定规范的有限域中的算术级数","authors":"Kaustav Chatterjee, Hariom Sharma, Aastha Shukla, Shailesh Kumar Tiwari","doi":"10.1515/forum-2024-0026","DOIUrl":null,"url":null,"abstract":"Given a prime power <jats:italic>q</jats:italic> and a positive integer <jats:italic>n</jats:italic>, let <jats:inline-formula> <jats:alternatives> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:msub> <m:mi>𝔽</m:mi> <m:msup> <m:mi>q</m:mi> <m:mi>n</m:mi> </m:msup> </m:msub> </m:math> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_forum-2024-0026_eq_0435.png\" /> <jats:tex-math>{\\mathbb{F}_{q^{n}}}</jats:tex-math> </jats:alternatives> </jats:inline-formula> represent a finite extension of degree <jats:italic>n</jats:italic> of the finite field <jats:inline-formula> <jats:alternatives> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:msub> <m:mi>𝔽</m:mi> <m:mi>q</m:mi> </m:msub> </m:math> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_forum-2024-0026_eq_0722.png\" /> <jats:tex-math>{{\\mathbb{F}_{q}}}</jats:tex-math> </jats:alternatives> </jats:inline-formula>. In this article, we investigate the existence of <jats:italic>m</jats:italic> elements in arithmetic progression, where every element is primitive and at least one is normal with prescribed norms. Moreover, for <jats:inline-formula> <jats:alternatives> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:mrow> <m:mi>n</m:mi> <m:mo>≥</m:mo> <m:mn>6</m:mn> </m:mrow> </m:math> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_forum-2024-0026_eq_0646.png\" /> <jats:tex-math>{n\\geq 6}</jats:tex-math> </jats:alternatives> </jats:inline-formula>, <jats:inline-formula> <jats:alternatives> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:mrow> <m:mi>q</m:mi> <m:mo>=</m:mo> <m:msup> <m:mn>3</m:mn> <m:mi>k</m:mi> </m:msup> </m:mrow> </m:math> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_forum-2024-0026_eq_0678.png\" /> <jats:tex-math>{q=3^{k}}</jats:tex-math> </jats:alternatives> </jats:inline-formula>, <jats:inline-formula> <jats:alternatives> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:mrow> <m:mi>m</m:mi> <m:mo>=</m:mo> <m:mn>2</m:mn> </m:mrow> </m:math> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_forum-2024-0026_eq_0621.png\" /> <jats:tex-math>{m=2}</jats:tex-math> </jats:alternatives> </jats:inline-formula> we establish that there are only 10 possible exceptions.","PeriodicalId":12433,"journal":{"name":"Forum Mathematicum","volume":"21 1","pages":""},"PeriodicalIF":1.0000,"publicationDate":"2024-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Arithmetic progression in a finite field with prescribed norms\",\"authors\":\"Kaustav Chatterjee, Hariom Sharma, Aastha Shukla, Shailesh Kumar Tiwari\",\"doi\":\"10.1515/forum-2024-0026\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Given a prime power <jats:italic>q</jats:italic> and a positive integer <jats:italic>n</jats:italic>, let <jats:inline-formula> <jats:alternatives> <m:math xmlns:m=\\\"http://www.w3.org/1998/Math/MathML\\\"> <m:msub> <m:mi>𝔽</m:mi> <m:msup> <m:mi>q</m:mi> <m:mi>n</m:mi> </m:msup> </m:msub> </m:math> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" xlink:href=\\\"graphic/j_forum-2024-0026_eq_0435.png\\\" /> <jats:tex-math>{\\\\mathbb{F}_{q^{n}}}</jats:tex-math> </jats:alternatives> </jats:inline-formula> represent a finite extension of degree <jats:italic>n</jats:italic> of the finite field <jats:inline-formula> <jats:alternatives> <m:math xmlns:m=\\\"http://www.w3.org/1998/Math/MathML\\\"> <m:msub> <m:mi>𝔽</m:mi> <m:mi>q</m:mi> </m:msub> </m:math> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" xlink:href=\\\"graphic/j_forum-2024-0026_eq_0722.png\\\" /> <jats:tex-math>{{\\\\mathbb{F}_{q}}}</jats:tex-math> </jats:alternatives> </jats:inline-formula>. In this article, we investigate the existence of <jats:italic>m</jats:italic> elements in arithmetic progression, where every element is primitive and at least one is normal with prescribed norms. Moreover, for <jats:inline-formula> <jats:alternatives> <m:math xmlns:m=\\\"http://www.w3.org/1998/Math/MathML\\\"> <m:mrow> <m:mi>n</m:mi> <m:mo>≥</m:mo> <m:mn>6</m:mn> </m:mrow> </m:math> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" xlink:href=\\\"graphic/j_forum-2024-0026_eq_0646.png\\\" /> <jats:tex-math>{n\\\\geq 6}</jats:tex-math> </jats:alternatives> </jats:inline-formula>, <jats:inline-formula> <jats:alternatives> <m:math xmlns:m=\\\"http://www.w3.org/1998/Math/MathML\\\"> <m:mrow> <m:mi>q</m:mi> <m:mo>=</m:mo> <m:msup> <m:mn>3</m:mn> <m:mi>k</m:mi> </m:msup> </m:mrow> </m:math> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" xlink:href=\\\"graphic/j_forum-2024-0026_eq_0678.png\\\" /> <jats:tex-math>{q=3^{k}}</jats:tex-math> </jats:alternatives> </jats:inline-formula>, <jats:inline-formula> <jats:alternatives> <m:math xmlns:m=\\\"http://www.w3.org/1998/Math/MathML\\\"> <m:mrow> <m:mi>m</m:mi> <m:mo>=</m:mo> <m:mn>2</m:mn> </m:mrow> </m:math> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" xlink:href=\\\"graphic/j_forum-2024-0026_eq_0621.png\\\" /> <jats:tex-math>{m=2}</jats:tex-math> </jats:alternatives> </jats:inline-formula> we establish that there are only 10 possible exceptions.\",\"PeriodicalId\":12433,\"journal\":{\"name\":\"Forum Mathematicum\",\"volume\":\"21 1\",\"pages\":\"\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2024-03-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Forum Mathematicum\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1515/forum-2024-0026\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Forum Mathematicum","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1515/forum-2024-0026","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
摘要
给定一个质幂 q 和一个正整数 n,让 𝔽 q n {{mathbb{F}_{q^{n}}} 表示有限域 𝔽 q {{mathbb{F}_{q}}} 的 n 阶有限扩展。本文将研究算术级数中是否存在 m 个元素,其中每个元素都是基元,且至少有一个元素是具有规定规范的正则元素。此外,对于 n ≥ 6 {n\geq 6} , q = 3 k {q=3^{k}} , m = 2 {m=2 , m = 2 {m=2},我们可以确定只有 10 个可能的例外。
Arithmetic progression in a finite field with prescribed norms
Given a prime power q and a positive integer n, let 𝔽qn{\mathbb{F}_{q^{n}}} represent a finite extension of degree n of the finite field 𝔽q{{\mathbb{F}_{q}}}. In this article, we investigate the existence of m elements in arithmetic progression, where every element is primitive and at least one is normal with prescribed norms. Moreover, for n≥6{n\geq 6}, q=3k{q=3^{k}}, m=2{m=2} we establish that there are only 10 possible exceptions.
期刊介绍:
Forum Mathematicum is a general mathematics journal, which is devoted to the publication of research articles in all fields of pure and applied mathematics, including mathematical physics. Forum Mathematicum belongs to the top 50 journals in pure and applied mathematics, as measured by citation impact.