Related papers: Products of extended binomial coefficients and the…

Let $f(x) \in \mathbb{Z}[x]$. Set $f_{0}(x) = x$ and, for $n \geq 1$, define $f_{n}(x)$ $=$ $f(f_{n-1}(x))$. We describe several infinite families of polynomials for which the infinite product \prod_{n=0}^{\infty} (1 + \frac{1}{f_{n}(x)})…

For any polynomial $P(x)\in\mathbb{Z}[x],$ we study arithmetic dynamical systems generated by $\displaystyle{F_P(n)=\prod_{k\le n}}P(n)(\text{mod}\ p),$ $n\ge 1.$ We apply this to improve the lower bound on the number of distinct quadratic…

The expression $a^n + b^n$ can be factored as $(a+b)(a^{n-1} - a^{n-2} b + a^{n-3} b^2 - ... + b^{n-1})$ when $n$ is an odd integer greater than one. This paper focuses on proving a few properties of the longer factor above, which we call…

Let $P(x)\in \mathbb{Z}[x]$ be a polynomial with at least two distinct complex roots. We prove that the number of solutions $(x_1, \dots, x_k, y_1, \dots, y_k)\in [N]^{2k}$ to the equation \[ \prod_{1\le i \le k} P(x_i) = \prod_{1\le j \le…

Bhargava introduced a generalization of the factorial function to extend classical results in integers to Dedekind rings and unify them. We study the Bhargava factorial of the images of polynomial maps from an analytic perspective. We first…

We give an overview of combinatoric properties of the number of ordered $k$-factorizations $f_k(n,l)$ of an integer, where every factor is greater or equal to $l$. We show that for a large number $k$ of factors, the value of the cumulative…

A bracket polynomial on the integers is a function formed using the operations of addition, multiplication and taking fractional parts. For a fairly large class of bracket polynomials we show that if p is a bracket polynomial of degree k-1…

The main result of this paper is the following: for all $b \in \mathbb Z$ there exists $k=k(b)$ such that \[ \max \{ |A^{(k)}|, |(A+u)^{(k)}| \} \geq |A|^b, \] for any finite $A \subset \mathbb Q$ and any non-zero $u \in \mathbb Q$. Here,…

Let $D_n(x;a)$ and $E_n(x;a)\in\mathbb F_q[x]$ be Dickson polynomials of first and second kind respectively, where $\mathbb F_q$ is a finite field with $q$ elements. In this article we show explicitly the irreducible factors these…

In this paper we use a generalized vector product to construct an exterior form $\wedge :(\mathbb{R}^{n}) ^{k}\to \mathbb{R}^{\binom{n}{k}}$, where $\binom{n}{k}=\frac{n!}{(n-k)!k!}$, $k\leq n$. Finally, for $n=k-1$ we introduce the…

The k-fold Cartesian product of a graph G is defined as a graph on k-tuples of vertices, where two tuples are connected if they form an edge in one of the positions and are equal in the rest. Starting with G as a single edge gives G^k as a…

We develop a fractional extension of the classical binomial distribution and the associated Bernstein operator, formulated within the framework of the generalized binomial theorem (Hara and Hino [Bull.\ London Math.\ Soc. \textbf{42}…

By applying the Newton-Gregory expansion to the polynomial associated with the sum of powers of integers $S_k(n) = 1^k + 2^k + \cdots + n^k$, we derive a couple of infinite families of explicit formulas for $S_k(n)$. One of the families…

We study some counting questions concerning products of positive integers $u_1, \ldots, u_n$ which form a non-zero perfect square, or more generally, a perfect $k$-th power. We obtain an asymptotic formula for the number of such integers of…

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…

The modified B_{n}^{*} = \sum_{r=0}^{n} \binom{n+r}{2r} \frac{B_{r}}{n+r}, \quad n > 0 introduced by D. Zagier in 1998 are extended to the polynomial case by replacing $B_{r}$ by the Bernoulli polynomials $B_{r}(x)$. Properties of these new…

A numerical semigroup $S$ is an additively-closed set of non-negative integers, and a factorization of an element $n$ of $S$ is an expression of $n$ as a sum of generators of $S$. It is known that for a given numerical semigroup $S$, the…

Let $p_k(n)$ be given by the $k$-th power of the Euler Product $\prod _{n=1}^{\infty}(1-q^n)^k=\sum_{n=0}^{\infty}p_k(n)q^{n}$. By investigating the properties of the modular equations of the second and the third order under the Atkin…

Rowland found a matrix product formula for generating functions counting binomial coefficients by their $p$-adic valuations. A natural generalization of binomial coefficients was introduced by Knuth and Wilf defined by a sequence $C$. We…

A classical tool in the study of real closed fields are the fields $K((G))$ of generalised power series (i.e., formal sums with well-ordered support) with coefficients in a field $K$ of characteristic 0 and exponents in an ordered abelian…