English
Related papers

Related papers: On the H-triangle of generalised nonnesting partit…

200 papers

The set of dominant regions of the $k$-Catalan arrangement of a crystallographic root system $\Phi$ is a well-studied object enumerated by the Fu{\ss}-Catalan number $Cat^{(k)}(\Phi)$. It is natural to refine this enumeration by considering…

Combinatorics · Mathematics 2014-11-06 Marko Thiel

A case-free proof is given that the entries of the $h$-vector of the cluster complex $\Delta (\Phi)$, associated by S. Fomin and A. Zelevinsky to a finite root system $\Phi$, count elements of the lattice $\nc$ of noncrossing partitions of…

Combinatorics · Mathematics 2007-05-23 Christos A. Athanasiadis , Thomas Brady , Jon McCammond , Colum Watt

Let $\Phi$ be an finite root system with corresponding reflection group $W$ and let $m$ be a nonnegative integer. We consider the generalized cluster complex $\Delta^m(\Phi)$ defined by S. Fomin and N. Reading and the poset $NC_{(m)}(W)$ of…

Combinatorics · Mathematics 2007-05-23 E. Tzanaki

Let $\Phi$ be an irreducible crystallographic root system with Weyl group $W$ and coroot lattice $\check{Q}$, spanning a Euclidean space $V$. Let $m$ be a positive integer and $\aA^m_\Phi$ be the arrangement of hyperplanes in $V$ of the…

Combinatorics · Mathematics 2007-05-23 C. A. Athanasiadis , E. Tzanaki

Let $\Phi$ be a finite root system of rank $n$ and let $m$ be a nonnegative integer. The generalized cluster complex $\Delta^m (\Phi)$ was introduced by S. Fomin and N. Reading. It was conjectured by these authors that $\Delta^m (\Phi)$ is…

Combinatorics · Mathematics 2007-05-23 Christos A. Athanasiadis , Eleni Tzanaki

The $F$-triangle is a refined face count for the generalised cluster complex of Fomin and Reading. We compute the $F$-triangle explicitly for all irreducible finite root systems. Furthermore, we use these results to partially prove the…

Combinatorics · Mathematics 2007-05-23 Christian Krattenthaler

We prove a conjecture of F. Chapoton relating certain enumerative invariants of (a) the cluster complex associated by S. Fomin and A. Zelevinsky to a finite root system and (b) the lattice of noncrossing partitions associated to the…

Combinatorics · Mathematics 2007-05-23 Christos A. Athanasiadis

The cluster complex $\Delta (\Phi)$ is an abstract simplicial complex, introduced by Fomin and Zelevinsky for a finite root system $\Phi$. The positive part of $\Delta (\Phi)$ naturally defines a simplicial subdivision of the simplex on the…

Combinatorics · Mathematics 2012-04-03 Christos A. Athanasiadis , Christina Savvidou

Let W be a finite crystallographic reflection group. The generalized Catalan number of W coincides both with the number of clusters in the cluster algebra associated to W, and with the number of noncrossing partitions for W. Natural…

Representation Theory · Mathematics 2011-06-15 Aslak Bakke Buan , Idun Reiten , Hugh Thomas

We introduce the notion of fractal index associated with the universal class $h$ of particles or quasiparticles, termed fractons, which obey specific fractal statistics. A connection between fractons and conformal field…

High Energy Physics - Theory · Physics 2009-10-31 Wellington da Cruz , Rosevaldo de Oliveira

We establish several new fractal and number theoretical phenomena connected with expansions which are generated by infinite linear iterated function systems. First of all we show that the systems $\Phi$ of cylinders of generalized L\"uroth…

Metric Geometry · Mathematics 2015-07-22 Sergio Albeverio , Yuri Kondratiev , Roman Nikiforov , Grygoriy Torbin

For any integer $k\geq2$, we prove combinatorially the following Euler (binomial) transformation identity $$ \NC_{n+1}^{(k)}(t)=t\sum_{i=0}^n{n\choose i}\NW_{i}^{(k)}(t), $$ where $\NC_{m}^{(k)}(t)$ (resp.~$\NW_{m}^{(k)}(t)$) is the sum of…

Combinatorics · Mathematics 2019-09-17 Zhicong Lin , Dongsu Kim

The three main objects in noncrossing Catalan combinatorics associated to a finite Coxeter system are noncrossing partitions, clusters, and sortable elements. The first two of these have known Fuss-Catalan generalizations. We provide new…

Combinatorics · Mathematics 2018-10-30 Christian Stump , Hugh Thomas , Nathan Williams

The concept of fractal index is introduced in connection with the idea of universal class $h$ of particles or quasiparticles, termed fractons, which obey fractal statistics. We show the relation between fractons and conformal field…

High Energy Physics - Theory · Physics 2017-08-23 Wellington da Cruz

The generalized cluster complex was introduced by Fomin and Reading, as a natural extension of the Fomin-Zelevinsky cluster complex coming from finite type cluster algebras. In this work, to each face of this complex we associate a…

Combinatorics · Mathematics 2023-09-27 Theo Douvropoulos , Matthieu Josuat-Vergès

We revisit, in an elementary way, the classical statement of various ``Main Conjectures'' for $p$-class groups $\mathcal{H}_K$ and $p$-ramified torsion groups $\mathcal{T}_K$ of abelian fields $K$, in the non semi-simple case $p \mid [K :…

Number Theory · Mathematics 2023-12-21 Georges Gras

In type A, the q,t-Fuss-Catalan numbers can be defined as a bigraded Hilbert series of a module associated to the symmetric group. We generalize this construction to (finite) complex reflection groups and, based on computer experiments, we…

Combinatorics · Mathematics 2009-09-30 Christian Stump

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…

Combinatorics · Mathematics 2023-10-24 Juan B. Gil , Jordan O. Tirrell

This memoir constitutes the author's PhD thesis at Cornell University. It serves both as an expository work and as a description of new research. At the heart of the memoir, we introduce and study a poset $NC^{(k)}(W)$ for each finite…

Combinatorics · Mathematics 2007-10-19 Drew Armstrong

A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings $1^{n_1} 0^{m_1} ... 1^{n_r} 0^{m_r}$, we generalize classical…

Combinatorics · Mathematics 2009-06-17 Todd Kemp , Karl Mahlburg , Amarpreet Rattan , Clifford Smyth
‹ Prev 1 2 3 10 Next ›