This paper considers the (n, k)-Bernoulli-Laplace model in the case when there are two urns, the total number of red and white balls is the same, and the number of selections k at each step is on the same asymptotic order as the number of balls n in each urn. Our main focus is on the large-time behavior of the corresponding Markov chain tracking the number of red balls in a given urn. Under reasonable assumptions on the asymptotic behavior of the ratio k/n as n → ∞, cutoff in the total variation distance is established. A cutoff window is also provided. These results, in particular, partially resolve an open problem posed by Eskenazis and Nestoridi in [8].
We study three operations on Riordan arrays. First, we investigate when the sum of Riordan arrays yields another Riordan array. We characterize the A-and Z-sequences of these sums of Riordan arrays, and also identify an analog for A-sequences when the sum of Riordan arrays does not yield a Riordan array. In addition, we define the new operations 'Der' and 'Flip' on Riordan arrays. We fully characterize the Riordan arrays resulting from these operations applied to the Appell and Lagrange subgroups of the Riordan group. Finally, we study the application of these operations to various known Riordan arrays, generating many combinatorial identities in the process.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.