中文
相关论文

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

200 篇论文

We consider $m$-divisible non-crossing partitions of $\{1,2,\ldots,mn\}$ with the property that for some $t\leq n$ no block contains more than one of the first $t$ integers. We give a closed formula for the number of multi-chains of such…

组合数学 · 数学 2023-02-07 Christian Krattenthaler , Henri Mühle

We revisit the twisted multiplicativity property of Voiculescu's S-transform in the operator-valued setting, using a specific bijection between planar binary trees and noncrossing partitions.

组合数学 · 数学 2025-03-27 Kurusch Ebrahimi-Fard , Timothe Ringeard

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

The correspondence between the braid group on a solid torus of arbitrary genus and the algebra of Yang-Baxter and reflection equation operators is shown. A representation of this braid group in terms of $R$-matrices is given. The…

高能物理 - 理论 · 物理学 2008-02-03 C. Schwiebert

It is well known that the number of distinct non-crossing matchings of $n$ half-circles in the half-plane with endpoints on the x-axis equals the $n^{th}$ Catalan number $C_n$. This paper generalizes that notion of linear non-crossing…

组合数学 · 数学 2016-06-16 Paul Drube , Puttipong Pongtanapaisan

In this paper, we consider the set of partitions $pend(n)$ which enumerates the number of partitions of $n$ wherein the even parts are not allowed to be distinct. Using a result of Newman, we prove a few infinite families of congruences…

数论 · 数学 2024-07-16 Hemjyoti Nath

For any $n\geq 3$, we prove that there exist equivalences between these apparently unrelated objects: irreducible $n$-dimensional non degenerate projective varieties $X\subset \mathbb P^{2n+1}$ different from rational normal scrolls and…

代数几何 · 数学 2011-10-07 Luc Pirio , Francesco Russo

Let $R$ and $B$ be a set of red points and a set of blue points in the plane, respectively, such that $R\cup B$ is in general position, and let $f:R \to \{2,3,4, \ldots \}$ be a function. We show that if $2\le |B|\le \sum_{x\in R}(f(x)-2) +…

离散数学 · 计算机科学 2018-12-10 Mikio Kano , Kenta Noguchi , David Orden

For multiqubit density operators in a suitable tensorial basis, we show that a number of nonunitary operations used in the detection and synthesis of entanglement are classifiable as reflection symmetries, i.e., orientation changing…

量子物理 · 物理学 2018-08-30 Claudio Altafini , Timothy F. Havel

An indecomposable decomposition of a torsion-free abelian group $G$ of rank $n$ is a decomposition $G=A_1\oplus\cdots\oplus A_t$ where $A_i$ is indecomposable of rank $r_i$ so that $\sum_i r_i=n$ is a partition of $n$. The group $G$ may…

群论 · 数学 2018-02-28 Adolf Mader , Phill Schultz

A genus one labeled circle tree is a tree with its vertices on a circle, such that together they can be embedded in a surface of genus one, but not of genus zero. We define an e-reduction process whereby a special type of subtree, called an…

组合数学 · 数学 2007-05-23 Karola Meszaros

Recall that an excedance of a permutation $\pi$ is any position $i$ such that $\pi_i > i$. Inspired by the work of Hopkins, McConville and Propp (Elec. J. Comb., 2017) on sorting using toppling, we say that a permutation is toppleable if it…

组合数学 · 数学 2021-01-05 Arvind Ayyer , Daniel Hathcock , Prasad Tetali

Inspired by the recent work by Nadji, Ahmia and Ram\'irez, we examined the arithmetic properties of $\bar{B}_{l_1,l_2} (n)$, the number of overpartitions of n whose parts are neither divisible by $l_1$ nor divisible by $l_2$. In particular,…

数论 · 数学 2025-07-04 Anakha V

Rectangulations are partitions of a square into axis-aligned rectangles. A number of results provide bijections between combinatorial equivalence classes of rectangulations and families of pattern-avoiding permutations. Other results deal…

组合数学 · 数学 2023-06-22 Jean Cardinal , Vera Sacristán , Rodrigo I. Silveira

The collection of reflecting hyperplanes of a finite Coxeter group is called a reflection arrangement and it appears in many subareas of combinatorics and representation theory. We focus on the problem of counting regions of reflection…

组合数学 · 数学 2023-09-01 Priyavrat Deshpande , Krishna Menon

This paper addresses the problem of finding $Q_{m,t}\left(n\right)$, the number of possible ways to partition any member $n$ of the cyclic group $\mathbb{Z}/m\mathbb{Z}$ into $t$ distinct parts. When $m$ is odd, it was previously known that…

组合数学 · 数学 2019-06-04 Steven S Poon

Raimi's theorem guarantees the existence of a partition of $\mathbb{N}$ into two parts with an unavoidable intersection property: for any finite coloring of $\mathbb{N}$, some color class intersects both parts infinitely many times, after…

组合数学 · 数学 2026-01-01 Norbert Hegyvari , Janos Pach , Thang Pham

We prove the conjecture by M. Yip stating that counting genus one partitions by the number of their elements and parts yields, up to a shift of indices, the same array of numbers as counting genus one rooted hypermonopoles. Our proof…

组合数学 · 数学 2013-06-24 Robert Cori , Gábor Hetyei

In this note, we give a new proof of a result of Matthew Dyer stating that in an arbitrary Coxeter group $W$, every pair $t,t'$ of distinct reflections lie in a unique maximal dihedral reflection subgroup of $W$. Our proof only relies on…

群论 · 数学 2023-08-01 Thomas Gobet

The exact degree bound for the generators of rings of polynomial invariants is determined for the finite, non-cyclic groups having a cyclic subgroup of index two. It is proved that the Noether number of these groups equals one half the…

表示论 · 数学 2012-05-15 K. Cziszter , M. Domokos