Searcharxiv⌕ Search

arXiv subjects

Daniel Yaqubi

Publications and source records attributed to Daniel Yaqubi.

At least 19 recordsLinked to original sources

The Möbius function of factorizations with a simple prime factor

The poset of factorizations of a positive integer $n$ (ordered by refinement) is known to have a very irregular Möbius function. We prove that this function becomes completely explicit whenever $n$ is divisible by a prime $q$ to the first power only ($q^2 \nmid n$). Specifically, between a factorization with $k$ factors and $n$ itself, the Möbius function is given by $(-1)^{k-1}$ multiplied by the number of ways to order the factors that are not divisible by $q$. As a consequence, the sum of the absolute values of the Möbius function over this interval equals twice the number of ordered factorizations of $n/q$.

math.CO↗

Graph binomial coefficients and a positivity conjecture of Guo and Krattenthaler

We investigate Conjecture 7.4 of Guo and Krattenthaler \cite{GK}, which predicts that for every positive integer $n$, the polynomial \[ P_n(q) = \frac{(1-q)^2}{(1-q^{10n-1})(1-q^{15n-1})}\qbin{30n}{5n} \] has non-negative coefficients, except for $q^1$ and $q^{125n^2-25n+3}$, which equal $-1$. We study this problem through three main perspectives: First, by linking the boundary coefficients to the second differences of the partition function, we settle the first and last $25n+1$ coefficients via a novel partition injection. Second, by introducing a ``defect'' generalization of Andrews' classical lemma, we reduce the conjecture to an almost-unimodality property and employ a uniform saddle-point analysis to prove it analytically for all large $n \ge 2\cdot 10^{29}$. Finally, we connect these quotients to graph binomial coefficients, providing a natural orbit-counting interpretation via Burnside's lemma on directed cycles and paths.

math.CO↗

Riordan Arrays and Shifted Hankel Determinants of OEIS A005773

