English
Related papers

Related papers: Minimal determining sets for certain $W$-graph ide…

200 papers

Automorphisms of the quantum Schubert cell algebras ${\mathcal U}_q^\pm[w]$ of De Concini, Kac, Procesi and Lusztig and their restrictions to some key invariant subalgebras are studied. We develop some general rigidity results and apply…

Quantum Algebra · Mathematics 2023-02-24 Garrett Johnson , Hayk Melikyan

Let $\mathfrak{g}$ be the Lie algebra $\mathfrak{sl}(n,\mathbb{C})$. Its Weyl group is the symmetric group $S_n$. In this paper, we want to describe some Kazhdan-Lusztig right cells containing smooth elements which parameterize the smooth…

Representation Theory · Mathematics 2025-10-09 Zhanqiang Bai , Zheng-an Chen

We establish a cutting lemma for definable families of sets in distal structures, as well as the optimality of the distal cell decomposition for definable families of sets on the plane in $o$-minimal expansions of fields. Using it, we…

Logic · Mathematics 2020-02-28 Artem Chernikov , David Galvin , Sergei Starchenko

To a Coxeter system $(W,S)$ (with $S$ finite) and a weight function $L : W \to \NM$ is associated a partition of $W$ into Kazhdan-Lusztig (left, right or two-sided) $L$-cells. Let $S^\circ = \{s \in S | L(s)=0\}$, $S^+=\{s \in S | L(s) >…

Representation Theory · Mathematics 2011-04-20 Cédric Bonnafé , Jérémie Guilhot

This paper is the continuation of the work in~\cite{Yin}. In that paper we generalized the definition of $W$-graph ideal in the weighted Coxeter groups, and showed how to construct a $W$-graph from a given $W$-graph ideal in the case of…

Representation Theory · Mathematics 2015-04-01 Yunchuan Yin

We study the diameter of the graph $G(w)$ of reduced words of an element $w$ in a Coxeter group $W$ whose edges correspond to applications of the Coxeter relations. We resolve conjectures of Reiner--Roichman and Dahlberg--Kim by proving a…

Combinatorics · Mathematics 2022-11-02 Christian Gaetz , Yibo Gao

A set $W\subseteq V(G)$ is called a resolving set for $G$, if for each two distinct vertices $u,v\in V(G)$ there exists $w\in W$ such that $d(u,w)\neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. The minimum…

Combinatorics · Mathematics 2012-03-13 Mohsen Jannesari

We give a characterization of the Dynkin elements of a simple Lie algebra. Namely, we prove that one-half of a Dynkin element is the unique point of minimal length in its N-region. In type A_n this translates into a statement about the…

Representation Theory · Mathematics 2007-05-23 Paul E. Gunnells , Eric Sommers

We study a class of combinatorially-defined polynomial ideals which are generated by minors of a generic symmetric matrix. Included within this class are the symmetric determinantal ideals, the symmetric ladder determinantal ideals, and the…

Algebraic Geometry · Mathematics 2024-02-21 Laura Escobar , Alex Fink , Jenna Rajchgot , Alexander Woo

In 2011, Howlett and Nguyen \cite{r1} introduced the concept of a $W$-graph ideal $E_J$ in $\left ( W,\leqslant_{L} \right )$ with respect to $J$ (a subset of $S$), where $\leqslant _{L}$ is the left weak order on $W$. They proved that one…

Combinatorics · Mathematics 2018-05-03 Qi Wang

The inclusion ideal graph $\mathcal{I}n(S)$ of a semigroup $S$ is an undirected simple graph whose vertices are all nontrivial left ideals of $S$ and two distinct left ideals $I, J$ are adjacent if and only if either $I \subset J$ or $J…

Combinatorics · Mathematics 2021-10-28 Barkha Baloda , Jitender Kumar

In this article we associate to every lattice ideal $I_{L,\rho}\subset K[x_1,..., x_m]$ a cone $\sigma $ and a graph $G_{\sigma}$ with vertices the minimal generators of the Stanley-Reisner ideal of $\sigma $. To every polynomial $F$ we…

Commutative Algebra · Mathematics 2007-05-23 Anargyros Katsabekis , Marcel Morales , Apostolos Thoma

A graph $G$ is universal for a class of graphs $\mathcal{C}$, if, up to isomorphism, $G$ contains every graph in $\mathcal{C}$ as a subgraph. In 1978, Chung and Graham asked for the minimal number $s(n)$ of edges in a graph with $n$…

Combinatorics · Mathematics 2026-03-27 Julian Becker , Konstantinos Panagiotou , Matija Pasch

Let $G$ be a connected reductive group over an algebraically closed field with Weyl group $W$. The analogy between Lusztig varieties and Deligne-Lusztig varieties associated to minimal length elements in elliptic conjugacy classes of $W$…

Representation Theory · Mathematics 2023-12-11 Chengze Duan

We define a notion of ideal for objects in the category of abstract unitary Cuntz semigroups introduced in [3] and termed Cu$^\sim$. We show that the set of ideals of a Cu$^\sim$-semigroup has a complete lattice structure. In fact, we prove…

Operator Algebras · Mathematics 2021-07-07 Laurent Cantier

In 1979, Kazhdan and Lusztig introduced the notion of "cells" (left, right and two-sided) for a Coxeter group $W$, a concept with numerous applications in Lie theory and around. Here, we address algorithmic aspects of this theory for finite…

Representation Theory · Mathematics 2014-02-07 Meinolf Geck , Abbie Halls

From the combinatorial characterizations of the right, left, and two-sided Kazhdan-Lusztig cells of the symmetric group, 'RSK bases' are constructed for certain quotients by two-sided ideals of the group ring and the Hecke algebra.…

Representation Theory · Mathematics 2011-01-21 K. N. Raghavan , Preena Samuel , K. V. Subrahmanyam

Let (W,S) be a crystallographic Coxeter group (this includes all finite and affine Weyl groups), and J a subset of S. Let $W^J$ denote the set of minimal coset representatives modulo the parabolic subgroup $W_J$. For w in $W^J$, let…

Combinatorics · Mathematics 2008-05-01 Anders Bjorner , Torsten Ekedahl

A set-system $S\subseteq \{0,1\}^n$ is cube-ideal if its convex hull can be described by capacity and generalized set covering inequalities. In this paper, we use combinatorics, convex geometry, and polyhedral theory to give exponential…

Combinatorics · Mathematics 2026-04-21 Ahmad Abdi , Gérard Cornuéjols , Daniel Dadush , Mahsa Dalirrooyfard

An $S_k$-set in a group $\Gamma$ is a set $A\subseteq\Gamma$ such that $\alpha_1\cdots\alpha_k=\beta_1\cdots\beta_k$ with $\alpha_i,\beta_i\in A$ implies $(\alpha_1,\ldots,\alpha_k)=(\beta_1,\ldots,\beta_k)$. An $S_k'$-set is a set such…

Combinatorics · Mathematics 2025-09-10 John Byrne , Michael Tait