scientific article; zbMATH DE number 7283878
From MaRDI portal
Publication:5139691
zbMath1457.06002MaRDI QIDQ5139691
Publication date: 10 December 2020
Full work available at URL: http://ajc.maths.uq.edu.au/pdf/78/ajc_v78_p073.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Exact enumeration problems, generating functions (05A15) Combinatorics of partially ordered sets (06A07) Structure theory of lattices (06B05)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The asymptotic number of planar, slim, semimodular lattice diagrams
- A generalization of Eulerian numbers via rook placements
- Posets on up to 16 points
- Generating all finite modular lattices of a given size
- The number of orders with thirteen elements
- On a class of finite lattices
- The asymptotic number of labeled graphs with \(n\) vertices, \(q\) edges, and no isolated vertices
- A structure theorem for dismantlable lattices and enumeration
- On the number of distributive lattices
- How many ways can two composition series intersect?
- Counting finite lattices.
- Generating modular lattices of up to 30 elements
- Constructing unlabelled lattices
- The number of slim rectangular lattices.
- On the number of slim, semimodular lattices
- On the nullity of graphs
- An Inductive Algorithm to Construct Finite Lattices
- The Asymptotic Number of Lattices
- Lattices with Doubly Irreducible Elements
- Enumeration of Posets Generated by Disjoint Unions and Ordinal Sums
- The number of graded partially ordered sets
This page was built for publication: