Loop conditions for strongly connected digraphs-Reference-Cited by-同舟云学术

Loop conditions for strongly connected digraphs

Published:2019-12-02 Issue:03 Volume:30 Page:467-499
ISSN:0218-1967
Container-title:International Journal of Algebra and Computation
language:en
Short-container-title:Int. J. Algebra Comput.

Author:

Olšák Miroslav¹²

Affiliation:

1. Faculty of Mathematics and Physics, Charles University in Prague, Sokolovská 83, Praha 8, Czechia

2. Department of Computer Science, University of Innsbruck, Technikerstraße 21a, Innsbruck, Austria

Abstract

We prove that every strongly connected (not necessarily finite) digraph of algebraic length 1, which is compatible with an operation [Formula: see text] satisfying a non-trivial identity of the form [Formula: see text], has a loop.

Publisher

World Scientific Pub Co Pte Lt

Subject

General Mathematics

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0218196720500083

Reference22 articles.

1. Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem

2. Dagstuhl Follow-Ups;Barto L.,2017

3. The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)

4. Dagstuhl Follow-Ups;Barto L.,2017

5. The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Topology and Adjunction in Promise Constraint Satisfaction;SIAM Journal on Computing;2023-02-14

2. Local–global property for G-invariant terms;International Journal of Algebra and Computation;2022-06-21

3. Smooth digraphs modulo primitive positive constructability and cyclic loop conditions;International Journal of Algebra and Computation;2021-06-24

4. The local loop lemma;Algebra universalis;2020-02-19