Zobrazeno 1 - 10
of 3 331
pro vyhledávání: '"Rampersad A"'
Publikováno v:
Patient Preference and Adherence, Vol Volume 16, Pp 3229-3239 (2022)
Isaac A Janson,1 Ellen M Bloom,1 Kisha C Hampton,1 Emily Riehm Meier,1 Angeli G Rampersad,1 William G Kronenberger2 1Indiana Hemophilia and Thrombosis Center, Indianapolis, IN, USA; 2Department of Psychiatry, Indiana University School of Medicine, In
Externí odkaz:
https://doaj.org/article/0c46bfd65ac442db83f3dbafb36244f3
The critical exponent of an infinite word $\bf x$ is the supremum, over all finite nonempty factors $f$, of the exponent of $f$. In this note we show that for all integers $k\geq 2,$ there is a binary infinite $k$-automatic sequence with critical exp
Externí odkaz:
http://arxiv.org/abs/2406.06513
Autor:
Currie, James D., Rampersad, Narad
It is known that there are infinite words over finite alphabets with Abelian repetition threshold arbitrarily close to 1; however, the construction previously used involves huge alphabets. In this note we give a short cyclic morphism (length 13) over
Externí odkaz:
http://arxiv.org/abs/2312.16665
Autor:
Currie, James D., Rampersad, Narad
A $4^-$-power is a non-empty word of the form $XXXX^-$, where $X^-$ is obtained from $X$ by erasing the last letter. A binary word is called {\em faux-bonacci} if it contains no $4^-$-powers, and no factor 11. We show that faux-bonacci words bear the
Externí odkaz:
http://arxiv.org/abs/2311.12962
Autor:
Currie, James, Rampersad, Narad
We find the lexicographically least infinite binary rich word having critical exponent $2+\sqrt{2}/2$
Externí odkaz:
http://arxiv.org/abs/2310.07010
Autor:
Narcia-Macias, Christian I., Guardado, Joselito, Rodriguez, Jocell, Rampersad-Ammons, Joanne, Enriquez, Erik, Kim, Dong-Chul
Utilizing computer vision and the latest technological advancements, in this study, we developed a honey bee monitoring system that aims to enhance our understanding of Colony Collapse Disorder, honey bee behavior, population decline, and overall hiv
Externí odkaz:
http://arxiv.org/abs/2309.08955
Autor:
Rampersad, Narad, Wiebe, Max
If $u$ and $v$ are two words, the correlation of $u$ over $v$ is a binary word that encodes all possible overlaps between $u$ and $v$. This concept was introduced by Guibas and Odlyzko as a key element of their method for enumerating the number of wo
Externí odkaz:
http://arxiv.org/abs/2309.07070
Autor:
Rampersad, Narad, Wiebe, Max
Wu showed that certain sums of products of binomial coefficients modulo 2 are given by the run length transforms of several famous linear recurrence sequences, such as the positive integers, the Fibonacci numbers, the extended Lucas numbers, and Nara
Externí odkaz:
http://arxiv.org/abs/2309.04012
Publikováno v:
Patient Preference and Adherence, Vol 2016, Iss Issue 1, Pp 983-992 (2016)
Natalie A Duncan,1 William G Kronenberger,2 Kisha C Hampton,1 Ellen M Bloom,1 Angeli G Rampersad,1 Christopher P Roberson,1 Amy D Shapiro11Department of Hematology, Indiana Hemophilia and Thrombosis Center, 2Department of Psychiatry, Indiana Universi
Externí odkaz:
https://doaj.org/article/ad3df6c4668049d5af0e02c5d159a84b
Autor:
Rampersad, Narad, Shallit, Jeffrey
We show how to obtain, via a unified framework provided by logic and automata theory, many classical results of Brillhart and Morton on Rudin-Shapiro sums. The techniques also facilitate easy proofs for new results.
Comment: This is the full ver
Comment: This is the full ver
Externí odkaz:
http://arxiv.org/abs/2302.00405