Maltsev digraphs have a majority polymorphism
نویسنده
چکیده
We prove that when a digraph G has a Maltsev polymorphism, then G also has a ma jority polymorphism. We consider the consequences of this result for the structure of Maltsev digraphs and the complexity of the Constraint Satisfaction Problem.
منابع مشابه
On Maltsev Digraphs
We study digraphs preserved by a Maltsev operation: Maltsev digraphs. We show that these digraphs retract either onto a directed path or to the disjoint union of directed cycles, showing in this way that the constraint satisfaction problem for Maltsev digraphs is in logspace, L. We then generalize results from Kazda (2011) to show that a Maltsev digraph is preserved not only by a majority opera...
متن کاملSecond order conservative languages with a Maltsev polymorphism also have a majority polymorphism
Second order conservative languages with a Maltsev polymorphism also have a majority polymorphism. Abstract The paper proves that for any second order conservative constraint language with a Maltsev polymorphism there is a majority polymor-phism. Moreover, the majority polymorphism can be defined by the Maltsev polymorphism.
متن کاملDeciding some Maltsev conditions in finite idempotent algebras
In this paper we investigate the computational complexity of deciding if a given finite algebraic structure satisfies a certain type of existential condition on its set of term operations. These conditions, known as Maltsev conditions, have played a central role in the classification, study, and applications of general algebraic structures. Several well studied properties of equationally define...
متن کامل0n removable cycles in graphs and digraphs
In this paper we define the removable cycle that, if $Im$ is a class of graphs, $Gin Im$, the cycle $C$ in $G$ is called removable if $G-E(C)in Im$. The removable cycles in Eulerian graphs have been studied. We characterize Eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for Eulerian graph to have removable cycles h...
متن کاملMore skew-equienergetic digraphs
Two digraphs of same order are said to be skew-equienergetic if their skew energies are equal. One of the open problems proposed by Li and Lian was to construct non-cospectral skew-equienergetic digraphs on n vertices. Recently this problem was solved by Ramane et al. In this paper, we give some new methods to construct new skew-equienergetic digraphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 32 شماره
صفحات -
تاریخ انتشار 2011