finite homomorphism-homogeneous permutations via edge …dockie/pres/dolinka_090414.pdf ·...
TRANSCRIPT
![Page 1: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/1.jpg)
Finite homomorphism-homogeneouspermutations via edge colourings of chains
Igor [email protected]
Department of Mathematics and Informatics, University of Novi Sad
St Andrews (PMC), April 9, 2014
![Page 2: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/2.jpg)
First of all there is Blue. Later there is White, and thenthere is Black, and before the beginning there is Brown.
Paul Auster: Ghosts (The New York Trilogy)
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations
![Page 3: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/3.jpg)
(Ultra)homogeneity
Let A be a (countable) first order structure. A is said to be(ultra)homogeneous if any isomorphism
ι : B → B′
between its finitely generated substructures is a restriction of anautomorphism α of A: ι = α|B .
RemarkIf we restrict to relational structures, ‘finitely generated’ becomessimply ‘finite’.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations1
![Page 4: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/4.jpg)
(Ultra)homogeneity
Let A be a (countable) first order structure. A is said to be(ultra)homogeneous if any isomorphism
ι : B → B′
between its finitely generated substructures is a restriction of anautomorphism α of A: ι = α|B .
RemarkIf we restrict to relational structures, ‘finitely generated’ becomessimply ‘finite’.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations1
![Page 5: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/5.jpg)
Classification programme for countable ultrahomogeneousstructures
I finite graphs (Gardiner, 1976)
I posets (Schmerl, 1979)
I undirected graphs (Lachlan & Woodrow, 1980)
I tournaments (Lachlan, 1984)
I directed graphs (Cherlin, 1998 – Memoirs of AMS, 160+ pp.)
I finite groups (Cherlin & Felgner, 2000)
I permutations (???) (Cameron, 2002)
I . . .
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations2
![Page 6: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/6.jpg)
Classification programme for countable ultrahomogeneousstructures
I finite graphs (Gardiner, 1976)
I posets (Schmerl, 1979)
I undirected graphs (Lachlan & Woodrow, 1980)
I tournaments (Lachlan, 1984)
I directed graphs (Cherlin, 1998 – Memoirs of AMS, 160+ pp.)
I finite groups (Cherlin & Felgner, 2000)
I permutations (???) (Cameron, 2002)
I . . .
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations2
![Page 7: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/7.jpg)
Classification programme for countable ultrahomogeneousstructures
I finite graphs (Gardiner, 1976)
I posets (Schmerl, 1979)
I undirected graphs (Lachlan & Woodrow, 1980)
I tournaments (Lachlan, 1984)
I directed graphs (Cherlin, 1998 – Memoirs of AMS, 160+ pp.)
I finite groups (Cherlin & Felgner, 2000)
I permutations (???) (Cameron, 2002)
I . . .
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations2
![Page 8: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/8.jpg)
Classification programme for countable ultrahomogeneousstructures
I finite graphs (Gardiner, 1976)
I posets (Schmerl, 1979)
I undirected graphs (Lachlan & Woodrow, 1980)
I tournaments (Lachlan, 1984)
I directed graphs (Cherlin, 1998 – Memoirs of AMS, 160+ pp.)
I finite groups (Cherlin & Felgner, 2000)
I permutations (???) (Cameron, 2002)
I . . .
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations2
![Page 9: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/9.jpg)
Classification programme for countable ultrahomogeneousstructures
I finite graphs (Gardiner, 1976)
I posets (Schmerl, 1979)
I undirected graphs (Lachlan & Woodrow, 1980)
I tournaments (Lachlan, 1984)
I directed graphs (Cherlin, 1998 – Memoirs of AMS, 160+ pp.)
I finite groups (Cherlin & Felgner, 2000)
I permutations (???) (Cameron, 2002)
I . . .
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations2
![Page 10: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/10.jpg)
Classification programme for countable ultrahomogeneousstructures
I finite graphs (Gardiner, 1976)
I posets (Schmerl, 1979)
I undirected graphs (Lachlan & Woodrow, 1980)
I tournaments (Lachlan, 1984)
I directed graphs (Cherlin, 1998 – Memoirs of AMS, 160+ pp.)
I finite groups (Cherlin & Felgner, 2000)
I permutations (???) (Cameron, 2002)
I . . .
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations2
![Page 11: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/11.jpg)
Classification programme for countable ultrahomogeneousstructures
I finite graphs (Gardiner, 1976)
I posets (Schmerl, 1979)
I undirected graphs (Lachlan & Woodrow, 1980)
I tournaments (Lachlan, 1984)
I directed graphs (Cherlin, 1998 – Memoirs of AMS, 160+ pp.)
I finite groups (Cherlin & Felgner, 2000)
I permutations (???) (Cameron, 2002)
I . . .
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations2
![Page 12: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/12.jpg)
Classification programme for countable ultrahomogeneousstructures
I finite graphs (Gardiner, 1976)
I posets (Schmerl, 1979)
I undirected graphs (Lachlan & Woodrow, 1980)
I tournaments (Lachlan, 1984)
I directed graphs (Cherlin, 1998 – Memoirs of AMS, 160+ pp.)
I finite groups (Cherlin & Felgner, 2000)
I permutations (???) (Cameron, 2002)
I . . .
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations2
![Page 13: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/13.jpg)
Classification programme for countable ultrahomogeneousstructures
I finite graphs (Gardiner, 1976)
I posets (Schmerl, 1979)
I undirected graphs (Lachlan & Woodrow, 1980)
I tournaments (Lachlan, 1984)
I directed graphs (Cherlin, 1998 – Memoirs of AMS, 160+ pp.)
I finite groups (Cherlin & Felgner, 2000)
I permutations (???) (Cameron, 2002)
I . . .
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations2
![Page 14: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/14.jpg)
Fraısse theory
FactFor any countably infinite ultrahomogeneous structure A, its ageAge(A) (the class of its finitely generated substructures) has thefollowing properties:
I it has countably many isomorphism types;
I it is closed for taking (copies of) substructures;
I it has the joint embedding property (JEP);
I it has the amalgamation property (AP).
A class of finite(ly generated) structures with such properties iscalled a Fraısse class.
Theorem (Fraısse)
Let C be a Fraısse class. Then there exists a unique countablyinfinite ultrahomogeneous structure F such that Age(F) = C.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations3
![Page 15: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/15.jpg)
Fraısse theory
FactFor any countably infinite ultrahomogeneous structure A, its ageAge(A) (the class of its finitely generated substructures) has thefollowing properties:
I it has countably many isomorphism types;
I it is closed for taking (copies of) substructures;
I it has the joint embedding property (JEP);
I it has the amalgamation property (AP).
A class of finite(ly generated) structures with such properties iscalled a Fraısse class.
Theorem (Fraısse)
Let C be a Fraısse class. Then there exists a unique countablyinfinite ultrahomogeneous structure F such that Age(F) = C.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations3
![Page 16: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/16.jpg)
Fraısse theory
FactFor any countably infinite ultrahomogeneous structure A, its ageAge(A) (the class of its finitely generated substructures) has thefollowing properties:
I it has countably many isomorphism types;
I it is closed for taking (copies of) substructures;
I it has the joint embedding property (JEP);
I it has the amalgamation property (AP).
A class of finite(ly generated) structures with such properties iscalled a Fraısse class.
Theorem (Fraısse)
Let C be a Fraısse class. Then there exists a unique countablyinfinite ultrahomogeneous structure F such that Age(F) = C.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations3
![Page 17: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/17.jpg)
Fraısse theory
FactFor any countably infinite ultrahomogeneous structure A, its ageAge(A) (the class of its finitely generated substructures) has thefollowing properties:
I it has countably many isomorphism types;
I it is closed for taking (copies of) substructures;
I it has the joint embedding property (JEP);
I it has the amalgamation property (AP).
A class of finite(ly generated) structures with such properties iscalled a Fraısse class.
Theorem (Fraısse)
Let C be a Fraısse class. Then there exists a unique countablyinfinite ultrahomogeneous structure F such that Age(F) = C.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations3
![Page 18: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/18.jpg)
Fraısse theory
FactFor any countably infinite ultrahomogeneous structure A, its ageAge(A) (the class of its finitely generated substructures) has thefollowing properties:
I it has countably many isomorphism types;
I it is closed for taking (copies of) substructures;
I it has the joint embedding property (JEP);
I it has the amalgamation property (AP).
A class of finite(ly generated) structures with such properties iscalled a Fraısse class.
Theorem (Fraısse)
Let C be a Fraısse class. Then there exists a unique countablyinfinite ultrahomogeneous structure F such that Age(F) = C.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations3
![Page 19: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/19.jpg)
Fraısse theory
FactFor any countably infinite ultrahomogeneous structure A, its ageAge(A) (the class of its finitely generated substructures) has thefollowing properties:
I it has countably many isomorphism types;
I it is closed for taking (copies of) substructures;
I it has the joint embedding property (JEP);
I it has the amalgamation property (AP).
A class of finite(ly generated) structures with such properties iscalled a Fraısse class.
Theorem (Fraısse)
Let C be a Fraısse class. Then there exists a unique countablyinfinite ultrahomogeneous structure F such that Age(F) = C.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations3
![Page 20: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/20.jpg)
Fraısse theory
FactFor any countably infinite ultrahomogeneous structure A, its ageAge(A) (the class of its finitely generated substructures) has thefollowing properties:
I it has countably many isomorphism types;
I it is closed for taking (copies of) substructures;
I it has the joint embedding property (JEP);
I it has the amalgamation property (AP).
A class of finite(ly generated) structures with such properties iscalled a Fraısse class.
Theorem (Fraısse)
Let C be a Fraısse class. Then there exists a unique countablyinfinite ultrahomogeneous structure F such that Age(F) = C.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations3
![Page 21: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/21.jpg)
Fraısse theory (continued)
The structure F from the previous theorem is called the Fraısselimit of C.
Classical examples:
I finite chains −→ (Q, <)
I finite undirected graph −→ the Rado (random) graph R
I finite posets −→ the random poset
I finite tournaments −→ the random tournament
I finite metric spaces with rational distances −→ the rationalUrysohn space UQ
I finite permutations (???) −→ the random permutation(???!!!)
Fraısse limits over finite relational languages are ω-categorical,have quantifier elimination, oligomorphic automorphism groups,. . .
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations4
![Page 22: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/22.jpg)
Fraısse theory (continued)
The structure F from the previous theorem is called the Fraısselimit of C.
Classical examples:
I finite chains −→ (Q, <)
I finite undirected graph −→ the Rado (random) graph R
I finite posets −→ the random poset
I finite tournaments −→ the random tournament
I finite metric spaces with rational distances −→ the rationalUrysohn space UQ
I finite permutations (???) −→ the random permutation(???!!!)
Fraısse limits over finite relational languages are ω-categorical,have quantifier elimination, oligomorphic automorphism groups,. . .
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations4
![Page 23: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/23.jpg)
Fraısse theory (continued)
The structure F from the previous theorem is called the Fraısselimit of C.
Classical examples:
I finite chains −→ (Q, <)
I finite undirected graph −→ the Rado (random) graph R
I finite posets −→ the random poset
I finite tournaments −→ the random tournament
I finite metric spaces with rational distances −→ the rationalUrysohn space UQ
I finite permutations (???) −→ the random permutation(???!!!)
Fraısse limits over finite relational languages are ω-categorical,have quantifier elimination, oligomorphic automorphism groups,. . .
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations4
![Page 24: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/24.jpg)
Fraısse theory (continued)
The structure F from the previous theorem is called the Fraısselimit of C.
Classical examples:
I finite chains −→ (Q, <)
I finite undirected graph −→ the Rado (random) graph R
I finite posets −→ the random poset
I finite tournaments −→ the random tournament
I finite metric spaces with rational distances −→ the rationalUrysohn space UQ
I finite permutations (???) −→ the random permutation(???!!!)
Fraısse limits over finite relational languages are ω-categorical,have quantifier elimination, oligomorphic automorphism groups,. . .
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations4
![Page 25: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/25.jpg)
Fraısse theory (continued)
The structure F from the previous theorem is called the Fraısselimit of C.
Classical examples:
I finite chains −→ (Q, <)
I finite undirected graph −→ the Rado (random) graph R
I finite posets −→ the random poset
I finite tournaments −→ the random tournament
I finite metric spaces with rational distances −→ the rationalUrysohn space UQ
I finite permutations (???) −→ the random permutation(???!!!)
Fraısse limits over finite relational languages are ω-categorical,have quantifier elimination, oligomorphic automorphism groups,. . .
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations4
![Page 26: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/26.jpg)
Fraısse theory (continued)
The structure F from the previous theorem is called the Fraısselimit of C.
Classical examples:
I finite chains −→ (Q, <)
I finite undirected graph −→ the Rado (random) graph R
I finite posets −→ the random poset
I finite tournaments −→ the random tournament
I finite metric spaces with rational distances −→ the rationalUrysohn space UQ
I finite permutations (???) −→ the random permutation(???!!!)
Fraısse limits over finite relational languages are ω-categorical,have quantifier elimination, oligomorphic automorphism groups,. . .
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations4
![Page 27: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/27.jpg)
Fraısse theory (continued)
The structure F from the previous theorem is called the Fraısselimit of C.
Classical examples:
I finite chains −→ (Q, <)
I finite undirected graph −→ the Rado (random) graph R
I finite posets −→ the random poset
I finite tournaments −→ the random tournament
I finite metric spaces with rational distances −→ the rationalUrysohn space UQ
I finite permutations (???) −→ the random permutation(???!!!)
Fraısse limits over finite relational languages are ω-categorical,have quantifier elimination, oligomorphic automorphism groups,. . .
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations4
![Page 28: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/28.jpg)
Fraısse theory (continued)
The structure F from the previous theorem is called the Fraısselimit of C.
Classical examples:
I finite chains −→ (Q, <)
I finite undirected graph −→ the Rado (random) graph R
I finite posets −→ the random poset
I finite tournaments −→ the random tournament
I finite metric spaces with rational distances −→ the rationalUrysohn space UQ
I finite permutations (???) −→ the random permutation(???!!!)
Fraısse limits over finite relational languages are ω-categorical,have quantifier elimination, oligomorphic automorphism groups,. . .
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations4
![Page 29: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/29.jpg)
Fraısse theory (continued)
The structure F from the previous theorem is called the Fraısselimit of C.
Classical examples:
I finite chains −→ (Q, <)
I finite undirected graph −→ the Rado (random) graph R
I finite posets −→ the random poset
I finite tournaments −→ the random tournament
I finite metric spaces with rational distances −→ the rationalUrysohn space UQ
I finite permutations (???) −→ the random permutation(???!!!)
Fraısse limits over finite relational languages are ω-categorical,
have quantifier elimination, oligomorphic automorphism groups,. . .
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations4
![Page 30: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/30.jpg)
Fraısse theory (continued)
The structure F from the previous theorem is called the Fraısselimit of C.
Classical examples:
I finite chains −→ (Q, <)
I finite undirected graph −→ the Rado (random) graph R
I finite posets −→ the random poset
I finite tournaments −→ the random tournament
I finite metric spaces with rational distances −→ the rationalUrysohn space UQ
I finite permutations (???) −→ the random permutation(???!!!)
Fraısse limits over finite relational languages are ω-categorical,have quantifier elimination,
oligomorphic automorphism groups,. . .
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations4
![Page 31: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/31.jpg)
Fraısse theory (continued)
The structure F from the previous theorem is called the Fraısselimit of C.
Classical examples:
I finite chains −→ (Q, <)
I finite undirected graph −→ the Rado (random) graph R
I finite posets −→ the random poset
I finite tournaments −→ the random tournament
I finite metric spaces with rational distances −→ the rationalUrysohn space UQ
I finite permutations (???) −→ the random permutation(???!!!)
Fraısse limits over finite relational languages are ω-categorical,have quantifier elimination, oligomorphic automorphism groups,
. . .
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations4
![Page 32: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/32.jpg)
Fraısse theory (continued)
The structure F from the previous theorem is called the Fraısselimit of C.
Classical examples:
I finite chains −→ (Q, <)
I finite undirected graph −→ the Rado (random) graph R
I finite posets −→ the random poset
I finite tournaments −→ the random tournament
I finite metric spaces with rational distances −→ the rationalUrysohn space UQ
I finite permutations (???) −→ the random permutation(???!!!)
Fraısse limits over finite relational languages are ω-categorical,have quantifier elimination, oligomorphic automorphism groups,. . .
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations4
![Page 33: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/33.jpg)
Homomorphism-homogeneity
In 2006, in their seminal paper, P. J. Cameron and J. Nesetrilinvestigated what happens if one replaces isomorphisms andautomorphisms in the classical definition of ultrahomogeneity byother types of morphism.
In particular, a structure A is said to behomomorphism-homogeneous (HH) if any homomorphism
ϕ : B → B′
between its finitely generated substructures is a restriction of anendomorphism ψ of A: ϕ = ψ|B .
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations5
![Page 34: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/34.jpg)
Homomorphism-homogeneity
In 2006, in their seminal paper, P. J. Cameron and J. Nesetrilinvestigated what happens if one replaces isomorphisms andautomorphisms in the classical definition of ultrahomogeneity byother types of morphism.
In particular, a structure A is said to behomomorphism-homogeneous (HH) if any homomorphism
ϕ : B → B′
between its finitely generated substructures is a restriction of anendomorphism ψ of A: ϕ = ψ|B .
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations5
![Page 35: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/35.jpg)
Homomorphism-homogeneity vs homogeneity
HH is the ‘semigroup-theoretical analogue’ of ultrahomogeneity!
Theorem (Masulovic & M. Pech, 2011)
A submonoid M of AA is the endomorphism monoid of a HHstructure on A in a residually finite relational language if and onlyif it is closed (in the pointwise convergence topology) andoligomorphic.
Theorem (M & P, 2011)
A structure A is HH if and only if End(A) is oligomorphic (i.e. Ais weakly oligomorphic) and A admits quatifier elimination forpositive formulæ.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations6
![Page 36: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/36.jpg)
Homomorphism-homogeneity vs homogeneity
HH is the ‘semigroup-theoretical analogue’ of ultrahomogeneity!
Theorem (Masulovic & M. Pech, 2011)
A submonoid M of AA is the endomorphism monoid of a HHstructure on A in a residually finite relational language if and onlyif it is closed (in the pointwise convergence topology) andoligomorphic.
Theorem (M & P, 2011)
A structure A is HH if and only if End(A) is oligomorphic (i.e. Ais weakly oligomorphic) and A admits quatifier elimination forpositive formulæ.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations6
![Page 37: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/37.jpg)
Homomorphism-homogeneity vs homogeneity
HH is the ‘semigroup-theoretical analogue’ of ultrahomogeneity!
Theorem (Masulovic & M. Pech, 2011)
A submonoid M of AA is the endomorphism monoid of a HHstructure on A in a residually finite relational language if and onlyif it is closed (in the pointwise convergence topology) andoligomorphic.
Theorem (M & P, 2011)
A structure A is HH if and only if End(A) is oligomorphic (i.e. Ais weakly oligomorphic) and A admits quatifier elimination forpositive formulæ.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations6
![Page 38: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/38.jpg)
Classification of (countable) HH structures
I finite groups (‘quasi-injective’, Bertholf & Walls, 1979)
I some classes of infinite groups (Tomkinson, 1988)
I posets – of arbitrary cardinality! (Masulovic, 2007)
I finite tournaments with loops (Ilic, Masulovic & Rajkovic,2008)
I lattices and some classes of semilattices (ID & Masulovic,2011)
I some classes of finite (point-line) geometries (Masulovic,2013)
I mono-unary algebras (Jungabel & Masulovic, 2013)
I Fraısse limits (ID, 2014) – the ‘one-point homomorphismextension property’
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations7
![Page 39: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/39.jpg)
Classification of (countable) HH structures
I finite groups (‘quasi-injective’, Bertholf & Walls, 1979)
I some classes of infinite groups (Tomkinson, 1988)
I posets – of arbitrary cardinality! (Masulovic, 2007)
I finite tournaments with loops (Ilic, Masulovic & Rajkovic,2008)
I lattices and some classes of semilattices (ID & Masulovic,2011)
I some classes of finite (point-line) geometries (Masulovic,2013)
I mono-unary algebras (Jungabel & Masulovic, 2013)
I Fraısse limits (ID, 2014) – the ‘one-point homomorphismextension property’
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations7
![Page 40: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/40.jpg)
Classification of (countable) HH structures
I finite groups (‘quasi-injective’, Bertholf & Walls, 1979)
I some classes of infinite groups (Tomkinson, 1988)
I posets – of arbitrary cardinality! (Masulovic, 2007)
I finite tournaments with loops (Ilic, Masulovic & Rajkovic,2008)
I lattices and some classes of semilattices (ID & Masulovic,2011)
I some classes of finite (point-line) geometries (Masulovic,2013)
I mono-unary algebras (Jungabel & Masulovic, 2013)
I Fraısse limits (ID, 2014) – the ‘one-point homomorphismextension property’
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations7
![Page 41: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/41.jpg)
Classification of (countable) HH structures
I finite groups (‘quasi-injective’, Bertholf & Walls, 1979)
I some classes of infinite groups (Tomkinson, 1988)
I posets – of arbitrary cardinality! (Masulovic, 2007)
I finite tournaments with loops (Ilic, Masulovic & Rajkovic,2008)
I lattices and some classes of semilattices (ID & Masulovic,2011)
I some classes of finite (point-line) geometries (Masulovic,2013)
I mono-unary algebras (Jungabel & Masulovic, 2013)
I Fraısse limits (ID, 2014) – the ‘one-point homomorphismextension property’
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations7
![Page 42: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/42.jpg)
Classification of (countable) HH structures
I finite groups (‘quasi-injective’, Bertholf & Walls, 1979)
I some classes of infinite groups (Tomkinson, 1988)
I posets – of arbitrary cardinality! (Masulovic, 2007)
I finite tournaments with loops (Ilic, Masulovic & Rajkovic,2008)
I lattices and some classes of semilattices (ID & Masulovic,2011)
I some classes of finite (point-line) geometries (Masulovic,2013)
I mono-unary algebras (Jungabel & Masulovic, 2013)
I Fraısse limits (ID, 2014) – the ‘one-point homomorphismextension property’
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations7
![Page 43: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/43.jpg)
Classification of (countable) HH structures
I finite groups (‘quasi-injective’, Bertholf & Walls, 1979)
I some classes of infinite groups (Tomkinson, 1988)
I posets – of arbitrary cardinality! (Masulovic, 2007)
I finite tournaments with loops (Ilic, Masulovic & Rajkovic,2008)
I lattices and some classes of semilattices (ID & Masulovic,2011)
I some classes of finite (point-line) geometries (Masulovic,2013)
I mono-unary algebras (Jungabel & Masulovic, 2013)
I Fraısse limits (ID, 2014) – the ‘one-point homomorphismextension property’
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations7
![Page 44: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/44.jpg)
Classification of (countable) HH structures
I finite groups (‘quasi-injective’, Bertholf & Walls, 1979)
I some classes of infinite groups (Tomkinson, 1988)
I posets – of arbitrary cardinality! (Masulovic, 2007)
I finite tournaments with loops (Ilic, Masulovic & Rajkovic,2008)
I lattices and some classes of semilattices (ID & Masulovic,2011)
I some classes of finite (point-line) geometries (Masulovic,2013)
I mono-unary algebras (Jungabel & Masulovic, 2013)
I Fraısse limits (ID, 2014) – the ‘one-point homomorphismextension property’
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations7
![Page 45: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/45.jpg)
Classification of (countable) HH structures
I finite groups (‘quasi-injective’, Bertholf & Walls, 1979)
I some classes of infinite groups (Tomkinson, 1988)
I posets – of arbitrary cardinality! (Masulovic, 2007)
I finite tournaments with loops (Ilic, Masulovic & Rajkovic,2008)
I lattices and some classes of semilattices (ID & Masulovic,2011)
I some classes of finite (point-line) geometries (Masulovic,2013)
I mono-unary algebras (Jungabel & Masulovic, 2013)
I Fraısse limits (ID, 2014) – the ‘one-point homomorphismextension property’
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations7
![Page 46: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/46.jpg)
Classification of (countable) HH structures
I finite groups (‘quasi-injective’, Bertholf & Walls, 1979)
I some classes of infinite groups (Tomkinson, 1988)
I posets – of arbitrary cardinality! (Masulovic, 2007)
I finite tournaments with loops (Ilic, Masulovic & Rajkovic,2008)
I lattices and some classes of semilattices (ID & Masulovic,2011)
I some classes of finite (point-line) geometries (Masulovic,2013)
I mono-unary algebras (Jungabel & Masulovic, 2013)
I Fraısse limits (ID, 2014) – the ‘one-point homomorphismextension property’
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations7
![Page 47: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/47.jpg)
Classification of (countable) HH structures
WARNING!
co-NP-complete classes of finite HH structures:
I finite undirected graphs with loops (Rusinov & Schweitzer,2010)
I finite algebras of a (fixed) similarity type containing either asymbol of arity ≥ 2, or at least two unary symbols (Masulovic,2013)
I . . .
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations8
![Page 48: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/48.jpg)
Classification of (countable) HH structures
WARNING!
co-NP-complete classes of finite HH structures:
I finite undirected graphs with loops (Rusinov & Schweitzer,2010)
I finite algebras of a (fixed) similarity type containing either asymbol of arity ≥ 2, or at least two unary symbols (Masulovic,2013)
I . . .
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations8
![Page 49: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/49.jpg)
Few questions
So, what about finite HH permutations?
How, on Earth, is a permutation considered in the role of astructure???
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations9
![Page 50: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/50.jpg)
Few questions
So, what about finite HH permutations?
How, on Earth, is a permutation considered in the role of astructure???
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations9
![Page 51: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/51.jpg)
What is, in fact, a permutation?
I To an algebraist: an element of the symmetric group Sym(X ),a bijection π : X → X , e.g.
π =
(1 2 3 4 52 1 3 5 4
)Has nothing to do with |X |.
I To a combinatorialist: a sequence a1a2 . . . over X in whicheach element occurs exactly once, e.g.
21354
Also, can be represented by ‘plots’.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations10
![Page 52: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/52.jpg)
What is, in fact, a permutation?
I To an algebraist: an element of the symmetric group Sym(X ),a bijection π : X → X , e.g.
π =
(1 2 3 4 52 1 3 5 4
)Has nothing to do with |X |.
I To a combinatorialist: a sequence a1a2 . . . over X in whicheach element occurs exactly once, e.g.
21354
Also, can be represented by ‘plots’.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations10
![Page 53: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/53.jpg)
What is, in fact, a permutation?
I To an algebraist: an element of the symmetric group Sym(X ),a bijection π : X → X , e.g.
π =
(1 2 3 4 52 1 3 5 4
)Has nothing to do with |X |.
I To a combinatorialist: a sequence a1a2 . . . over X in whicheach element occurs exactly once, e.g.
21354
Also, can be represented by ‘plots’.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations10
![Page 54: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/54.jpg)
What is, in fact, a permutation?
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations11
![Page 55: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/55.jpg)
What is, in fact, a permutation?
I To an algebraist: an element of the symmetric group Sym(X ),a bijection π : X → X , e.g.
π =
(1 2 3 4 52 1 3 5 4
)Has nothing to do with |X |.
I To a combinatorialist: a sequence a1a2 . . . over X in whicheach element occurs exactly once, e.g.
21354
Also, can be represented by ‘plots’. Runs into trouble when Xis infinite.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations10
![Page 56: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/56.jpg)
What is, in fact, a permutation?
I To a model theorist: a structure (X ,≤1,≤2), where the set Xis equipped by two linear orders, e.g.
1 <1 2 <1 3 <1 4 <1 5 and 2 <2 1 <2 3 <2 5 <2 4.
Very suitable for infinite generalisations.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations12
![Page 57: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/57.jpg)
⊕ and
Let π and σ be permutations of [1, p] and [1, s], respectively.
(π ⊕ σ)(i) =
{π(i) for 1 ≤ i ≤ p,
σ(i − p) + p for p + 1 ≤ i ≤ p + s,
(π σ)(i) =
{π(i) + s for 1 ≤ i ≤ p,
σ(i − p) for p + 1 ≤ i ≤ p + s.
This is particularly convenient to explain on the plots.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations13
![Page 58: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/58.jpg)
⊕ and
Let π and σ be permutations of [1, p] and [1, s], respectively.
(π ⊕ σ)(i) =
{π(i) for 1 ≤ i ≤ p,
σ(i − p) + p for p + 1 ≤ i ≤ p + s,
(π σ)(i) =
{π(i) + s for 1 ≤ i ≤ p,
σ(i − p) for p + 1 ≤ i ≤ p + s.
This is particularly convenient to explain on the plots.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations13
![Page 59: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/59.jpg)
⊕ and
Let π and σ be permutations of [1, p] and [1, s], respectively.
(π ⊕ σ)(i) =
{π(i) for 1 ≤ i ≤ p,
σ(i − p) + p for p + 1 ≤ i ≤ p + s,
(π σ)(i) =
{π(i) + s for 1 ≤ i ≤ p,
σ(i − p) for p + 1 ≤ i ≤ p + s.
This is particularly convenient to explain on the plots.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations13
![Page 60: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/60.jpg)
⊕ and
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations14
![Page 61: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/61.jpg)
⊕ and
Let π and σ be permutations of [1, p] and [1, s], respectively.
(π ⊕ σ)(i) =
{π(i) for 1 ≤ i ≤ p,
σ(i − p) + p for p + 1 ≤ i ≤ p + s,
(π σ)(i) =
{π(i) + s for 1 ≤ i ≤ p,
σ(i − p) for p + 1 ≤ i ≤ p + s.
This is particularly convenient to explain on the plots.
Easily generalises to infinite permutations.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations13
![Page 62: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/62.jpg)
Countable ultrahomogeneous permutations
Theorem (Cameron, 2002)
The countable ultrahomogeneous permutations are precisely thefollowing:
1. the trivial permutation on a singleton set;
2. Q+ = (Q,≤,≤), where ≤ is the usual order of the rationals;
3. Q− = (Q,≤,≥);
4. · · · Q+ Q+ Q+ Q+ . . . ;5. · · · ⊕Q− ⊕Q− ⊕Q− ⊕Q− ⊕ . . . ;6. the random permutation Π = the Fraıssse limit of all finite
permutations.
A model for Π: an everywhere dense and independent subset ofQ×Q.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations15
![Page 63: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/63.jpg)
Countable ultrahomogeneous permutations
Theorem (Cameron, 2002)
The countable ultrahomogeneous permutations are precisely thefollowing:
1. the trivial permutation on a singleton set;
2. Q+ = (Q,≤,≤), where ≤ is the usual order of the rationals;
3. Q− = (Q,≤,≥);
4. · · · Q+ Q+ Q+ Q+ . . . ;5. · · · ⊕Q− ⊕Q− ⊕Q− ⊕Q− ⊕ . . . ;6. the random permutation Π = the Fraıssse limit of all finite
permutations.
A model for Π: an everywhere dense and independent subset ofQ×Q.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations15
![Page 64: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/64.jpg)
Countable ultrahomogeneous permutations
Theorem (Cameron, 2002)
The countable ultrahomogeneous permutations are precisely thefollowing:
1. the trivial permutation on a singleton set;
2. Q+ = (Q,≤,≤), where ≤ is the usual order of the rationals;
3. Q− = (Q,≤,≥);
4. · · · Q+ Q+ Q+ Q+ . . . ;5. · · · ⊕Q− ⊕Q− ⊕Q− ⊕Q− ⊕ . . . ;6. the random permutation Π = the Fraıssse limit of all finite
permutations.
A model for Π: an everywhere dense and independent subset ofQ×Q.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations15
![Page 65: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/65.jpg)
Countable ultrahomogeneous permutations
Theorem (Cameron, 2002)
The countable ultrahomogeneous permutations are precisely thefollowing:
1. the trivial permutation on a singleton set;
2. Q+ = (Q,≤,≤), where ≤ is the usual order of the rationals;
3. Q− = (Q,≤,≥);
4. · · · Q+ Q+ Q+ Q+ . . . ;5. · · · ⊕Q− ⊕Q− ⊕Q− ⊕Q− ⊕ . . . ;6. the random permutation Π = the Fraıssse limit of all finite
permutations.
A model for Π: an everywhere dense and independent subset ofQ×Q.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations15
![Page 66: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/66.jpg)
Countable ultrahomogeneous permutations
Theorem (Cameron, 2002)
The countable ultrahomogeneous permutations are precisely thefollowing:
1. the trivial permutation on a singleton set;
2. Q+ = (Q,≤,≤), where ≤ is the usual order of the rationals;
3. Q− = (Q,≤,≥);
4. · · · Q+ Q+ Q+ Q+ . . . ;
5. · · · ⊕Q− ⊕Q− ⊕Q− ⊕Q− ⊕ . . . ;6. the random permutation Π = the Fraıssse limit of all finite
permutations.
A model for Π: an everywhere dense and independent subset ofQ×Q.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations15
![Page 67: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/67.jpg)
Countable ultrahomogeneous permutations
Theorem (Cameron, 2002)
The countable ultrahomogeneous permutations are precisely thefollowing:
1. the trivial permutation on a singleton set;
2. Q+ = (Q,≤,≤), where ≤ is the usual order of the rationals;
3. Q− = (Q,≤,≥);
4. · · · Q+ Q+ Q+ Q+ . . . ;5. · · · ⊕Q− ⊕Q− ⊕Q− ⊕Q− ⊕ . . . ;
6. the random permutation Π = the Fraıssse limit of all finitepermutations.
A model for Π: an everywhere dense and independent subset ofQ×Q.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations15
![Page 68: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/68.jpg)
Countable ultrahomogeneous permutations
Theorem (Cameron, 2002)
The countable ultrahomogeneous permutations are precisely thefollowing:
1. the trivial permutation on a singleton set;
2. Q+ = (Q,≤,≤), where ≤ is the usual order of the rationals;
3. Q− = (Q,≤,≥);
4. · · · Q+ Q+ Q+ Q+ . . . ;5. · · · ⊕Q− ⊕Q− ⊕Q− ⊕Q− ⊕ . . . ;6. the random permutation Π = the Fraıssse limit of all finite
permutations.
A model for Π: an everywhere dense and independent subset ofQ×Q.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations15
![Page 69: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/69.jpg)
Countable ultrahomogeneous permutations
Theorem (Cameron, 2002)
The countable ultrahomogeneous permutations are precisely thefollowing:
1. the trivial permutation on a singleton set;
2. Q+ = (Q,≤,≤), where ≤ is the usual order of the rationals;
3. Q− = (Q,≤,≥);
4. · · · Q+ Q+ Q+ Q+ . . . ;5. · · · ⊕Q− ⊕Q− ⊕Q− ⊕Q− ⊕ . . . ;6. the random permutation Π = the Fraıssse limit of all finite
permutations.
A model for Π: an everywhere dense and independent subset ofQ×Q.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations15
![Page 70: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/70.jpg)
Changing the view
For the task of characterising HH permutations, yet anotherapproach is needed. Let (A,≤1,≤2) be a permutation.
Consider now two posets on A: the agreement poset
v1=≤1 ∩ ≤2
and the disagreement (inversion) poset
v2=≤1 ∩ ≥2 .
Now we have v1 ∪ v2=≤1 and v1 ∩ v2= ∆A. So, in fact, wehave a colouring of the non-loop edges of the graph of (A,≤1) intotwo colours: blue and red, such that each coloured componentinduces a poset on A.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations16
![Page 71: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/71.jpg)
Changing the view
For the task of characterising HH permutations, yet anotherapproach is needed. Let (A,≤1,≤2) be a permutation.
Consider now two posets on A: the agreement poset
v1=≤1 ∩ ≤2
and the disagreement (inversion) poset
v2=≤1 ∩ ≥2 .
Now we have v1 ∪ v2=≤1 and v1 ∩ v2= ∆A. So, in fact, wehave a colouring of the non-loop edges of the graph of (A,≤1) intotwo colours: blue and red, such that each coloured componentinduces a poset on A.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations16
![Page 72: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/72.jpg)
Changing the view
For the task of characterising HH permutations, yet anotherapproach is needed. Let (A,≤1,≤2) be a permutation.
Consider now two posets on A: the agreement poset
v1=≤1 ∩ ≤2
and the disagreement (inversion) poset
v2=≤1 ∩ ≥2 .
Now we have v1 ∪ v2=≤1 and v1 ∩ v2= ∆A. So, in fact, wehave a colouring of the non-loop edges of the graph of (A,≤1) intotwo colours: blue and red, such that each coloured componentinduces a poset on A.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations16
![Page 73: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/73.jpg)
Changing the view
For the task of characterising HH permutations, yet anotherapproach is needed. Let (A,≤1,≤2) be a permutation.
Consider now two posets on A: the agreement poset
v1=≤1 ∩ ≤2
and the disagreement (inversion) poset
v2=≤1 ∩ ≥2 .
Now we have v1 ∪ v2=≤1 and v1 ∩ v2= ∆A.
So, in fact, wehave a colouring of the non-loop edges of the graph of (A,≤1) intotwo colours: blue and red, such that each coloured componentinduces a poset on A.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations16
![Page 74: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/74.jpg)
Changing the view
For the task of characterising HH permutations, yet anotherapproach is needed. Let (A,≤1,≤2) be a permutation.
Consider now two posets on A: the agreement poset
v1=≤1 ∩ ≤2
and the disagreement (inversion) poset
v2=≤1 ∩ ≥2 .
Now we have v1 ∪ v2=≤1 and v1 ∩ v2= ∆A. So, in fact, wehave a colouring of the non-loop edges of the graph of (A,≤1) intotwo colours: blue and red, such that each coloured componentinduces a poset on A.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations16
![Page 75: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/75.jpg)
Changing the view
Let us now call a permutation a structure of the form(A,≤,v1,v2), where
I ≤ is a linear order of A, and
I (v1,v2) is a partition of ≤ into two partial orders on A, inthe sense that v1 ∪ v2=≤ and v1 ∩ v2= ∆A (so all loopsare violet).
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations17
![Page 76: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/76.jpg)
Changing the view
Example
Permutation black (of the set {a, b, c , k , l})
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations18
![Page 77: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/77.jpg)
Changing the view
We have a categorical equivalence between two ways to represent apermutation as a structure.
In particular, the following holds.
LemmaA permutation π = (A,≤1,≤2) is (homomorphism-)homogeneousif and only if it adjoined ‘permutation’ Pπ = (A,≤1,v1,v2) is(homomorphism-)homogeneous.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations19
![Page 78: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/78.jpg)
Changing the view
We have a categorical equivalence between two ways to represent apermutation as a structure. In particular, the following holds.
LemmaA permutation π = (A,≤1,≤2) is (homomorphism-)homogeneousif and only if it adjoined ‘permutation’ Pπ = (A,≤1,v1,v2) is(homomorphism-)homogeneous.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations19
![Page 79: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/79.jpg)
The result
Let ιk denote the identical permutation on [1, k], and let π be thedual permutation of π, obtained by reversing the second order.
Theorem (ID & E. Jungabel)
Let π be a permutation of [1, n]. Then π is HH if and only if eitherπ = ιr1 ⊕ · · · ⊕ ιrm , or π = ιr1 · · · ιrm , where the sequence(r1, . . . , rm) satisfies one of the following conditions:
(i) m = n and r1 = · · · = rn = 1;
(ii) m ≥ 2, r1 = · · · = rm−1 = 1 and rm > 1;
(iii) m ≥ 2, r1 > 1 and r2 = · · · = rm = 1;
(iv) m ≥ 4 and there exists an index j such that 2 ≤ j ≤ m − 2,rj , rj+1 > 1, r1 = · · · = rj−1 = 1 and rj+2 = · · · = rm = 1;
(v) m ≥ 3, r1 = rm = 1, and for any pair of indices j , k such that1 < j < k < m and rj , rk > 1 there exists an index q such thatj < q < k and rq = 1.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations20
![Page 80: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/80.jpg)
The result
Let ιk denote the identical permutation on [1, k], and let π be thedual permutation of π, obtained by reversing the second order.
Theorem (ID & E. Jungabel)
Let π be a permutation of [1, n].
Then π is HH if and only if eitherπ = ιr1 ⊕ · · · ⊕ ιrm , or π = ιr1 · · · ιrm , where the sequence(r1, . . . , rm) satisfies one of the following conditions:
(i) m = n and r1 = · · · = rn = 1;
(ii) m ≥ 2, r1 = · · · = rm−1 = 1 and rm > 1;
(iii) m ≥ 2, r1 > 1 and r2 = · · · = rm = 1;
(iv) m ≥ 4 and there exists an index j such that 2 ≤ j ≤ m − 2,rj , rj+1 > 1, r1 = · · · = rj−1 = 1 and rj+2 = · · · = rm = 1;
(v) m ≥ 3, r1 = rm = 1, and for any pair of indices j , k such that1 < j < k < m and rj , rk > 1 there exists an index q such thatj < q < k and rq = 1.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations20
![Page 81: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/81.jpg)
The result
Let ιk denote the identical permutation on [1, k], and let π be thedual permutation of π, obtained by reversing the second order.
Theorem (ID & E. Jungabel)
Let π be a permutation of [1, n]. Then π is HH if and only if eitherπ = ιr1 ⊕ · · · ⊕ ιrm , or π = ιr1 · · · ιrm , where the sequence(r1, . . . , rm) satisfies one of the following conditions:
(i) m = n and r1 = · · · = rn = 1;
(ii) m ≥ 2, r1 = · · · = rm−1 = 1 and rm > 1;
(iii) m ≥ 2, r1 > 1 and r2 = · · · = rm = 1;
(iv) m ≥ 4 and there exists an index j such that 2 ≤ j ≤ m − 2,rj , rj+1 > 1, r1 = · · · = rj−1 = 1 and rj+2 = · · · = rm = 1;
(v) m ≥ 3, r1 = rm = 1, and for any pair of indices j , k such that1 < j < k < m and rj , rk > 1 there exists an index q such thatj < q < k and rq = 1.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations20
![Page 82: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/82.jpg)
The result
Let ιk denote the identical permutation on [1, k], and let π be thedual permutation of π, obtained by reversing the second order.
Theorem (ID & E. Jungabel)
Let π be a permutation of [1, n]. Then π is HH if and only if eitherπ = ιr1 ⊕ · · · ⊕ ιrm , or π = ιr1 · · · ιrm , where the sequence(r1, . . . , rm) satisfies one of the following conditions:
(i) m = n and r1 = · · · = rn = 1;
(ii) m ≥ 2, r1 = · · · = rm−1 = 1 and rm > 1;
(iii) m ≥ 2, r1 > 1 and r2 = · · · = rm = 1;
(iv) m ≥ 4 and there exists an index j such that 2 ≤ j ≤ m − 2,rj , rj+1 > 1, r1 = · · · = rj−1 = 1 and rj+2 = · · · = rm = 1;
(v) m ≥ 3, r1 = rm = 1, and for any pair of indices j , k such that1 < j < k < m and rj , rk > 1 there exists an index q such thatj < q < k and rq = 1.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations20
![Page 83: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/83.jpg)
The result
Let ιk denote the identical permutation on [1, k], and let π be thedual permutation of π, obtained by reversing the second order.
Theorem (ID & E. Jungabel)
Let π be a permutation of [1, n]. Then π is HH if and only if eitherπ = ιr1 ⊕ · · · ⊕ ιrm , or π = ιr1 · · · ιrm , where the sequence(r1, . . . , rm) satisfies one of the following conditions:
(i) m = n and r1 = · · · = rn = 1;
(ii) m ≥ 2, r1 = · · · = rm−1 = 1 and rm > 1;
(iii) m ≥ 2, r1 > 1 and r2 = · · · = rm = 1;
(iv) m ≥ 4 and there exists an index j such that 2 ≤ j ≤ m − 2,rj , rj+1 > 1, r1 = · · · = rj−1 = 1 and rj+2 = · · · = rm = 1;
(v) m ≥ 3, r1 = rm = 1, and for any pair of indices j , k such that1 < j < k < m and rj , rk > 1 there exists an index q such thatj < q < k and rq = 1.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations20
![Page 84: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/84.jpg)
The result
Let ιk denote the identical permutation on [1, k], and let π be thedual permutation of π, obtained by reversing the second order.
Theorem (ID & E. Jungabel)
Let π be a permutation of [1, n]. Then π is HH if and only if eitherπ = ιr1 ⊕ · · · ⊕ ιrm , or π = ιr1 · · · ιrm , where the sequence(r1, . . . , rm) satisfies one of the following conditions:
(i) m = n and r1 = · · · = rn = 1;
(ii) m ≥ 2, r1 = · · · = rm−1 = 1 and rm > 1;
(iii) m ≥ 2, r1 > 1 and r2 = · · · = rm = 1;
(iv) m ≥ 4 and there exists an index j such that 2 ≤ j ≤ m − 2,rj , rj+1 > 1, r1 = · · · = rj−1 = 1 and rj+2 = · · · = rm = 1;
(v) m ≥ 3, r1 = rm = 1, and for any pair of indices j , k such that1 < j < k < m and rj , rk > 1 there exists an index q such thatj < q < k and rq = 1.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations20
![Page 85: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/85.jpg)
The result
Let ιk denote the identical permutation on [1, k], and let π be thedual permutation of π, obtained by reversing the second order.
Theorem (ID & E. Jungabel)
Let π be a permutation of [1, n]. Then π is HH if and only if eitherπ = ιr1 ⊕ · · · ⊕ ιrm , or π = ιr1 · · · ιrm , where the sequence(r1, . . . , rm) satisfies one of the following conditions:
(i) m = n and r1 = · · · = rn = 1;
(ii) m ≥ 2, r1 = · · · = rm−1 = 1 and rm > 1;
(iii) m ≥ 2, r1 > 1 and r2 = · · · = rm = 1;
(iv) m ≥ 4 and there exists an index j such that 2 ≤ j ≤ m − 2,rj , rj+1 > 1, r1 = · · · = rj−1 = 1 and rj+2 = · · · = rm = 1;
(v) m ≥ 3, r1 = rm = 1, and for any pair of indices j , k such that1 < j < k < m and rj , rk > 1 there exists an index q such thatj < q < k and rq = 1.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations20
![Page 86: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/86.jpg)
The result
Let ιk denote the identical permutation on [1, k], and let π be thedual permutation of π, obtained by reversing the second order.
Theorem (ID & E. Jungabel)
Let π be a permutation of [1, n]. Then π is HH if and only if eitherπ = ιr1 ⊕ · · · ⊕ ιrm , or π = ιr1 · · · ιrm , where the sequence(r1, . . . , rm) satisfies one of the following conditions:
(i) m = n and r1 = · · · = rn = 1;
(ii) m ≥ 2, r1 = · · · = rm−1 = 1 and rm > 1;
(iii) m ≥ 2, r1 > 1 and r2 = · · · = rm = 1;
(iv) m ≥ 4 and there exists an index j such that 2 ≤ j ≤ m − 2,rj , rj+1 > 1, r1 = · · · = rj−1 = 1 and rj+2 = · · · = rm = 1;
(v) m ≥ 3, r1 = rm = 1, and for any pair of indices j , k such that1 < j < k < m and rj , rk > 1 there exists an index q such thatj < q < k and rq = 1.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations20
![Page 87: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/87.jpg)
The result
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations21
![Page 88: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/88.jpg)
The key step
For a permutation Pπ = (A,≤,v1,v2) let Bπ = (A,v1) be the‘blue poset’ (agreement), while Rπ = (A,v2) is the ‘red poset’(inversion).
Proposition
If Pπ is a HH permutation (of arbitrary cardinality!), then both Bπ
and Rπ are HH posets.
Theorem (Masulovic, 2007)
A partially ordered set (A,�) is HH if and only if one of thefollowing condition holds:
(1) each connected component of (A,�) is a chain;
(2) (A,�) is a tree;
(3) (A,�) is a dual tree;
(4) (A,�) splits into a tree and a dual tree;
(5) (A,�) is locally bounded and X5-dense (A finite ⇒ lattice).
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations22
![Page 89: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/89.jpg)
The key step
For a permutation Pπ = (A,≤,v1,v2) let Bπ = (A,v1) be the‘blue poset’ (agreement), while Rπ = (A,v2) is the ‘red poset’(inversion).
Proposition
If Pπ is a HH permutation (of arbitrary cardinality!), then both Bπ
and Rπ are HH posets.
Theorem (Masulovic, 2007)
A partially ordered set (A,�) is HH if and only if one of thefollowing condition holds:
(1) each connected component of (A,�) is a chain;
(2) (A,�) is a tree;
(3) (A,�) is a dual tree;
(4) (A,�) splits into a tree and a dual tree;
(5) (A,�) is locally bounded and X5-dense (A finite ⇒ lattice).
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations22
![Page 90: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/90.jpg)
The key step
For a permutation Pπ = (A,≤,v1,v2) let Bπ = (A,v1) be the‘blue poset’ (agreement), while Rπ = (A,v2) is the ‘red poset’(inversion).
Proposition
If Pπ is a HH permutation (of arbitrary cardinality!), then both Bπ
and Rπ are HH posets.
Theorem (Masulovic, 2007)
A partially ordered set (A,�) is HH if and only if one of thefollowing condition holds:
(1) each connected component of (A,�) is a chain;
(2) (A,�) is a tree;
(3) (A,�) is a dual tree;
(4) (A,�) splits into a tree and a dual tree;
(5) (A,�) is locally bounded and X5-dense (A finite ⇒ lattice).
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations22
![Page 91: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/91.jpg)
The key step
For a permutation Pπ = (A,≤,v1,v2) let Bπ = (A,v1) be the‘blue poset’ (agreement), while Rπ = (A,v2) is the ‘red poset’(inversion).
Proposition
If Pπ is a HH permutation (of arbitrary cardinality!), then both Bπ
and Rπ are HH posets.
Theorem (Masulovic, 2007)
A partially ordered set (A,�) is HH if and only if one of thefollowing condition holds:
(1) each connected component of (A,�) is a chain;
(2) (A,�) is a tree;
(3) (A,�) is a dual tree;
(4) (A,�) splits into a tree and a dual tree;
(5) (A,�) is locally bounded and X5-dense (A finite ⇒ lattice).
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations22
![Page 92: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/92.jpg)
The key step
For a permutation Pπ = (A,≤,v1,v2) let Bπ = (A,v1) be the‘blue poset’ (agreement), while Rπ = (A,v2) is the ‘red poset’(inversion).
Proposition
If Pπ is a HH permutation (of arbitrary cardinality!), then both Bπ
and Rπ are HH posets.
Theorem (Masulovic, 2007)
A partially ordered set (A,�) is HH if and only if one of thefollowing condition holds:
(1) each connected component of (A,�) is a chain;
(2) (A,�) is a tree;
(3) (A,�) is a dual tree;
(4) (A,�) splits into a tree and a dual tree;
(5) (A,�) is locally bounded and X5-dense (A finite ⇒ lattice).
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations22
![Page 93: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/93.jpg)
The key step
For a permutation Pπ = (A,≤,v1,v2) let Bπ = (A,v1) be the‘blue poset’ (agreement), while Rπ = (A,v2) is the ‘red poset’(inversion).
Proposition
If Pπ is a HH permutation (of arbitrary cardinality!), then both Bπ
and Rπ are HH posets.
Theorem (Masulovic, 2007)
A partially ordered set (A,�) is HH if and only if one of thefollowing condition holds:
(1) each connected component of (A,�) is a chain;
(2) (A,�) is a tree;
(3) (A,�) is a dual tree;
(4) (A,�) splits into a tree and a dual tree;
(5) (A,�) is locally bounded and X5-dense (A finite ⇒ lattice).
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations22
![Page 94: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/94.jpg)
The key step
For a permutation Pπ = (A,≤,v1,v2) let Bπ = (A,v1) be the‘blue poset’ (agreement), while Rπ = (A,v2) is the ‘red poset’(inversion).
Proposition
If Pπ is a HH permutation (of arbitrary cardinality!), then both Bπ
and Rπ are HH posets.
Theorem (Masulovic, 2007)
A partially ordered set (A,�) is HH if and only if one of thefollowing condition holds:
(1) each connected component of (A,�) is a chain;
(2) (A,�) is a tree;
(3) (A,�) is a dual tree;
(4) (A,�) splits into a tree and a dual tree;
(5) (A,�) is locally bounded and X5-dense (A finite ⇒ lattice).
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations22
![Page 95: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/95.jpg)
The key step
For a permutation Pπ = (A,≤,v1,v2) let Bπ = (A,v1) be the‘blue poset’ (agreement), while Rπ = (A,v2) is the ‘red poset’(inversion).
Proposition
If Pπ is a HH permutation (of arbitrary cardinality!), then both Bπ
and Rπ are HH posets.
Theorem (Masulovic, 2007)
A partially ordered set (A,�) is HH if and only if one of thefollowing condition holds:
(1) each connected component of (A,�) is a chain;
(2) (A,�) is a tree;
(3) (A,�) is a dual tree;
(4) (A,�) splits into a tree and a dual tree;
(5) (A,�) is locally bounded and X5-dense (A finite ⇒ lattice).
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations22
![Page 96: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/96.jpg)
The key step (continued)
Corollary
If Pπ = (A,≤,v1,v2) is a finite HH permutation and |A| > 1,then at least one of the posets Bπ and Rπ are disconnected andthus a free sum of at least two chains.
Therefore, by duality of blue and red, w.l.o.g. we may assume thatBπ is a free sum of chains.
Hence,π = ιr1 · · · ιrm
for some positive integers (r1, . . . , rm) such that r1 + · · ·+ rm = n;these are the lengths of maximal blue chains.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations23
![Page 97: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/97.jpg)
The key step (continued)
Corollary
If Pπ = (A,≤,v1,v2) is a finite HH permutation and |A| > 1,then at least one of the posets Bπ and Rπ are disconnected andthus a free sum of at least two chains.
Therefore, by duality of blue and red, w.l.o.g. we may assume thatBπ is a free sum of chains.
Hence,π = ιr1 · · · ιrm
for some positive integers (r1, . . . , rm) such that r1 + · · ·+ rm = n;these are the lengths of maximal blue chains.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations23
![Page 98: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/98.jpg)
The key step (continued)
Corollary
If Pπ = (A,≤,v1,v2) is a finite HH permutation and |A| > 1,then at least one of the posets Bπ and Rπ are disconnected andthus a free sum of at least two chains.
Therefore, by duality of blue and red, w.l.o.g. we may assume thatBπ is a free sum of chains.
Hence,π = ιr1 · · · ιrm
for some positive integers (r1, . . . , rm) such that r1 + · · ·+ rm = n;these are the lengths of maximal blue chains.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations23
![Page 99: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/99.jpg)
The cases
Case 1: Rπ is a free sum of chains =⇒ (i)
Case 2: Rπ is a tree =⇒ (ii)
Case 3: Rπ is a dual tree =⇒ (iii)
Case 4: Rπ splits into a tree and a dual tree =⇒ (iv) or (v)
Case 5: Rπ is a lattice =⇒ (v)
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations24
![Page 100: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/100.jpg)
The cases
Case 1: Rπ is a free sum of chains =⇒ (i)
Case 2: Rπ is a tree =⇒ (ii)
Case 3: Rπ is a dual tree =⇒ (iii)
Case 4: Rπ splits into a tree and a dual tree =⇒ (iv) or (v)
Case 5: Rπ is a lattice =⇒ (v)
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations24
![Page 101: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/101.jpg)
The cases
Case 1: Rπ is a free sum of chains =⇒ (i)
Case 2: Rπ is a tree =⇒ (ii)
Case 3: Rπ is a dual tree =⇒ (iii)
Case 4: Rπ splits into a tree and a dual tree =⇒ (iv) or (v)
Case 5: Rπ is a lattice =⇒ (v)
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations24
![Page 102: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/102.jpg)
The cases
Case 1: Rπ is a free sum of chains =⇒ (i)
Case 2: Rπ is a tree =⇒ (ii)
Case 3: Rπ is a dual tree =⇒ (iii)
Case 4: Rπ splits into a tree and a dual tree =⇒ (iv) or (v)
Case 5: Rπ is a lattice =⇒ (v)
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations24
![Page 103: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/103.jpg)
The cases
Case 1: Rπ is a free sum of chains =⇒ (i)
Case 2: Rπ is a tree =⇒ (ii)
Case 3: Rπ is a dual tree =⇒ (iii)
Case 4: Rπ splits into a tree and a dual tree =⇒ (iv) or (v)
Case 5: Rπ is a lattice =⇒ (v)
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations24
![Page 104: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/104.jpg)
The cases
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations25
![Page 105: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/105.jpg)
The converse...
...consists in verifying that each permutation of the type (i)–(v) isindeed HH.
This is quite a technical proof (which, however, has its hiddenbeauties) involving combinatorics of finite posets and partialorder-preserving transformations.
The most complicated case is (v) – its proof exceeds in length theother four combined.
For details, see
I. Dolinka, E. Jungabel, Finite homomorphism-homogeneouspermutations via edge colourings of chains, Electronic Journal ofCombinatorics 19(4) (2012), #P17, 15 pp.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations26
![Page 106: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/106.jpg)
The converse...
...consists in verifying that each permutation of the type (i)–(v) isindeed HH.
This is quite a technical proof (which, however, has its hiddenbeauties) involving combinatorics of finite posets and partialorder-preserving transformations.
The most complicated case is (v) – its proof exceeds in length theother four combined.
For details, see
I. Dolinka, E. Jungabel, Finite homomorphism-homogeneouspermutations via edge colourings of chains, Electronic Journal ofCombinatorics 19(4) (2012), #P17, 15 pp.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations26
![Page 107: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/107.jpg)
The converse...
...consists in verifying that each permutation of the type (i)–(v) isindeed HH.
This is quite a technical proof (which, however, has its hiddenbeauties) involving combinatorics of finite posets and partialorder-preserving transformations.
The most complicated case is (v) – its proof exceeds in length theother four combined.
For details, see
I. Dolinka, E. Jungabel, Finite homomorphism-homogeneouspermutations via edge colourings of chains, Electronic Journal ofCombinatorics 19(4) (2012), #P17, 15 pp.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations26
![Page 108: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/108.jpg)
The converse...
...consists in verifying that each permutation of the type (i)–(v) isindeed HH.
This is quite a technical proof (which, however, has its hiddenbeauties) involving combinatorics of finite posets and partialorder-preserving transformations.
The most complicated case is (v) – its proof exceeds in length theother four combined.
For details, see
I. Dolinka, E. Jungabel, Finite homomorphism-homogeneouspermutations via edge colourings of chains, Electronic Journal ofCombinatorics 19(4) (2012), #P17, 15 pp.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations26
![Page 109: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/109.jpg)
Problems
Open Problem
Describe countably infinite homomorphism-homogeneouspermutations.
Open Problem
Describe the finite homomorphism-homogeneous structures with nindependent linear orders, n ≥ 3.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations27
![Page 110: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/110.jpg)
Problems
Open Problem
Describe countably infinite homomorphism-homogeneouspermutations.
Open Problem
Describe the finite homomorphism-homogeneous structures with nindependent linear orders, n ≥ 3.
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations27
![Page 111: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/111.jpg)
On certain nights, when it is clear to Blue that Black willnot be going anywhere, he slips out to a bar not far awayfor a beer or two, enjoying the conversations hesometimes has with the bartender, whose name is Red,and who bears an uncanny resemblance to Green, thebartender from the Gray Case so long ago.
Paul Auster: Ghosts (The New York Trilogy)
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations
![Page 112: Finite homomorphism-homogeneous permutations via edge …dockie/pres/Dolinka_090414.pdf · 2014-04-10 · Finite homomorphism-homogeneous permutations via edge colourings of chains](https://reader036.vdocuments.net/reader036/viewer/2022081702/5f7825837d81c846132d02fc/html5/thumbnails/112.jpg)
THANK YOU!
Questions and comments to:
Preprints may be found at:
http://people.dmi.uns.ac.rs/∼dockie
St Andrews (PMC), April 9, 2014 Igor Dolinka: Finite HH permutations28