Related papers: Catalan numbers and a conjecture on the maximum co…

We present new descriptive complexity characterisations of classes REG (regular languages), LCFL (linear context-free languages) and CFL (context-free languages) as restrictions on inference rules, size of formulae and permitted connectives…

The existence of apparently coincidental equalities (also called Wilf-equivalences) between the enumeration sequences, or generating functions, of various hereditary classes of combinatorial structures has attracted significant interest. We…

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…

For a strongly connected category $\mathcal C$ with pair-wise coproducts, we introduce a cosimplicial object, which serves as a sort of resolution for computing higher derived functors of ${\sf lim} : \mathrm{Ab}^{\mathcal C}\to…

The number of flats of a hyperplane arrangement is considered as a generalization of the Bell number and the Stirling number of the second kind. Robert Gill gave the exponential generating function of the number of flats of the extended…

The study of pattern avoidance in permutations, and specifically in flattened partitions is an active area of current research. In this paper, we count the number of distinct flattened partitions over [n] avoiding a single pattern, as well…

We show that cluster algebras do not contain non-trivial units and that all cluster variables are irreducible elements. Both statements follow from Fomin and Zelevinsky's Laurent phenomenon. As an application we give a criterion for a…

We provide an explicit formulation for the solution to the Catalan's triangle system using Catalan's trapezoids and a specified boundary condition. Additionally, we study this system with various boundary conditions obtained by utilizing…

We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…

Let $\alpha$ be a complex number. We show that there is a finite subset $F$ of the ring of the rational integers $\mathbb{Z}$, such that $F\left[ \alpha\right] =\mathbb{Z}\left[ \alpha\right]$, if and only if $\alpha$ is an algebraic number…

The problem of computing the characters of the finite dimensional irreducible representations of the Lie superalgebra $\mathfrak{gl}(m|n)$ over $\C$ was solved a few years ago by V. Serganova. In this article, we present an entirely…

We introduce the Ceiling Continued Fractions (FCT) framework for constructing three-term Egyptian fraction representations in the Erd\H{o}s-Straus conjecture. The approach exploits divisor structures of shifted integers p+i rather than…

We consider the class of polynomial optimization problems $\inf \{f(x):x\in K\}$ for which the quadratic module generated by the polynomials that define $K$ and the polynomial $c-f$ (for some scalar $c$) is Archimedean. For such problems,…

First, we prove the Kac-Wakimoto conjecture on modular invariance of characters of exceptional affine W-algebras. In fact more generally we prove modular invariance of characters of all lisse W-algebras obtained through Hamiltonian…

Consider an a.e.c. (abstract elementary class), that is, a class K of models with a partial order refining inclusion (submodel) which satisfy the most basic properties of an elementary class. Our test question is trying to show that the…

In this note we introduce several instructive examples of bijections found between several different combinatorially defined sequences of sets. Each sequence has cardinalities given by the Catalan numbers. Our results answer some questions…

Let $(\mathfrak{g},\mathfrak{k})$ be a supersymmetric pair arising from a finite-dimensional, symmetrizable Kac-Moody superalgebra $\mathfrak{g}$. An important branching problem is to determine the finite-dimensional highest-weight…

We study the properties of the odd Catalan numbers, C_n, modulo 2^k for k >= 2. We show that there exist only k - 1 different congruences of the odd Catalan numbers modulo 2^k. Moreover, these congruences can be obtained by C_{2^m - 1} (mod…

We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…

The union-closed sets conjecture (sometimes referred to as Frankl's conjecture) states that every finite, nontrivial union-closed family of sets has an element that is in at least half of its members. Although the conjecture is known to be…