English
Related papers

Related papers: Computationally Efficient Bounds for the Sum of Ca…

200 papers

In this article, we provide a comprehensive analysis of the asymptotic behavior of Bell numbers, enhancing and unifying various results previously dispersed in the literature. We establish several explicit lower and upper bounds. The main…

Number Theory · Mathematics 2024-08-27 Jerzy Grunwald , Grzegorz Serafin

We obtain upper bounds on the number of finite sets $\mathcal S$ of primes below a given bound for which various $2$ variable $\mathcal S$-unit equations have a solution.

Number Theory · Mathematics 2020-07-31 I. E. Shparlinski , C. L. Stewart

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…

Combinatorics · Mathematics 2021-02-11 Paul E. Gunnells

We provide new upper bounds for sums of certain arithmetic functions in many variables at polynomial arguments and, exploiting recent progress on the mean-value of the Erd\H os-Hooley $\Delta$-function, we derive lower bounds for the…

Number Theory · Mathematics 2026-01-14 Régis de la Bretèche , Gérald Tenenbaum

We investigate the divisibility properties of \sigma(C_n), the sum-of-divisors function applied to Catalan numbers, in relation to other number-theoretic functions. We establish conditions under which C_n has prime factors of the form 6k-1,…

Combinatorics · Mathematics 2025-02-10 Volkan Yildiz

We use an old elementary arithmetic argument to find new upper and lower bounds for Sylvester's denumerant function. These bounds are tight enough to get the asymptotic behavior of the denumerant.

Number Theory · Mathematics 2023-01-13 Gerardo Ballesio

We investigate additive properties of sets $A,$ where $A=\{a_1,a_2,\ldots ,a_k\}$ is a monotone increasing set of real numbers, and the differences of consecutive elements are all distinct. It is known that $|A+B|\geq c|A||B|^{1/2}$ for any…

Combinatorics · Mathematics 2021-07-01 Imre Ruzsa , Jozsef Solymosi

A coding method using binary sequences is presented for different computation problems related to Catalan numbers. This method proves in a very easy way the equivalence of these problems.

Discrete Mathematics · Computer Science 2010-03-13 Antal Bege , Zoltán Kása

We introduce the super Patalan numbers, a generalization of the super Catalan numbers in the sense of Gessel, and prove a number of properties analagous to those of the super Catalan numbers. The super Patalan numbers generalize the super…

Combinatorics · Mathematics 2015-02-26 Thomas M. Richardson

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…

Combinatorics · Mathematics 2014-08-27 Emily Allen , Irina Gheorghiciuc

We give a new proof of the following statement: the Catalan number $C_n$ is divisible by $n+2$, if $n$ is odd and $n\not\equiv 1\text{ mod }3$.

Combinatorics · Mathematics 2025-07-29 Yury Kochetkov

We prove exact asymptotic expansions for the partial sums of the sequences of central binomial coefficients and Catalan numbers, $\sum_{k=0}^n \binom{2k}{k}$ and $\sum_{k=0}^n C_n$. We also obtain closed forms for the polynomials…

Combinatorics · Mathematics 2010-01-13 Sandro Mattarei

In this paper, we prove two congruences on the double sums of the super Catalan numbers (named by Gessel), which were recently conjectured by Apagodu.

Number Theory · Mathematics 2018-04-26 Ji-Cai Liu

A generalization of the Catalan numbers is considered. New results include binomial identities, recursive relations and a close formula for the multivariate generating function. A simple expression for the Catalan determinant is derived.

Combinatorics · Mathematics 2007-05-23 Siu-Ah Ng

We present a new alternating convolution formula for the super Catalan numbers which arises as a generalization of two known binomial identities. We prove a generalization of this formula by using auxiliary sums, recurrence relations, and…

Combinatorics · Mathematics 2021-10-12 Jovan Mikić

We obtain a new upper bound for binary sums with multiplicative characters over variables belong to some sets, having small additive doubling.

Number Theory · Mathematics 2017-12-29 Aleksei S. Volostnov

We prove two conjectures on sums of products of Catalan triangle numbers, which were originally conjectured by Miana, Ohtsuka, and Romero [Discrete Math. 340 (2017), 2388--2397]. The first one is proved by using Zeilberger's algorithm, and…

Combinatorics · Mathematics 2018-06-08 Victor J. W. Guo , Xiuguo Lian

We prove that the sumset or the productset of any finite set of real numbers, $A,$ is at least $|A|^{4/3-\epsilon},$ improving earlier bounds. Our main tool is a new upper bound on the multiplicative energy, $E(A,A).$

Combinatorics · Mathematics 2008-06-23 Jozsef Solymosi

In this paper, we study arithmetic properties of weighted Catalan numbers. Previously, Postnikov and Sagan found conditions under which the $2$-adic valuations of the weighted Catalan numbers are equal to the $2$-adic valutations of the…

Combinatorics · Mathematics 2019-08-13 Yibo Gao , Andrew Gu

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…

Combinatorics · Mathematics 2022-08-04 Kevin Limanta , Norman J. Wildberger