DeepAI AI Chat
Log In Sign Up

Surjective polymorphisms of reflexive cycles

06/22/2022
by   Isabelle Larivière, et al.
0

A reflexive cycle is any reflexive digraph whose underlying undirected graph is a cycle. Call a relational structure Slupecki if its surjective polymorphisms are all essentially unary. We prove that all reflexive cycles of girth at least 4 have this property.

READ FULL TEXT

page 1

page 2

page 3

page 4

04/22/2022

Lengths of Cycles in Generalized Pancake Graphs

In this paper, we consider the lengths of cycles that can be embedded on...
08/22/2020

On Cycles of Generalized Collatz Sequences

We explore the cycles and convergence of Generalized Collatz Sequence, w...
02/19/2023

On Existence of Must-Include Paths and Cycles in Undirected Graphs

Given an undirected graph G=(V,E) and vertices s,t,w_1,w_2∈ V, we study ...
10/01/2020

On the recursive structure of multigrid cycles

A new non-adaptive recursive scheme for multigrid algorithms is introduc...
10/26/2020

Modeling Long Cycles

Recurrent boom-and-bust cycles are a salient feature of economic and fin...
05/29/2014

JPEG Noises beyond the First Compression Cycle

This paper focuses on the JPEG noises, which include the quantization no...
11/18/2020

Further Results on Pure Summing Registers and Complementary Ones

We decide completely the cycle structure of pure summing register (PSR) ...