Polynomial-time Tests for Difference Terms in Idempotent Varieties

11/16/2020
by   William DeMeo, et al.
0

We consider the following practical question: given a finite algebra A in a finite language, can we efficiently decide whether the variety generated by A has a difference term? We answer this question (positively) in the idempotent case and then describe algorithms for constructing difference term operations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/15/2019

Existence of cube terms in finite finitely generated clones

We study the problem of whether a given finite clone generated by finite...
research
04/07/2016

Toric Difference Variety

In this paper, the concept of toric difference varieties is defined and ...
research
08/14/2022

Analogical proportions in monounary algebras and difference proportions

This paper studies analogical proportions in monounary algebras consisti...
research
03/21/2018

The Subpower Membership Problem for Finite Algebras with Cube Terms

The subalgebra membership problem is the problem of deciding if a given ...
research
11/09/2022

Complexity of solving a system of difference constraints with variables restricted to a finite set

Fishburn developed an algorithm to solve a system of m difference constr...
research
07/17/2019

Polynomial Reduction and Super Congruences

Based on a reduction processing, we rewrite a hypergeometric term as the...
research
06/04/2023

Overlap Splines and Meshless Finite Difference Methods

We consider overlap splines that are defined by connecting the patches o...

Please sign up or login with your details

Forgot password? Click here to reset