Related papers: Character Values of Stanley Sequences

The character theory of finite groups has numerous basic questions that are often already quite involved: enumerating of irreducible characters, their character formulas, point-wise product decompositions, and restriction/induction between…

We develop a lower bound sieve for primes under the (unlikely) assumption of infinitely many exceptional characters. Compared with the illusory sieve due to Friedlander and Iwaniec which produces asymptotic formulas, we show that less…

Motivated by the change-making problem, we extend the notion of greediness to sets of positive integers not containing the element $1$, and from there to numerical semigroups. We provide an algorithm to determine if a given set (not…

In 2009, Grant, Shallit, and Stoll constructed a large family of pseudorandom sequences, called generalized Rudin--Shapiro sequences, for which they established some results about the average of discrete correlation coefficients of order 2…

The first author introduced a sequence of polynomials (\cite{8}, sequence A174531) defined recursively. One of the main results of this study is proof of the integrality of its coefficients.

Iterative methods play an important role in science and engineering applications, with uses ranging from linear system solvers in finite element methods to optimization solvers in model predictive control. Recently, a new computational…

A fundamental concept related to strings is that of repetitions. It has been extensively studied in many versions, from both purely combinatorial and algorithmic angles. One of the most basic questions is how many distinct squares, i.e.,…

Given an integer $n$, let $G(n)$ be the number of integer sequences $n-1\ge d_1\ge d_2\ge\dotsb\ge d_n\ge 0$ that are the degree sequence of some graph. We show that $G(n)=(c+o(1))4^n/n^{3/4}$ for some constant $c>0$, improving both the…

We study one-character CFTs obtained as one-character extensions of the tensor products of a single CFT $\mathcal{C}$. The motivation comes from the fact that $28$ of the $71$ CFTs in the Schelleken's list of $c = 24$ CFTs are such CFTs. We…

Construction sequences are a general method of building symbolic shifts that capture cut-and-stack constructions and are general enough to give symbolic representations of Anosov-Katok diffeomorphisms. We show here that any finite entropy…

We report a rigorous theory to show the origin of the unexpected periodic behavior seen in the consecutive differences between prime numbers. We also check numerically our findings to ensure that they hold for finite sequences of primes,…

Given a finite group G, let cd(G) denote the set of degrees of the irreducible complex characters of G. The character degree graph of G is defined as the simple undirected graph whose vertices are the prime divisors of the numbers in cd(G),…

We give a new characterization of generalized B\"uchi sequences (sequences whose sequence of squares has constant second difference $(a)$, for some fixed integer $a$) of length 3 over the integers and a strategy for attacking B\"uchi's n…

For any irrational $\alpha > 0$ and any initial value $z_{-1} \in \mathbb{C}$, we define a sequence of complex numbers $(z_n)_{n=0}^{\infty}$ as follows: $z_n$ is $z_{n-1} + e^{2 \pi i \alpha n}$ or $z_{n-1} - e^{2 \pi i \alpha n}$,…

Let $\pi_n$ be a uniformly chosen random permutation on $[n]$. The authors of [2] showed that the expected number of distinct consecutive patterns of all lengths $k\in\{1,2,\ldots,n\}$ in $\pi_n$ was $\frac{n^2}{2}(1-o(1))$ as $n\to\infty$,…

The principal permanent rank characteristic sequence is a binary sequence $r_0 r_1 \ldots r_n$ where $r_k = 1$ if there exists a principal square submatrix of size $k$ with nonzero permanent and $r_k = 0$ otherwise, and $r_0 = 1$ if there…

Rational CFT's are classified by an integer $\ell$, the number of zeroes of the Wronskian of their characters in moduli space. For $\ell=0$ they satisfy non-singular modular-invariant differential equations, while for $\ell>0$ the…

It is shown that pairs of maximal linear recursive sequences (m-sequences) typically have mean square aperiodic crosscorrelation on par with that of random sequences, but that if one takes a pair of m-sequences where one is the reverse of…

Orientable sequences of order n are infinite periodic sequences with symbols drawn from a finite alphabet of size k with the property that any particular subsequence of length n occurs at most once in a period in either direction. They were…

Let the sequence S_m of nonnegative integers be generated by the following conditions: Set the first term a_0 = 0, and for all k \geq 0, let a_k+1 be the least integer greater than a_k such that no element of {a_0,...,a_k+1} is the average…