Add to ORKGWe characterize the finite graph algebras which are dualizable. Indeed, a finite graph algebra is dualizable if and only if each connected component of the underlying graph is either complete or bipartite complete (or a single point)
We investigate the dualisability problem for finite relational structures and highlight differences ...
Abstract. We show that a finite algebra must be inherently non-dualisable if the variety that it gen...
AbstractWe give an example of a finite algebra which is dualizable but not fully dualizable in the s...
. We characterize the finite graph algebras which are dualizable. Indeed, a finite graph algebra is ...
AbstractWe characterize the finite graph algebras which are dualizable. Indeed, a finite graph algeb...
We prove that among nite graph algebras and among finite flat graph algebras, dualizability, full du...
We prove that among finite graph algebras and among finite flat graph algebras, dualizability, full ...
We address the problem of proving that a finite algebraM is dualizable, or strongly dualizable, in t...
Abstract. We give an example of a finite algebra which is dualizable but not fully dualizable in the...
AbstractIn this paper we study dualities of graphs and, more generally, relational structures with r...
Abstract. While every finite lattice-based algebra is dualisable, the same is not true of semilattic...
The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cu...
The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cu...
AbstractWe investigate ways in which certain binary homomorphisms of a finite algebra can guarantee ...
In (2), Brian Davey poses the question: "Which finite algebras admit a duality?" The answer to this ...
We investigate the dualisability problem for finite relational structures and highlight differences ...
Abstract. We show that a finite algebra must be inherently non-dualisable if the variety that it gen...
AbstractWe give an example of a finite algebra which is dualizable but not fully dualizable in the s...
. We characterize the finite graph algebras which are dualizable. Indeed, a finite graph algebra is ...
AbstractWe characterize the finite graph algebras which are dualizable. Indeed, a finite graph algeb...
We prove that among nite graph algebras and among finite flat graph algebras, dualizability, full du...
We prove that among finite graph algebras and among finite flat graph algebras, dualizability, full ...
We address the problem of proving that a finite algebraM is dualizable, or strongly dualizable, in t...
Abstract. We give an example of a finite algebra which is dualizable but not fully dualizable in the...
AbstractIn this paper we study dualities of graphs and, more generally, relational structures with r...
Abstract. While every finite lattice-based algebra is dualisable, the same is not true of semilattic...
The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cu...
The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cu...
AbstractWe investigate ways in which certain binary homomorphisms of a finite algebra can guarantee ...
In (2), Brian Davey poses the question: "Which finite algebras admit a duality?" The answer to this ...
We investigate the dualisability problem for finite relational structures and highlight differences ...
Abstract. We show that a finite algebra must be inherently non-dualisable if the variety that it gen...
AbstractWe give an example of a finite algebra which is dualizable but not fully dualizable in the s...