On sortable intervals of monomials
نویسندگان
چکیده
In 1996, in his study of Gröbner bases of toric ideals, Sturmfels introduced a sorting operator on pairs of monomials of degree d in n variables. This gave rise to the notion of sortable sets, namely sets B of monomials of degree d such that B×B is preserved by that operator. In this paper, we determine all lex-intervals or revlex-intervals of monomials which are sortable. The solution involves the notion of greatest common prefix.
منابع مشابه
Methods of computing deque sortable permutations given complete and incomplete information
The problem of determining which permutations can be sorted using certain switchyard networks is a venerable problem in computer science dating back to Knuth in 1968. In this work, we are interested in permutations which are sortable on a double-ended queue (called a deque), or on two parallel stacks. In 1982, Rosenstiehl and Tarjan presented an O (n) algorithm for testing whether a given permu...
متن کاملClusters, Coxeter-sortable Elements and Noncrossing Partitions
We introduce Coxeter-sortable elements of a Coxeter group W. For finite W, we give bijective proofs that Coxeter-sortable elements are equinumerous with clusters and with noncrossing partitions. We characterize Coxeter-sortable elements in terms of their inversion sets and, in the classical cases, in terms of permutations.
متن کاملSortable Elements for Quivers with Cycles
Each Coxeter element c of a Coxeter group W defines a subset of W called the c-sortable elements. The choice of a Coxeter element of W is equivalent to the choice of an acyclic orientation of the Coxeter diagram of W . In this paper, we define a more general notion of Ω-sortable elements, where Ω is an arbitrary orientation of the diagram, and show that the key properties of c-sortable elements...
متن کاملSorting Permutations on Two Parallel Stacks
We give a new combinatorial proof, based on stack graphs, for the characterization by forbidden subsequences of the permutations which are sortable on two parallel stacks. Some remarks about the permutations sortable on parallel queues are also made.
متن کاملSortable Elements in Infinite Coxeter Groups
In a series of previous papers, we studied sortable elements in finite Coxeter groups, and the related Cambrian fans. We applied sortable elements and Cambrian fans to the study of cluster algebras of finite type and the noncrossing partitions associated to Artin groups of finite type. In this paper, as the first step towards expanding these applications beyond finite type, we study sortable el...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016