730 search results - page 6 / 146 » Combinatorics of Monotone Computations |
DM
2008
13 years 7 months ago
2008
Extremal Combinatorics is one of the central areas in Discrete Mathematics. It deals with problems that are often motivated by questions arising in other areas, including Theoreti...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Here, we present a family of time series with a simple growth constraint. This family can be the basis of a model to apply to emerging computation in business and micro-economy wh...
LICS
2007
IEEE
14 years 1 months ago
2007
IEEE
We show how to construct the category of games and innocent strategies from a more primitive category of games. On that category we define a comonad and monad with the former dis...
ICALP
2001
Springer
13 years 12 months ago
2001
Springer
We consider the set Gn of all period sets of strings of length n over a finite alphabet. We show that there is redundancy in period sets and introduce the notion of an irreducibl...
JCT
2010
13 years 5 months ago
2010
We study a q-analog Qr(n, q) of the partition algebra Pr(n). The algebra Qr(n, q) arises as the centralizer algebra of the finite general linear group GLn(Fq) acting on a vector ...