Loop conditions

2017/01/01 by Miroslav Olšák, Olšák, Miroslav
Engineering · Mathematics · #Combinatorics (math.CO) #Control and Stability of Dynamical Systems #FOS: Mathematics #Logic (math.LO) #Mathematics and Applications #Numerical methods for differential equations

paper · pdf · doi:10.48550/arxiv.1701.00260

openalex publication_date 2017/01/01 · openalex created_date 2022/10/01 · openalex updated_date 2026/07/28

Abstract

We discuss such Maltsev conditions that consist of just one linear equation, we call them loop conditions. To every such condition can be assigned a graph. We provide a classification of conditions with undirected graphs. It follows that the Siggers term is the weakest non-trivial loop condition.

Related

• A Survey of Best Monotone Degree Conditions for Graph Properties
• Non-Termination Sets of Simple Linear Loops
• The nature of loops in programming
• Loop conditions with strongly connected graphs
• Ranking Functions for Linear-Constraint Loops