692 search results - page 6 / 139 » Combinatorics of Partial Derivatives |
COMBINATORICS
2006
14 years 9 months ago
2006
Sommerville [10] and Davies [2] classified the spherical triangles that can tile the sphere in an edge-to-edge fashion. Relaxing this condition yields other triangles, which tile ...
COMBINATORICS
2006
14 years 9 months ago
2006
In this paper, we consider matchings avoiding partial patterns 1123 and 1132. We give a bijection between 1123-avoiding matchings with n edges and nonnegative lattice paths from (...
COMBINATORICS
2000
14 years 9 months ago
2000
Bound polysemy is the property of any pair (G1, G2) of graphs on a shared vertex set V for which there exists a partial order on V such that any pair of vertices has an upper boun...
90
Voted
CADE
1994
Springer
15 years 1 months ago
1994
Springer
Pi is a system for the interactive construction and editing of formal derivations in the calculus of finitary partial inductive definitions. This calculus can be used as a logical ...
FORTE
2000
14 years 11 months ago
2000
The paper addresses the problem of test derivation from partially defined specifications. A specification is modeled by an Input/Output FSM such that transitions from some states ...