Counting of lattices containing up to five comparable reducible elements and having nullity up to three
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | Aware, B. P., Bhavale, A. N. |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
Documents similaires
Counting of lattices containing up to four comparable reducible elements and having nullity up to three
par: Aware, B. P., et autres
Publié: (2024)
par: Aware, B. P., et autres
Publié: (2024)
Counting of lattices containing up to $4$ reducible elements and having nullity up to $3$
par: Bhavale, Ashok Nivrutti
Publié: (2024)
par: Bhavale, Ashok Nivrutti
Publié: (2024)
Enumeration of lattices of nullity $k$ and containing $r$ comparable reducible elements
par: Bhavale, A. N.
Publié: (2025)
par: Bhavale, A. N.
Publié: (2025)
Dimension of RC-lattices
par: Bhavale, Ashok Nivrutti
Publié: (2025)
par: Bhavale, Ashok Nivrutti
Publié: (2025)
Equivalence of labeled graphs and lattices
par: Bhavale, Ashok Nivrutti
Publié: (2025)
par: Bhavale, Ashok Nivrutti
Publié: (2025)
Antimagic labelings of a complete graph
par: Bhavale, Dr A. N.
Publié: (2025)
par: Bhavale, Dr A. N.
Publié: (2025)
Counting up-up-or-down-down permutations
par: Gessel, Ira M.
Publié: (2024)
par: Gessel, Ira M.
Publié: (2024)
The stable maximum nullity of digraphs and $1$-DAGs
par: Arav, Marina, et autres
Publié: (2024)
par: Arav, Marina, et autres
Publié: (2024)
On the Characteristic polynomial of ABS Matrix and ABS-Energy of Some Graphs
par: Barde, Sharad, et autres
Publié: (2025)
par: Barde, Sharad, et autres
Publié: (2025)
Effects of edge addition or removal on the nullity of a graph
par: Batal, Ahmet
Publié: (2021)
par: Batal, Ahmet
Publié: (2021)
A family of Neumaier graphs containing examples with exactly five eigenvalues
par: De Bruyn, Bart, et autres
Publié: (2026)
par: De Bruyn, Bart, et autres
Publié: (2026)
On Tutte cycles containing three prescribed edges
par: Wigal, Michael C., et autres
Publié: (2021)
par: Wigal, Michael C., et autres
Publié: (2021)
Counting lattice triangulations: Fredholm equations in combinatorics
par: Orevkov, S. Yu.
Publié: (2022)
par: Orevkov, S. Yu.
Publié: (2022)
Counting the minimum number of arcs in an oriented graph having weak diameter 2
par: Das, Sandip, et autres
Publié: (2023)
par: Das, Sandip, et autres
Publié: (2023)
Counting filter restricted paths in $\mathbb{Z}^2$ lattice
par: Postnova, Olga, et autres
Publié: (2021)
par: Postnova, Olga, et autres
Publié: (2021)
The rank-nullity ring of a matroid
par: Fife, Tara, et autres
Publié: (2026)
par: Fife, Tara, et autres
Publié: (2026)
Even-up words and their variants
par: Fried, Sela
Publié: (2025)
par: Fried, Sela
Publié: (2025)
Blowing up Dirac's theorem
par: Lang, Richard, et autres
Publié: (2024)
par: Lang, Richard, et autres
Publié: (2024)
Blow-ups and extensions of trees in tournaments
par: Aboulker, Pierre, et autres
Publié: (2024)
par: Aboulker, Pierre, et autres
Publié: (2024)
Blow-up lemmas for sparse graphs
par: Allen, Peter, et autres
Publié: (2016)
par: Allen, Peter, et autres
Publié: (2016)
The excluded minors for three classes of 2-polymatroids having special types of natural matroids
par: Bonin, Joseph E., et autres
Publié: (2022)
par: Bonin, Joseph E., et autres
Publié: (2022)
A formula for the number of up-down words
par: Fried, Sela
Publié: (2025)
par: Fried, Sela
Publié: (2025)
The inversion number of dijoins and blow-up digraphs
par: Wang, Haozhe, et autres
Publié: (2024)
par: Wang, Haozhe, et autres
Publié: (2024)
When all directed cycles have length three
par: Seymour, Paul
Publié: (2024)
par: Seymour, Paul
Publié: (2024)
A strong nullity parameter for rooted graphs
par: Abiad, Aida, et autres
Publié: (2026)
par: Abiad, Aida, et autres
Publié: (2026)
On the Turán number of blow-ups of $\mathcal{F}_5$
par: Zhao, Xiamiao, et autres
Publié: (2026)
par: Zhao, Xiamiao, et autres
Publié: (2026)
Counting lattice points that appear as algebraic invariants of Cameron-Walker graphs
par: Faridi, Sara, et autres
Publié: (2024)
par: Faridi, Sara, et autres
Publié: (2024)
On the nullities of quartic circulant graphs and their extremal null spaces
par: Damnjanović, Ivan
Publié: (2022)
par: Damnjanović, Ivan
Publié: (2022)
Constructions of Turán systems that are tight up to a multiplicative constant
par: Pikhurko, Oleg
Publié: (2024)
par: Pikhurko, Oleg
Publié: (2024)
Independent transversal blow-up of graphs
par: Dai, Tianjiao, et autres
Publié: (2025)
par: Dai, Tianjiao, et autres
Publié: (2025)
Counting edges in factorization graphs of numerical semigroup elements
par: Moschetti, Mariah, et autres
Publié: (2024)
par: Moschetti, Mariah, et autres
Publié: (2024)
Realizations with five subsquares
par: Kemp, Tara
Publié: (2024)
par: Kemp, Tara
Publié: (2024)
Enumeration of spanning trees and resistance distances of generalized blow-up graphs
par: Liu, Hechao, et autres
Publié: (2025)
par: Liu, Hechao, et autres
Publié: (2025)
A stepping-up lemma for monotone paths with bounded color complexity
par: Choi, Jigang, et autres
Publié: (2026)
par: Choi, Jigang, et autres
Publié: (2026)
Efficient Weighted Counting of Multiset Derangements
par: Ekhad, Shalosh B., et autres
Publié: (2025)
par: Ekhad, Shalosh B., et autres
Publié: (2025)
Direct constructions of some group divisible designs with block size $4$ and up to $50$ points
par: Abel, R. Julian. R., et autres
Publié: (2024)
par: Abel, R. Julian. R., et autres
Publié: (2024)
On cubic graphs having the maximal coalition number
par: Dobrynin, Andrey A., et autres
Publié: (2024)
par: Dobrynin, Andrey A., et autres
Publié: (2024)
A bijection between edges of the Turán graph and irreducible elements in the dominance order lattice
par: Hassler, Nathanaël
Publié: (2026)
par: Hassler, Nathanaël
Publié: (2026)
Stiffness matrices of graph blow-ups and the $d$-dimensional algebraic connectivity of complete bipartite graphs
par: Jung, Yunseong, et autres
Publié: (2025)
par: Jung, Yunseong, et autres
Publié: (2025)
An $O(n\log^2n)$ Algorithm for Computing Hankel Determinants up to Order $n$
par: Liu, Feihu, et autres
Publié: (2025)
par: Liu, Feihu, et autres
Publié: (2025)
Documents similaires
-
Counting of lattices containing up to four comparable reducible elements and having nullity up to three
par: Aware, B. P., et autres
Publié: (2024) -
Counting of lattices containing up to $4$ reducible elements and having nullity up to $3$
par: Bhavale, Ashok Nivrutti
Publié: (2024) -
Enumeration of lattices of nullity $k$ and containing $r$ comparable reducible elements
par: Bhavale, A. N.
Publié: (2025) -
Dimension of RC-lattices
par: Bhavale, Ashok Nivrutti
Publié: (2025) -
Equivalence of labeled graphs and lattices
par: Bhavale, Ashok Nivrutti
Publié: (2025)