English
Related papers

Related papers: Black Cell Capacity in Catalan polyominoes

200 papers

We study a recursion that generates real sequences depending on a parameter $x$. Given a negative $x$ the growth of the sequence is very difficult to estimate due to canceling terms. We reduce the study of the recursion to a problem about a…

Combinatorics · Mathematics 2010-06-08 Magnus Aspenberg , Rodrigo Perez

We describe one interpretation of the q-Catalan numbers in frameworks of random matrix theory and weighted partitions of the set of integers.

Combinatorics · Mathematics 2007-05-23 A. Khorunzhy

Let $P(n)$ be the number of polyominoes of $n$ cells and $\lambda$ be Klarner's constant, that is, $\lambda=\lim_{n\to\infty} \sqrt[n]{P(n)}$. We show that there exist some positive numbers $A,T$, so that for every $n$ \[ P(n) \ge…

Combinatorics · Mathematics 2025-07-15 Vuong Bui

We present an integral expression of the Catalan numbers, based on F\'eaux' integral representation of $\log\left[\Gamma(x)\right]$, $\Gamma$ being the usual Gamma function. The obtained formula may be the starting point of the derivation…

Combinatorics · Mathematics 2024-11-01 Jean-Christophe Pain

For $m,n$ coprime we introduce a new statistic skip on $(m,n)$-rational Dyck paths and give a fast way to compute dinv and skip statistics. We also introduce $(m,n)$-rank words, which are in one-to-one correspondence with $(m,n)$-Dyck…

Combinatorics · Mathematics 2016-11-16 Ryan Kaliszewski , Huilan Li

Standard set-valued Young tableaux are a generalization of standard Young tableaux in which cells may contain more than one integer, with the added conditions that every integer at position $(i,j)$ must be smaller than every integer at…

Combinatorics · Mathematics 2017-10-05 Paul Drube

In this note, we provide bijective proofs of some identities involving the Bell number, as previously requested. Our arguments may be extended to yield a generalization in terms of complete Bell polynomials. We also provide a further…

Combinatorics · Mathematics 2014-01-28 Mark Shattuck

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.

Combinatorics · Mathematics 2019-01-01 Helmut Prodinger

Correlation functions in a dynamic quartic matrix model are obtained from the two-point function through a recurrence relation. This paper gives the explicit solution of the recurrence by mapping it bijectively to a two-fold nested…

Mathematical Physics · Physics 2022-04-15 Jins de Jong , Alexander Hock , Raimar Wulkenhaar

Li et al. give an integral formula for the Catalan-Qi number of the second kind. They show that this integral can be written as a summation with double factorials. In this paper the integral is reduced to a product of the Catalan number and…

Combinatorics · Mathematics 2022-10-27 Enno Diekema

We consider planar cubic maps, i.e. connected cubic graphs imbedded into plane, with marked spanning tree and marked directed edge (not in this tree). The number of such objects with $2n$ vertices is $C_{2n}\cdot C_{n+1}$, where $C_k$ is…

Combinatorics · Mathematics 2016-08-09 Yury Kochetkov

We define a weighted analog for the multidimensional Catalan numbers, obtain matrix-based recurrences for some of them, and give conditions under which they are periodic. Building on this framework, we introduce two new sequences of…

Combinatorics · Mathematics 2025-10-17 Ryota Inagaki , Dimana Pramatarova

Intrigued by the product formula prod_{i=1}^{n-2} C_i for the volume of the Chan-Robbins-Yuen polytope CRY_n, where C_i is the ith Catalan number, we construct a family of polytopes P_{m,n}, whose volumes are given by the product…

Combinatorics · Mathematics 2011-11-28 Karola Meszaros

We study the expressive power of kernel methods and the algorithmic feasibility of multiple kernel learning for a special rich class of kernels. Specifically, we define \emph{Euclidean kernels}, a diverse class that includes most, if not…

Machine Learning · Computer Science 2019-02-14 Pravesh K. Kothari , Roi Livni

In this paper we study the structure of cellular pseudomanifolds (aka abstract polytopes). These are natural combinatorial generalisations of polytopal spheres (i.e., boundary complexes of convex polytopes). This class is closed under…

Combinatorics · Mathematics 2023-07-06 Bhaskar Bagchi , Basudeb Datta

The paper counts the number of reduced quasigroup words of a particular length in a certain number of generators. Taking account of the relationship with the Catalan numbers, counting words in a free magma, we introduce the term…

Combinatorics · Mathematics 2019-10-23 Jonathan D. H. Smith , Stefanie G. Wang

This paper studies the number conservation property of 1-dimensional non-uniform cellular automata (CAs). In a non-uniform cellular automaton (CA), different cells may follow different rules. The present work considers that the cells follow…

Formal Languages and Automata Theory · Computer Science 2016-04-25 Raju Hazari , Sukanta Das

Recently, Banderier et. al. considered Young tableaux with walls, which are similar to standard Young tableaux, except that local decreases are allowed at some walls. We count the numbers $\overline{f}_m(n)$ of Young tableaux of shape…

Combinatorics · Mathematics 2024-01-29 Feihu Liu , Guoce Xin

We compute the expansion of the Catalan family of Lie idempotents introduced in [Menous et al., Adv. Applied Math. 51 (2013), 177-22] on the PBW basis of the Lie module. It is found that the coefficient of a tree depends only on its number…

Combinatorics · Mathematics 2020-05-20 Loïc Foissy , Frédéric Menous , Jean-Christophe Novelli , Jean-Yves Thibon

A method is proposed, called channel polarization, to construct code sequences that achieve the symmetric capacity $I(W)$ of any given binary-input discrete memoryless channel (B-DMC) $W$. The symmetric capacity is the highest rate…

Information Theory · Computer Science 2016-11-18 Erdal Arikan