Related papers: Rudin-Shapiro-Like Sequences with Maximum Asymptot…
For a prime $p\ge 5$ let $q_0,q_1,\ldots,q_{(p-3)/2}$ be the quadratic residues modulo $p$ in increasing order. We study two $(p-3)/2$-periodic binary sequences $(d_n)$ and $(t_n)$ defined by $d_n=q_n+q_{n+1}\bmod 2$ and $t_n=1$ if…
We introduce a sequence P_d of monic reciprocal polynomials with integer coefficients having the central coefficients fixed as well as the peripheral coefficients. We prove that the ratio between number of nonunimodular roots of P_d and its…
We derive Mehler--Heine type asymptotic formulas for Charlier and Meixner polynomials, and also for their associated families. These formulas provide good approximations for the polynomials in the neighborhood of $x=0,$ and determine the…
We show that the asymptotic regularity of a graded family $(I_n)_{n \ge 0}$ of homogeneous ideals in a reduced standard graded algebra, i.e., the limit $\lim_{n \rightarrow \infty} \text{reg } I_n/n$, exists in several cases; for example,…
Morton and Vivaldi defined the polynomials whose roots are parabolic parameters for a one-parameter family of polynomial maps. We call these polynomials delta factors. They conjectured that delta factors are irreducible for the family…
The study of minimal complements in a group or a semigroup was initiated by Nathanson. The notion of minimal complements and being a minimal complement leads to the notion of co-minimal pairs which was considered in a prior work of the…
We compare ordinary and symmetric variants of two classical measures of pseudorandomness for binary sequences, the $2$-adic complexity and the linear complexity. In the periodic setting, we show that for binary periodic sequences…
A set $R\subset \mathbb{N}$ is called rational if it is well-approximable by finite unions of arithmetic progressions. Examples of rational sets include many classical sets of number-theoretical origin such as the set of squarefree numbers,…
A real-valued sequence $f = \{ f(n) \}_{n \in \mathbb{N}}$ is said to be second-order holonomic if it satisfies a linear recurrence $f (n + 2) = P (n) f (n + 1) + Q (n) f (n)$ for all sufficiently large $n$, where $P, Q \in \mathbb{R}(x)$…
In previous work, the authors established various bounds for the dimensions of degree $n$ cohomology and $\Ext$-groups, for irreducible modules of semisimple algebraic groups $G$ (in positive characteristic $p$) and (Lusztig) quantum groups…
We define a three parameter family of Bell pseudo-involutions in the Riordan group. The defining sequences have generating functions that are expressible as continued fractions. We indicate that the Hankel transforms of the defining…
We investigate two Stieltjes continued fractions given by the paperfolding sequence and the Rudin-Shapiro sequence. By explicitly describing certain subsequences of the convergents $P_n(x)/Q_n(x)$ modulo $4$, we give the formal power series…
We study the family of irreducible modules for quantum affine $\lie{sl}_{n+1}$ whose Drinfeld polynomials are supported on just one node of the Dynkin diagram. We identify all the prime modules in this family and prove a unique…
A weighted recursive tree is an evolving tree in which vertices are assigned random vertex-weights and new vertices connect to a predecessor with a probability proportional to its weight. Here, we study the maximum degree and near-maximum…
Solitons in one-dimensional parity-time (PT)-symmetric periodic potentials are studied using exponential asymptotics. The new feature of this exponential asymptotics is that, unlike conservative periodic potentials, the inner and outer…
We study chains of nonzero edge ideals that are invariant under the action of the monoid $\mathrm{Inc}$ of increasing functions on the positive integers. We prove that the sequence of Castelnuovo--Mumford regularity of ideals in such a…
We give a new characterization of maximal repetitions (or runs) in strings based on Lyndon words. The characterization leads to a proof of what was known as the "runs" conjecture (Kolpakov \& Kucherov (FOCS '99)), which states that the…
The change-making problem consists of representing a certain amount of money with the least possible number of coins, from a given, pre-established set of denominations. The greedy algorithm works by choosing the coins of largest possible…
We apply round-off to planar rotations, obtaining a one-parameter family of invertible maps of a two-dimensional lattice. As the angle of rotation approaches pi/2, the fourth iterate of the map produces piecewise-rectilinear motion, which…
The starting point of this paper is a duality for sequences of natural numbers which, under mild hypotheses, interchanges subadditive and superadditive sequences and inverts their asymptotic growth constants. We are motivated to explore…