Amanote Research

Amanote Research

    RegisterSign In

Enumeration of Partitions With Hooklengths

European Journal of Combinatorics - United States
doi 10.1016/s0195-6698(82)80011-5
Full Text
Open PDF
Abstract

Available in full text

Categories
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTheoretical Computer ScienceTopology
Date

March 1, 1982

Authors
Bruce Sagan
Publisher

Elsevier BV


Related search

Exact Enumeration of Garden of Eden Partitions

English

Efficient Enumeration of Graph Orientations With Sources

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

On Partitions With Difference Conditions

International Journal of Mathematics and Mathematical Sciences
Mathematics
2000English

Riemann Surfaces With Automorphism Groups Admitting Partitions

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1969English

Enumeration of Maps

2018English

State Enumeration With Abstract Descriptions of State Machines

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1995English

Enumeration $1$ -Genericity in the Local Enumeration Degrees

Notre Dame Journal of Formal Logic
Logic
2018English

Multistage Robust Mixed-Integer Optimization With Adaptive Partitions

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
2016English

Characterizations of Radon Partitions

Pacific Journal of Mathematics
Mathematics
1971English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy