Clones of pivotally decomposable operations Bruno Teheux joint work - - PowerPoint PPT Presentation

clones of pivotally decomposable operations
SMART_READER_LITE
LIVE PREVIEW

Clones of pivotally decomposable operations Bruno Teheux joint work - - PowerPoint PPT Presentation

Clones of pivotally decomposable operations Bruno Teheux joint work with Miguel Couceiro Mathematics Research Unit University of Luxembourg Motivation Shannon decomposition of operations f : { 0 , 1 } n { 0 , 1 } : f ( x ) = x k f ( x 1 k )


slide-1
SLIDE 1

Clones of pivotally decomposable operations

Bruno Teheux

joint work with Miguel Couceiro

Mathematics Research Unit University of Luxembourg

slide-2
SLIDE 2

Motivation

Shannon decomposition of operations f : {0, 1}n → {0, 1}: f (x) = xkf (x1

k) + (1 − xk)f (x0 k),

where · xa

k is obtained from x by replacing its kth component by a.

slide-3
SLIDE 3

Motivation

Shannon decomposition of operations f : {0, 1}n → {0, 1}: f (x) = xkf (x1

k) + (1 − xk)f (x0 k),

Median decomposition of polynomial operations over bounded DL: f (x) = med(xk, f (x1

k), f (x0 k)),

where · xa

k is obtained from x by replacing its kth component by a.

· med(x, y, z) = (x ∧ y) ∨ (x ∧ z) ∨ (y ∧ z)

slide-4
SLIDE 4

Motivation

Shannon decomposition of operations f : {0, 1}n → {0, 1}: f (x) = xkf (x1

k) + (1 − xk)f (x0 k),

Median decomposition of polynomial operations over bounded DL: f (x) = med(xk, f (x1

k), f (x0 k)),

where · xa

k is obtained from x by replacing its kth component by a.

· med(x, y, z) = (x ∧ y) ∨ (x ∧ z) ∨ (y ∧ z) Goal: Uniform approach of these decomposition schemes.

slide-5
SLIDE 5

Pivotal decomposition

A set and 0, 1 ∈ A Let Π: A3 → A an operation

  • Definition. An operation f : An → A is Π-decomposable if

f (x) = Π(xk, f (x1

k), f (x0 k))

for all x ∈ An and all k ≤ n.

slide-6
SLIDE 6

Pivotal decomposition

A set and 0, 1 ∈ A Let Π: A3 → A an operation that satisfies the equation Π(x, y, y) = y. Such a Π is called a pivotal operation. In this talk, all Π are pivotal.

  • Definition. An operation f : An → A is Π-decomposable if

f (x) = Π(xk, f (x1

k), f (x0 k))

for all x ∈ An and all k ≤ n.

slide-7
SLIDE 7

Examples

f (x) = Π(xk, f (x1

k), f (x0 k))

Shannon decomposition: Π(x, y, z) = xy + (1 − x)z Median decomposition: Π(x, y, z) = med(x, y, z) Benefits: · uniformly isolate the marginal contribution of a factor · repeated applications lead to normal form representations · lead to characterization of operation classes ΛΠ := {f | f is Π-decomposable}

slide-8
SLIDE 8

ΛΠ = {f | f is Π-decomposable} Problem. Characterize those ΛΠ which are clones.

slide-9
SLIDE 9

ΛΠ = {f | f is Π-decomposable} Problem. Characterize those ΛΠ which are clones. Π(x, 1, 0) = x (P) Π(Π(x, y, z), u, v) = Π(x, Π(y, u, v), Π(z, u, v)) (AD)

slide-10
SLIDE 10

ΛΠ = {f | f is Π-decomposable} Problem. Characterize those ΛΠ which are clones. Π(x, 1, 0) = x (P) Π(Π(x, y, z), u, v) = Π(x, Π(y, u, v), Π(z, u, v)) (AD)

  • Proposition. If Π |

= (AD), the following are equivalent (i) ΛΠ is a clone (ii) ΛΠ | = (P)

slide-11
SLIDE 11

Clones of pivotally decomposable Boolean operations

