20 research outputs found
Words in Linear Groups, Random Walks, Automata and P-Recursiveness
Fix a finite set . Denote by the number
of products of matrices in of length that are equal to 1. We show that
the sequence is not always P-recursive. This answers a question of
Kontsevich.Comment: 10 pages, 1 figur
Counting With Irrational Tiles
We introduce and study the number of tilings of unit height rectangles with
irrational tiles. We prove that the class of sequences of these numbers
coincides with the class of diagonals of N-rational generating functions and a
class of certain binomial multisums. We then give asymptotic applications and
establish connections to hypergeometric functions and Catalan numbers
Using TPA to count linear extensions
A linear extension of a poset is a permutation of the elements of the set
that respects the partial order. Let denote the number of linear
extensions. It is a #P complete problem to determine exactly for an
arbitrary poset, and so randomized approximation algorithms that draw randomly
from the set of linear extensions are used. In this work, the set of linear
extensions is embedded in a larger state space with a continuous parameter ?.
The introduction of a continuous parameter allows for the use of a more
efficient method for approximating called TPA. Our primary result is
that it is possible to sample from this continuous embedding in time that as
fast or faster than the best known methods for sampling uniformly from linear
extensions. For a poset containing elements, this means we can approximate
to within a factor of with probability at least using an expected number of random bits and comparisons in the poset
which is at most Comment: 12 pages, 4 algorithm