English
Related papers

Related papers: The Absolute Orders on the Coxeter Groups $A_n$ an…

200 papers

We construct a simple combinatorially-defined representation of $\mathfrak{sl}_2$ which respects the order structure of the weak order on the symmetric group. This is used to resolve a conjecture of Stanley that the weak order has the…

Combinatorics · Mathematics 2020-01-06 Christian Gaetz , Yibo Gao

It is shown that there exists a compact planar set K such that the uniform algebra R(K) is nontrivial and strongly regular. This settles an issue raised by Donald Wilken 55 years ago. It is shown that the set K can be chosen such that, in…

Complex Variables · Mathematics 2025-01-03 Alexander J. Izzo

We enumerate factorizations of a Coxeter element in a well generated complex reflection group into arbitrary factors, keeping track of the fixed space dimension of each factor. In the infinite families of generalized permutations, our…

Combinatorics · Mathematics 2024-02-07 Joel Brewster Lewis , Alejandro H. Morales

The absolute sets of local systems on a smooth complex algebraic variety are the subject of a conjecture of N. Budur and B. Wang based on an analogy with special subvarieties of Shimura varieties. An absolute set should be the…

Algebraic Geometry · Mathematics 2022-02-18 Nero Budur , Leonardo A. Lerer , Haopeng Wang

Partially ordered sets of type (k, n) are the sets such that a) cardinality of each set is n, b) dimension of each set is two, c) length of the maximal antichain in each set is k. Let \alpha_k(n) be the number of partially ordered sets of…

Combinatorics · Mathematics 2013-09-27 Mikhail Kharitonov

In the 1950s, H. S. M. Coxeter considered the quotients of braid groups given by adding the relation that all half Dehn twist generators have some fixed, finite order. He found a remarkable formula for the order of these groups in terms of…

Geometric Topology · Mathematics 2025-09-23 Ethan Dlugie , Tahsin Saffat

Let $W$ be an irreducible Coxeter group. We define the Coxeter pop-stack-sorting operator $\mathsf{Pop}:W\to W$ to be the map that fixes the identity element and sends each nonidentity element $w$ to the meet of the elements covered by $w$…

Combinatorics · Mathematics 2022-09-07 Colin Defant

Given a pure, full-dimensional, locally strongly connected polyhedral complex C with convex support, we characterize, by a local codimension-2 condition, polyhedral complexes that coarsen C. The proof of the characterization draws upon a…

Combinatorics · Mathematics 2026-05-15 Nathan Reading

We show that picture groups are directly related to maximal green sequences for valued Dynkin quivers of finite type. Namely, there is a bijection between maximal green sequences and positive expressions (words in the generators without…

Representation Theory · Mathematics 2025-06-25 Kiyoshi Igusa , Gordana Todorov

This paper consists of two prongs. Firstly, we prove that any Specht module labelled by a 2-separated partition is semisimple and we completely determine its decomposition as a direct sum of graded simple modules. Secondly, we apply these…

Representation Theory · Mathematics 2019-04-09 C. Bessenrodt , C. Bowman , L. Sutton

S.Janson [Poset limits and exchangeable random posets, Combinatorica 31 (2011), 529--563] defined limits of finite posets in parallel to the emerging theory of limits of dense graphs. We prove that each poset limit can be represented as a…

Combinatorics · Mathematics 2013-11-05 Jan Hladky , Andras Mathe , Viresh Patel , Oleg Pikhurko

Recently, Schneider and Schneider defined a new class of partitions called sequentially congruent partitions, in which each part is congruent to the next part modulo its index, and they proved two partition bijections involving these…

Combinatorics · Mathematics 2022-08-10 Ezekiel Cochran , Madeline Locus Dawsey , Emma Harrell , Samuel Saunders

Motivated by spin modular representations of the symmetric groups, we propose two generalizations of the Schur regular partitions for an odd integer $p\geq 3$. One forms a subset of the set of $p$-strict partitions, and the other forms that…

Quantum Algebra · Mathematics 2024-02-13 Shunsuke Tsuchioka , Masaki Watanabe

We present two stable mergesort variants, "peeksort" and "powersort", that exploit existing runs and find nearly-optimal merging orders with practically negligible overhead. Previous methods either require substantial effort for determining…

Data Structures and Algorithms · Computer Science 2019-05-07 J. Ian Munro , Sebastian Wild

Based on previous work of Paul Ressel and myself, I show that the space of all "continuous" exchangeable probability measures on a certain set of order processes is a Bauer simplex.

Probability · Mathematics 2007-05-23 Ulrich Hirth

We find the (unique) largest subset of $\{0, 1, 2\}^n$ such that it contains no two elements, one of which is coordinatewise greater than the other, but strictly greater on at most $k$ coordinates. To do so, we decompose the cube into…

Combinatorics · Mathematics 2025-10-01 Yaël Dillies , Matthew Johnson , Aleksandra Kowalska

We say that a cyclotomic polynomial Phi_{n}(x) has order three if n is the product of three distinct primes, p<q<r. Let A(n) be the largest absolute value of a coefficient of Phi_{n}(x) and M(p) be the maximum of A(pqr). In 1968, Sister…

Number Theory · Mathematics 2009-10-13 Jia Zhao , Xianke Zhang

A Coxeter system is an ordered pair (W,S) where S is the generating set in a particular type of presentation for the Coxeter group W. A subgroup of W is called special if it is generated by a subset of S. Amalgamated product decompositions…

Group Theory · Mathematics 2007-05-23 Michael L. Mihalik , Steven Tschantz

In this chapter, we give an overview of Billey-Postnikov (BP) decompositions which have become an important tool for understanding the geometry and combinatorics of Schubert varieties. BP decompositions are factorizations of Coxeter group…

Combinatorics · Mathematics 2024-09-06 Suho Oh , Edward Richmond

When a linear order has an order preserving surjection onto each of its suborders we say that it is strongly surjective. We prove that the set of countable strongly surjective linear orders is complete for the class of sets which are the…

Logic · Mathematics 2020-06-30 Riccardo Camerlo , Raphaël Carroy , Alberto Marcone