Related papers: A proof of Catalan's Convolution formula
Let k and n be positive integers. We mainly show that $$(ln+1) | k\binom{kn+ln}{kn},$$ $$2\binom{kn}n | \binom {2n}{n}C_{2n}^{(k-1)}$$, $$\binom{kn}n | (2k-1)C_n\binom{2kn}{2n},$$ $$\binom{2n}n | (k+1)C_n^{(k-1)}\binom{2kn}{kn},$$…
We present an alternative cyclic proof system for Peano arithmetic that could be simpler than the existing ones and well-adapted both for proof analysis and for automatizing inductive proof search. In addition, we will show how various…
There is a classical geometric construction which uses a binary quadratic form to define an involution on the space of binary d-ics. We give a complete characterization of a general class of such involutions which are definable using…
We compute the limiting distribution, as n approaches infinity, of the number of cycles of length between gamma n and delta n in a permutation of [n] chosen uniformly at random, for constants gamma, delta such that 1/(k+1) <= gamma < delta…
The $p$-th power of the logarithm of the Catalan generating function is computed using the Stirling cycle numbers. Instead of Stirling numbers, one may write this generating function in terms of higher order harmonic numbers.
For each integer k > 1, Johnson gave a 3-manifold with Heegaard splittings of genera 2k and 2k-1 such that any common stabilization of these two surfaces has genus at least 3k-1. We modify his argument to produce a 3-manifold with two…
A typical decomposition question asks whether the edges of some graph $G$ can be partitioned into disjoint copies of another graph $H$. One of the oldest and best known conjectures in this area, posed by Ringel in 1963, concerns the…
We prove that for all natural numbers $m$ and $k$ where $k$ is odd, there exists a natural number $N(k)$ such that any 3-connected cubic graph with at least $N(k)$ vertices contains a cycle of length $m$ modulo $k$. We also construct a…
On an elliptic surface or threefold, Catalan numbers appear when one tries to compute the autoequivalence group action on the Bridgeland stability manifold. We explain why this happens by identifying a class of equations in the Chow ring of…
This paper establishes an interesting link between $k$th price auctions and Catalan numbers by showing that for distributions that have linear density, the bid function at any symmetric, increasing equilibrium of a $k$th price auction with…
In this paper, we deal with the convolution series that are a far reaching generalization of the conventional power series and the power series with the fractional exponents including the Mittag-Leffler type functions. Special attention is…
We give a formula for counting the triangles in a picture consisting of the three sides of a triangle and some cevians. This lets us prove statements that are claimed without proof in the Online Encyclopedia of Integer Sequences and some…
Guo-Niu Han [arXiv:2006.14070 [math.CO]] has introduced a new combinatorial object named standard puzzle. We use digraphs to show the relations between numbers in standard puzzles and propose a skeleton model. By this model, we solve the…
Recently, John Pardon proved the MNOP conjecture (on the GW-DT correspondence for CY3s) by introducing a new mathematical gadget, which we call the Pardon homology algebra of 1-cycles in 3-folds. We work out an analogous construction for…
We determine continuous bijections $f$, acting on a real interval into itself, whose $k$-fold iterate is the quasi-arithmetic mean of all its subsequent iterates from $f^0$ up to $f^n$ (where $0\le k\le n$). Namely, we prove that if at most…
The acyclic system conjecture of Ardila and Ceballos can be interpreted as saying the following: "Every triangulation of the 3-skeleton of a product of two simplices can be extended to a triangulation of the whole product". We show a…
An asymptotic formula is proved for the k-fold divisor function averaged over homogeneous polynomials of degree k in k-1 variables coming from incomplete norm forms.
In this paper, we apply the Dirichlet convolution method to \begin{equation*} T_{k}(x)=\sum_{n \leq x} d_{k}(n), \end{equation*} for $k\ge 3$, where $d_{k}(n)$ is the number of ways to represent $n$ as a product of $k$ positive integer…
Generalising Solomon's theorem, C. Gordon and F. Rodriguez-Villegas have proven recently that, in any group, the number of solutions to a system of coefficient-free equations is divisible by the order of this group whenever the rank of the…
The article contains some important classes of multisets. Combinatorial proofs of problems on the number of m-submultisets and m-permutations of multiset elements are considered and effective algorithms for their calculation are given. In…