Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Physical Sciences and Mathematics
Finite Factors Of Bernoulli Schemes And Distinguishing Labelings Of Directed Graphs, Andrew Lazowski, Stephen M. Shea
Finite Factors Of Bernoulli Schemes And Distinguishing Labelings Of Directed Graphs, Andrew Lazowski, Stephen M. Shea
Mathematics Faculty Publications
A labeling of a graph is a function from the vertices of the graph to some finite set. In 1996, Albertson and Collins defined distinguishing labelings of undirected graphs. Their definition easily extends to directed graphs. Let G be a directed graph associated to the k -block presentation of a Bernoulli scheme X . We determine the automorphism group of G , and thus the distinguishing labelings of G . A labeling of G defines a finite factor of X . We define demarcating labelings and prove that demarcating labelings define finitarily Markovian finite factors of X . We use …
On A Pair Of Identities From Ramanujan's Lost Notebook, James Mclaughlin, Andrew Sills
On A Pair Of Identities From Ramanujan's Lost Notebook, James Mclaughlin, Andrew Sills
Mathematics Faculty Publications
Using a pair of two variable series-product identities recorded by Ramanujan in the lost notebook as inspiration, we find some new identities of similar type. Each identity immediately implies an infinite family of Rogers-Ramanujan type identities, some of which are well-known identities from the literature. We also use these identities to derive some general identities for integer partitions.