Zobrazeno 1 - 10
of 34
pro vyhledávání: '"YAQUBI, DANIEL"'
Generalizing the concept of a perfect number is a Zumkeller or integer perfect number that was introduced by Zumkeller in 2003. The positive integer $n$ is a Zumkeller number if its divisors can be partitioned into two sets with the same sum, which w
Externí odkaz:
http://arxiv.org/abs/2008.11096
Autor:
Yaqubi, Daniel, Fatehizadeh, Amirali
In this paper, we discuss about some results on average of Fibonacci and Lucas sequences that may be found in the OEIS code A111035.
Externí odkaz:
http://arxiv.org/abs/2001.11839
Autor:
Bényi, Beáta, Yaqubi, Daniel
In this paper we introduce mixed coloured permutation, permutations with certain coloured cycles, and study the enumerative properties of these combinatorial objects. We derive the generating function, closed forms, recursions and combinatorial ident
Externí odkaz:
http://arxiv.org/abs/1903.07450
In this note we investigate mixed partitions with extra condition on the sizes of the blocks. We give a general formula and the generating function. We consider in more details a special case, determining the generating functions, some recurrences an
Externí odkaz:
http://arxiv.org/abs/1812.02955
Publikováno v:
Adv. Appl. Math. 101 (2018), 232-265
We evaluate Hankel determinants of matrices in which the entries are generating functions for paths consisting of up-steps, down-steps and level steps with a fixed starting point but variable end point. By specialisation, these determinant evaluation
Externí odkaz:
http://arxiv.org/abs/1802.05990
Consider an $m\times n$ table $T$ and latices paths $\nu_1,\ldots,\nu_k$ in $T$ such that each step $\nu_{i+1}-\nu_i=(1,1)$, $(1,0)$ or $(1,-1)$. The number of paths from the $(1,i)$-blank (resp. first column) to the $(s,t)$-blank is denoted by $\mat
Externí odkaz:
http://arxiv.org/abs/1711.01924
Autor:
Yaqubi, Daniel, Mirzavaziri, Madjid
In this paper, we gave some properties of binomial coefficient.
Externí odkaz:
http://arxiv.org/abs/1701.06217
A lattice path in $\mathbb{Z}^d$ is a sequence $\nu_1,\nu_2,\ldots,\nu_k\in\mathbb{Z}^d$ such that the steps $\nu_i-\nu_{i-1}$ lie in a subset $\mathbf{S}$ of $\mathbb{Z}^d$ for all $i=2,\ldots,k$. Let $T_{m,n}$ be the $m\times n$ table in the first
Externí odkaz:
http://arxiv.org/abs/1612.08697
Autor:
YAQUBI, DANIEL1 Daniel_yaqubi@yahoo.es, GHOUCHAN, MOHAMMAD FARROKHI DERAKHSHANDEH2 farrokhi@iasbs.ac.ir, ZOERAM, HAMED GHASEMIAN3 hamed@idsia.ch
Publikováno v:
Mathematical Communications. 2023, Vol. 28 Issue 2, p181-201. 21p.
A tree is called k-ended tree if it has at most k leaves, where a leaf is a vertex of degree one. In this paper we prove that every 3-regular connected graph with n vertices such that n is greater than 8 has spanning sub tree with at most [(2n+4)/9]-
Externí odkaz:
http://arxiv.org/abs/1510.05246