中文
相关论文

相关论文: A bijection between dominant Shi regions and core …

200 篇论文

We establish combinatorial interpretations of several identities for the Catalan and Fine numbers and, along the way, we present some new bijections of independent interest. Briefly, we show that C_{n} = 1/(n+1) Sum_{k} (n+1)choose(2k+1)…

组合数学 · 数学 2007-05-23 David Callan

This paper is about two arrangements of hyperplanes. The first --- the Shi arrangement --- was introduced by Jian-Yi Shi to describe the Kazhdan-Lusztig cells in the affine Weyl group of type $A$. The second --- the Ish arrangement --- was…

组合数学 · 数学 2010-09-13 Drew Armstrong , Brendon Rhoades

Given an arbitrary Coxeter system $(W,S)$ and a nonnegative integer $m$, the $m$-Shi arrangement of $(W,S)$ is a subarrangement of the Coxeter hyperplane arrangement of $(W,S)$. The classical Shi arrangement ($m=0$) was introduced in the…

组合数学 · 数学 2024-12-13 Matthew Dyer , Christophe Hohlweg , Susanna Fishel , Alice Mark

For stacked simplicial complexes, (special subclasses of such are: trees, triangulations of polygons, stacked polytopes), we give an explicit bijection between partitions of facets (for trees: edges), and partitions of vertices into…

组合数学 · 数学 2024-01-17 Gunnar Fløystad

We present a bijective algorithm with which an arbitrary permutation decomposes canonically into elementary blocks which we call families, which are sets with a specified number of ascents and descents. We show that families, arranged in an…

组合数学 · 数学 2013-04-05 Adrian Ocneanu

Johnson recently proved Armstrong's conjecture which states that the average size of an $(a,b)$-core partition is $(a+b+1)(a-1)(b-1)/24$. He used various coordinate changes and one-to-one correspondences that are useful for counting…

组合数学 · 数学 2017-11-07 Jineon Baek , Hayan Nam , Myungjun Yu

Let $s,t$ be natural numbers, and fix an $s$-core partition $\sigma$ and a $t$-core partition $\tau$. Put $d=\gcd(s,t)$ and $m= lcm(s,t)$, and write $N_{\sigma, \tau}(k)$ for the number of $m$-core partitions of length no greater than $k$…

组合数学 · 数学 2022-02-01 K. Seethalakshmi , Steven Spallone

The Raney numbers $R_{p,r}(k)$ are a two-parameter generalization of the Catalan numbers. In this paper, we obtain a recurrence relation for the Raney numbers which is a generalization of the recurrence relation for the Catalan numbers.…

组合数学 · 数学 2015-12-29 Robin DaPao Zhou

In this paper we build a bijection between the meet-irreducible elements of the lattice of the compositions of $n$ with parts in $[1,p]$ equipped with the dominance order, and the edges of the $(n,p)$-Tur\'an graph. Using this bijection, we…

组合数学 · 数学 2026-01-29 Nathanaël Hassler

We introduce two partially ordered sets, $P^A_n$ and $P^B_n$, of the same cardinalities as the type-A and type-B noncrossing partition lattices. The ground sets of $P^A_n$ and $P^B_n$ are subsets of the symmetric and the hyperoctahedral…

组合数学 · 数学 2007-05-23 Miklós Bóna , Rodica Simion

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…

组合数学 · 数学 2022-08-10 Ezekiel Cochran , Madeline Locus Dawsey , Emma Harrell , Samuel Saunders

A semiorder is a partially ordered set $P$ with two certain forbidden induced subposets. This paper establishes a bijection between $n$-element semiorders of length $H$ and $(n+1)$-node ordered trees of height $H+1$. This bijection…

组合数学 · 数学 2013-06-28 Yangzhou Hu

In this note, we give a simple extension map from partitions of subsets of [n] to partitions of [n+1], which sends $\delta$-distant k-crossings to $(\delta+1)$-distant k-crossings (and similarly for nestings). This map provides a…

组合数学 · 数学 2023-10-24 Juan B. Gil , Jordan O. Tirrell

We give an interpretation of the coefficients of the two variable refinement $D_{\Sh_n}(q,t)$ of the distance enumerator of the Shi hyperplane arrangement $\Sh_n$ in $n$ dimensions. This two variable refinement was defined by Stanley…

组合数学 · 数学 2007-05-23 Sivaramakrishnan Sivasubramanian

The number of tree-rooted maps, that is, rooted planar maps with a distinguished spanning tree, of size $n$ is C(n)C(n+1) where C(n)=binomial(2n,n)/(n+1) is the nth Catalan number. We present a (long awaited) simple bijection which explains…

组合数学 · 数学 2009-06-18 Olivier Bernardi

We introduce the notion of a Mahonian pair. Consider the set, P^*, of all words having the positive integers as alphabet. Given finite subsets S,T of P^*, we say that (S,T) is a Mahonian pair if the distribution of the major index, maj,…

组合数学 · 数学 2011-11-03 Bruce E. Sagan , Carla D. Savage

We interpret noncrossing partitions of type $B$ and type $D$ in terms of noncrossing partitions of type $A$. As an application, we get type-preserving bijections between noncrossing and nonnesting partitions of type $B$, type $C$ and type…

组合数学 · 数学 2011-08-30 Jang Soo Kim

We consider the restrictions of Shi arrangements to Weyl cones, their relations to antichains in the root poset, and their intersection posets. For any Weyl cone, we provide bijections between regions, flats intersecting the cone, and…

组合数学 · 数学 2025-10-14 Galen Dorpalen-Barry , Christian Stump

We provide new Schmidt-type results through an investigation of two bijections, which are results involving partitions with parts counted only at given indices. Mork's bijection, the first of these, was originally given as a proof of…

组合数学 · 数学 2022-10-17 Hunter Waldron

A bijective proof is given for the following theorem: the number of compositions of n into odd parts equals the number of compositions of n + 1 into parts greater than one. Some commentary about the history of partitions and compositions is…

组合数学 · 数学 2013-12-04 Andrew V. Sills