English
Related papers

Related papers: On dominance and minuscule Weyl group elements

200 papers

The numbers game is a one-player game played on a finite simple graph with certain ``amplitudes'' assigned to its edges and with an initial assignment of real numbers to its nodes. The moves of the game successively transform the numbers at…

Combinatorics · Mathematics 2007-10-02 Robert G. Donnelly

Let $\mathfrak{g}$ be a simple Lie algebra of rank $r$ over $\mathbb{C}$, $\mathfrak{h} \subset \mathfrak{g}$ a Cartan subalgebra. We construct a family of $r$ commuting Hermitian operators acting on $\mathfrak{h}$ whose eigenvalues are…

Representation Theory · Mathematics 2016-12-14 Laura Brillon , Vadim Schechtman

In this article, we first show that in case $n$ is even which Coxeter element in $\mathfrak{S}_{n}$ affords the longest by taking its power to $n/2$. We also show that in case $n$ is odd which Coxeter element affords the longest in…

Group Theory · Mathematics 2014-11-24 Masashi Kosuda

Let (W,S) be a Coxeter system of finite rank (ie |S| is finite) and let A be the associated Coxeter (or Davis) complex. We study chains of pairwise parallel walls in A using Tits' bilinear form associated to the standard root system of…

Group Theory · Mathematics 2009-06-29 Pierre-Emmanuel Caprace

There are many different ways that the exponents of Weyl groups of irreducible root systems have been defined and put into practice. One of the most classical and algebraic definitions of the exponents is related to the eigenvalues of…

Combinatorics · Mathematics 2020-09-24 Tan Nhat Tran

Chapuy and Stump have given a nice generating series for the number of factorisations of a Coxeter element as a product of reflections. Their method is to evaluate case by case a character-theoretic expression. The goal of this note is to…

Representation Theory · Mathematics 2014-08-05 Jean Michel

Members of a shareholder meeting or legislative committee have greater or smaller voting power than meets the eye if the nucleolus of the induced majority game differs from the voting weight distribution. We establish a new sufficient…

Optimization and Control · Mathematics 2017-03-27 Sascha Kurz , Stefan Napel , Andreas Nohn

A subset $D$ of vertices of a graph $G$ is a \textit{dominating set} if for each $u\in V(G)\setminus D$, $u$ is adjacent to some vertex $v\in D$. The \textit{dominating number}, $\gamma(G)$ of $G$, is the minimum cardinality of a dominating…

Combinatorics · Mathematics 2018-04-10 Doost Ali Mojdeh , Seyed Reza Musawi , Esmaeil Nazari , Nader Jafari Rad

For oriented connected closed manifolds of the same dimension, there is a transitive relation: $M$ dominates $N$, or $M \ge N$, if there exists a continuous map of non-zero degree from $M$ onto $N$. Section 1 is a reminder on the notion of…

Algebraic Topology · Mathematics 2016-09-22 Pierre de la Harpe

Let $(W, R)$ be a Coxeter system and let $w \in W$. We say that $u$ is a prefix of $w$ if there is a reduced expression for $u$ that can be extended to one for $w$. That is, $w = uv$ for some $v$ in $W$ such that $\ell(w) = \ell(u) +…

Group Theory · Mathematics 2025-02-04 Sarah B. Hart , Peter J. Rowley

Let $c$ be the family of irreducible representations of a Weyl group $W$ corresponding to a two-sided cell of $W$. We define a subset $A_c$ of $c$ which contains the special representation of $W$ in $c$ and is in canonical bijection with…

Representation Theory · Mathematics 2024-05-08 G. Lusztig

Let G be a split adjoint semisimple group over Q and K a maximal compact subgroup of the real points G(R). We shall give a uniform, short and essentially elementary proof of the Weyl law for cusp forms on congruence quotients of G(R)/K.…

Number Theory · Mathematics 2007-05-23 Elon Lindenstrauss , Akshay Venkatesh

This paper studies weakly mixing (singular) and mixing masas in type $\rm{II}_{1}$ factors from a bimodule point of view. Several necessary and sufficient conditions to characterize the normalizing algebra of a masa are presented. We also…

Operator Algebras · Mathematics 2017-01-02 Jan Cameron , Junsheng Fang , Kunal Mukherjee

We explore some of the special features with respect to Bredon cohomology of groups having all its finite subgroups either nilpotent or p-groups or cyclic p-groups. We get some results on dimensions and also a formula for the equivariant…

Group Theory · Mathematics 2013-03-13 Conchita Martínez-Pérez

The usual combinatorial model for the 0-Hecke algebra of the symmetric group is to consider the algebra (or monoid) generated by the bubble sort operators. This construction generalizes to any finite Coxeter group W. The authors previously…

Combinatorics · Mathematics 2011-02-07 Florent Hivert , Anne Schilling , Nicolas M. Thiéry

An axiomatic approach to the representation theory of Coxeter groups and their Hecke algebras was presented in [1]. Combinatorial aspects of this construction are studied in this paper. In particular, the symmetric group case is…

Representation Theory · Mathematics 2007-05-23 Ron M. Adin , Francesco Brenti , Yuval Roichman

A vertex subset $W\subseteq V$ of the graph $G = (V,E)$ is an independent dominating set if every vertex in $V\setminus W$ is adjacent to at least one vertex in $W$ and the vertices of $W$ are pairwise non-adjacent. We enumerate independent…

General Mathematics · Mathematics 2019-10-14 Somayeh Jahari , Saeid Alikhani

Let W be an arbitrary Coxeter group. If two elements have expressions that are cyclic shifts of each other (as words), then they are conjugate (as group elements) in W. We say that w is "cyclically fully commutative" (CFC) if every cyclic…

Combinatorics · Mathematics 2024-02-12 Tomas Boothby , Jeffrey Burkert , Morgan Eichwald , R. M. Green , Dana C. Ernst , Matthew Macauley

A weak multiplier Hopf algebra is a pair (A,\Delta) of a non-degenerate idempotent algebra A and a coproduct $\Delta$ on A. The coproduct is a coassociative homomorphism from A to the multiplier algebra M(A\otimes A) with some natural extra…

Rings and Algebras · Mathematics 2012-10-17 Alfons Van Daele , Shuanhong Wang

Let $G=(V,E)$ be a simple graph. A dominating set of $G$ is a subset $D\subseteq V$ such that every vertex not in $D$ is adjacent to at least one vertex in $D$. The cardinality of a smallest dominating set of $G$, denoted by $\gamma(G)$, is…

Combinatorics · Mathematics 2021-11-04 Nima Ghanbari