Related papers: Character Values of Stanley Sequences
Using Symbolic Dynamic Programming we describe algorithms, fully implemented in Maple, for automatically generating generating functions introduced by Richard Stanley in his study of generalized Stern arrays, generalized even further, to…
We study those automatic sequences which are produced by an automaton whose underlying graph is the Cayley graph of a finite group. For $2$-automatic sequences, we find a characterization in terms of what we call homogeneity, and among…
Richard Stanley proved that the centralized/normalized version of the random variable "length of largest up-down subsequence" in a random permutation of length n is asymptotically normal. We go beyond and present a more refined asymptotic…
Number theorists have studied extensively the connections between the distribution of zeros of the Riemann $\zeta$-function, and of some generalizations, with the statistics of the eigenvalues of large random matrices. It is interesting to…
The so-called binary perfect phylogeny with persistent characters has recently been thoroughly studied in computational biology as it is less restrictive than the well known binary perfect phylogeny. Here, we focus on the notion of (binary)…
For a fixed integer $t \geq 2$, we consider the irreducible characters of representations of the classical groups of types A, B, C and D, namely $\text{GL}_{tn}, \text{SO}_{2tn+1}, \text{Sp}_{2tn}$ and $\text{O}_{2tn}$, evaluated at…
Borwein and Mossinghoff investigated the Rudin-Shapiro-like sequences, which are infinite families of binary sequences, usually represented as polynomials. Each family of Rudin-Shapiro-like sequences is obtained from a starting sequence…
We associate in a canonical way a substitution to any abstract numeration system built on a regular language. In relationship with the growth order of the letters, we define the notion of two independent substitutions. Our main result is…
The Stern sequence (s(n)) is defined by s(0) = 0, s(1) = 1, s(2n) = s(n), s(2n+1) = s(n) + s(n+1). Stern showed in 1858 that gcd(s(n),s(n+1)) = 1, and that for every pair of relatively prime positive integers (a,b), there exists a unique n…
In this short survey article, we present an elementary, yet quite powerful, method of enumerating independent sets in graphs. This method was first employed more than three decades ago by Kleitman and Winston and has subsequently been used…
This work represents an in-depth study of the structural behavior of the Collatz sequences. We consider a finite arithmetic progression with a common difference is 2 and the number of terms in the sequence is equal to 2^n . After, we…
If a group $G$ is $\pi$-separable, where $\pi$ is a set of primes, the set of irreducible characters $\operatorname{B}_{\pi}(G) \cup \operatorname{B}_{\pi'}(G)$ can be defined. In this paper, we prove that there are variants of some…
Let F be a non-archimedean local field and G be the group GL(N,F). Let \pi be a smooth complex representation of G lying in the Bernstein block B(\pi) of some simple type in the sense of Bushnell and Kutzko. Refining the approach of the…
Labeled infinite trees provide combinatorial interpretations for many integer sequences generated by nested recurrence relations. Typically, such sequences are monotone increasing. Several of these sequences also have straightforward…
For a finite group $G$, let $\Delta(G)$ denote the character graph built on the set of degrees of the irreducible complex characters of $G$. Akhlaghi and Tong-Viet in \cite{[AT]} conjectured that if for some positive integer $n$,…
An operational approach to the Collatz Conjecture is presented. Scenarios are defined as strings of characters "s" (for "spike") and "d" (for "down") which symbolize the Collatz operations (3m+1)/2 and m/2 in a Collatz Series connecting two…
We introduce and analyze a three-parameter family of self-referential integer sequences $S(x,y,z)$: starting from $a(1)=x$, each term advances by $y$ when the index $k$ has already appeared as a value and by $z$ otherwise. This simple rule…
It is a fun game to complete a partial character table of a finite group. We show that one can reconstruct a missing row or column from a given table. The proof relies on deep properties of fully ramified characters. Moreover, we extend a…
Let $p$ be a prime. For $p=2$, the fields of values of the complex irreducible characters of finite groups whose degrees are not divisible by $p$ have been classified; for odd primes $p$, a conjectural classification has been proposed. In…
In 1980, R. Tijdeman provided an on-line algorithm that generates sequences over a finite alphabet with minimal discrepancy, that is, such that the occurrence of each letter optimally tracks its frequency. In this article, we define…