Related papers: Counting compatible indexing systems for $C_{p^n}$
We present an exposition on the Fuss--Catalan numbers, which are a generalization of the well known Catalan numbers. The literature on the subject is scattered (especially for the case of multiple independent parameters, as will be…
We call $n$ a cyclic number if every group of order $n$ is cyclic. It is implicit in work of Dickson, and explicit in work of Szele, that $n$ is cyclic precisely when $\gcd(n,\phi(n))=1$. With $C(x)$ denoting the count of cyclic $n\le x$,…
The asymptotic study of the conjugacy classes of a random element of the finite affine group leads one to define a probability measure on the set of all partitions of all positive integers. Four different probabilistic understandings of…
This paper presents a clustering algorithm that is an extension of the Category Trees algorithm. Category Trees is a clustering method that creates tree structures that branch on category type and not feature. The development in this paper…
The well-known process algebras, such as CCS, ACP and $\pi$-calculus, capture the interleaving concurrency based on bisimilarity semantics. We did some work on truly concurrent process algebras, such as CTC, APTC and $\pi_{tc}$, capture the…
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.
We present a higher genus generalization of $bc$-Motzkin numbers, which are themselves a generalization of Catalan numbers, and we derive a recursive formula which can be used to calculate them. Further, we show that this leads to a…
It is well known that the Catalan number C_n counts dissections of a regular (n+2)-gon into triangles. Here we count such dissections by number of triangles that contain two sides of the polygon among their three edges, leading to a…
We define an extension of parity from the integers to the rational numbers. Three parity classes are found -- even, odd and `none'. Using the 2-adic valuation, we partition the rationals into subgroups with a rich algebraic structure. The…
We describe a method for determining a complete set of integrals for a classical Hamiltonian that separates in orthogonal subgroup coordinates. As examples, we use it to determine complete sets of integrals, polynomial in the momenta, for…
The well-known process algebras, such as CCS, ACP and $\pi$-calculus, capture the interleaving concurrency based on bisimilarity semantics. We did some work on truly concurrent process algebras, such as CTC, APTC and $\pi_{tc}$, capture the…
We prove that the inverse of the Hankel matrix of the reciprocals of the Catalan numbers has integer entries. We generalize the result to an infinite family of generalized Catalan numbers. The Hankel matrices that we consider are associated…
Cyclic codes are among the most important families of codes in coding theory for both theoretical and practical reasons. Despite their prominence and intensive research on cyclic codes for over a half century, there are still open problems…
We show that the modular group has an infinite family of finite index subgroups, each of which has the same trace set as the modular group itself. Various congruence subgroups of the modular group, and the Bianchi groups, are also shown to…
We investigate how the notions of pairings of operads of May and compatible pairs of indexing systems of Blumberg--Hill relate via the correspondence between indexing systems and $N_{\infty}$-operads. We show that a pairing of operads…
We solve two open problems in Coxeter-Catalan combinatorics. First, we introduce a family of rational noncrossing objects for any finite Coxeter group, using the combinatorics of distinguished subwords. Second, we give a type-uniform proof…
In this paper we consider combinatorial numbers $C_{m, k}$ for $m\ge 1$ and $k\ge 0$ which unifies the entries of the Catalan triangles $ B_{n, k}$ and $ A_{n, k}$ for appropriate values of parameters $m$ and $k$, i.e., $B_{n,…
We present a formula for an infinite number of universal quantum logic gates, which are $4$ by $4$ unitary solutions to the Yang-Baxter (Y-B) equation. We obtain this family from a certain representation of the cyclic group of order $n$. We…
Generalizations of linear numeration systems in which the set of natural numbers is recognizable by finite automata are obtained by describing an arbitrary infinite regular language following the lexicographic ordering. For these systems of…
These notes present an approach to obtaining monoid operations which are compatible with a given family of mappings in the sense that the mappings become left translations in the monoid. This can be applied to various situations such as the…