6 search results - page 1 / 2 » A Concise Proof of the Littlewood-Richardson Rule |
COMBINATORICS
2002
13 years 4 months ago
2002
We give a short proof of the Littlewood-Richardson rule using a sign-reversing involution.
COMBINATORICS
2004
13 years 4 months ago
2004
CSFW
2010
IEEE
13 years 8 months ago
2010
IEEE
—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...
ICFP
2007
ACM
14 years 4 months ago
2007
ACM
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...
FUIN
2007
13 years 4 months ago
2007
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...