strongly generic sets
play

Strongly generic sets Ludomir Newelski Instytut Matematyczny - PowerPoint PPT Presentation

Aug 07, 2023 •40 likes •1.66k views

Strongly generic sets Ludomir Newelski Instytut Matematyczny Uniwersytet Wroc lawski June 2011 Newelski Strongly generic sets Set-up T is a countable complete theory, M is a model of T , G is a group definable in M . We work in a monster

  1. Motivating example: the circle S 1 M = ( R , + , · , <, . . . ) o-minimal. G = S 1 , definable in M . Left arcs: ( a , b ] and right arcs: [ a , b ) Finite unions of left [right] arcs are strongly generic. These are all definable strongly generic sets U ⊆ S 1 . Finite unions of left arcs form a G -algebra A ℓ . Finite unions of right arcs form a G -algebra A r . A ℓ ∼ = A r as G -algebras. r : Gen G ( M ) → S ( A ℓ ) is a homeomorphism. r : Gen G ( M ) → S ( A r ) also. This is not accidental... Newelski Strongly generic sets

  2. Motivating example: the circle S 1 M = ( R , + , · , <, . . . ) o-minimal. G = S 1 , definable in M . Left arcs: ( a , b ] and right arcs: [ a , b ) Finite unions of left [right] arcs are strongly generic. These are all definable strongly generic sets U ⊆ S 1 . Finite unions of left arcs form a G -algebra A ℓ . Finite unions of right arcs form a G -algebra A r . A ℓ ∼ = A r as G -algebras. r : Gen G ( M ) → S ( A ℓ ) is a homeomorphism. r : Gen G ( M ) → S ( A r ) also. This is not accidental... Newelski Strongly generic sets

  3. Motivating example: the circle S 1 M = ( R , + , · , <, . . . ) o-minimal. G = S 1 , definable in M . Left arcs: ( a , b ] and right arcs: [ a , b ) Finite unions of left [right] arcs are strongly generic. These are all definable strongly generic sets U ⊆ S 1 . Finite unions of left arcs form a G -algebra A ℓ . Finite unions of right arcs form a G -algebra A r . A ℓ ∼ = A r as G -algebras. r : Gen G ( M ) → S ( A ℓ ) is a homeomorphism. r : Gen G ( M ) → S ( A r ) also. This is not accidental... Newelski Strongly generic sets

  4. Motivating example: the circle S 1 M = ( R , + , · , <, . . . ) o-minimal. G = S 1 , definable in M . Left arcs: ( a , b ] and right arcs: [ a , b ) Finite unions of left [right] arcs are strongly generic. These are all definable strongly generic sets U ⊆ S 1 . Finite unions of left arcs form a G -algebra A ℓ . Finite unions of right arcs form a G -algebra A r . A ℓ ∼ = A r as G -algebras. r : Gen G ( M ) → S ( A ℓ ) is a homeomorphism. r : Gen G ( M ) → S ( A r ) also. This is not accidental... Newelski Strongly generic sets

  5. Motivating example: the circle S 1 M = ( R , + , · , <, . . . ) o-minimal. G = S 1 , definable in M . Left arcs: ( a , b ] and right arcs: [ a , b ) Finite unions of left [right] arcs are strongly generic. These are all definable strongly generic sets U ⊆ S 1 . Finite unions of left arcs form a G -algebra A ℓ . Finite unions of right arcs form a G -algebra A r . A ℓ ∼ = A r as G -algebras. r : Gen G ( M ) → S ( A ℓ ) is a homeomorphism. r : Gen G ( M ) → S ( A r ) also. This is not accidental... Newelski Strongly generic sets

  6. Motivating example: the circle S 1 M = ( R , + , · , <, . . . ) o-minimal. G = S 1 , definable in M . Left arcs: ( a , b ] and right arcs: [ a , b ) Finite unions of left [right] arcs are strongly generic. These are all definable strongly generic sets U ⊆ S 1 . Finite unions of left arcs form a G -algebra A ℓ . Finite unions of right arcs form a G -algebra A r . A ℓ ∼ = A r as G -algebras. r : Gen G ( M ) → S ( A ℓ ) is a homeomorphism. r : Gen G ( M ) → S ( A r ) also. This is not accidental... Newelski Strongly generic sets

  7. Motivating example: the circle S 1 M = ( R , + , · , <, . . . ) o-minimal. G = S 1 , definable in M . Left arcs: ( a , b ] and right arcs: [ a , b ) Finite unions of left [right] arcs are strongly generic. These are all definable strongly generic sets U ⊆ S 1 . Finite unions of left arcs form a G -algebra A ℓ . Finite unions of right arcs form a G -algebra A r . A ℓ ∼ = A r as G -algebras. r : Gen G ( M ) → S ( A ℓ ) is a homeomorphism. r : Gen G ( M ) → S ( A r ) also. This is not accidental... Newelski Strongly generic sets

  8. Motivating example: the circle S 1 M = ( R , + , · , <, . . . ) o-minimal. G = S 1 , definable in M . Left arcs: ( a , b ] and right arcs: [ a , b ) Finite unions of left [right] arcs are strongly generic. These are all definable strongly generic sets U ⊆ S 1 . Finite unions of left arcs form a G -algebra A ℓ . Finite unions of right arcs form a G -algebra A r . A ℓ ∼ = A r as G -algebras. r : Gen G ( M ) → S ( A ℓ ) is a homeomorphism. r : Gen G ( M ) → S ( A r ) also. This is not accidental... Newelski Strongly generic sets

  9. Motivating example: the circle S 1 M = ( R , + , · , <, . . . ) o-minimal. G = S 1 , definable in M . Left arcs: ( a , b ] and right arcs: [ a , b ) Finite unions of left [right] arcs are strongly generic. These are all definable strongly generic sets U ⊆ S 1 . Finite unions of left arcs form a G -algebra A ℓ . Finite unions of right arcs form a G -algebra A r . A ℓ ∼ = A r as G -algebras. r : Gen G ( M ) → S ( A ℓ ) is a homeomorphism. r : Gen G ( M ) → S ( A r ) also. This is not accidental... Newelski Strongly generic sets

  10. Motivating example: the circle S 1 M = ( R , + , · , <, . . . ) o-minimal. G = S 1 , definable in M . Left arcs: ( a , b ] and right arcs: [ a , b ) Finite unions of left [right] arcs are strongly generic. These are all definable strongly generic sets U ⊆ S 1 . Finite unions of left arcs form a G -algebra A ℓ . Finite unions of right arcs form a G -algebra A r . A ℓ ∼ = A r as G -algebras. r : Gen G ( M ) → S ( A ℓ ) is a homeomorphism. r : Gen G ( M ) → S ( A r ) also. This is not accidental... Newelski Strongly generic sets

  11. S 1 in the saturated setting Let M ∗ ≻ M be ℵ 0 -saturated. Bad news The only strongly generic definable sets U ⊆ S 1 ( M ∗ ) are ∅ and S 1 ( M ∗ ). Solution Externally definable sets. Newelski Strongly generic sets

  12. S 1 in the saturated setting Let M ∗ ≻ M be ℵ 0 -saturated. Bad news The only strongly generic definable sets U ⊆ S 1 ( M ∗ ) are ∅ and S 1 ( M ∗ ). Solution Externally definable sets. Newelski Strongly generic sets

  13. S 1 in the saturated setting Let M ∗ ≻ M be ℵ 0 -saturated. Bad news The only strongly generic definable sets U ⊆ S 1 ( M ∗ ) are ∅ and S 1 ( M ∗ ). Solution Externally definable sets. Newelski Strongly generic sets

  14. S 1 in the saturated setting Let M ∗ ≻ M be ℵ 0 -saturated. Bad news The only strongly generic definable sets U ⊆ S 1 ( M ∗ ) are ∅ and S 1 ( M ∗ ). Solution Externally definable sets. Newelski Strongly generic sets

  15. S 1 in the saturated setting Let M ∗ ≻ M be ℵ 0 -saturated. Bad news The only strongly generic definable sets U ⊆ S 1 ( M ∗ ) are ∅ and S 1 ( M ∗ ). Solution Externally definable sets. Newelski Strongly generic sets

  16. Back to the general case Let Def ext , G ( M ) = the G -algebra of externally definable subsets of G . Let SGen ext , G ( M ) = { U ⊆ ext G : U is strongly generic } . SGen ext , G ( M ) need not be an algebra of sets (see G = S 1 ). Newelski Strongly generic sets

  17. Back to the general case Let Def ext , G ( M ) = the G -algebra of externally definable subsets of G . Let SGen ext , G ( M ) = { U ⊆ ext G : U is strongly generic } . SGen ext , G ( M ) need not be an algebra of sets (see G = S 1 ). Newelski Strongly generic sets

  18. Back to the general case Let Def ext , G ( M ) = the G -algebra of externally definable subsets of G . Let SGen ext , G ( M ) = { U ⊆ ext G : U is strongly generic } . SGen ext , G ( M ) need not be an algebra of sets (see G = S 1 ). Newelski Strongly generic sets

  19. Back to the general case Let Def ext , G ( M ) = the G -algebra of externally definable subsets of G . Let SGen ext , G ( M ) = { U ⊆ ext G : U is strongly generic } . SGen ext , G ( M ) need not be an algebra of sets (see G = S 1 ). Newelski Strongly generic sets

  20. Back to G = S 1 U ⊆ ext S 1 ( M ∗ ) is strongly generic iff U = G 00 ( M ∗ ) · V for some strongly generic V ⊆ def S 1 ( M ). Let A ∗ ℓ = { G 00 ( M ∗ ) V : V ∈ A ℓ } A ∗ r = { G 00 ( M ∗ ) V : V ∈ A r } These are G -algebras isomorphic to A ℓ and A r r : Gen G ( M ∗ ) ≈ → S ( A ∗ ℓ ) and r : Gen G ( M ∗ ) ≈ → S ( A ∗ r ) Newelski Strongly generic sets

  21. Back to G = S 1 U ⊆ ext S 1 ( M ∗ ) is strongly generic iff U = G 00 ( M ∗ ) · V for some strongly generic V ⊆ def S 1 ( M ). Let A ∗ ℓ = { G 00 ( M ∗ ) V : V ∈ A ℓ } A ∗ r = { G 00 ( M ∗ ) V : V ∈ A r } These are G -algebras isomorphic to A ℓ and A r r : Gen G ( M ∗ ) ≈ → S ( A ∗ ℓ ) and r : Gen G ( M ∗ ) ≈ → S ( A ∗ r ) Newelski Strongly generic sets

  22. Back to G = S 1 U ⊆ ext S 1 ( M ∗ ) is strongly generic iff U = G 00 ( M ∗ ) · V for some strongly generic V ⊆ def S 1 ( M ). Let A ∗ ℓ = { G 00 ( M ∗ ) V : V ∈ A ℓ } A ∗ r = { G 00 ( M ∗ ) V : V ∈ A r } These are G -algebras isomorphic to A ℓ and A r r : Gen G ( M ∗ ) ≈ → S ( A ∗ ℓ ) and r : Gen G ( M ∗ ) ≈ → S ( A ∗ r ) Newelski Strongly generic sets

  23. Back to G = S 1 U ⊆ ext S 1 ( M ∗ ) is strongly generic iff U = G 00 ( M ∗ ) · V for some strongly generic V ⊆ def S 1 ( M ). Let A ∗ ℓ = { G 00 ( M ∗ ) V : V ∈ A ℓ } A ∗ r = { G 00 ( M ∗ ) V : V ∈ A r } These are G -algebras isomorphic to A ℓ and A r r : Gen G ( M ∗ ) ≈ → S ( A ∗ ℓ ) and r : Gen G ( M ∗ ) ≈ → S ( A ∗ r ) Newelski Strongly generic sets

  24. Back to G = S 1 U ⊆ ext S 1 ( M ∗ ) is strongly generic iff U = G 00 ( M ∗ ) · V for some strongly generic V ⊆ def S 1 ( M ). Let A ∗ ℓ = { G 00 ( M ∗ ) V : V ∈ A ℓ } A ∗ r = { G 00 ( M ∗ ) V : V ∈ A r } These are G -algebras isomorphic to A ℓ and A r r : Gen G ( M ∗ ) ≈ → S ( A ∗ ℓ ) and r : Gen G ( M ∗ ) ≈ → S ( A ∗ r ) Newelski Strongly generic sets

  25. The general setting Definition A maximal G -algebra A ⊆ SGen ext , G ( M ) is called an image algebra. Example A ℓ , A r , A ∗ ℓ , A ∗ r are image algebras, in the respective models. Theorem 2 (1) Image algebras are all G -isomorphic and SGen ext , G ( M ) is a union of them. (2) If A is an image algebra, then there is a G -epimorphism Def ext , G ( M ) → A . This G -epimorphism is a general counterpart of a G -invariant Keisler measure. Newelski Strongly generic sets

  26. The general setting Definition A maximal G -algebra A ⊆ SGen ext , G ( M ) is called an image algebra. Example A ℓ , A r , A ∗ ℓ , A ∗ r are image algebras, in the respective models. Theorem 2 (1) Image algebras are all G -isomorphic and SGen ext , G ( M ) is a union of them. (2) If A is an image algebra, then there is a G -epimorphism Def ext , G ( M ) → A . This G -epimorphism is a general counterpart of a G -invariant Keisler measure. Newelski Strongly generic sets

  27. The general setting Definition A maximal G -algebra A ⊆ SGen ext , G ( M ) is called an image algebra. Example A ℓ , A r , A ∗ ℓ , A ∗ r are image algebras, in the respective models. Theorem 2 (1) Image algebras are all G -isomorphic and SGen ext , G ( M ) is a union of them. (2) If A is an image algebra, then there is a G -epimorphism Def ext , G ( M ) → A . This G -epimorphism is a general counterpart of a G -invariant Keisler measure. Newelski Strongly generic sets

  28. The general setting Definition A maximal G -algebra A ⊆ SGen ext , G ( M ) is called an image algebra. Example A ℓ , A r , A ∗ ℓ , A ∗ r are image algebras, in the respective models. Theorem 2 (1) Image algebras are all G -isomorphic and SGen ext , G ( M ) is a union of them. (2) If A is an image algebra, then there is a G -epimorphism Def ext , G ( M ) → A . This G -epimorphism is a general counterpart of a G -invariant Keisler measure. Newelski Strongly generic sets

  29. The general setting Definition A maximal G -algebra A ⊆ SGen ext , G ( M ) is called an image algebra. Example A ℓ , A r , A ∗ ℓ , A ∗ r are image algebras, in the respective models. Theorem 2 (1) Image algebras are all G -isomorphic and SGen ext , G ( M ) is a union of them. (2) If A is an image algebra, then there is a G -epimorphism Def ext , G ( M ) → A . This G -epimorphism is a general counterpart of a G -invariant Keisler measure. Newelski Strongly generic sets

  30. The general setting Definition A maximal G -algebra A ⊆ SGen ext , G ( M ) is called an image algebra. Example A ℓ , A r , A ∗ ℓ , A ∗ r are image algebras, in the respective models. Theorem 2 (1) Image algebras are all G -isomorphic and SGen ext , G ( M ) is a union of them. (2) If A is an image algebra, then there is a G -epimorphism Def ext , G ( M ) → A . This G -epimorphism is a general counterpart of a G -invariant Keisler measure. Newelski Strongly generic sets

  31. Topological dynamics Let S ext , G ( M ) = S ( Def ext , G ( M )) This is a G -flow. For p ∈ S ext , G ( M ) and U ∈ Def ext , G ( M ) let d p U = { g ∈ G : g − 1 U ∈ p } . d p U ∈ Def ext , G ( M ) d p : Def ext , G ( M ) → Def ext , G ( M ) is a G -endomorphism. The function d : S ext , G ( M ) → End ( Def ext , G ( M )) mapping p to d p is a bijection and induces on S ext , G ( M ) a semigroup operation ∗ . Newelski Strongly generic sets

  32. Topological dynamics Let S ext , G ( M ) = S ( Def ext , G ( M )) This is a G -flow. For p ∈ S ext , G ( M ) and U ∈ Def ext , G ( M ) let d p U = { g ∈ G : g − 1 U ∈ p } . d p U ∈ Def ext , G ( M ) d p : Def ext , G ( M ) → Def ext , G ( M ) is a G -endomorphism. The function d : S ext , G ( M ) → End ( Def ext , G ( M )) mapping p to d p is a bijection and induces on S ext , G ( M ) a semigroup operation ∗ . Newelski Strongly generic sets

  33. Topological dynamics Let S ext , G ( M ) = S ( Def ext , G ( M )) This is a G -flow. For p ∈ S ext , G ( M ) and U ∈ Def ext , G ( M ) let d p U = { g ∈ G : g − 1 U ∈ p } . d p U ∈ Def ext , G ( M ) d p : Def ext , G ( M ) → Def ext , G ( M ) is a G -endomorphism. The function d : S ext , G ( M ) → End ( Def ext , G ( M )) mapping p to d p is a bijection and induces on S ext , G ( M ) a semigroup operation ∗ . Newelski Strongly generic sets

  34. Topological dynamics Let S ext , G ( M ) = S ( Def ext , G ( M )) This is a G -flow. For p ∈ S ext , G ( M ) and U ∈ Def ext , G ( M ) let d p U = { g ∈ G : g − 1 U ∈ p } . d p U ∈ Def ext , G ( M ) d p : Def ext , G ( M ) → Def ext , G ( M ) is a G -endomorphism. The function d : S ext , G ( M ) → End ( Def ext , G ( M )) mapping p to d p is a bijection and induces on S ext , G ( M ) a semigroup operation ∗ . Newelski Strongly generic sets

  35. Topological dynamics Let S ext , G ( M ) = S ( Def ext , G ( M )) This is a G -flow. For p ∈ S ext , G ( M ) and U ∈ Def ext , G ( M ) let d p U = { g ∈ G : g − 1 U ∈ p } . d p U ∈ Def ext , G ( M ) d p : Def ext , G ( M ) → Def ext , G ( M ) is a G -endomorphism. The function d : S ext , G ( M ) → End ( Def ext , G ( M )) mapping p to d p is a bijection and induces on S ext , G ( M ) a semigroup operation ∗ . Newelski Strongly generic sets

  36. Topological dynamics Let S ext , G ( M ) = S ( Def ext , G ( M )) This is a G -flow. For p ∈ S ext , G ( M ) and U ∈ Def ext , G ( M ) let d p U = { g ∈ G : g − 1 U ∈ p } . d p U ∈ Def ext , G ( M ) d p : Def ext , G ( M ) → Def ext , G ( M ) is a G -endomorphism. The function d : S ext , G ( M ) → End ( Def ext , G ( M )) mapping p to d p is a bijection and induces on S ext , G ( M ) a semigroup operation ∗ . Newelski Strongly generic sets

  37. Topological dynamics Let S ext , G ( M ) = S ( Def ext , G ( M )) This is a G -flow. For p ∈ S ext , G ( M ) and U ∈ Def ext , G ( M ) let d p U = { g ∈ G : g − 1 U ∈ p } . d p U ∈ Def ext , G ( M ) d p : Def ext , G ( M ) → Def ext , G ( M ) is a G -endomorphism. The function d : S ext , G ( M ) → End ( Def ext , G ( M )) mapping p to d p is a bijection and induces on S ext , G ( M ) a semigroup operation ∗ . Newelski Strongly generic sets

  38. Topological dynamics Let S ext , G ( M ) = S ( Def ext , G ( M )) This is a G -flow. For p ∈ S ext , G ( M ) and U ∈ Def ext , G ( M ) let d p U = { g ∈ G : g − 1 U ∈ p } . d p U ∈ Def ext , G ( M ) d p : Def ext , G ( M ) → Def ext , G ( M ) is a G -endomorphism. The function d : S ext , G ( M ) → End ( Def ext , G ( M )) mapping p to d p is a bijection and induces on S ext , G ( M ) a semigroup operation ∗ . Newelski Strongly generic sets

  39. Topological dynamics Let S ext , G ( M ) = S ( Def ext , G ( M )) This is a G -flow. For p ∈ S ext , G ( M ) and U ∈ Def ext , G ( M ) let d p U = { g ∈ G : g − 1 U ∈ p } . d p U ∈ Def ext , G ( M ) d p : Def ext , G ( M ) → Def ext , G ( M ) is a G -endomorphism. The function d : S ext , G ( M ) → End ( Def ext , G ( M )) mapping p to d p is a bijection and induces on S ext , G ( M ) a semigroup operation ∗ . Newelski Strongly generic sets

  40. Topological dynamics For p , q ∈ S ext , G ( M ) and U ∈ Def ext , G ( M ) we have: U ∈ p ∗ q ⇐ ⇒ d q U ∈ p . S ext , G ( M ) is isomorphic to its Ellis semigroup. minimal subflows of S ext , G ( M ) = minimal left ideals I ⊳ S ext , G ( M ). For p ∈ S ext , G ( M ): Im ( d p ) ⊆ Def ext , G ( M ) is a G -subalgebra, Ker ( d p ) ⊆ Def ext , G ( M ) is a G -ideal. Newelski Strongly generic sets

  41. Topological dynamics For p , q ∈ S ext , G ( M ) and U ∈ Def ext , G ( M ) we have: U ∈ p ∗ q ⇐ ⇒ d q U ∈ p . S ext , G ( M ) is isomorphic to its Ellis semigroup. minimal subflows of S ext , G ( M ) = minimal left ideals I ⊳ S ext , G ( M ). For p ∈ S ext , G ( M ): Im ( d p ) ⊆ Def ext , G ( M ) is a G -subalgebra, Ker ( d p ) ⊆ Def ext , G ( M ) is a G -ideal. Newelski Strongly generic sets

  42. Topological dynamics For p , q ∈ S ext , G ( M ) and U ∈ Def ext , G ( M ) we have: U ∈ p ∗ q ⇐ ⇒ d q U ∈ p . S ext , G ( M ) is isomorphic to its Ellis semigroup. minimal subflows of S ext , G ( M ) = minimal left ideals I ⊳ S ext , G ( M ). For p ∈ S ext , G ( M ): Im ( d p ) ⊆ Def ext , G ( M ) is a G -subalgebra, Ker ( d p ) ⊆ Def ext , G ( M ) is a G -ideal. Newelski Strongly generic sets

  43. Topological dynamics For p , q ∈ S ext , G ( M ) and U ∈ Def ext , G ( M ) we have: U ∈ p ∗ q ⇐ ⇒ d q U ∈ p . S ext , G ( M ) is isomorphic to its Ellis semigroup. minimal subflows of S ext , G ( M ) = minimal left ideals I ⊳ S ext , G ( M ). For p ∈ S ext , G ( M ): Im ( d p ) ⊆ Def ext , G ( M ) is a G -subalgebra, Ker ( d p ) ⊆ Def ext , G ( M ) is a G -ideal. Newelski Strongly generic sets

  44. Topological dynamics For p , q ∈ S ext , G ( M ) and U ∈ Def ext , G ( M ) we have: U ∈ p ∗ q ⇐ ⇒ d q U ∈ p . S ext , G ( M ) is isomorphic to its Ellis semigroup. minimal subflows of S ext , G ( M ) = minimal left ideals I ⊳ S ext , G ( M ). For p ∈ S ext , G ( M ): Im ( d p ) ⊆ Def ext , G ( M ) is a G -subalgebra, Ker ( d p ) ⊆ Def ext , G ( M ) is a G -ideal. Newelski Strongly generic sets

  45. Topological dynamics For p , q ∈ S ext , G ( M ) and U ∈ Def ext , G ( M ) we have: U ∈ p ∗ q ⇐ ⇒ d q U ∈ p . S ext , G ( M ) is isomorphic to its Ellis semigroup. minimal subflows of S ext , G ( M ) = minimal left ideals I ⊳ S ext , G ( M ). For p ∈ S ext , G ( M ): Im ( d p ) ⊆ Def ext , G ( M ) is a G -subalgebra, Ker ( d p ) ⊆ Def ext , G ( M ) is a G -ideal. Newelski Strongly generic sets

  46. Topological dynamics For p , q ∈ S ext , G ( M ) and U ∈ Def ext , G ( M ) we have: U ∈ p ∗ q ⇐ ⇒ d q U ∈ p . S ext , G ( M ) is isomorphic to its Ellis semigroup. minimal subflows of S ext , G ( M ) = minimal left ideals I ⊳ S ext , G ( M ). For p ∈ S ext , G ( M ): Im ( d p ) ⊆ Def ext , G ( M ) is a G -subalgebra, Ker ( d p ) ⊆ Def ext , G ( M ) is a G -ideal. Newelski Strongly generic sets

  47. Strongly generic sets explained If p ∈ S ext , G ( M ) is almost periodic, then Im ( d p ) consists of strongly generic sets and is an image algebra. Every strongly generic set U ⊆ ext G arises this way, i.e. � SGen ext , G ( M ) = { Im ( d p ) : p ∈ S ext , G ( M ) is almost periodic } . Every image algebra arises this way, i.e. Assume A ⊆ SGen ext , G ( M ) is an image algebra and I ⊳ S ext , G ( M ). Then A = Im ( d p ) for some p ∈ I . Newelski Strongly generic sets

  48. Strongly generic sets explained If p ∈ S ext , G ( M ) is almost periodic, then Im ( d p ) consists of strongly generic sets and is an image algebra. Every strongly generic set U ⊆ ext G arises this way, i.e. � SGen ext , G ( M ) = { Im ( d p ) : p ∈ S ext , G ( M ) is almost periodic } . Every image algebra arises this way, i.e. Assume A ⊆ SGen ext , G ( M ) is an image algebra and I ⊳ S ext , G ( M ). Then A = Im ( d p ) for some p ∈ I . Newelski Strongly generic sets

  49. Strongly generic sets explained If p ∈ S ext , G ( M ) is almost periodic, then Im ( d p ) consists of strongly generic sets and is an image algebra. Every strongly generic set U ⊆ ext G arises this way, i.e. � SGen ext , G ( M ) = { Im ( d p ) : p ∈ S ext , G ( M ) is almost periodic } . Every image algebra arises this way, i.e. Assume A ⊆ SGen ext , G ( M ) is an image algebra and I ⊳ S ext , G ( M ). Then A = Im ( d p ) for some p ∈ I . Newelski Strongly generic sets

  50. Strongly generic sets explained If p ∈ S ext , G ( M ) is almost periodic, then Im ( d p ) consists of strongly generic sets and is an image algebra. Every strongly generic set U ⊆ ext G arises this way, i.e. � SGen ext , G ( M ) = { Im ( d p ) : p ∈ S ext , G ( M ) is almost periodic } . Every image algebra arises this way, i.e. Assume A ⊆ SGen ext , G ( M ) is an image algebra and I ⊳ S ext , G ( M ). Then A = Im ( d p ) for some p ∈ I . Newelski Strongly generic sets

  51. Strongly generic sets explained If p ∈ S ext , G ( M ) is almost periodic, then Im ( d p ) consists of strongly generic sets and is an image algebra. Every strongly generic set U ⊆ ext G arises this way, i.e. � SGen ext , G ( M ) = { Im ( d p ) : p ∈ S ext , G ( M ) is almost periodic } . Every image algebra arises this way, i.e. Assume A ⊆ SGen ext , G ( M ) is an image algebra and I ⊳ S ext , G ( M ). Then A = Im ( d p ) for some p ∈ I . Newelski Strongly generic sets

  52. Strongly generic sets explained If p ∈ S ext , G ( M ) is almost periodic, then Im ( d p ) consists of strongly generic sets and is an image algebra. Every strongly generic set U ⊆ ext G arises this way, i.e. � SGen ext , G ( M ) = { Im ( d p ) : p ∈ S ext , G ( M ) is almost periodic } . Every image algebra arises this way, i.e. Assume A ⊆ SGen ext , G ( M ) is an image algebra and I ⊳ S ext , G ( M ). Then A = Im ( d p ) for some p ∈ I . Newelski Strongly generic sets

  53. Strongly generic sets explained If p ∈ S ext , G ( M ) is almost periodic, then Im ( d p ) consists of strongly generic sets and is an image algebra. Every strongly generic set U ⊆ ext G arises this way, i.e. � SGen ext , G ( M ) = { Im ( d p ) : p ∈ S ext , G ( M ) is almost periodic } . Every image algebra arises this way, i.e. Assume A ⊆ SGen ext , G ( M ) is an image algebra and I ⊳ S ext , G ( M ). Then A = Im ( d p ) for some p ∈ I . Newelski Strongly generic sets

  54. Strongly generic sets explained If p ∈ S ext , G ( M ) is almost periodic, then Im ( d p ) consists of strongly generic sets and is an image algebra. Every strongly generic set U ⊆ ext G arises this way, i.e. � SGen ext , G ( M ) = { Im ( d p ) : p ∈ S ext , G ( M ) is almost periodic } . Every image algebra arises this way, i.e. Assume A ⊆ SGen ext , G ( M ) is an image algebra and I ⊳ S ext , G ( M ). Then A = Im ( d p ) for some p ∈ I . Newelski Strongly generic sets

  55. Strongly generic sets explained Assume I ⊳ S ext , G ( M ). All d p , p ∈ I , have common kernel K I ⊆ Def ext , G ( M ). Im ( d p ) ∼ = Def ext , G ( M ) / K I , so all image algebras are G -isomorphic. Let A = Im ( d p ) be an image algebra. Then d p : Def ext , G ( M ) → A is a G -epimorphism. Also S ( A ) ≈ I . So we have proved Theorem 2. Newelski Strongly generic sets

  56. Strongly generic sets explained Assume I ⊳ S ext , G ( M ). All d p , p ∈ I , have common kernel K I ⊆ Def ext , G ( M ). Im ( d p ) ∼ = Def ext , G ( M ) / K I , so all image algebras are G -isomorphic. Let A = Im ( d p ) be an image algebra. Then d p : Def ext , G ( M ) → A is a G -epimorphism. Also S ( A ) ≈ I . So we have proved Theorem 2. Newelski Strongly generic sets

  57. Strongly generic sets explained Assume I ⊳ S ext , G ( M ). All d p , p ∈ I , have common kernel K I ⊆ Def ext , G ( M ). Im ( d p ) ∼ = Def ext , G ( M ) / K I , so all image algebras are G -isomorphic. Let A = Im ( d p ) be an image algebra. Then d p : Def ext , G ( M ) → A is a G -epimorphism. Also S ( A ) ≈ I . So we have proved Theorem 2. Newelski Strongly generic sets

  58. Strongly generic sets explained Assume I ⊳ S ext , G ( M ). All d p , p ∈ I , have common kernel K I ⊆ Def ext , G ( M ). Im ( d p ) ∼ = Def ext , G ( M ) / K I , so all image algebras are G -isomorphic. Let A = Im ( d p ) be an image algebra. Then d p : Def ext , G ( M ) → A is a G -epimorphism. Also S ( A ) ≈ I . So we have proved Theorem 2. Newelski Strongly generic sets

  59. Strongly generic sets explained Assume I ⊳ S ext , G ( M ). All d p , p ∈ I , have common kernel K I ⊆ Def ext , G ( M ). Im ( d p ) ∼ = Def ext , G ( M ) / K I , so all image algebras are G -isomorphic. Let A = Im ( d p ) be an image algebra. Then d p : Def ext , G ( M ) → A is a G -epimorphism. Also S ( A ) ≈ I . So we have proved Theorem 2. Newelski Strongly generic sets

  60. Strongly generic sets explained Assume I ⊳ S ext , G ( M ). All d p , p ∈ I , have common kernel K I ⊆ Def ext , G ( M ). Im ( d p ) ∼ = Def ext , G ( M ) / K I , so all image algebras are G -isomorphic. Let A = Im ( d p ) be an image algebra. Then d p : Def ext , G ( M ) → A is a G -epimorphism. Also S ( A ) ≈ I . So we have proved Theorem 2. Newelski Strongly generic sets

  61. Strongly generic sets explained Assume I ⊳ S ext , G ( M ). All d p , p ∈ I , have common kernel K I ⊆ Def ext , G ( M ). Im ( d p ) ∼ = Def ext , G ( M ) / K I , so all image algebras are G -isomorphic. Let A = Im ( d p ) be an image algebra. Then d p : Def ext , G ( M ) → A is a G -epimorphism. Also S ( A ) ≈ I . So we have proved Theorem 2. Newelski Strongly generic sets

  62. Strongly generic sets explained Assume I ⊳ S ext , G ( M ). All d p , p ∈ I , have common kernel K I ⊆ Def ext , G ( M ). Im ( d p ) ∼ = Def ext , G ( M ) / K I , so all image algebras are G -isomorphic. Let A = Im ( d p ) be an image algebra. Then d p : Def ext , G ( M ) → A is a G -epimorphism. Also S ( A ) ≈ I . So we have proved Theorem 2. Newelski Strongly generic sets

  63. Ideal groups Definition (1) u ∈ S ext , G ( M ) is an idempotent iff u 2 = u . (2) J = { u ∈ S ext , G ( M ) : u 2 = u } . (3) For I ⊳ S ext , G ( M ) let J ( I ) = J ∩ I . J ( I ) � = ∅ . Let u ∈ J ( I ). Then uI ⊆ I is a group. Groups uI are called ideal groups. All ideal groups are isomorphic and I is the disjoint union of them.(well known from topological dynamics). p , q ∈ I are in the same uI iff Im ( d p ) = Im ( d q ). If u ∈ J ( I ) and A = Im ( d u ), then d u : Def ext , G ( M ) → A is a retraction. Newelski Strongly generic sets

  64. Ideal groups Definition (1) u ∈ S ext , G ( M ) is an idempotent iff u 2 = u . (2) J = { u ∈ S ext , G ( M ) : u 2 = u } . (3) For I ⊳ S ext , G ( M ) let J ( I ) = J ∩ I . J ( I ) � = ∅ . Let u ∈ J ( I ). Then uI ⊆ I is a group. Groups uI are called ideal groups. All ideal groups are isomorphic and I is the disjoint union of them.(well known from topological dynamics). p , q ∈ I are in the same uI iff Im ( d p ) = Im ( d q ). If u ∈ J ( I ) and A = Im ( d u ), then d u : Def ext , G ( M ) → A is a retraction. Newelski Strongly generic sets

  65. Ideal groups Definition (1) u ∈ S ext , G ( M ) is an idempotent iff u 2 = u . (2) J = { u ∈ S ext , G ( M ) : u 2 = u } . (3) For I ⊳ S ext , G ( M ) let J ( I ) = J ∩ I . J ( I ) � = ∅ . Let u ∈ J ( I ). Then uI ⊆ I is a group. Groups uI are called ideal groups. All ideal groups are isomorphic and I is the disjoint union of them.(well known from topological dynamics). p , q ∈ I are in the same uI iff Im ( d p ) = Im ( d q ). If u ∈ J ( I ) and A = Im ( d u ), then d u : Def ext , G ( M ) → A is a retraction. Newelski Strongly generic sets

  66. Ideal groups Definition (1) u ∈ S ext , G ( M ) is an idempotent iff u 2 = u . (2) J = { u ∈ S ext , G ( M ) : u 2 = u } . (3) For I ⊳ S ext , G ( M ) let J ( I ) = J ∩ I . J ( I ) � = ∅ . Let u ∈ J ( I ). Then uI ⊆ I is a group. Groups uI are called ideal groups. All ideal groups are isomorphic and I is the disjoint union of them.(well known from topological dynamics). p , q ∈ I are in the same uI iff Im ( d p ) = Im ( d q ). If u ∈ J ( I ) and A = Im ( d u ), then d u : Def ext , G ( M ) → A is a retraction. Newelski Strongly generic sets

  67. Ideal groups Definition (1) u ∈ S ext , G ( M ) is an idempotent iff u 2 = u . (2) J = { u ∈ S ext , G ( M ) : u 2 = u } . (3) For I ⊳ S ext , G ( M ) let J ( I ) = J ∩ I . J ( I ) � = ∅ . Let u ∈ J ( I ). Then uI ⊆ I is a group. Groups uI are called ideal groups. All ideal groups are isomorphic and I is the disjoint union of them.(well known from topological dynamics). p , q ∈ I are in the same uI iff Im ( d p ) = Im ( d q ). If u ∈ J ( I ) and A = Im ( d u ), then d u : Def ext , G ( M ) → A is a retraction. Newelski Strongly generic sets

  68. Ideal groups Definition (1) u ∈ S ext , G ( M ) is an idempotent iff u 2 = u . (2) J = { u ∈ S ext , G ( M ) : u 2 = u } . (3) For I ⊳ S ext , G ( M ) let J ( I ) = J ∩ I . J ( I ) � = ∅ . Let u ∈ J ( I ). Then uI ⊆ I is a group. Groups uI are called ideal groups. All ideal groups are isomorphic and I is the disjoint union of them.(well known from topological dynamics). p , q ∈ I are in the same uI iff Im ( d p ) = Im ( d q ). If u ∈ J ( I ) and A = Im ( d u ), then d u : Def ext , G ( M ) → A is a retraction. Newelski Strongly generic sets

  69. Ideal groups Definition (1) u ∈ S ext , G ( M ) is an idempotent iff u 2 = u . (2) J = { u ∈ S ext , G ( M ) : u 2 = u } . (3) For I ⊳ S ext , G ( M ) let J ( I ) = J ∩ I . J ( I ) � = ∅ . Let u ∈ J ( I ). Then uI ⊆ I is a group. Groups uI are called ideal groups. All ideal groups are isomorphic and I is the disjoint union of them.(well known from topological dynamics). p , q ∈ I are in the same uI iff Im ( d p ) = Im ( d q ). If u ∈ J ( I ) and A = Im ( d u ), then d u : Def ext , G ( M ) → A is a retraction. Newelski Strongly generic sets

  70. Ideal groups Definition (1) u ∈ S ext , G ( M ) is an idempotent iff u 2 = u . (2) J = { u ∈ S ext , G ( M ) : u 2 = u } . (3) For I ⊳ S ext , G ( M ) let J ( I ) = J ∩ I . J ( I ) � = ∅ . Let u ∈ J ( I ). Then uI ⊆ I is a group. Groups uI are called ideal groups. All ideal groups are isomorphic and I is the disjoint union of them.(well known from topological dynamics). p , q ∈ I are in the same uI iff Im ( d p ) = Im ( d q ). If u ∈ J ( I ) and A = Im ( d u ), then d u : Def ext , G ( M ) → A is a retraction. Newelski Strongly generic sets

  71. Ideal groups Definition (1) u ∈ S ext , G ( M ) is an idempotent iff u 2 = u . (2) J = { u ∈ S ext , G ( M ) : u 2 = u } . (3) For I ⊳ S ext , G ( M ) let J ( I ) = J ∩ I . J ( I ) � = ∅ . Let u ∈ J ( I ). Then uI ⊆ I is a group. Groups uI are called ideal groups. All ideal groups are isomorphic and I is the disjoint union of them.(well known from topological dynamics). p , q ∈ I are in the same uI iff Im ( d p ) = Im ( d q ). If u ∈ J ( I ) and A = Im ( d u ), then d u : Def ext , G ( M ) → A is a retraction. Newelski Strongly generic sets

  72. Ideal groups Definition (1) u ∈ S ext , G ( M ) is an idempotent iff u 2 = u . (2) J = { u ∈ S ext , G ( M ) : u 2 = u } . (3) For I ⊳ S ext , G ( M ) let J ( I ) = J ∩ I . J ( I ) � = ∅ . Let u ∈ J ( I ). Then uI ⊆ I is a group. Groups uI are called ideal groups. All ideal groups are isomorphic and I is the disjoint union of them.(well known from topological dynamics). p , q ∈ I are in the same uI iff Im ( d p ) = Im ( d q ). If u ∈ J ( I ) and A = Im ( d u ), then d u : Def ext , G ( M ) → A is a retraction. Newelski Strongly generic sets

  73. Ideal groups Definition (1) u ∈ S ext , G ( M ) is an idempotent iff u 2 = u . (2) J = { u ∈ S ext , G ( M ) : u 2 = u } . (3) For I ⊳ S ext , G ( M ) let J ( I ) = J ∩ I . J ( I ) � = ∅ . Let u ∈ J ( I ). Then uI ⊆ I is a group. Groups uI are called ideal groups. All ideal groups are isomorphic and I is the disjoint union of them.(well known from topological dynamics). p , q ∈ I are in the same uI iff Im ( d p ) = Im ( d q ). If u ∈ J ( I ) and A = Im ( d u ), then d u : Def ext , G ( M ) → A is a retraction. Newelski Strongly generic sets

  74. Ideal groups Definition (1) u ∈ S ext , G ( M ) is an idempotent iff u 2 = u . (2) J = { u ∈ S ext , G ( M ) : u 2 = u } . (3) For I ⊳ S ext , G ( M ) let J ( I ) = J ∩ I . J ( I ) � = ∅ . Let u ∈ J ( I ). Then uI ⊆ I is a group. Groups uI are called ideal groups. All ideal groups are isomorphic and I is the disjoint union of them.(well known from topological dynamics). p , q ∈ I are in the same uI iff Im ( d p ) = Im ( d q ). If u ∈ J ( I ) and A = Im ( d u ), then d u : Def ext , G ( M ) → A is a retraction. Newelski Strongly generic sets

  75. Ideal groups Definition (1) u ∈ S ext , G ( M ) is an idempotent iff u 2 = u . (2) J = { u ∈ S ext , G ( M ) : u 2 = u } . (3) For I ⊳ S ext , G ( M ) let J ( I ) = J ∩ I . J ( I ) � = ∅ . Let u ∈ J ( I ). Then uI ⊆ I is a group. Groups uI are called ideal groups. All ideal groups are isomorphic and I is the disjoint union of them.(well known from topological dynamics). p , q ∈ I are in the same uI iff Im ( d p ) = Im ( d q ). If u ∈ J ( I ) and A = Im ( d u ), then d u : Def ext , G ( M ) → A is a retraction. Newelski Strongly generic sets

  76. Ideal groups Definition (1) u ∈ S ext , G ( M ) is an idempotent iff u 2 = u . (2) J = { u ∈ S ext , G ( M ) : u 2 = u } . (3) For I ⊳ S ext , G ( M ) let J ( I ) = J ∩ I . J ( I ) � = ∅ . Let u ∈ J ( I ). Then uI ⊆ I is a group. Groups uI are called ideal groups. All ideal groups are isomorphic and I is the disjoint union of them.(well known from topological dynamics). p , q ∈ I are in the same uI iff Im ( d p ) = Im ( d q ). If u ∈ J ( I ) and A = Im ( d u ), then d u : Def ext , G ( M ) → A is a retraction. Newelski Strongly generic sets

Recommend

1 ) Hom sets of reals, A dichotomy for ( 2 with applications to generic absoluteness Trevor

1 ) Hom sets of reals, A dichotomy for ( 2 with applications to generic absoluteness Trevor

Some nice sets of reals A dichotomy for ( 2 1 ) Hom sets Applications to generic absoluteness 1 ) Hom sets of reals, A dichotomy for ( 2 with applications to generic absoluteness Trevor Wilson University of California, Irvine

422 views • 24 slides
Bent functions, difference sets and strongly regular graphs Wilfried Meidl Sabanc University

Bent functions, difference sets and strongly regular graphs Wilfried Meidl Sabanc University

Bent functions, difference sets and strongly regular graphs Wilfried Meidl Sabanc University December 1, 2013 Bent Functions, Definition, Properties Bent Functions and Difference Sets Strongly Regular Graphs A Construction

580 views • 38 slides
Generic absoluteness and universally Baire sets of reals Trevor Wilson Miami University, Ohio

Generic absoluteness and universally Baire sets of reals Trevor Wilson Miami University, Ohio

One-step generic absoluteness Two-step generic absoluteness Generic absoluteness and universally Baire sets of reals Trevor Wilson Miami University, Ohio July 18, 2016 Trevor Wilson Generic absoluteness and universally Baire sets of reals

464 views • 24 slides
1 Definition of a simple generic class Why generic programming (cont.) class Pair &lt;T&gt; {

1 Definition of a simple generic class Why generic programming (cont.) class Pair &lt;T&gt; {

Topics background and goals of generic programming basics of generic classes = parameterized types generic methods for general algorithms inheritance rules for generic types Generic programming in Java bounded type parameters

261 views • 5 slides
Strongly connected components Finding strongly-connected components A strongly connected component

Strongly connected components Finding strongly-connected components A strongly connected component

Strongly connected components Finding strongly-connected components A strongly connected component is the maximal subset of a graph with a directed path between any two vertices B Tyler Moore CSE 3353, SMU, Dallas, TX g e Lecture 9 f a b

166 views • 5 slides
5 Operations and Aggregations of Fuzzy Sets Fuzzy Systems Engineering Toward Human-Centric

5 Operations and Aggregations of Fuzzy Sets Fuzzy Systems Engineering Toward Human-Centric

5 Operations and Aggregations of Fuzzy Sets Fuzzy Systems Engineering Toward Human-Centric Computing Contents 5.1 Standard operations on sets and fuzzy sets 5.2 Generic requirements for operations on fuzzy sets 5.3 Triangular norms 5.4

1.78k views • 104 slides
Non-equilibrium Non-equilibrium Fluctuations in Strongly Fluctuations in Strongly Correlated

Non-equilibrium Non-equilibrium Fluctuations in Strongly Fluctuations in Strongly Correlated

International Symposium in Honor of Professor Nambu for the 10th Anniversary of his Nobel Prize in Physics Osaka City University, December 12-13, 2018 Non-equilibrium Non-equilibrium Fluctuations in Strongly Fluctuations in Strongly

490 views • 36 slides
Generic Methods 36 What are Generic Methods? Generic methods = methods that introduce type

Generic Methods 36 What are Generic Methods? Generic methods = methods that introduce type

Generic Methods 36 What are Generic Methods? Generic methods = methods that introduce type parameters Similar to declaring a generic type but type parameter's scope is limited to method where it is declared The following are

584 views • 6 slides
Generic classes Declaration Use Annotations 54 Generic classes Declaration add

Generic classes Declaration Use Annotations 54 Generic classes Declaration add

Generic classes Declaration Use Annotations 54 Generic classes Declaration add generic types between angle brackets: public class MyStack &lt; E,F &gt;{ E item; } 55 Generic Classes Use MyStack&lt;Integer&gt; ms= new

273 views • 23 slides
Generic functional programming Basic idea: define generic functions by induction on the

Generic functional programming Basic idea: define generic functions by induction on the

A Hitchhikers Guide to the Universes (Universes for Generic Programs and Proofs) Marcin Benke Peter Dybjer Patrik Jansson Chalmers Technical University Main goals: extend generic programming to functional languages with dependent types

250 views • 10 slides
Generic Programming in a Dependently Typed Language Generic proofs for generic programs Peter

Generic Programming in a Dependently Typed Language Generic proofs for generic programs Peter

Generic Programming in a Dependently Typed Language Generic proofs for generic programs Peter Morris pwm@cs.nott.ac.uk University of Nottingham Generic Programming in a Dependently Typed Language p. 1/12 This talk We introduce a

599 views • 45 slides
Student Responsibilities Week 4 Reading : Textbook, Section 2.12.3 Mat 2345

Student Responsibilities Week 4 Reading : Textbook, Section 2.12.3 Mat 2345

Student Responsibilities Week 4 Reading : Textbook, Section 2.12.3 Mat 2345 Attendance : Strongly Encouraged Week 4 Week 4 Overview Fall 2013 2.1 Sets 2.2 Set Operations 2.3 Functions 2.1 Sets Notation used to

243 views • 8 slides
Science Attitudes Rank each question 1 5 where 1 is strongly agree and 5 is strongly disagree

Science Attitudes Rank each question 1 5 where 1 is strongly agree and 5 is strongly disagree

Science Attitudes Rank each question 1 5 where 1 is strongly agree and 5 is strongly disagree 1.I enjoy science 2.Science is useful in everyday life 3.Doing science often makes me feel nervous or upset 4.Science challenges me to use my mind

216 views • 19 slides
Strongly Connected Components Detection Strongly Connected Components A directed graph is

Strongly Connected Components Detection Strongly Connected Components A directed graph is

Company LOGO Strongly Connected Components Detection Strongly Connected Components A directed graph is called strongly connected if there is a path from each vertex in the graph to every other vertex. The strongly connected components

177 views • 15 slides
GENERICS A generic type is a generic class or interface that is parameterized over types. 1 / 6

GENERICS A generic type is a generic class or interface that is parameterized over types. 1 / 6

GENERICS A generic type is a generic class or interface that is parameterized over types. 1 / 6 Weve already seen examples of generic classes ArrayList&lt;T&gt;; HashMap&lt;K, V&gt;; Where T is being used to represent the type of each

304 views • 6 slides
Strongly paired fermions Alexandros Gezerlis TALENT/INT Course on Nuclear forces and their

Strongly paired fermions Alexandros Gezerlis TALENT/INT Course on Nuclear forces and their

Strongly paired fermions Alexandros Gezerlis TALENT/INT Course on Nuclear forces and their impact on structure, reactions and astrophysics July 4, 2013 Strongly paired fermions Neutron matter &amp; cold atoms Strongly paired fermions BCS

760 views • 48 slides
What are Generics? e.g. Generics, Generic Programming, Generic Types, Generic Methods 6

What are Generics? e.g. Generics, Generic Programming, Generic Types, Generic Methods 6

What are Generics? e.g. Generics, Generic Programming, Generic Types, Generic Methods 6 Defining the idea Behind Java Generics Data Types are now used as Type Parameters 7 Defining the idea Behind Java Generics Generic Types: generic

601 views • 23 slides
On strongly regular graphs attaining the claw bound M. Ma caj Comenius University,

On strongly regular graphs attaining the claw bound M. Ma caj Comenius University,

On strongly regular graphs attaining the claw bound M. Ma caj Comenius University, Bratislava, Slovakia Villanova, June 5th 2014 Strongly regular graphs A k -regular graph on n vertices is strongly regular with parame- ters ( n, k, , )

523 views • 29 slides
Planning and Optimization C14. Merge-and-Shrink Abstractions: Generic Algorithm Malte Helmert and

Planning and Optimization C14. Merge-and-Shrink Abstractions: Generic Algorithm Malte Helmert and

Planning and Optimization C14. Merge-and-Shrink Abstractions: Generic Algorithm Malte Helmert and Gabriele R oger Universit at Basel November 14, 2016 Generic Algorithm Summary Generic Algorithm Generic Algorithm Summary Generic

272 views • 24 slides
Patients Must Have Immediate Access to Affordable Generic Medicines at Day One After Patent

Patients Must Have Immediate Access to Affordable Generic Medicines at Day One After Patent

Patients Must Have Immediate Access to Affordable Generic Medicines at Day One After Patent Expiry Generic Medicines: Key to Healthcare Sustainability and Patient Care EGA represents over 700 companies in 34 European countries Generic

728 views • 25 slides
Making Strongly-typed NETCONF Usable Ryan Goulding Colin Dixon The goals of YANG Strongly

Making Strongly-typed NETCONF Usable Ryan Goulding Colin Dixon The goals of YANG Strongly

Making Strongly-typed NETCONF Usable Ryan Goulding Colin Dixon The goals of YANG Strongly typed Machine consumable (Automatically) Catch errors early tl;dr Standard libraries should do lots of the work (serialization,

394 views • 26 slides
Deriving Generic Functions by Example Neil Mitchell www.cs.york.ac.uk/~ndm/derive Generic

Deriving Generic Functions by Example Neil Mitchell www.cs.york.ac.uk/~ndm/derive Generic

Deriving Generic Functions by Example Neil Mitchell www.cs.york.ac.uk/~ndm/derive Generic Functions Operates on many data types Think of equality Comparing two integers, booleans, lists, trees Usually, must give each version

450 views • 28 slides
A Generic Programming A Generic Programming Toolkit Toolkit for PADS/ML for PADS/ML Mary

A Generic Programming A Generic Programming Toolkit Toolkit for PADS/ML for PADS/ML Mary

A Generic Programming A Generic Programming Toolkit Toolkit for PADS/ML for PADS/ML Mary Fernndez, Kathleen Fisher, Yitzhak Mandelbaum AT&amp;T Labs Research J. Nathan Foster, Michael Greenberg University of Pennsylvania PADL 2008 Data,

763 views • 51 slides
Strongly self-absorbing C -dynamical systems Classification and dynamical systems I: C

Strongly self-absorbing C -dynamical systems Classification and dynamical systems I: C

Strongly self-absorbing C -dynamical systems Classification and dynamical systems I: C -algebras Mittag-Leffler institute, Stockholm Gbor Szab WWU Mnster February 2016 1 / 24 Background &amp; Motivation 1 Strongly

646 views • 53 slides

More recommend