中文
相关论文

相关论文: A combinatorial interpretation of the eigensequenc…

200 篇论文

The Catalan numbers $C_n$ are an extremely well-studied sequence of numbers that appear as the answer to many combinatorial problems. Two generalizations of these numbers that have been studied are the Fuss-Catalan numbers and the…

组合数学 · 数学 2022-02-03 Parth Chavan , Andrew Lee , Karthik Seetharaman

The Catalan numbers are well-known to be the answer to many different counting problems, and so there are many different families of sets whose cardinalities are the Catalan numbers. We show how such a family can be given the structure of a…

范畴论 · 数学 2019-07-08 Mitchell Buckley , Richard Garner , Stephen Lack , Ross Street

Extending earlier work of R. Donaghey and P. J. Cameron, we investigate some canonical "eigen-sequences" associated with transformations of integer sequences. Several known sequences appear in a new setting: for instance the sequences (such…

组合数学 · 数学 2007-07-16 Mira Bernstein , N. J. A. Sloane

Descending plane partitions, alternating sign matrices, and totally symmetric self-complementary plane partitions are equinumerous combinatorial sets for which no explicit bijection is known. In this paper, we isolate a subset of descending…

组合数学 · 数学 2017-04-20 Colton Keller , Jessica Striker

We give a combinatorial interpretation using lattice paths for the super Catalan number $S(m, m+s)$ for $s \leq 3$ and a separate interpretation for $s = 4$.

组合数学 · 数学 2012-08-22 Xin Chen , Jane Wang

The Catalan numbers (C_n)_{n >= 0} = 1,1,2,5,14,42,... form one of the most venerable sequences in combinatorics. They have many combinatorial interpretations, from counting bracketings of products in non-associative algebra to counting…

组合数学 · 数学 2021-02-11 Paul E. Gunnells

We provide a context around a conjectured closed form for the Hankel transform of linear combinations of consecutive pairs of Catalan numbers. This generalizes the formula for the Hankel transforms of the shifted Catalan numbers and the…

组合数学 · 数学 2020-11-24 Paul Barry

The lonely singles sequence represents the number of noncrossing partitions of the finite set {1,. .. , n} in which no pair of singletons {i} and {j} can be merged into the pair {i, j} so that the partition stays noncrossing. The…

组合数学 · 数学 2024-02-13 Julien Rouyer , Alain Ninet

The super Catalan numbers $T(m,n)=(2m)!(2n)!/2m!n!(m+n)!$ are integers which generalize the Catalan numbers. With the exception of a few values of $m$, no combinatorial interpretation in known for $T(m,n)$. We give a weighted interpretation…

组合数学 · 数学 2014-08-27 Emily Allen , Irina Gheorghiciuc

Inspired by OEIS sequence A377912, which consists of the nonnegative integers in which every even digit (except possibly the last) is immediately followed by a strictly larger digit, we define even-up and odd-up words over an alphabet of…

组合数学 · 数学 2025-05-21 Sela Fried

In this paper, we introduce the concept of the over-Mahonian number, which counts the overlined permutations of length $n$ with $k$ inversions, allowing the first elements associated with the inversions to be independently overlined or not.…

组合数学 · 数学 2024-12-03 Ali Kessouri , Moussa Ahmia , Salim Mesbahi

Ascent sequences have received a lot of attention in recent years in connection with (2 + 2)-free posets and other combinatorial objects. Here, we first show bijectively that analogous repetition sequences are counted by the Bell numbers,…

组合数学 · 数学 2019-11-07 David Callan

Let $W^c(A_n)$ be the set of fully commutative elements in the $A_n$-type Coxeter group. Using only the settings of their canonical form, we recount $W^c(A_n)$ by the recurrence that is taken as a definition of the Catalan number $C_{n+1}$…

组合数学 · 数学 2024-01-18 Sadek Al Harbat

The Collatz map is defined for a positive even integer as half that integer, and for a positive odd integer as that integer threefold, plus one. The Collatz conjecture states that when the map is iterated the number one is eventually…

组合数学 · 数学 2015-01-19 Michael Albert , Bjarki Gudmundsson , Henning Ulfarsson

In this paper, we consider two sets of pattern-avoiding ascent sequences: those avoiding both 201 and 210 and those avoiding 0021. In each case we show that the number of such ascent sequences is given by the binomial convolution of the…

组合数学 · 数学 2014-10-29 Lara K. Pudwell

In this expository note, we introduce the reader to compositions of a natural number, e.g., $2+1+2+1+7+1$ is a composition of 14, and $1+2$ and $2+1$ are two different compositions of 3. We discuss some simple restricted forms of…

综合数学 · 数学 2020-07-14 Douglas E. Iannucci

Babson and Steingr\'{\i}msson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. Claesson presented a complete solution for the number of…

组合数学 · 数学 2007-05-23 Anders Claesson , Toufik Mansour

An involution of a real commutative algebra $A$ is a real-linear homomorphism $f : A \rightarrow A$ such that $f^2 = \mathrm{Id}$. We show that there are six involutions of the algebra of bicomplex numbers, contrary to the actual number of…

环与代数 · 数学 2022-08-04 Pierre-Olivier Parisé

This short paper is concerned with the enumeration of permutations avoiding the following four patterns: $2431$, $4231$, $1432$ and $4132$. Using a bijective construction, we prove that these permutations are counted by the central binomial…

组合数学 · 数学 2015-06-01 Marie-Louise Bruner

For any permutation w, we characterize the reduced words of w that are their own commutation class. When w is the long element n(n-1)...321 and n \ge 4, there are exactly four such words.

组合数学 · 数学 2023-05-19 Bridget Eileen Tenner