Sciweavers

Share
6 search results - page 1 / 2
» A Concise Proof of the Littlewood-Richardson Rule
Sort
View
COMBINATORICS
2002
89views more  COMBINATORICS 2002»
9 years 11 months ago
A Concise Proof of the Littlewood-Richardson Rule
We give a short proof of the Littlewood-Richardson rule using a sign-reversing involution.
John R. Stembridge
COMBINATORICS
2004
63views more  COMBINATORICS 2004»
9 years 11 months ago
A Positive Proof of the Littlewood-Richardson Rule using the Octahedron Recurrence
Allen Knutson, Terence Tao, Christopher Woodward
CSFW
2010
IEEE
10 years 3 months ago
Constraining Credential Usage in Logic-Based Access Control
—Authorization logics allow concise specification of flexible access-control policies, and are the basis for logic-based access-control systems. In such systems, resource owner...
Lujo Bauer, Limin Jia, Divya Sharma
ICFP
2007
ACM
10 years 11 months ago
Ott: effective tool support for the working semanticist
It is rare to give a semantic definition of a full-scale programming language, despite the many potential benefits. Partly this is because the available metalanguages for expressi...
Peter Sewell, Francesco Zappa Nardelli, Scott Owen...
FUIN
2007
90views more  FUIN 2007»
9 years 11 months ago
A Resolution Calculus with Shared Literals
We present a resolution calculus for first-order logic using a more concise formalism for representing sets of clauses. The idea is to represent the clause set at hand as a Direct...
Nicolas Peltier
books