中文
相关论文

相关论文: Paperfolding and Catalan numbers

200 篇论文

We count permutations avoiding a nonconsecutive instance of a two- or three-letter pattern, that is, the pattern may occur but only as consecutive entries in the permutation. Two-letter patterns give rise to the Fibonacci numbers. The…

组合数学 · 数学 2007-05-23 David Callan

Some years ago, Borcherds described in [Bo1] two methods for constructing modular forms on modular varieties related to the orthogonal group ${\O}(2,n)$. They are the so called Borcherds' additive and multiplicative lifting. The…

代数几何 · 数学 2007-05-23 E. Freitag , R. Salvati Manni

We review the stamp folding problem, the number of ways to fold a strip of $n$ stamps, and the related problem of enumerating meander configurations. The study of equivalence classes of foldings and meanders under symmetries allows to…

组合数学 · 数学 2013-02-11 Stéphane Legendre

We present a parametric family of Riordan arrays which are obtained by multiplying any Riordan array with a generalized Pascal array. In particular, we focus on some interesting properties of one-parameter Catalan triangles. We obtain…

组合数学 · 数学 2015-05-22 José Agapito , Ângela Mestre , Pasquale Petrullo , Maria M. Torres

Motivated by Andrews' partitions with initial repetitions, we derive parity formulas for several functions for this class of partitions. In many cases, we present an infinite family of Ramanujan-like congruences modulo 2.

数论 · 数学 2023-06-13 Darlison Nyirenda , Beaullah Mugwangwavari

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

Using factorization properties, we give several characterizations for an algebraic number ring to have class number 2.

交换代数 · 数学 2019-03-13 Scott T. Chapman

Description of cocommutative Hopf algebras associated with families of trees. Applications include Cayley's theorem on the number of rooted trees with n nodes, and Catalan's theorem on the number of rooted ordered trees with n nodes.

环与代数 · 数学 2007-11-27 R. L. Grossman , R. G. Larson

We investigate some arithmetic properties of the q-Fibonacci numbers and the q-Pell numbers.

组合数学 · 数学 2007-05-23 Hao Pan

Applying Zeilberger's algorithm of creative telescoping to a family of certain very-well-poised hypergeometric series involving linear forms in Catalan's constant with rational coefficients, we obtain a second-order difference equation for…

数论 · 数学 2025-10-20 Wadim Zudilin

We extend Carleson's formula to radially polynomially weighted Dirichlet spaces.

复变函数 · 数学 2023-01-25 Brahim Bouya , Andreas Hartmann

In the paper, the authors analytically generalize the Catalan numbers in combinatorial number theory, establish an integral representation of the analytic generalization of the Catalan numbers by virtue of Cauchy's integral formula in the…

组合数学 · 数学 2023-04-18 Wen-Hui Li , Jian Cao , Da-Wei Niu , Jiao-Lian Zhao , Feng Qi

We investigate a class of combinatorial sums involving reciprocals of central binomial coefficients , employing generating functions as the primary solution technique to formulate and analyze series involving the Catalan's constant. Using a…

综合数学 · 数学 2024-11-20 Olofin Akerele , Quadri Adeshina

We mainly show a supercongruence for a truncated series with cubes of Catalan numbers which extends a result by Zhi-Wei Sun.

数论 · 数学 2018-08-02 Roberto Tauraso

To flatten a set partition (with apologies to Mathematica) means to form a permutation by erasing the dividers between its blocks. Of course, the result depends on how the blocks are listed. For the usual listing--increasing entries in each…

组合数学 · 数学 2008-02-18 David Callan

In this paper, we reveal an internal structure within Dedekind numbers, demonstrating that they can be expressed as polynomials of powers of 2. This discovery is based on innovative concepts and methods, offering a new perspective on the…

组合数学 · 数学 2024-03-12 YongQing Liu

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…

数据结构与算法 · 计算机科学 2026-01-21 Mahesh Ramani

We study polynomial summation over unit circles over finite fields of odd characteristic, obtaining a purely algebraic integration theory without recourse to infinite procedures. There are nonetheless strong parallels to classical…

组合数学 · 数学 2022-08-04 Kevin Limanta , Norman J. Wildberger

We present two results, the first on the distribution of the roots of a polynomial over the ring of integers modulo $n$ and the second on the distribution of the roots of the Sylvester resultant of two multivariate polynomials. The second…

组合数学 · 数学 2016-09-29 Michael Monagan , Baris Tuncer

In this paper, we study some combinations of the degenerate and incomplete Stirling numbers of the second kind. We use a combinatorial approach and provide some asymptotic results.

组合数学 · 数学 2026-04-21 Beáta Bényi , Sithembele Nkonkobe