Related papers: Some Formulas for Numbers of Restricted Words

Let $G_n= \prod_{k=0}^n \binom{n}{k},$ the product of the elements of the $n$-th row of Pascal's triangle. This paper studies the partial factorizations of $G_n$ given by the product $G(n,x)$ of all prime factors $p$ of $G_n$ having $p \le…

Using $P(n,m)$, the number of integer partitions of $n$ into exactly $m$ parts, which was the subject of an earlier paper, $P(n,m,p)$, the number of integer partitions of $n$ into exactly $m$ parts with each part at most $p$, can be…

We estimate mixed character sums of polynomial values over elements of a finite field $\mathbb F_{q^r}$ with sparse representations in a fixed ordered basis over the subfield $\mathbb F_q$. First we use a combination of the…

This paper seeks to model human language by the mathematical framework of quantum physics. With the well-designed mathematical formulations in quantum physics, this framework unifies different linguistic units in a single complex-valued…

Departing from a class of infinite series with central binomial coefficients in the numerator and depending on a positive integer parameter, we first extend known identities to all complex parameters. Then we use various methods, including…

Let $r\geq 1$ be an integer, $\mathbf a=(a_1,\ldots,a_r)$ a vector of positive integers and let $D\geq 1$ be a common multiple of $a_1,\ldots,a_r$. In a continuation of a previous paper we prove that, if $D=1$ or $D$ is a prime number, the…

In this lecture notes we try to familiarize the audience with the theory of Bernoulli polynomials; we study their properties, and we give, with proofs and references, some of the most relevant results related to them. Several applications…

We introduce a variant of de Bruijn words that we call perfect necklaces. Fix a finite alphabet. Recall that a word is a finite sequence of symbols in the alphabet and a circular word, or necklace, is the equivalence class of a word under…

Word meaning has different aspects, while the existing word representation "compresses" these aspects into a single vector, and it needs further analysis to recover the information in different dimensions. Inspired by quantum probability,…

For a sequence of polynomials $\{p_k(t)\}$ in one real or complex variable, where $p_k$ has degree $k$, for $k\ge 0$, we find explicit expressions and recurrence relations for infinite matrices whose entries are the coefficients $d(n,m,k)$,…

We investigate one-way communication scenarios where Bob manipulating on his parts can transfer some sub-system to the environment. We define reduced versions of quantum communication rates and further, prove new upper bounds on one-way…

In [CaballeroHooleyDelta], we associated a Dyck word $\langle\! \langle n \rangle\! \rangle_{\lambda}$ to any pair $(n, \lambda)$ consisting of an integer $n \geq 1$ and a real number $\lambda > 1$. The goal of the present paper is to show…

A closed word (a.k.a. periodic-like word or complete first return) is a word whose longest border does not have internal occurrences, or, equivalently, whose longest repeated prefix is not right special. We investigate the structure of…

Any finite word $w$ of length $n$ contains at most $n+1$ distinct palindromic factors. If the bound $n+1$ is reached, the word $w$ is called rich. The number of rich words of length $n$ over an alphabet of cardinality $q$ is denoted…

We study a generalized class of weighted $k$-regular partitions defined by \[ \sum_{n=0}^{\infty} c_{k, r_1, r_2}(n) q^n = \prod_{n=1}^{\infty} \frac{(1 - q^{nk})^{r_1}}{(1 - q^n)^{r_2}}, \] which extends the classical $k$-regular partition…

For $k,m,n\in \mathbb{N}$, we consider $n^k\times n^k$ random matrices of the form $$ \mathcal{M}_{n,m,k}(\mathbf{y})=\sum_{\alpha=1}^m\tau_\alpha {Y_\alpha}Y_\alpha^T,\quad…

If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…

A large set of signals can sometimes be described sparsely using a dictionary, that is, every element can be represented as a linear combination of few elements from the dictionary. Algorithms for various signal processing applications,…

We introduce a variation of the Ziv-Lempel and Crochemore factorizations of words by requiring each factor to be a palindrome. We compute these factorizations for the Fibonacci word, and more generally, for all $m$-bonacci words.

Let $(m, n, k)$ be a tuple of integers with the property that if $i \leq k$, then $m + i$ and $n + i$ have the same radical. Using a result on the abc Conjecture, we bound $k$ from above, improving a result of Balasubramanian, Shorey, and…