Related papers: On the Horadam symbol elements
We describe combinatorial properties of the defining row of a circulant Hadamard matrix by exploiting its orthogonality to subsequent rows, and show how to exclude several particular forms of these matrices.
Catalan numbers and their interpretations in terms of Dyck paths are widely used in different topics of applied mathematics and computer science. Here, we consider a general approach for constrained Dyck paths. In particular, we study Dyck…
The goal of this paper is to introduce and study noncommutative Catalan numbers $C_n$ which belong to the free Laurent polynomial algebra in $n$ generators. Our noncommutative numbers admit interesting (commutative and noncommutative)…
In this note, we show how a combinatorial identity of Frisch can be applied to prove and generalize some well-known identities involving harmonic numbers. We also present some combinatorial identities involving odd harmonic numbers which…
In this paper, we define four transformations on the classical Catalan triangle $\mathcal{C}=(C_{n,k})_{n\geq k\geq 0}$ with $C_{n,k}=\frac{k+1}{n+1}\binom{2n-k}{n}$. The first three ones are based on the determinant and the forth is…
We present a new identity involving compositions (i.e. ordered partitions of natural numbers). The Formula has its origin in complex dynamical systems and appears when counting, in the polynomial family $\{f_c:z \mapsto z^d + c \}$,…
Our understanding about things is conceptual. By stating that we reason about objects, it is in fact not the objects but concepts referring to them that we manipulate. Now, so long just as we acknowledge infinitely extending notions such as…
We give a combinatorial interpretation of a matrix identity on Catalan numbers and the sequence $(1, 4, 4^2, 4^3, ...)$ which has been derived by Shapiro, Woan and Getu by using Riordan arrays. By giving a bijection between weighted partial…
Investigation on open questions about perturbation of Hermitian sequences and their spectral symbols. Results on normal sequences are also furnished.
In this paper we define and study properties and applications of a, b, x0, x1 elements in some special cases.
By prepending zeros to a given sequence Hankel determinants of backward shifts of this sequence become meaningful. We obtain some results for the sequences of Catalan numbers and of some numbers and polynomials which are related to Catalan…
Two types of finite series of products of harmonic numbers involving nonnegative integer powers are evaluated, also yielding two other important harmonic number identities. The recursion formulas for these sums are derived, which are easily…
In this paper the approach to obtaining nonrecurrent formulas for some recursively defined sequences is illustrated. The most interesting result in the paper is the formula for the solution of quadratic map-like recurrence. Also, some…
Refinements of the classical Rogers-Ramanujan identities are given in which some parts are weighted. Combinatorial interpretations refining MacMahon's results are corollaries.
We approach Riordan arrays and their generalizations via umbral symbolic methods. This new approach allows us to derive fundamental aspects of the theory of Riordan arrays as immediate consequences of the umbral version of the classical…
It is shown that traces of mapping classes of finite order may be expressed by Verlinde-like formulae. The 3D topological argument is explained, and the resulting trace identities for modular matrix elements are presented.
Experimental results on hadronic structures are discussed in view of our physics understanding. Achievements and challenges are noted.
In this note, we introduce arithmetic Heilbronn supercharacters that generalize the notions of arithmetic Heilbronn characters and Heilbronn supercharacters and discuss several properties of them.
On the torus, it is possible to assign a global symbol to a pseudodifferential operator using Fourier series. In this paper we investigate the relations between the local and global symbols for the operators in the classical H\"ormander…
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.