对称群子群配合物的等变Euler特性

IF 0.6 4区 数学 Q4 MATHEMATICS, APPLIED
Zhipeng Duan
{"title":"对称群子群配合物的等变Euler特性","authors":"Zhipeng Duan","doi":"10.1007/s00026-022-00630-2","DOIUrl":null,"url":null,"abstract":"<div><p>Equivariant Euler characteristics are important numerical homotopy invariants for objects with group actions. They have deep connections with many other areas like modular representation theory and chromatic homotopy theory. They are also computable, especially for combinatorial objects like partition posets, buildings associated with finite groups of Lie types, etc. In this article, we make new contributions to concrete computations by determining the equivariant Euler characteristics for all subgroup complexes of symmetric groups <span>\\(\\varSigma _n\\)</span> when n is prime, twice a prime, or a power of two and several variants. There are two basic approaches to calculating equivariant Euler characteristics. One is based on a recursion formula and generating functions, and another on analyzing the fixed points of abelian subgroups. In this article, we adopt the second approach since the fixed points of abelian subgroups are simple in this case.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2022-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Equivariant Euler Characteristics of Subgroup Complexes of Symmetric Groups\",\"authors\":\"Zhipeng Duan\",\"doi\":\"10.1007/s00026-022-00630-2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Equivariant Euler characteristics are important numerical homotopy invariants for objects with group actions. They have deep connections with many other areas like modular representation theory and chromatic homotopy theory. They are also computable, especially for combinatorial objects like partition posets, buildings associated with finite groups of Lie types, etc. In this article, we make new contributions to concrete computations by determining the equivariant Euler characteristics for all subgroup complexes of symmetric groups <span>\\\\(\\\\varSigma _n\\\\)</span> when n is prime, twice a prime, or a power of two and several variants. There are two basic approaches to calculating equivariant Euler characteristics. One is based on a recursion formula and generating functions, and another on analyzing the fixed points of abelian subgroups. In this article, we adopt the second approach since the fixed points of abelian subgroups are simple in this case.</p></div>\",\"PeriodicalId\":50769,\"journal\":{\"name\":\"Annals of Combinatorics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2022-12-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Annals of Combinatorics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s00026-022-00630-2\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s00026-022-00630-2","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

摘要

等变Euler特征是具有群作用的对象的重要数值同伦不变量。它们与许多其他领域有着深刻的联系,如模表示理论和色同伦论。它们也是可计算的,特别是对于组合对象,如划分偏序集、与李型有限群相关的建筑物等。在本文中,我们通过确定对称群\(\varSigma_n\)的所有子群复数的等变欧拉特征,对具体计算做出了新的贡献,或者两个和几个变体的幂。计算等变欧拉特性有两种基本方法。一个是基于递归公式和生成函数,另一个是分析阿贝尔子群的不动点。在本文中,我们采用了第二种方法,因为阿贝尔子群的不动点在这种情况下是简单的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Equivariant Euler Characteristics of Subgroup Complexes of Symmetric Groups

Equivariant Euler characteristics are important numerical homotopy invariants for objects with group actions. They have deep connections with many other areas like modular representation theory and chromatic homotopy theory. They are also computable, especially for combinatorial objects like partition posets, buildings associated with finite groups of Lie types, etc. In this article, we make new contributions to concrete computations by determining the equivariant Euler characteristics for all subgroup complexes of symmetric groups \(\varSigma _n\) when n is prime, twice a prime, or a power of two and several variants. There are two basic approaches to calculating equivariant Euler characteristics. One is based on a recursion formula and generating functions, and another on analyzing the fixed points of abelian subgroups. In this article, we adopt the second approach since the fixed points of abelian subgroups are simple in this case.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Annals of Combinatorics
Annals of Combinatorics 数学-应用数学
CiteScore
1.00
自引率
0.00%
发文量
56
审稿时长
>12 weeks
期刊介绍: Annals of Combinatorics publishes outstanding contributions to combinatorics with a particular focus on algebraic and analytic combinatorics, as well as the areas of graph and matroid theory. Special regard will be given to new developments and topics of current interest to the community represented by our editorial board. The scope of Annals of Combinatorics is covered by the following three tracks: Algebraic Combinatorics: Enumerative combinatorics, symmetric functions, Schubert calculus / Combinatorial Hopf algebras, cluster algebras, Lie algebras, root systems, Coxeter groups / Discrete geometry, tropical geometry / Discrete dynamical systems / Posets and lattices Analytic and Algorithmic Combinatorics: Asymptotic analysis of counting sequences / Bijective combinatorics / Univariate and multivariable singularity analysis / Combinatorics and differential equations / Resolution of hard combinatorial problems by making essential use of computers / Advanced methods for evaluating counting sequences or combinatorial constants / Complexity and decidability aspects of combinatorial sequences / Combinatorial aspects of the analysis of algorithms Graphs and Matroids: Structural graph theory, graph minors, graph sparsity, decompositions and colorings / Planar graphs and topological graph theory, geometric representations of graphs / Directed graphs, posets / Metric graph theory / Spectral and algebraic graph theory / Random graphs, extremal graph theory / Matroids, oriented matroids, matroid minors / Algorithmic approaches
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信