We study two Riordan arrays associated with the Motzkin-prefix sequence (\href{https://oeis.org/A005773}{OEIS A005773}). By connecting their production matrices through a simple boundary factorization, we obtain a period-three transformation on Motzkin endpoint distributions and exact formulas for paths by final height modulo~$3$. In addition, a unified factorization for the shifted Hankel matrices leads directly to explicit closed forms for the third and fourth Hankel determinants, $Δ_n^{(3)}$ and~$Δ_n^{(4)}$.

math.CO↗

Cyclic Latin Eulerian Numbers

We introduce the directed cyclic difference inventory $D_n(\mathbf{m})$ to study Latin Eulerian numbers restricted to row-reorderings of the cyclic Latin square, offering an orientation-sensitive refinement of the prescribed-edge-length Hamiltonian path problem. We establish exact enumeration formulas, symmetries, and realizability obstructions for this inventory. Furthermore, we reduce the cyclic total-ascent statistic directly to endpoint-refined Eulerian statistics via the identity $Σ(L_π) = n \operatorname{asc}(π) + π(1) - π(n)$, yielding a closed-form expression for the cyclic Latin-Eulerian polynomial.

math.CO↗

A Combinatorial Problem in Cinema Seating

We address a problem concerning cinema audiences: ``A cinema has $n$ seats numbered from $1$ to $n$, and there are $n$ people with tickets numbered from $1$ to $n$. People enter the cinema in order. If someone has the ticket number $i$, they can choose seats whose numbers are multiples of $i$. They should exit the cinema if the permitted seats are occupied by previous audience members. In how many ways can they be seated under these conditions?" We give an algorithm to create the list of situations that meet these conditions. We also focus on finding the number of situations in two special cases: when exactly one seat is unoccupied whose total number is denoted by $ω(n)$, and when all audiences $1, \ldots, n-1$ are seated, whose total number is denoted by $ψ(n)$. Giving the recursive formula $ψ(n)=1+\sum_{d|n, d\neq n}ψ(d)$ with the initial value $ψ(1)=1$, we provide an explicit formula for $ψ(p^αq^β)$, where $p$ and $q$ are distinct prime numbers. Furthermore, we show that $ω(n)=-n+\sum_{i=1}^nψ(i)$.

math.GM↗

Latin Eulerian Numbers

We introduce \emph{Latin Eulerian numbers} $\LE{n\atop k_1,\dots,k_n}$, a multivariate refinement of classical Eulerian numbers counting order-$n$ Latin squares by column ascents. We establish their fundamental symmetries, univariate marginals, and an exact multiplicity divisibility property. For the total ascent statistic $Σ(L)=\sum_i k_i(L)$, we prove the sharp, isolated bounds $n-1 \le Σ(L) \le (n-1)^2$, demonstrating that the adjacent values $n$ and $(n-1)^2-1$ are strictly unattainable. To analyze intermediate values, we show that symbol permutations typically ignored in classical enumeration directly govern $Σ$ via an exact formula. This insight yields explicit constructions for the interior range, motivates a unimodality conjecture for the total ascent distribution.

math.CO↗

Prime and Touchard Congruences of Mixed-Type Bell Numbers

This paper establishes a comprehensive combinatorial and arithmetic framework for mixed Stirling and mixed Bell numbers, bridging partition structures, Touchard polynomials, and prime-power congruences. Furthermore, we develop to $p$-adic valuation theory, proving prime-power Touchard congruences and higher-order modulo-$p^2$ refinements that generalize classical arithmetic properties of combinatorial sequences.

math.CO↗

Arithmetic Properties of Mixed Stirling Numbers of the second kind

We investigate the mixed Stirling numbers of the second kind, $\mathcal{S}(n; \mathbf{c})$, which count partitions of $n$ distinct elements into $m$ unlabeled and $k$ labeled non-empty blocks encoded by $\mathbf{c} = (m, 1^k)$. We establish their recurrence relations and exponential generating functions, and analyze their behavior modulo a prime $p$ and $p^2$. In particular, we extend the classical Touchard congruence to this mixed framework. Our results show that these configurations possess unique number-theoretic signatures distinct from classical set partitions.

math.CO↗

On the Graphical $r$-Stirling Numbers of the First Kind for Specific Graph Families

This paper investigates the \textbf{graphical $r$-Stirling numbers of the first kind}, denoted by $\str{G}{k}$, which enumerate partitions of a vertex set $V(G)$ into $k$ disjoint cycles such that $r$ specified vertices occupy distinct blocks. We establish closed-form expressions and recursive identities for fundamental graph families, including \textbf{Path} ($P_n$), \textbf{Cycle} ($C_n$), \textbf{Star} ($S_n$), \textbf{Wheel} ($W_n$), and \textbf{Fan} ($F_n$) graphs. A primary focus of this study is the \textbf{statistical characterization} of the cycle distribution. We derive explicit formulas for the \textbf{mean} and \textbf{variance} of these numbers, extracted from the structural properties of the $r$-cycle polynomials. These results provide a rigorous measure of the average cycle density and variability across different graph topologies, bridging the gap between algebraic combinatorics and the structural analysis of restricted permutations.

math.CO↗

Lattice paths inside a table, II

Consider an $m\times n$ table $T$ and latices paths $ν_1,\ldots,ν_k$ in $T$ such that each step $ν_{i+1}-ν_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 $\mathcal{D}^i(s,t)$ (resp. $\mathcal{D}(s,t)$). Also, the number of all paths form the first column to the las column is denoted by $\mathcal{I}_m(n)$. We give explicit formulas for the numbers $\mathcal{D}^1(s,t)$ and $\mathcal{D}(s,t)$.

math.GM↗

Some properties of Zumkeller numbers and $k$-layered numbers

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 will be $σ(n)/2$. Generalizing even further, we call $n$ a $k$-layered number if its divisors can be partitioned into $k$ sets with equal sum. In this paper, we completely characterize Zumkeller numbers with two distinct prime factors and give some bounds for prime factorization in case of Zumkeller numbers with more than two distinct prime factors. We also characterize $k$-layered numbers with two distinct prime factors and even $k$-layered numbers with more than two distinct odd prime factors. Some other results concerning these numbers and their relationship with practical numbers and Harmonic mean numbers are also discussed.

math.NT↗

Lattice paths inside a table, I

A lattice path in $\mathbb{Z}^d$ is a sequence $ν_1,ν_2,\ldots,ν_k\in\mathbb{Z}^d$ such that the steps $ν_i-ν_{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 area of the $xy$-axis and put $\mathbf{S}=\{(1,1),(1,0),(1,-1)\}$. Accordingly, let $\mathcal{I}_m(n)$ denote the number of lattice paths starting from the first column and ending at the last column of $T$. We will study the numbers $\mathcal{I}_m(n)$ and give explicit formulas for special values of $m$ and $n$. As a result, we prove a conjecture of \textit{Alexander R. Povolotsky} involving $\mathcal{I}_n(n)$. Finally, we present some relationships between the number of lattice paths and Fibonacci and Pell-Lucas numbers, and pose an open problem.

math.CO↗

Mixed r-stirling numbers of the second kind

The Stirling number of the second kind $n\brace k$ counts the number of ways to partition a set of $n$ labeled balls into $k$ non-empty unlabeled cells. As an extension of this, we consider $b_1+b_2+\ldots+b_n$ balls with $b_1$ balls labeled $1$, $b_2$ balls labeled $2$, $\ldots$, $b_n$ balls labeled $n$ and $c_1+c_2+\ldots+c_k$ cells with $c_1$ cells labeled $1$, $c_2$ cells labeled $2$, $\ldots$, $c_k$ cells labeled $k$ and then we called the number of ways to partition the set of these balls into non-empty cells of these types as the \textit{mixed partition numbers}. As an application, we give a new statement of the $r$-Stirling numbers of second kind and $r$-Bell numbers. We also introduce the \textit{$r$-mixed Stirling number of second kind and $r$-mixed Bell numbers}. Finally, for a positive integer $m$ we evaluate the number of ways to write $m$ as the form $m_1\cdot m_2\cdot\ldots\cdot m_k$, where $k\geqslant 1$ and $m_i$'s are positive integers greater than $1$.

math.CO↗

Mixed coloured permutations

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 identities for the counting sequence, mixed Stirling numbers of the first kind. In this comprehensive study we consider further the conditions on the length of the cycles, $r$-mixed Stirling numbers and the connection to Bell polynomials.

math.CO↗

Mixed restricted Stirling numbers

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 and a connection to r-Stirling numbers. To obtain our results, we use pure combinatorial arguments, classical manipulations of generating functions and to derive the generating functions we apply the symbolic method.

math.CO↗

Some determinants of path generating functions, II

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 evaluations have numerous corollaries. In particular, one consequence is that the Hankel determinant of Motzkin prefix numbers equals 1, regardless of the size of the Hankel matrix.

math.CO↗

The Twelvefold way, the non-intersecting circles problem, and partitions of multisets

Let $n$ be a non-negative integer and $A=\{a_1,\ldots,a_k\}$ be a multi-set with $k$ not necessarily distinct members, where $a_1\leqslant\ldots\leqslant a_k$. We denote by $Δ(n,A)$ the number of ways to partition $n$ as the form $a_1x_1+\ldots+a_kx_k$, where $x_i$'s are distinct positive integers and $x_i< x_{i+1}$ whenever $a_i=a_{i+1}$. We give a recursive formula for $Δ(n,A)$ and some explicit formulas for some special cases. Using this notion we solve the non-intersecting circles problem which asks to evaluate the number of ways to draw $n$ non-intersecting circles in a plane regardless to their sizes. The latter also enumerates the number of unlabelled rooted tree with $n+1$ vertices.

math.CO↗