中文
相关论文

相关论文: Noncrossing partitions under rotation and reflecti…

200 篇论文

In the paper ``Lower bounds on the number of crossing-free subgraphs of $K_N$'' (Computational Geometry 16 (2000), 211-221), it is shown that a double chain of $n$ points in the plane admits at least $\Omega(4.642126305^n)$ polygonizations,…

计算几何 · 计算机科学 2025-09-23 Javier Tejel

This article examines noncrossing partitions of the unit circle in the complex plane; we call these continuous noncrossing partitions. More precisely, we focus on the degree-$d$ continuous noncrossing partitions where unit complex numbers…

群论 · 数学 2025-07-02 Michael Dougherty , Jon McCammond

We prove a conjecture due independently to Yan and Martinez--Savage that asserts inversion sequences with no weakly decreasing subsequence of length $3$ and enhanced $3$-noncrossing partitions have the same cardinality. Our approach applies…

组合数学 · 数学 2019-02-06 Zhicong Lin

We analyse divergent diagrams of \(k\)-fold map-germs on \((\mathbb{C}^n,0)\), for $k, n \geq 2$, associated with reflections, adapting to the complex setting the theory of folds associated with involutions on \((\mathbb{R}^n,0)\). In the…

We study the bounded regions in a generic slice of the hyperplane arrangement in $\mathbb{R}^n$ consisting of the hyperplanes defined by $x_i$ and $x_i+x_j$. The bounded regions are in bijection with several classes of combinatorial…

组合数学 · 数学 2014-01-29 Qingchun Ren

When W is a finite Coxeter group of classical type (A, B, or D), noncrossing partitions associated to W and compatibility of almost positive roots in the associated root system are known to be modeled by certain planar diagrams. We show how…

组合数学 · 数学 2026-05-13 Nathan Reading

We construct a direct natural bijection between descending plane partitions without any special part and permutations. The directness is in the sense that the bijection avoids any reference to nonintersecting lattice paths. The advantage of…

组合数学 · 数学 2020-06-16 Arvind Ayyer

The lattice of noncrossing partitions is well-known for its wide variety of combinatorial appearances and properties. For example, the lattice is rank-symmetric and enumerated by the Catalan numbers. In this article, we introduce a large…

组合数学 · 数学 2024-09-17 Stella Cohen , Michael Dougherty , Andrew D. Harsh , Spencer Park Martin

We study a curious class of partitions, the parts of which obey an exceedingly strict congruence condition we refer to as "sequential congruence": the $m$th part is congruent to the $(m+1)$th part modulo $m$, with the smallest part…

数论 · 数学 2020-06-09 Maxwell Schneider , Robert Schneider

Let $T(n,m)$ be the set of all plane labelled bipartite trees with $n$ white vertices and $m$ black. If the number $n+m$ of vertices is even, then the set $T(n,m)$ is a union of two disjoint subsets --- subset od "even" trees and subset of…

组合数学 · 数学 2016-11-04 Yury Kochetkov

Consideration of a classification of the number of partitions of a natural number according to the members of sub-partitions differing from unity leads to a non-recursive formula for the number of irreducible representations of the…

组合数学 · 数学 2013-07-09 Godofredo Iommi Amunategui

In groups with involution a nonassociative product of elements is defined, which leads to the definition of a certain type of quasigroups. These quasigroups are represented by square tables of complex numbers, with inverses, which differ…

群论 · 数学 2015-09-30 Jerzy Kocinski

We provide an equivariant description/classification of all complete (compact or not) non-negatively curved manifolds M together with a co-compact action by a reflection group W, and moreover, classify such W. In particular, we show that…

微分几何 · 数学 2017-01-03 Fuquan Fang , Karsten Grove

Let $a < b$ be coprime positive integers. Armstrong, Rhoades, and Williams defined a set $\mathsf{NC}(a,b)$ of `rational noncrossing partitions', which form a subset of the ordinary noncrossing partitions of $\{1, 2, \dots, b-1\}$.…

组合数学 · 数学 2015-10-30 Michelle Bodnar , Brendon Rhoades

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 prove a conjecture of Drake and Kim: the number of $2$-distant noncrossing partitions of $\{1,2,...,n\}$ is equal to the sum of weights of Motzkin paths of length $n$, where the weight of a Motzkin path is a product of certain fractions…

组合数学 · 数学 2010-11-03 Ira M. Gessel , Jang Soo Kim

An ordered partition of $[n]=\{1, 2, \ldots, n\}$ is a partition whose blocks are endowed with a linear order. Let $\mathcal{OP}_{n,k}$ be set of ordered partitions of $[n]$ with $k$ blocks and $\mathcal{OP}_{n,k}(\sigma)$ be set of ordered…

组合数学 · 数学 2013-04-12 William Y. C. Chen , Alvin Y. L. Dai , Robin D. P. Zhou

The noncrossing partition poset associated to a Coxeter group $W$ and Coxeter element $c$ is the interval $[1,c]_T$ in the absolute order on $W$. We construct a new model of noncrossing partititions for $W$ of classical affine type, using…

组合数学 · 数学 2026-05-13 Laura G. Brestensky , Nathan Reading

In this note a bijection is constructed between the set of partitions of n simultaneously s-regular and t-distinct, and those simultaneously t-regular and s-distinct. Some implications of the map are discussed. As a generalized version of…

组合数学 · 数学 2022-08-04 William J. Keith

We show that the poset of non-trivial partitions of 1,2,...,n has a fundamental homology class with coefficients in a Lie superalgebra. Homological duality then rapidly yields a range of known results concerning the integral representations…

范畴论 · 数学 2014-10-01 Alan Robinson