activity
20082026
most citedOrientable sequences over non-binary alphabets

4 citations · 5 across the 10 of their papers we have counts for

collaborators

10 papers

math.PR2026

Block-hierarchical covariance decompositions for finite-block additive functionals

Abbas Alhakim

We study additive functionals of stationary Markov chains whose observables depend on a fixed finite block of consecutive states. Such block observables arise naturally in sliding-…

math.ST2026

Overlapping window tests for correlation and trend

Abbas Alhakim

We develop a general framework for constructing and analyzing overlapping sliding-window statistics for dependence and trend detection. For a fixed window size, the overlapping blo…

math.CO2024

Subdivisions of Oriented Cycles in Digraphs with Hamiltonian directed path

Abbas Alhakim, Mouhamad El Joubbeh

Cohen et al. conjectured that for every oriented cycle there exist an integer such that every strong -chromatic digraph contains a subdivision of . El Joubbeh c…

math.CO2024★ 4 cited

Orientable sequences over non-binary alphabets

Abbas Alhakim, Chris J. Mitchell, Janusz Szmidt +1

We describe new, simple, recursive methods of construction for orientable sequences over an arbitrary finite alphabet, i.e. periodic sequences in which any sub-sequence of n consec…

math.CO2022

Nonbinary Counterparts of the Prefer-Same and Prefer-Opposite de Bruijn Sequences

Abbas Alhakim

The well known prefer-one, prefer-opposite, and prefer-same binary de Bruijn sequences are all constructed using simple preference rules. We apply the technique of preference funct…

cs.DM2020

Efficient constructions of the Prefer-same and Prefer-opposite de Bruijn sequences

Evan Sala, Joe Sawada, Abbas Alhakim

The greedy Prefer-same de Bruijn sequence construction was first presented by Eldert et al.[AIEE Transactions 77 (1958)]. As a greedy algorithm, it has one major downside: it requi…