M. Golafshan

collaborators

4 papers

math.NT2026

Asymptotic counting of integers with prime factors $p_{r^{a} s^{b}}$

Mehdi Golafshan

Let $p_{n}$ be the $n$ th prime, and let $r, s \geq 2$ be fixed multiplicatively independent integers. We count the integers up to $x$ whose prime factors all have the form $p_{r^{a} s^{b}}$ …

math.CO2026

Binary binomial equivalence via hyperplane arrangements

Mehdi Golafshan

Rigo and Salimov (2015) proved that the number of binary $2$-binomial equivalence classes of words of length $n$ is the $n^{\text{th}}$ cake number. We give a geometric expla…

math.CO2026

Enumeration of Factor Occurrences in $k$ -Bonacci Words over an Infinite Alphabet

Narges Ghareghani, Mehdi Golafshan, Morteza Mohammad-Noori +1

We study the $k$ -Bonacci word over the infinite alphabet $N$ . Since the alphabet is infinite, the usual factor complexity is infinite and does not provide any information.…

math.DS2024

Factor Complexity of the Most Significant Digits of~ $a^{n^{d}}$

Mehdi Golafshan, Ivan Mitrofanov

We investigate unipotent dynamics on a torus and apply these techniques to the following problem. Let $d$ be a positive integer, and let $a > 0$ be a real number. For an intege…

Asymptotic counting of integers with prime factors prasb​

Binary binomial equivalence via hyperplane arrangements

Enumeration of Factor Occurrences in k-Bonacci Words over an Infinite Alphabet

Factor Complexity of the Most Significant Digits of~and

Asymptotic counting of integers with prime factors $p_{r^{a} s^{b}}$

Enumeration of Factor Occurrences in $k$ -Bonacci Words over an Infinite Alphabet

Factor Complexity of the Most Significant Digits of~ $a^{n^{d}}$