#### Filter Results:

#### Publication Year

2004

2014

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

1. INTRODUCTION. It is natural to use integer matrices for examples and exercises when teaching a linear algebra course, or, for that matter, when writing a textbook in the subject. After all, integer matrices offer a great deal of algebraic simplicity for particular problems. This, in turn, lets students focus on the concepts. Of course, to insist on… (More)

The game You walk into a casino, and just inside the main entrance you see a new game to play—the Multiplication Game. You sit at a table opposite the dealer and place your bet. The dealer hits a button and from a slot in the table comes a slip of paper with a number on it that you cannot see. You use a keypad to choose a number of your own—any positive… (More)

The combinatorial theory of species developed by Joyal provides a foundation for enumerative combinatorics of objects constructed from finite sets. In this paper we develop an analogous theory for the enumerative combinatorics of objects constructed from vector spaces over finite fields. Examples of these objects include subspaces, flags of subspaces,… (More)

The semigroup game is a two-person zero-sum game defined on a semigroup (S, ·) as follows: Players 1 and 2 choose elements x ∈ S and y ∈ S, respectively, and player 1 receives a payoff f (xy) defined by a function f : S → [−1, 1]. If the semigroup is amenable in the sense of Day and von Neumann, one can extend the set of classical strategies, namely… (More)

In a guessing game, players guess the value of a random real number selected using some probability density function. The winner may be determined in various ways; for example, a winner can be a player whose guess is closest in magnitude to the target, or a winner can be a player coming closest without guessing higher than the target. We study optimal… (More)

We develop an analog of the exponential families of Wilf in which the label sets are finite dimensional vector spaces over a finite field rather than finite sets of positive integers. The essential features of exponential families are preserved, including the exponential formula relating the deck enumerator and the hand enumerator.

- ‹
- 1
- ›