arXiv 1506.033322015-06-29math.COmath.RT

Absolute order in general linear groups

Jia Huang, Joel Brewster Lewis, Victor Reiner

备注：: 26 pages. v2: Minor edits; Question 6.3 and some references added
发表信息：: J. Lond. Math. Soc. (2) 95 (2017), no. 1, 223--247
DOI：: 10.1112/jlms.12013

英文摘要：

This paper studies a partial order on the general linear group GL(V) called the absolute order, derived from viewing GL(V) as a group generated by reflections, that is, elements whose fixed space has codimension one. The absolute order on GL(V) is shown to have two equivalent descriptions, one via additivity of length for factorizations into reflections, the other via additivity of fixed space codimensions. Other general properties of the order are derived, including self-duality of its intervals. Working over a finite field F_q, it is shown via a complex character computation that the poset interval from the identity to a Singer cycle (or any regular elliptic element) in GL_n(F_q) has a strikingly simple formula for the number of chains passing through a prescribed set of ranks.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

On the Sperner property for the absolute order on complex reflection groups

Two partial orders on a reflection group, the codimension order and the prefix order, are together called the absolute order when they agree. We show that in this case the absolute order on a complex reflection group has the strong Sperner property, except possibly for the Coxeter group of type $D_n$, for which this property is conjectural. The Sperner property had previously been established for the noncrossing partition lattice $NC_W$, a certain maximal interval in the absolute order, but not for the entire poset, except in the case of the symmetric group. We also show that neither the codim…

2020-10-31math.CO

The absolute order on the symmetric group, constructible partially ordered sets and Cohen-Macaulay complexes

The absolute order is a natural partial order on a Coxeter group W. It can be viewed as an analogue of the weak order on W in which the role of the generating set of simple reflections in W is played by the set of all reflections in W. By use of a notion of constructibility for partially ordered sets, it is proved that the absolute order on the symmetric group is homotopy Cohen-Macaulay. This answers in part a question raised by V. Reiner and the first author. The Euler characteristic of the order complex of the proper part of the absolute order on the symmetric group is also computed.

2008-01-07math.CO

The absolute order on the hyperoctahedral group

The absolute order on the hyperoctahedral group $B_n$ is investigated. It is proved that the order ideal of this poset generated by the Coxeter elements is homotopy Cohen-Macaulay and the Möbius number of this ideal is computed. Moreover, it is shown that every closed interval in the absolute order on $B_n$ is shellable and an example of a non-Cohen-Macaulay interval in the absolute order on $D_4$ is given. Finally, the closed intervals in the absolute order on $B_n$ and $D_n$ which are lattices are characterized and some of their important enumerative invariants are computed.

2010-03-25math.CO

The absolute order of a permutation representation of a Coxeter group

A permutation representation of a Coxeter group $W$ naturally defines an absolute order. This family of partial orders (which includes the absolute order on $W$) is introduced and studied in this paper. Conditions under which the associated rank generating polynomial divides the rank generating polynomial of the absolute order on $W$ are investigated when $W$ is finite. Several examples, including a symmetric group action on perfect matchings, are discussed. As an application, a well-behaved absolute order on the alternating subgroup of $W$ is defined.

2013-03-07math.COmath.GR

The Absolute Orders on the Coxeter Groups $A_n$ and $B_n$ are Sperner

Over 50 years ago, Rota posted the following celebrated `Research Problem': prove or disprove that the partial order of partitions on an $n$-set (i.e., the refinement order) is Sperner. A counterexample was eventually discovered by Canfield in 1978. However, Harper and Kim recently proved that a closely related order --- i.e., the refinement order on the symmetric group --- is not only Sperner, but strong Sperner. Equivalently, the well-known absolute order on the symmetric group is strong Sperner. In this paper, we extend these results by giving a concise, elegant proof that the absolute orde…

2019-02-22math.CO

Comparing Codimension and Absolute Length in Complex Reflection Groups

Reflection length and codimension of fixed point spaces induce partial orders on a complex reflection group. While these partial orders are of independent combinatorial interest, our investigation is motivated by a connection between the codimension order and the algebraic structure of cohomology governing deformations of skew group algebras. In this article, we compare the reflection length and codimension functions and discuss implications for cohomology of skew group algebras. We give algorithms using character theory for computing reflection length, atoms, and poset relations. Using a mixt…

2012-02-01math.ACmath.COmath.RA

更多相关论文收起更多论文

The Weyl functor - Introduction to Absolute Arithmetic

Starting from an ancient observation of Tits concerning the interpretation of symmetric groups as Chevalley groups over a (non-existing) field having only one element, we describe combinatorial geometry over this field, as well as Linear Algebra. We arrive at an "absolute mantra" which is one of the basic principles of the present book.

2014-06-18math.COmath.GR

On absolute linear Harbourne constants

In the present note we study absolute linear Harbourne constants. These are invariants which were introduced in order to relate the lower bounds on the selfintersection of negative curves on birationally equivalent surfaces to the complexity of the birational map between them. We provide various lower and upper bounds on Harbourne constants and give their values for the number of lines $s$ of the form $p^{2r}+p^r+1$ for any prime number $p$ and also for all values of $s$ up to $31$. This extends considerably earlier results of the third author.

2016-01-13math.AGmath.CO

The intermediate orders of a Coxeter group

We define a class of partial orders on a Coxeter group associated with sets of reflections. In special cases, these lie between the left weak order and the Bruhat order. We prove that these posets are graded by the length function and that the projections on the right parabolic quotients are always order preserving. We also introduce the notion of $k$-Bruhat graph, $k$-absolute length and $k$-absolute order, proposing some related conjectures and problems.

2022-06-27math.CO

Ree geometries

We introduce a rank 3 geometry for any Ree group over a not necessarily perfect field and show that its full collineation group is the automorphism group of the corresponding Ree group. A similar result holds for two rank 2 geometries obtained as a truncation of this rank 3 geometry. As an application, we show that a polarity in any Moufang generalized hexagon is unambiguously determined by its set of absolute points, or equivalently, its set of absolute lines.

2009-09-17math.COmath.GR

绝对序与反交换元

Absolute order and involutions

Université Clermont Auvergne（克莱蒙奥弗涅大学）

本文研究Coxeter群中绝对序在特定区间上的限制，通过反交换元的抛物子群概念，对满足特定条件的反交换元进行特征化和分类。

2025-07-15math.COmath.GR