Counting of lattices containing up to $4$ reducible elements and having nullity up to $3$
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866918147586523136 |
|---|---|
| author | Bhavale, Ashok Nivrutti |
| author_facet | Bhavale, Ashok Nivrutti |
| contents | In this paper, we count all non-isomorphic lattices on $n$ elements, containing four reducible elements and having nullity three. This work is in respect of Birkhoff's open problem (which is NP-complete) of counting all finite lattices on $n$ elements. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_06736 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Counting of lattices containing up to $4$ reducible elements and having nullity up to $3$ Bhavale, Ashok Nivrutti Combinatorics 06A05, 06A06, 06A07 Primary In this paper, we count all non-isomorphic lattices on $n$ elements, containing four reducible elements and having nullity three. This work is in respect of Birkhoff's open problem (which is NP-complete) of counting all finite lattices on $n$ elements. |
| title | Counting of lattices containing up to $4$ reducible elements and having nullity up to $3$ |
| topic | Combinatorics 06A05, 06A06, 06A07 Primary |
| url | https://arxiv.org/abs/2407.06736 |