Pub Date : 2024-07-05DOI: 10.1142/s021819672450036x
Sagar Saha, K. V. Krishna
{"title":"A branch group in a class of non-contracting weakly regular branch groups","authors":"Sagar Saha, K. V. Krishna","doi":"10.1142/s021819672450036x","DOIUrl":"https://doi.org/10.1142/s021819672450036x","url":null,"abstract":"","PeriodicalId":13756,"journal":{"name":"International Journal of Algebra and Computation","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2024-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141675772","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-05DOI: 10.1142/s0218196724500401
Dang Vo Phuc
{"title":"On the dimensions of the graded space 𝔽2 ⊗𝒜𝔽2[x1,x2,…,xs] at degrees s + 5 and its relation to algebraic transfers","authors":"Dang Vo Phuc","doi":"10.1142/s0218196724500401","DOIUrl":"https://doi.org/10.1142/s0218196724500401","url":null,"abstract":"","PeriodicalId":13756,"journal":{"name":"International Journal of Algebra and Computation","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2024-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141674211","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-05DOI: 10.1142/s0218196724500395
M. Kepczyk
{"title":"On the representation of fields as sums of two proper subfields","authors":"M. Kepczyk","doi":"10.1142/s0218196724500395","DOIUrl":"https://doi.org/10.1142/s0218196724500395","url":null,"abstract":"","PeriodicalId":13756,"journal":{"name":"International Journal of Algebra and Computation","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2024-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141675256","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-05-25DOI: 10.1142/s021819672450022x
Peter Mayr, Patrick Wynne
Clonoids are sets of finitary functions from an algebra to an algebra that are closed under composition with term functions of on the domain side and with term functions of on the codomain side. For (polynomially equivalent to) finite modules we show: If have coprime order and the congruence lattice of is distributive, then there are only finitely many clonoids from to . This is proved by establishing for every natural number a particular linear equation that all -ary functions from to satisfy. Else if do not have coprime order, then there exist infinite ascending chains of clonoids from to ordered by inclusion. Consequently any extension of by has countably infinitely many <
有限模块是指从代数 A 到代数 B 的有限函数集合,这些函数在与域边上的 A 的项函数和同域边上的 B 的项函数的组合下是封闭的。对于 A、B(多项式等价于)有限模块,我们证明:如果 A、B 有共阶,且 A 的全等网格是分布式的,那么从 A 到 B 只有有限多个克隆子。这可以通过为每个自然数 k 建立一个特定的线性方程来证明,从 A 到 B 的所有 kary 函数都满足这个方程。否则,如果 A、B 没有共序,那么就存在从 A 到 B 按包含排序的无限递增的克隆子链。因此,任何由 B 扩展的 A 都有可数的无限多个 2-nilpotent 扩展,直到项等价。
{"title":"Clonoids between modules","authors":"Peter Mayr, Patrick Wynne","doi":"10.1142/s021819672450022x","DOIUrl":"https://doi.org/10.1142/s021819672450022x","url":null,"abstract":"<p>Clonoids are sets of finitary functions from an algebra <span><math altimg=\"eq-00001.gif\" display=\"inline\"><mstyle><mtext mathvariant=\"normal\">A</mtext></mstyle></math></span><span></span> to an algebra <span><math altimg=\"eq-00002.gif\" display=\"inline\"><mstyle><mtext mathvariant=\"normal\">B</mtext></mstyle></math></span><span></span> that are closed under composition with term functions of <span><math altimg=\"eq-00003.gif\" display=\"inline\"><mstyle><mtext mathvariant=\"normal\">A</mtext></mstyle></math></span><span></span> on the domain side and with term functions of <span><math altimg=\"eq-00004.gif\" display=\"inline\"><mstyle><mtext mathvariant=\"normal\">B</mtext></mstyle></math></span><span></span> on the codomain side. For <span><math altimg=\"eq-00005.gif\" display=\"inline\"><mstyle><mtext mathvariant=\"normal\">A, B</mtext></mstyle></math></span><span></span> (polynomially equivalent to) finite modules we show: If <span><math altimg=\"eq-00006.gif\" display=\"inline\"><mstyle><mtext mathvariant=\"normal\">A, B</mtext></mstyle></math></span><span></span> have coprime order and the congruence lattice of <span><math altimg=\"eq-00007.gif\" display=\"inline\"><mstyle><mtext mathvariant=\"normal\">A</mtext></mstyle></math></span><span></span> is distributive, then there are only finitely many clonoids from <span><math altimg=\"eq-00008.gif\" display=\"inline\"><mstyle><mtext mathvariant=\"normal\">A</mtext></mstyle></math></span><span></span> to <span><math altimg=\"eq-00009.gif\" display=\"inline\"><mstyle><mtext mathvariant=\"normal\">B</mtext></mstyle></math></span><span></span>. This is proved by establishing for every natural number <span><math altimg=\"eq-00010.gif\" display=\"inline\"><mi>k</mi></math></span><span></span> a particular linear equation that all <span><math altimg=\"eq-00011.gif\" display=\"inline\"><mi>k</mi></math></span><span></span>-ary functions from <span><math altimg=\"eq-00012.gif\" display=\"inline\"><mstyle><mtext mathvariant=\"normal\">A</mtext></mstyle></math></span><span></span> to <span><math altimg=\"eq-00013.gif\" display=\"inline\"><mstyle><mtext mathvariant=\"normal\">B</mtext></mstyle></math></span><span></span> satisfy. Else if <span><math altimg=\"eq-00014.gif\" display=\"inline\"><mstyle><mtext mathvariant=\"normal\">A, B</mtext></mstyle></math></span><span></span> do not have coprime order, then there exist infinite ascending chains of clonoids from <span><math altimg=\"eq-00015.gif\" display=\"inline\"><mstyle><mtext mathvariant=\"normal\">A</mtext></mstyle></math></span><span></span> to <span><math altimg=\"eq-00016.gif\" display=\"inline\"><mstyle><mtext mathvariant=\"normal\">B</mtext></mstyle></math></span><span></span> ordered by inclusion. Consequently any extension of <span><math altimg=\"eq-00017.gif\" display=\"inline\"><mstyle><mtext mathvariant=\"normal\">A</mtext></mstyle></math></span><span></span> by <span><math altimg=\"eq-00018.gif\" display=\"inline\"><mstyle><mtext mathvariant=\"normal\">B</mtext></mstyle></math></span><span></span> has countably infinitely many <","PeriodicalId":13756,"journal":{"name":"International Journal of Algebra and Computation","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2024-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141198021","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-05-17DOI: 10.1142/s0218196724500188
Mikhail Anokhin
Let be a finite set of finitary operation symbols and let be a nontrivial variety of -algebras. Assume that for some set of group operation symbols, all -algebras in are groups under the operations associated with the symbols in . In other words, is assumed to be a nontrivial variety of expanded groups. In particular, can be a nontrivial variety of groups or rings. Our main result is that there are no post-quantum weakly pseudo-free families in , even in the worst-case setting and/or the black-box model. In this paper, we restrict ourselves to families of computational and black-box -algebras (where ) such that for every , each element of is represented by a unique bit string of length polynomial in the length of . In our main result, we use straight-line programs to represent nontrivial relations between elements of -algebras. Note that under certain conditions, this result depends on the classification of finite simple gr
{"title":"There are no post-quantum weakly pseudo-free families in any nontrivial variety of expanded groups","authors":"Mikhail Anokhin","doi":"10.1142/s0218196724500188","DOIUrl":"https://doi.org/10.1142/s0218196724500188","url":null,"abstract":"<p>Let <span><math altimg=\"eq-00001.gif\" display=\"inline\"><mi mathvariant=\"normal\">Ω</mi></math></span><span></span> be a finite set of finitary operation symbols and let <span><math altimg=\"eq-00002.gif\" display=\"inline\"><mi>𝔙</mi></math></span><span></span> be a nontrivial variety of <span><math altimg=\"eq-00003.gif\" display=\"inline\"><mi mathvariant=\"normal\">Ω</mi></math></span><span></span>-algebras. Assume that for some set <span><math altimg=\"eq-00004.gif\" display=\"inline\"><mi mathvariant=\"normal\">Γ</mi><mo>⊆</mo><mi mathvariant=\"normal\">Ω</mi></math></span><span></span> of group operation symbols, all <span><math altimg=\"eq-00005.gif\" display=\"inline\"><mi mathvariant=\"normal\">Ω</mi></math></span><span></span>-algebras in <span><math altimg=\"eq-00006.gif\" display=\"inline\"><mi>𝔙</mi></math></span><span></span> are groups under the operations associated with the symbols in <span><math altimg=\"eq-00007.gif\" display=\"inline\"><mi mathvariant=\"normal\">Γ</mi></math></span><span></span>. In other words, <span><math altimg=\"eq-00008.gif\" display=\"inline\"><mi>𝔙</mi></math></span><span></span> is assumed to be a nontrivial variety of expanded groups. In particular, <span><math altimg=\"eq-00009.gif\" display=\"inline\"><mi>𝔙</mi></math></span><span></span> can be a nontrivial variety of groups or rings. Our main result is that there are no post-quantum weakly pseudo-free families in <span><math altimg=\"eq-00010.gif\" display=\"inline\"><mi>𝔙</mi></math></span><span></span>, even in the worst-case setting and/or the black-box model. In this paper, we restrict ourselves to families <span><math altimg=\"eq-00011.gif\" display=\"inline\"><mo stretchy=\"false\">(</mo><msub><mrow><mi>H</mi></mrow><mrow><mi>d</mi></mrow></msub><mi>|d</mi><mo>∈</mo><mi>D</mi><mo stretchy=\"false\">)</mo></math></span><span></span> of computational and black-box <span><math altimg=\"eq-00012.gif\" display=\"inline\"><mi mathvariant=\"normal\">Ω</mi></math></span><span></span>-algebras (where <span><math altimg=\"eq-00013.gif\" display=\"inline\"><mi>D</mi><mo>⊆</mo><msup><mrow><mo stretchy=\"false\">{</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo stretchy=\"false\">}</mo></mrow><mrow><mo stretchy=\"false\">∗</mo></mrow></msup></math></span><span></span>) such that for every <span><math altimg=\"eq-00014.gif\" display=\"inline\"><mi>d</mi><mo>∈</mo><mi>D</mi></math></span><span></span>, each element of <span><math altimg=\"eq-00015.gif\" display=\"inline\"><msub><mrow><mi>H</mi></mrow><mrow><mi>d</mi></mrow></msub></math></span><span></span> is represented by a unique bit string of length polynomial in the length of <span><math altimg=\"eq-00016.gif\" display=\"inline\"><mi>d</mi></math></span><span></span>. In our main result, we use straight-line programs to represent nontrivial relations between elements of <span><math altimg=\"eq-00017.gif\" display=\"inline\"><mi mathvariant=\"normal\">Ω</mi></math></span><span></span>-algebras. Note that under certain conditions, this result depends on the classification of finite simple gr","PeriodicalId":13756,"journal":{"name":"International Journal of Algebra and Computation","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2024-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141190865","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-05-09DOI: 10.1142/s0218196724500206
Francesco de Giovanni, Iker de las Heras, Marco Trombetti
The subgroup lattice of a group is a great source of information about the structure of the group itself. The aim of this paper is to use a similar tool for studying profinite groups. In more detail, we study the lattices of closed or open subgroups of a profinite group and its relation with the whole group. We show, for example, that procyclic groups are the only profinite groups with a distributive lattice of closed or open subgroups, and we give a sharp characterization of profinite groups whose lattice of closed (or open) subgroups satisfies the Dedekind modular law; we actually give a precise description of the behavior of modular elements of the lattice of closed subgroups. We also deal with the problem of carrying some structural information from a profinite group to another one having an isomorphic lattice of closed (or open) subgroups. Some interesting consequences and related results concerning decomposability and the number of profinite groups with a given lattice of closed (or open) subgroups are also obtained.
{"title":"On the lattice of closed subgroups of a profinite group","authors":"Francesco de Giovanni, Iker de las Heras, Marco Trombetti","doi":"10.1142/s0218196724500206","DOIUrl":"https://doi.org/10.1142/s0218196724500206","url":null,"abstract":"<p>The subgroup lattice of a group is a great source of information about the structure of the group itself. The aim of this paper is to use a similar tool for studying profinite groups. In more detail, we study the lattices of closed or open subgroups of a profinite group and its relation with the whole group. We show, for example, that procyclic groups are the only profinite groups with a distributive lattice of closed or open subgroups, and we give a sharp characterization of profinite groups whose lattice of closed (or open) subgroups satisfies the Dedekind modular law; we actually give a precise description of the behavior of modular elements of the lattice of closed subgroups. We also deal with the problem of carrying some structural information from a profinite group to another one having an isomorphic lattice of closed (or open) subgroups. Some interesting consequences and related results concerning decomposability and the number of profinite groups with a given lattice of closed (or open) subgroups are also obtained.</p>","PeriodicalId":13756,"journal":{"name":"International Journal of Algebra and Computation","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2024-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140926562","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-04-30DOI: 10.1142/s021819672450019x
Dario Ascari
We provide an algorithm that, given a finite set of generators for a subgroup of a finitely generated free group , determines whether is echelon or not and, in case of affirmative answer, also computes a basis with respect to which is in echelon form. This gives an answer to a question of Rosenmann. We also prove, by means of a counterexample, that intersection of two echelon subgroups needs not to be echelon, answering another question of Rosenmann.
我们提供了一种算法,只要给定有限生成的自由群 F 的子群 H 的有限生成子集,就能确定 H 是否为梯形,如果答案是肯定的,还能计算出 H 为梯形的基。这就回答了罗森曼的一个问题。我们还通过一个反例证明了两个梯形子群的交集不一定是梯形,从而回答了罗森曼的另一个问题。
{"title":"An algorithm to recognize echelon subgroups of a free group","authors":"Dario Ascari","doi":"10.1142/s021819672450019x","DOIUrl":"https://doi.org/10.1142/s021819672450019x","url":null,"abstract":"<p>We provide an algorithm that, given a finite set of generators for a subgroup <span><math altimg=\"eq-00001.gif\" display=\"inline\" overflow=\"scroll\"><mi>H</mi></math></span><span></span> of a finitely generated free group <span><math altimg=\"eq-00002.gif\" display=\"inline\" overflow=\"scroll\"><mi>F</mi></math></span><span></span>, determines whether <span><math altimg=\"eq-00003.gif\" display=\"inline\" overflow=\"scroll\"><mi>H</mi></math></span><span></span> is echelon or not and, in case of affirmative answer, also computes a basis with respect to which <span><math altimg=\"eq-00004.gif\" display=\"inline\" overflow=\"scroll\"><mi>H</mi></math></span><span></span> is in echelon form. This gives an answer to a question of Rosenmann. We also prove, by means of a counterexample, that intersection of two echelon subgroups needs not to be echelon, answering another question of Rosenmann.</p>","PeriodicalId":13756,"journal":{"name":"International Journal of Algebra and Computation","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2024-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140841938","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-04-20DOI: 10.1142/s0218196724500139
Marina Anagnostopoulou-Merkouri, Zachary Mesyan, James D. Mitchell
From any directed graph one can construct the graph inverse semigroup , whose elements, roughly speaking, correspond to paths in . Wang and Luo showed that the congruence lattice of is upper-semimodular for every graph , but can fail to be lower-semimodular for some . We provide a simple characterization of the graphs for which is lower-semimodular. We also describe those such that is atomistic, and characterize the minimal generating sets for when is finite and simple.
王和罗(Wang and Luo)的研究表明,G(E) 的同余网格 L(G(E)) 对于每个图 E 都是上半模的,但对于某些图 E 可能不是下半模的。我们还描述了那些 L(G(E)) 原子化的 E,并描述了当 E 有限且简单时 L(G(E)) 的最小生成集。
{"title":"Properties of congruence lattices of graph inverse semigroups","authors":"Marina Anagnostopoulou-Merkouri, Zachary Mesyan, James D. Mitchell","doi":"10.1142/s0218196724500139","DOIUrl":"https://doi.org/10.1142/s0218196724500139","url":null,"abstract":"<p>From any directed graph <span><math altimg=\"eq-00001.gif\" display=\"inline\" overflow=\"scroll\"><mi>E</mi></math></span><span></span> one can construct the graph inverse semigroup <span><math altimg=\"eq-00002.gif\" display=\"inline\" overflow=\"scroll\"><mi>G</mi><mo stretchy=\"false\">(</mo><mi>E</mi><mo stretchy=\"false\">)</mo></math></span><span></span>, whose elements, roughly speaking, correspond to paths in <span><math altimg=\"eq-00003.gif\" display=\"inline\" overflow=\"scroll\"><mi>E</mi></math></span><span></span>. Wang and Luo showed that the congruence lattice <span><math altimg=\"eq-00004.gif\" display=\"inline\" overflow=\"scroll\"><mi>L</mi><mo stretchy=\"false\">(</mo><mi>G</mi><mo stretchy=\"false\">(</mo><mi>E</mi><mo stretchy=\"false\">)</mo><mo stretchy=\"false\">)</mo></math></span><span></span> of <span><math altimg=\"eq-00005.gif\" display=\"inline\" overflow=\"scroll\"><mi>G</mi><mo stretchy=\"false\">(</mo><mi>E</mi><mo stretchy=\"false\">)</mo></math></span><span></span> is upper-semimodular for every graph <span><math altimg=\"eq-00006.gif\" display=\"inline\" overflow=\"scroll\"><mi>E</mi></math></span><span></span>, but can fail to be lower-semimodular for some <span><math altimg=\"eq-00007.gif\" display=\"inline\" overflow=\"scroll\"><mi>E</mi></math></span><span></span>. We provide a simple characterization of the graphs <span><math altimg=\"eq-00008.gif\" display=\"inline\" overflow=\"scroll\"><mi>E</mi></math></span><span></span> for which <span><math altimg=\"eq-00009.gif\" display=\"inline\" overflow=\"scroll\"><mi>L</mi><mo stretchy=\"false\">(</mo><mi>G</mi><mo stretchy=\"false\">(</mo><mi>E</mi><mo stretchy=\"false\">)</mo><mo stretchy=\"false\">)</mo></math></span><span></span> is lower-semimodular. We also describe those <span><math altimg=\"eq-00010.gif\" display=\"inline\" overflow=\"scroll\"><mi>E</mi></math></span><span></span> such that <span><math altimg=\"eq-00011.gif\" display=\"inline\" overflow=\"scroll\"><mi>L</mi><mo stretchy=\"false\">(</mo><mi>G</mi><mo stretchy=\"false\">(</mo><mi>E</mi><mo stretchy=\"false\">)</mo><mo stretchy=\"false\">)</mo></math></span><span></span> is atomistic, and characterize the minimal generating sets for <span><math altimg=\"eq-00012.gif\" display=\"inline\" overflow=\"scroll\"><mi>L</mi><mo stretchy=\"false\">(</mo><mi>G</mi><mo stretchy=\"false\">(</mo><mi>E</mi><mo stretchy=\"false\">)</mo><mo stretchy=\"false\">)</mo></math></span><span></span> when <span><math altimg=\"eq-00013.gif\" display=\"inline\" overflow=\"scroll\"><mi>E</mi></math></span><span></span> is finite and simple.</p>","PeriodicalId":13756,"journal":{"name":"International Journal of Algebra and Computation","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2024-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140806223","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-04-05DOI: 10.1142/s0218196724500176
A. Rosenmann, Enric Ventura
{"title":"Dependence over subgroups of free groups","authors":"A. Rosenmann, Enric Ventura","doi":"10.1142/s0218196724500176","DOIUrl":"https://doi.org/10.1142/s0218196724500176","url":null,"abstract":"","PeriodicalId":13756,"journal":{"name":"International Journal of Algebra and Computation","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2024-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140737860","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-04-05DOI: 10.1142/s0218196724500164
Weijun Liu, Qinghong Guo, Lihua Feng, Zheng Huang
{"title":"p-Singular characters and normal sylow p-subgroups","authors":"Weijun Liu, Qinghong Guo, Lihua Feng, Zheng Huang","doi":"10.1142/s0218196724500164","DOIUrl":"https://doi.org/10.1142/s0218196724500164","url":null,"abstract":"","PeriodicalId":13756,"journal":{"name":"International Journal of Algebra and Computation","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2024-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140740957","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}