Sciweavers

692 search results - page 10 / 139
» Combinatorics of Partial Derivatives
Sort
View
COMBINATORICS
2000
74views more  COMBINATORICS 2000»
13 years 10 months ago
Frequency Squares and Affine Designs
The known methods for constructing complete sets of mutually orthogonal frequency squares all yield one of two parameter sets. We show that almost all these constructions can be d...
Vassili C. Mavron
IANDC
2010
121views more  IANDC 2010»
13 years 7 months ago
Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms
The Curry-Howard correspondence connects derivations in natural deduction with the lambdacalculus. Predicates are types, derivations are terms. This supports reasoning from assump...
Murdoch James Gabbay, Dominic P. Mulligan
COMBINATORICS
2006
115views more  COMBINATORICS 2006»
13 years 10 months ago
Chains, Subwords, and Fillings: Strong Equivalence of Three Definitions of the Bruhat Order
Let Sn be the group of permutations of [n] = {1, . . . , n}. The Bruhat order on Sn is a partial order relation, for which there are several equivalent definitions. Three well-kno...
Catalin Zara
COMBINATORICS
2006
131views more  COMBINATORICS 2006»
13 years 10 months ago
Encores on Cores
We give a new derivation of the threshold of appearance of the k-core of a random graph. Our method uses a hybrid model obtained from a simple model of random graphs based on rand...
Julie Cain, Nicholas C. Wormald
COMBINATORICS
2006
113views more  COMBINATORICS 2006»
13 years 10 months ago
Inversions Within Restricted Fillings of Young Tableaux
In this paper we study inversions within restricted fillings of Young tableaux. These restricted fillings are of interest because they describe geometric properties of certain sub...
Sarah Iveson