English
Related papers

Related papers: M\"obius numbers of some modified generalized nonc…

200 papers

In this paper, we give an algebra-combinatorics formula of the M\"obius transform for an abstract simplicial complex $K$ on $[m]=\{1, ..., m\}$ in terms of the Betti numbers of the Stanley-Reisner face ring of $K$. Furthermore, we employ a…

Combinatorics · Mathematics 2012-08-16 Xiangyu Cao , Zhi Lü

For coprime positive integers $a<b$, Armstrong, Rhoades, and Williams (2013) defined a set $NC(a,b)$ of rational noncrossing partitions, a subset of the ordinary noncrossing partitions of $\{1, \ldots, b-1\}$. Bodnar and Rhoades (2015)…

Combinatorics · Mathematics 2017-10-17 Michelle Bodnar

The unbounded bicommutant $(\mathfrak M_{E'})''$ of the {\em reduction} of an O*-algebra $\MM$ via a given projection $E'$ weakly commuting with $\mathfrak M$ is studied, with the aim of finding conditions under which the reduction of a…

Mathematical Physics · Physics 2009-04-07 F. Bagarello , A. Inoue , C. Trapani

The McKay Conjecture (MC) asserts the existence of a bijection between the (inequivalent) complex irreducible representations of degree coprime to $p$ ($p$ a prime) of a finite group $G$ and those of the subgroup $N$, the normalizer of…

Representation Theory · Mathematics 2008-07-23 Geoffrey Mason

Let P be a poset and let P* be the set of all finite length words over P. Generalized subword order is the partial order on P* obtained by letting u \leq w if and only if there is a subword u' of w having the same length as u such that each…

Combinatorics · Mathematics 2012-02-14 Peter R. W. McNamara , Bruce E. Sagan

Under $\mathfrak{p} = \mathfrak{c}$, we answer Question 24 of \cite{dikranjan&shakhmatov3} for cardinality ${\mathfrak c}$ , by showing that if a non-torsion Abelian group of size continuum admits a countably compact Hausdorff group…

In this fith part, (with the notations of the preceding parts) we make the following hypothesis: $(W,S)$ is a Coxeter system, irreducible, $2$-spherical and $S$ is of cardinality $3$. Let $R:W\to GL(M)$ be a reducible reflection…

Group Theory · Mathematics 2020-03-03 François Zara

In this paper, we bring the terminology of the Kunz coordinates of numerical semigroups to gapsets and we generalize this concept to $m$-extensions. It allows us to identify gapsets and, in general, $m$-extensions with tilings of boards. As…

Combinatorics · Mathematics 2022-08-17 Gilberto B. Almeida Filho , Matheus Bernardini

Stirling numbers, which count partitions of a set and permutations in the symmetric group, have found extensive application in combinatorics, geometry, and algebra. We study analogues and q-analogues of these numbers corresponding to the…

Combinatorics · Mathematics 2022-05-30 Bruce E. Sagan , Joshua P. Swanson

The deletion order of a finitely generated Coxeter group W is a total order on the elements which, as is proved, is a refinement of the Bruhat order. This order is applied in [8] to construct Elnitsky tilings for any finite Coxeter group.…

Group Theory · Mathematics 2025-02-25 Robert Nicolaides , Peter Rowley

In this paper we prove a duality between $k$-noncrossing partitions over $[n]=\{1,...,n\}$ and $k$-noncrossing braids over $[n-1]$. This duality is derived directly via (generalized) vacillating tableaux which are in correspondence to…

Combinatorics · Mathematics 2007-11-15 Emma Y. Jin , Jing Qin , Christian M. Reidys

We give short elementary expositions of combinatorial proofs of some variants of Euler's partitition problem that were first addressed analytically by George Andrews, and later combinatorially by others. Our methods, based on ideas from a…

Combinatorics · Mathematics 2021-07-19 Aritro Pathak

The purpose of this paper is to discuss the validity of the assumptions (W) and (S) stated in a previous work, about the torsion in the modular l-adic cohomology of Deligne-Lusztig varieties associated to Coxeter elements. We prove that…

Representation Theory · Mathematics 2013-03-21 Olivier Dudas

Given $d, N \in \mathbb{N}$, we define $\mathfrak{C}_d(N)$ to be the number of pairs of $d\times d$ matrices $A,B$ with entries in $[-N,N] \cap \mathbb{Z}$ such that $AB = BA$. We prove that $$ N^{10} \ll \mathfrak{C}_3(N) \ll N^{10},$$…

Number Theory · Mathematics 2025-04-23 Jonathan Chapman , Akshat Mudgal

The topological group version of the celebrated Banach-Mazur problem asks wether every infinite topological group has a non-trivial separable quotient group. It is known that compact groups have infinite separable metrizable quotient…

Group Theory · Mathematics 2023-07-24 Dekui Peng

We define for families of finite metric spaces quantitative assembly map estimates that take into account propagation phenomena for pseudo-differential calculus. We relate these estimates to the Novikov conjecture and we show that they fit…

K-Theory and Homology · Mathematics 2024-12-03 Hervé Oyono-Oyono , Guoliang Yu

We introduce and study the lattice of generalized partitions, called weighted partitions. This lattice possesses similar properties of the lattice of partitions. By use of the pictorial representation of a weighted partition, the total…

Combinatorics · Mathematics 2023-01-02 Keiichi Shigechi

The Cambrian lattices, introduced in (Reading, 2006), generalize the Tamari lattice to any choice of Coxeter element in any finite Coxeter group. They are further generalized to the m-Cambrian lattices (Stump, Thomas, Williams, 2015).…

Combinatorics · Mathematics 2025-04-21 Clément Chenevière , Wenjie Fang , Corentin Henriet

For a finite real reflection group $W$ with Coxeter element $\gamma$ we give a uniform proof that the closed interval, $[I, \gamma]$ forms a lattice in the partial order on $W$ induced by reflection length. The proof involves the…

Combinatorics · Mathematics 2007-05-23 Thomas Brady , Colum Watt

M\"obius inversion, originally a tool in number theory, was generalized to posets for use in group theory and combinatorics. It was later generalized to categories in two different ways, both of which are useful. We provide a unifying…

Category Theory · Mathematics 2013-03-12 Tom Leinster