Related papers: Enumeration of Standard Puzzles
Finding integer solutions to norm form equations is a classical Diophantine problem. Using the units of the associated coefficient ring, we can produce sequences of solutions to these equations. It is known that these solutions can be…
The Fibonacci number is the residue of a rational function, from which follows that Fibonacci number summation identities can be derived with the integral representation method, a method also used to derive combinatorial identities. A…
Combinatorial counting problems pervade artificial intelligence, statistics, and discrete mathematics. Whether the task is enumerating subsets, multisets, permutations, partitions, or compositions under structural and arithmetic…
This article introduces a pedagogical method for {\it solving combinatorial problems} that frequently involve structures that are unfamiliar or less familiar. Indeed, an indirect method has been proposed in order to evade any possible…
In this study, we define a new type of Fibonacci and Lucas num- bers which are called bicomplex Fibonacci and bicomplex Lucas numbers. We obtain the well-known properties e.g. Docagnes, Cassini, Catalan for these new types. We also give the…
We define a new generalization of Catalan numbers to multinomial coefficients. With arithmetic methods, we study their integrality and the integrality of their Lucasnomial generalization. We give a complete characterization of regular Lucas…
Experimental mathematics is an experimental approach to mathematics in which programming and symbolic computation are used to investigate mathematical objects, identify properties and patterns, discover facts and formulas and even…
We construct multiple $qt$-binomial coefficients and related multiple analogues of several celebrated families of special numbers in this paper. These multidimensional generalizations include the first and the second kind of $qt$-Stirling…
The following article summarizes research where theorems and their respective demonstrations are postulated based on quadratic equations with special properties given by the Pythagorean triplets and the Fibonacci sequence given the second…
The focus of this paper is the study of generalized Fibonacci polynomials and Fibonomial coefficients. The former are polynomials {n} in variables s and t given by {0} = 0, {1} = 1, and {n} = s{n-1}+t{n-2} for n ge 2. The latter are defined…
In many everyday categories (sets, spaces, modules, ...) objects can be both added and multiplied. The arithmetic of such objects is a challenge because there is usually no subtraction. We prove a family of cases of the following principle:…
In this work, by using Pauli matrices, we introduce four families of polynomials indexed over the positive integers. These polynomials have rational or imaginary rational coefficients. It turns out that two of these families are closely…
The Catalan numbers (C_n)_{n >= 0} = 1,1,2,5,14,42,... form one of the most venerable sequences in combinatorics. They have many combinatorial interpretations, from counting bracketings of products in non-associative algebra to counting…
We settle the existence of certain "anti-magic" cubes using combinatorial block designs and graph decompositions to align a handful of small examples.
Based on the combinatorial interpretation of the ordered Bell numbers, which count all the ordered partitions of the set $[n]=\{1,2,\dots,n\}$, we introduce the Fibonacci partition as a Fibonacci permutation of its blocks. Then we define…
We present new expressions for the $k$-generalized Fibonacci numbers, say $F_k(n)$. They satisfy the recurrence $F_k(n) = F_k(n-1) +\dots+F_k(n-k)$. Explicit expressions for the roots of the auxiliary (or characteristic) polynomial are…
We give enumerations of various families of restricted permutations involving the Fibonacci numbers or k-generalized Fibonacci numbers.
We define generalized bivariate polynomials, from which upon specification of initial conditions the bivariate Fibonacci and Lucas polynomials are obtained. Using essentially a matrix approach we derive identities and inequalities that in…
Explicit expressions for multimatrix models with complex and unitary matrices allows to couple these models with well-known unitary, orthogonsl and sympletic ensembles. We consider examples of such mixed ensembles which are solvable in the…
Sudoku is a popular combinatorial puzzle. A new method of solving Sudoku is presented, which involves formulating a puzzle as a special type of transportation problem. This model allows one to solve puzzles with more than one solution,…