(P) + (AD) = ⇒ ΛΠ is a clone (⋆)

  • Example. For a Boolean clone C, the following are equivalent

(i) There is Π such that C = ΛΠ

slide-12
SLIDE 12

Clones of pivotally decomposable Boolean operations

(P) + (AD) = ⇒ ΛΠ is a clone (⋆)

  • Example. For a Boolean clone C, the following are equivalent

(i) There is Π such that C = ΛΠ (ii) C is the clone of (monotone) Boolean functions What about the converse of (⋆)?

slide-13
SLIDE 13

The case of Π-decomposable Π

Π(Π(1, 0, 1), 0, 1) = Π(1, Π(0, 0, 1), Π(1, 0, 1)) Π(Π(0, 0, 1), 0, 1) = Π(0, Π(0, 0, 1), Π(1, 0, 1))

  • (WAD)
slide-14
SLIDE 14

The case of Π-decomposable Π

Π(Π(1, 0, 1), 0, 1) = Π(1, Π(0, 0, 1), Π(1, 0, 1)) Π(Π(0, 0, 1), 0, 1) = Π(0, Π(0, 0, 1), Π(1, 0, 1))

  • (WAD)
  • Theorem. If Π ∈ ΛΠ and Π |

= (WAD), then (P) + (AD) ⇐ ⇒ ΛΠ is a clone, and ΛΠ is the clone generated by Π and the constant maps.

slide-15
SLIDE 15

What happens if Π is not Π-decomposable?

We have seen that if ΛΠ is a Boolean clone then Π ∈ ΛΠ. There are some Π such that ΛΠ is a clone but Π ∈ ΛΠ.

slide-16
SLIDE 16

What happens if Π is not Π-decomposable?

We have seen that if ΛΠ is a Boolean clone then Π ∈ ΛΠ. There are some Π such that ΛΠ is a clone but Π ∈ ΛΠ.

  • Example. Let A = {0, 1/2, 1} and Π be the pivotal operation s.t.

Π(x, 1, 0) = x Π(x, 0, 1) = 1 − x Π(x, 1, 1/2) = 1 Π(x, 0, 1/2) = 1 Π(x, 1/2, 1) = 0 Π(x, 1/2, 0) = 0

slide-17
SLIDE 17

What happens if Π is not Π-decomposable?

We have seen that if ΛΠ is a Boolean clone then Π ∈ ΛΠ. There are some Π such that ΛΠ is a clone but Π ∈ ΛΠ.

  • Example. Let A = {0, 1/2, 1} and Π be the pivotal operation s.t.

Π(x, 1, 0) = x Π(x, 0, 1) = 1 − x Π(x, 1, 1/2) = 1 Π(x, 0, 1/2) = 1 Π(x, 1/2, 1) = 0 Π(x, 1/2, 0) = 0 Π | = (P), (AD) but Π ∈ ΛΠ since Π(x, 1/2, 1/2) = 1/2 and Π(1/2, Π(x, 1, 1/2), Π(x, 0, 1/2)) = 1

slide-18
SLIDE 18

Symmetry

  • Theorem. If Π ∈ ΛΠ and Π |

= (P), then the following are equivalent (i) Π is symmetric (ii) Π(0, 0, 1) = Π(0, 1, 0) and Π(1, 0, 1) = Π(1, 1, 0)

slide-19
SLIDE 19

Summary

· If Π ∈ ΛΠ and Π | = (WAD), then (P) + (AD) ⇐ ⇒ ΛΠ is a clone · There is a clone ΛΠ such that Π ∈ ΛΠ

slide-20
SLIDE 20

Summary

· If Π ∈ ΛΠ and Π | = (WAD), then (P) + (AD) ⇐ ⇒ ΛΠ is a clone · There is a clone ΛΠ such that Π ∈ ΛΠ Problems. Find a characterization of those ΛΠ which are clones when Π ∈ ΛΠ. Structure of the family of decomposable classes of operations?

  • M. Couceiro, and B. Teheux. Pivotal decomposition schemes inducing

clones of operations. Beitr. Algebra Geom., 59:25 – 40, 2018.