Results 41 to 50 of about 13,276 (167)

Chains in the Bruhat order [PDF]

open access: yesJournal of Algebraic Combinatorics, 2008
36 ...
Postnikov, Alexander   +1 more
openaire   +2 more sources

Towers of powers and bruhat order

open access: yesEuropean Journal of Combinatorics, 1992
In this short paper, the authors provide a counterexample ...
Griggs, Jerrold R., Wachs, Michelle L.
openaire   +2 more sources

Bruhat Order in Full Symmetric Toda System [PDF]

open access: yesCommunications in Mathematical Physics, 2014
In this paper we discuss some geometrical and topological properties of the full symmetric Toda system. We show by a direct inspection that the phase transition diagram for the full symmetric Toda system in dimensions $n=3,4$ coincides with the Hasse diagram of the Bruhat order of symmetric groups $S_3$ and $S_4$.
Chernyakov, Yu. B.   +2 more
openaire   +3 more sources

Quotients of Twisted Bruhat Orders

open access: yesJournal of Algebra, 1994
The present paper is a continuation of the author's preceding paper [Contemp. Math. 139, 141-165 (1992; Zbl 0833.20048)] on the study of a twisted Bruhat order \(\leq_A\) on a Coxeter group \(W\), where \(A\) is some initial section of reflections of \(W\). Let \(W\) be an indecomposable affine Weyl group represented geometrically on a euclidean space \
openaire   +2 more sources

The Order Dimension of Bruhat Order on Infinite Coxeter Groups [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2005
We give a quadratic lower bound and a cubic upper bound on the order dimension of the Bruhat (or strong) ordering of the affine Coxeter group ${\tilde{A}}_n$. We also demonstrate that the order dimension of the Bruhat order is infinite for a large class of Coxeter groups.
Reading, Nathan, Waugh, Debra J.
openaire   +2 more sources

The Rook Monoid is Lexicographically Shellable

open access: yes, 2019
We prove that the Bruhat-Chevalley-Renner order on the rook monoid is EL-shellable.
Can, Mahir Bilen
core   +1 more source

KP Solitons, Higher Bruhat and Tamari Orders [PDF]

open access: yes, 2012
In a tropical approximation, any tree-shaped line soliton solution, a member of the simplest class of soliton solutions of the Kadomtsev-Petviashvili (KP-II) equation, determines a chain of planar rooted binary trees, connected by right rotation. More precisely, it determines a maximal chain of a Tamari lattice.
Müller-Hoissen, F., Dimakis, A.
openaire   +3 more sources

Moments of L$L$‐functions via a relative trace formula

open access: yesProceedings of the London Mathematical Society, Volume 132, Issue 4, April 2026.
Abstract We prove an asymptotic formula for the second moment of the GL(n)×GL(n−1)$\mathrm{GL}(n)\times \mathrm{GL}(n-1)$ Rankin–Selberg central L$L$‐values L(1/2,Π⊗π)$L(1/2,\Pi \otimes \pi)$, where π$\pi$ is a fixed cuspidal representation of GL(n−1)$\mathrm{GL}(n-1)$ that is tempered and unramified at every place, while Π$\Pi$ varies over a family of
Subhajit Jana, Ramon Nunes
wiley   +1 more source

Noncrossing partitions and Bruhat order

open access: yesEuropean Journal of Combinatorics, 2016
We prove that the restriction of Bruhat order to noncrossing partitions in type $A_n$ for the Coxeter element $c=s_1s_2 ...s_n$ forms a distributive lattice isomorphic to the order ideals of the root poset ordered by inclusion. Motivated by the change-of-basis from the graphical basis of the Temperley-Lieb algebra to the image of the simple elements of
Gobet, Thomas, Williams, Nathan
openaire   +3 more sources

On the Euler characteristic of S$S$‐arithmetic groups

open access: yesJournal of the London Mathematical Society, Volume 113, Issue 3, March 2026.
Abstract We show that the sign of the Euler characteristic of an S$S$‐arithmetic subgroup of a simple algebraic group depends on the S$S$‐congruence completion only, except possibly in type 6D4${}^6 D_4$. Consequently, the sign is a profinite invariant for such S$S$‐arithmetic groups with the congruence subgroup property. This generalizes previous work
Holger Kammeyer, Giada Serafini
wiley   +1 more source

Home - About - Disclaimer - Privacy