20 citations · 100 across the 19 of their papers we have counts for
5 papers · 1 filter
Analytic Combinatorics of -Set Mappings and Their Applications
Toma Diaconescu-Grabari, Daniel Panario
A -set mapping is a function acting on a domain equipped with a partition into disjoint subsets. While standard functions represent -set mappings, generalizations to…
A general construction of Ordered Orthogonal Arrays using LFSRs
Daniel Panario, Mark Saaltink, Brett Stevens +1
In \cite{Castoldi}, $q^t \by (q+1)t$ ordered orthogonal arrays (OOAs) of strength over the alphabet $\FF_q$ were constructed using linear feedback shift register sequences (LFS…
Periods of iterations of functions with restricted preimage sizes
Rodrigo S. V. Martins, Daniel Panario, Claudio Qureshi +1
We consider random mappings on n = kr nodes with preimage sizes restricted to a set of the form {0,k}, where k = k(r) is greater than 1. We prove that T, the least common multiple…
An asymptotic formula for the number of irreducible transformation shift registers
Stephen D. Cohen, Sartaj Ul Hasan, Daniel Panario +1
We consider the problem of enumerating the number of irreducible transformation shift registers. We give an asymptotic formula for the number of irreducible transformation shift re…
A Hybrid of Darboux's Method and Singularity Analysis in Combinatorial Asymptotics
Philippe Flajolet, Eric Fusy, Xavier Gourdon +2
A ``hybrid method'', dedicated to asymptotic coefficient extraction in combinatorial generating functions, is presented, which combines Darboux's method and singularity analysis th…