English
Related papers

Related papers: Modular Catalan Numbers

200 papers

This paper presents a two-phase algorithm for computing exact Catalan numbers at an unprecedented scale. The method is demonstrated by computing $C(n)$ for $n = 2,050,572,903$ yielding a result with a targeted $1,234,567,890$ decimal…

Data Structures and Algorithms · Computer Science 2026-01-21 Mahesh Ramani

We study and classify faithfully balanced modules for the algebra of lower triangular $n$ by $n$ matrices. The theory extends known results about tilting modules, which are classified by binary trees, and counted with the Catalan numbers.…

Representation Theory · Mathematics 2019-09-09 William Crawley-Boevey , Biao Ma , Baptiste Rognerud , Julia Sauter

Let $C_n$ be the $n$th Catalan number. For any prime $p \geq 5$ we show that the set $\{C_n : n \in \mathbb{N} \}$ contains all residues mod $p$. In addition all residues are attained infinitely often. Any positive integer can be expressed…

Number Theory · Mathematics 2017-03-09 Rob Burns

In this work, we consider a class of substitutions on infinite alphabets and show that they exhibit a growth behaviour which is impossible for substitutions on finite alphabets. While for both settings the leading term of the tile counting…

Combinatorics · Mathematics 2023-03-14 Dirk Frettlöh , Alexey Garber , Neil Mañibo

Let $p$ be a prime and let $a$ be a positive integer. In this paper we investigate $\sum_{k=0}^{p^a-1}\binom[(h+1)k,k+d]/m^k$ modulo a prime $p$, where $d$ and $m$ are integers with $-h<d<=p^a$ and $m\not=0 (mod p)$. We also study…

Number Theory · Mathematics 2009-09-28 Zhi-Wei Sun

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…

Combinatorics · Mathematics 2017-04-20 Colton Keller , Jessica Striker

We reprove a few results concerning paperfolding sequences using properties of Catalan numbers modulo 2.

Combinatorics · Mathematics 2007-05-23 Roland Bacher

The paper describes a prime factorization of the Catalan numbers. Odd prime factors are distributed in layers in accordance with Legendre's formula. The content of each layer is a network of the intervals, Chebyshev's Segments. The primes…

Number Theory · Mathematics 2019-08-13 Gennady Eremin

We study monomial ideals, always locally given by a monomial, like a reasonable first step to estimate in general the number of monoidal transformations of Villamayor's algorithm of resolution of singularities. The resolution of a monomial…

Algebraic Geometry · Mathematics 2009-01-22 Rocio Blanco

The purpose of this paper is twofold. First we answer to a question asked by Steingrimsson and Williams about certain permutation tableaux: we construct a bijection between binary trees and the so-called Catalan tableaux. These tableaux are…

Combinatorics · Mathematics 2009-05-20 Xavier Gérard Viennot

This note provide bijective proofs of two combinatorial identities involving generalized Catalan number $C_{m,5}(n)={m\over 5n+m}{5n+m\choose n}$ recently proposed by Sun.

Combinatorics · Mathematics 2008-05-27 Sherry H. F. Yan

A 3-dimensional Catalan word is a word on three letters so that the subword on any two letters is a Dyck path. For a given Dyck path $D$, a recently defined statistic counts the number of Catalan words with the property that any subword on…

Combinatorics · Mathematics 2022-05-20 Kassie Archer , Christina Gravies

In this (mostly expository) paper I want to share some observations prompted by a class of matrices whose determinants are Catalan numbers. Considering different methods of proof we obtain some generalizations and q-analogues and…

Combinatorics · Mathematics 2019-05-03 Johann Cigler

Given an integer $k$, define $C_k$ as the set of integers $n > \max(k,0)$ such that $a^{n-k+1} \equiv a \pmod{n}$ holds for all integers $a$. We establish various multiplicative properties of the elements in $C_k$ and give a sufficient…

Number Theory · Mathematics 2021-03-09 Yongyi Chen , Tae Kyu Kim

We consider compositions of natural numbers when there are different types of each natural number. Several recursions as well as some closed formulas for the number of compositions is derived. We also find its relationships with some known…

Combinatorics · Mathematics 2010-12-17 Milan Janjic

We study a certain family of infinite series with reciprocal Catalan numbers. We first evaluate two special candidates of the family in closed form, where we also present some Catalan-Fibonacci relations. Then we focus on the general…

Combinatorics · Mathematics 2022-01-07 Kunle Adegoke , Robert Frontczak , Taras Goy

The $q,t$-Catalan number $\mathrm{Cat}_n(q,t)$ enumerates integer partitions contained in an $n\times n$ triangle by their dinv and external area statistics. The paper [LLL18 (Lee, Li, Loehr, SIAM J. Discrete Math. 32(2018))] proposed a new…

Combinatorics · Mathematics 2020-03-10 Seongjune Han , Kyungyong Lee , Li Li , Nicholas A. Loehr

We study the combinatorics of ad-nilpotent ideals of a Borel subalgebra of $sl(n+1,\Bbb C)$. We provide an inductive method for calculating the class of nilpotence of these ideals and formulas for the number of ideals having a given class…

Rings and Algebras · Mathematics 2007-05-23 George E. Andrews , Christian Krattenthaler , Luigi Orsina , Paolo Papi

We discuss example of an elementary cellular automaton for which the density of ones decays toward its limiting value as a power of the number of iterations $n$. Using the fact that this rule conserves the number of blocks 10 and that…

Cellular Automata and Lattice Gases · Physics 2007-11-09 Henryk Fuks , Jeff Haroutunian

We investigate compositions of a positive integer with a fixed number of parts, when there are several types of each natural number. These compositions produce new relationships among binomial coefficients, Catalan numbers, and numbers of…

Combinatorics · Mathematics 2010-12-20 Milan Janjic
‹ Prev 1 3 4 5 6 7 10 Next ›