embeddability and universal equivalence of partially
play

Embeddability and universal equivalence of partially commutative - PowerPoint PPT Presentation

Mar 17, 2024 •36 likes •796 views

Embeddability and universal equivalence of partially commutative groups Montserrat Casals-Ruiz Marie Curie Postdoctoral Fellow University of Oxford GAGTA 2013 May 29, 2013 Montserrat Casals-Ruiz (Oxford) Embeddability GAGTA 2013 May 29,

  1. Embeddability and universal equivalence of partially commutative groups Montserrat Casals-Ruiz Marie Curie Postdoctoral Fellow University of Oxford GAGTA 2013 May 29, 2013 Montserrat Casals-Ruiz (Oxford) Embeddability GAGTA 2013 May 29, 2013 1 / 16

  2. Partially commutative groups Definition Let Γ = ( V (Γ) , E (Γ)) be a (undirected) simplicial graph. The partially commutative group (pc group) G = G (Γ) defined by the commutation graph Γ is the group given by the following presentation, G = � V (Γ) | [ v 1 , v 2 ] = 1 , whenever ( v 1 , v 2 ) ∈ E (Γ) � . Remark Indeed, pc groups = right-angled Artin groups = graph groups =... Remark Dually, pc groups can be defined via its non-commutation graph Γ which is the complement of the commutation graph. Montserrat Casals-Ruiz (Oxford) Embeddability GAGTA 2013 May 29, 2013 2 / 16

  3. Partially commutative groups Definition Let Γ = ( V (Γ) , E (Γ)) be a (undirected) simplicial graph. The partially commutative group (pc group) G = G (Γ) defined by the commutation graph Γ is the group given by the following presentation, G = � V (Γ) | [ v 1 , v 2 ] = 1 , whenever ( v 1 , v 2 ) ∈ E (Γ) � . Remark Indeed, pc groups = right-angled Artin groups = graph groups =... Remark Dually, pc groups can be defined via its non-commutation graph Γ which is the complement of the commutation graph. Montserrat Casals-Ruiz (Oxford) Embeddability GAGTA 2013 May 29, 2013 2 / 16

  4. Partially commutative groups Definition Let Γ = ( V (Γ) , E (Γ)) be a (undirected) simplicial graph. The partially commutative group (pc group) G = G (Γ) defined by the commutation graph Γ is the group given by the following presentation, G = � V (Γ) | [ v 1 , v 2 ] = 1 , whenever ( v 1 , v 2 ) ∈ E (Γ) � . Remark Indeed, pc groups = right-angled Artin groups = graph groups =... Remark Dually, pc groups can be defined via its non-commutation graph Γ which is the complement of the commutation graph. Montserrat Casals-Ruiz (Oxford) Embeddability GAGTA 2013 May 29, 2013 2 / 16

  5. Partially commutative groups Definition Let Γ = ( V (Γ) , E (Γ)) be a (undirected) simplicial graph. The partially commutative group (pc group) G = G (Γ) defined by the commutation graph Γ is the group given by the following presentation, G = � V (Γ) | [ v 1 , v 2 ] = 1 , whenever ( v 1 , v 2 ) ∈ E (Γ) � . Remark Indeed, pc groups = right-angled Artin groups = graph groups =... Remark Dually, pc groups can be defined via its non-commutation graph Γ which is the complement of the commutation graph. Montserrat Casals-Ruiz (Oxford) Embeddability GAGTA 2013 May 29, 2013 2 / 16

  6. Examples Z 2 =!<!a,b!|![a,b]!>! a! b! a! b! ! ! ! !>! a! b! a! b! a! b! Montserrat Casals-Ruiz (Oxford) Embeddability GAGTA 2013 May 29, 2013 3 / 16 a! d! ,d]!>! b! c! c! d! a! d! a! b! ,d]!>! c! d! c! b! b! d! a! c! a! b! e,a]>! e! e! d! c! d! b! a! b! c! d! e! ]>! a! e! c!

  7. Examples Z 2 =!<!a,b!|![a,b]!>! a! b! a! b! ! ! ! ! ! ! F 2 =!<!a,b|! ø !>! !>! a! a! b! b! a! a! b! b! ! ! a! b! a! b! a! d! a! d! ,d]!>! Montserrat Casals-Ruiz (Oxford) Embeddability ,d]!>! GAGTA 2013 May 29, 2013 3 / 16 b! c! b! c! c! c! d! d! a! d! a! d! a! b! a! b! ,d]!>! ,d]!>! c! d! c! d! c! b! c! b! d! b! d! b! a! c! a! b! a! c! a! b! e,a]>! e,a]>! c! e! e! d! e! e! d! c! d! b! d! b! a! b! c! d! e! b! ]>! a! c! d! e! ]>! a! e! a! e! c! c!

  8. Examples a! b! a! d! F 2 ! x! F 2 =!<!a,b,c,d!|[a,b],[a,c],[b,d],![c,d]!>! b! c! c! d! a! d! a! b! ,d]!>! c! d! c! b! Montserrat Casals-Ruiz (Oxford) Embeddability GAGTA 2013 May 29, 2013 3 / 16 d! b! a! c! a! b! e,a]>! c! e! e! d! d! b! a! b! c! d! e! ]>! a! e! c!

  9. Examples a! b! a! d! F 2 ! x! F 2 =!<!a,b,c,d!|[a,b],[a,c],[b,d],![c,d]!>! b! c! c! d! c! d! a! d! a! b! a! d! a! b! ,d]!>! Z 2! *!Z 2 =!<!a,b,c,d!|![a,b][c,d]!>! c! d! c! d! c! b! c! b! d! b! b! d! a! c! a! b! Montserrat Casals-Ruiz (Oxford) Embeddability GAGTA 2013 May 29, 2013 3 / 16 e,a]>! a! b! a! c! e,a]>! c! e! e! d! e! e! d! c! d! b! d! b! a! b! c! d! e! ]>! a! b! c! d! e! ]>! a! e! a! e! c! c!

  10. Examples c! b! d! b! a! b! a! c! <!a,b,c,d,e!|![a,b],![b,c],![c,d],![d,e],![e,a]>! e! e! d! c! d! b! a! b! c! d! e! ]>! a! e! Montserrat Casals-Ruiz (Oxford) Embeddability GAGTA 2013 May 29, 2013 3 / 16 c!

  11. Examples c! b! d! b! a! c! a! b! <!a,b,c,d,e!|![a,b],![b,c],![c,d],![d,e],![e,a]>! e! e! d! c! d! b! d! b! a! b! c! d! e! <!a,b,c,d,e!|![a,b],![b,c],![c,d],![d,e]>! a! b! c! d! e! ]>! a! e! a! e! c! c! Montserrat Casals-Ruiz (Oxford) Embeddability GAGTA 2013 May 29, 2013 3 / 16

  12. Algebraic vs. graph properties Slogan Many algebraic properties of G = G (Γ) are determined by properties of its defining graph Γ . G is freely decomposable if and only if Γ is not connected. G is directly decomposable if and only if Γ is not connected. The centraliser of a generator v is generated by the star of v in Γ . (Droms 1987) G (Γ) ≃ G (∆) if and only if Γ ≃ ∆ . Montserrat Casals-Ruiz (Oxford) Embeddability GAGTA 2013 May 29, 2013 4 / 16

  13. Algebraic vs. graph properties Slogan Many algebraic properties of G = G (Γ) are determined by properties of its defining graph Γ . G is freely decomposable if and only if Γ is not connected. G is directly decomposable if and only if Γ is not connected. The centraliser of a generator v is generated by the star of v in Γ . (Droms 1987) G (Γ) ≃ G (∆) if and only if Γ ≃ ∆ . Montserrat Casals-Ruiz (Oxford) Embeddability GAGTA 2013 May 29, 2013 4 / 16

  14. Algebraic vs. graph properties Slogan Many algebraic properties of G = G (Γ) are determined by properties of its defining graph Γ . G is freely decomposable if and only if Γ is not connected. G is directly decomposable if and only if Γ is not connected. The centraliser of a generator v is generated by the star of v in Γ . (Droms 1987) G (Γ) ≃ G (∆) if and only if Γ ≃ ∆ . Montserrat Casals-Ruiz (Oxford) Embeddability GAGTA 2013 May 29, 2013 4 / 16

  15. Algebraic vs. graph properties Slogan Many algebraic properties of G = G (Γ) are determined by properties of its defining graph Γ . G is freely decomposable if and only if Γ is not connected. G is directly decomposable if and only if Γ is not connected. The centraliser of a generator v is generated by the star of v in Γ . (Droms 1987) G (Γ) ≃ G (∆) if and only if Γ ≃ ∆ . Montserrat Casals-Ruiz (Oxford) Embeddability GAGTA 2013 May 29, 2013 4 / 16

  16. Algebraic vs. graph properties Slogan Many algebraic properties of G = G (Γ) are determined by properties of its defining graph Γ . G is freely decomposable if and only if Γ is not connected. G is directly decomposable if and only if Γ is not connected. The centraliser of a generator v is generated by the star of v in Γ . (Droms 1987) G (Γ) ≃ G (∆) if and only if Γ ≃ ∆ . Montserrat Casals-Ruiz (Oxford) Embeddability GAGTA 2013 May 29, 2013 4 / 16

  17. Embeddability between pc groups Question Can we characterise when G (∆) < G (Γ) ? Montserrat Casals-Ruiz (Oxford) Embeddability GAGTA 2013 May 29, 2013 5 / 16

  18. Warm-up examples a! b! c! d! a! b! c! d! e! ! ! ! ! a! b! c! d! a! b! c! d! e! b d! a d! Montserrat Casals-Ruiz (Oxford) Embeddability GAGTA 2013 May 29, 2013 6 / 16 c! b! b! a c! a! c! a! d! e c! f! e! e! d!

  19. Warm-up examples a! b! c! d! a! b! c! d! e! ! ! ! ! ! ! a! b! c! d! e! a! b! c! d! ! a! b! c! d! a! b! c! d! e! b d! ! a d! ! b d! a d! ! ! c! b! b! a c! Montserrat Casals-Ruiz (Oxford) Embeddability GAGTA 2013 May 29, 2013 6 / 16 c! a! b! c! b! a! d! a c! a! c! e c! a! d! f! e! d! e! e c! f! e! e! d!

  20. Warm-up examples Paths(Kim-Koberda 2011) If F is a forest, then G ( F ) < G ( P 3 ) Montserrat Casals-Ruiz (Oxford) Embeddability GAGTA 2013 May 29, 2013 6 / 16

  21. Warm-up examples ! ! c! b! b! ! a c! a! c! ! a! d! ! e c! f! e! d! ! e! ! Montserrat Casals-Ruiz (Oxford) Embeddability GAGTA 2013 May 29, 2013 6 / 16

  22. Warm-up examples ! ! (" $ )! "! ! $! (" $ )! #! &! #! "! %! " $! "! $! (" $ )! %! & $! '! &! &! %! Montserrat Casals-Ruiz (Oxford) Embeddability GAGTA 2013 May 29, 2013 6 / 16

  23. Warm-up examples Cycles (Kim-Koberda 2011) If C n is the cycle with n vertices, n ≥ 5, then G ( C n ) < G ( C 5 ) . Montserrat Casals-Ruiz (Oxford) Embeddability GAGTA 2013 May 29, 2013 6 / 16

  24. Extension Graph Conjecture Definition Let Γ be a simplicial graph, V (Γ) = { a 1 , . . . , a k } . We define the extension graph Γ e to be the graph whose set of vertices V (Γ e ) are labelled by elements a w i , w ∈ G (Γ) and 1 w j the set of edges E (Γ e ) are pairs of different vertices ( a w i i , a j ) such that 2 w j [ a w i i , a j ] = 1 in G (Γ) . Montserrat Casals-Ruiz (Oxford) Embeddability GAGTA 2013 May 29, 2013 7 / 16

Recommend

The Finite Embeddability Property for IP Loops and Local Embeddability of Groups into Finite IP

The Finite Embeddability Property for IP Loops and Local Embeddability of Groups into Finite IP

The Finite Embeddability Property for IP Loops and Local Embeddability of Groups into Finite IP Loops Martin Vodi cka Max-Planck Institute, Leipzig Pavol Zlato s Comenius University, Bratislava LOOPS 2019 Budapest July 8 13, 2019

1.53k views • 95 slides
Embeddability amongst the countable models of set theory Joel David Hamkins The City University

Embeddability amongst the countable models of set theory Joel David Hamkins The City University

Introduction Universal structures Surreal numbers &amp; Hypnagogic digraph Proof of main theorem Further issues Embeddability amongst the countable models of set theory Joel David Hamkins The City University of New York College of Staten

1.04k views • 88 slides
Equivalence Testing of Weighted Automata over Partially Commutative Monoids V. Arvind 1 Abhranil

Equivalence Testing of Weighted Automata over Partially Commutative Monoids V. Arvind 1 Abhranil

Equivalence Testing of Weighted Automata over Partially Commutative Monoids V. Arvind 1 Abhranil Chatterjee 1 Rajit Datta 2 Partha Mukhopadhyay 2 1 Institute of Mathematical Sciences(HBNI), India 2 Chennai Mathematical Institute, India Highlights

324 views • 21 slides
Universal homogeneous constraint structures and the hom-equivalence classes of weakly

Universal homogeneous constraint structures and the hom-equivalence classes of weakly

Universal homogeneous constraint structures and the hom-equivalence classes of weakly oligomorphic structures Christian Pech Maja Pech 17.03.2012 Weakly oligomorphic structures Definition A countable relational structure A is called weakly

196 views • 18 slides
Embeddability of real hyersurfaces into hyperquadrics and spheres Ming Xiao University of

Embeddability of real hyersurfaces into hyperquadrics and spheres Ming Xiao University of

Embeddability of real hyersurfaces into hyperquadrics and spheres Ming Xiao University of California San Diego Midwestern Workshop on Asymptotic Analysis IUPUI, Indianapolis October 7th, 2017 Ming Xiao Embeddability of real hyersurfaces into

549 views • 44 slides
On CCZ-Equivalence, Extended-Affine Equivalence and Function Twisting Anne Canteaut, L eo

On CCZ-Equivalence, Extended-Affine Equivalence and Function Twisting Anne Canteaut, L eo

On CCZ-Equivalence, Extended-Affine Equivalence and Function Twisting Anne Canteaut, L eo Perrin June 3, 2019 Fq14, Vancouver Setting up the background Cryptographic properties Equivalence classes CCZ-equivalence Cryptographic

885 views • 63 slides
Embeddability and Decidability in the Turing Degrees Antonio Montalb an. University of

Embeddability and Decidability in the Turing Degrees Antonio Montalb an. University of

Jump upper semilattice embeddings Local Structures ASL Summer Meeting Logic Colloquium 06. Embeddability and Decidability in the Turing Degrees Antonio Montalb an. University of Chicago Nijmegen, Netherlands, 27 July- 2 Aug. of

484 views • 31 slides
On CCZ-Equivalence, Extended-Affine Equivalence and Function Twisting Anne Canteaut, Lo Perrin

On CCZ-Equivalence, Extended-Affine Equivalence and Function Twisting Anne Canteaut, Lo Perrin

On CCZ-Equivalence, Extended-Affine Equivalence and Function Twisting Anne Canteaut, Lo Perrin June 18, 2018 BFA2018 Definition (EA-Equivalence; EA-mapping) F and G are E(xtented) A(ffine) equivalent if G x B F A x C x , where A B C

1.11k views • 98 slides
Equivalences 1 Equivalence Definition (Equivalence) Two formulas F and G are (semantically)

Equivalences 1 Equivalence Definition (Equivalence) Two formulas F and G are (semantically)

Propositional Logic Equivalences 1 Equivalence Definition (Equivalence) Two formulas F and G are (semantically) equivalent if A ( F ) = A ( G ) for every assignment A that is suitable for both F and G . We write F G to denote that F and G

276 views • 12 slides
Universal Credit Universal Credit Universal Credit is for working-age people aged over 18 and

Universal Credit Universal Credit Universal Credit is for working-age people aged over 18 and

Universal Credit Universal Credit Universal Credit is for working-age people aged over 18 and under State Pension age. Universal Credit will replace a number of current benefits: income-based Jobseekers Allowance (JSA);

332 views • 14 slides
Topological embeddability between functions. Rapha el Carroy Kurt G odel Research Center

Topological embeddability between functions. Rapha el Carroy Kurt G odel Research Center

Topological embeddability between functions. Rapha el Carroy Kurt G odel Research Center Vienna SGSLPS Spring Meeting Lausanne, Switzerland May 29th, 2017 Framework f : X Y means that f is a function, dom( f ) = X and Im( f )

443 views • 19 slides
Todays Expedition TED highlights Equivalence Relations Equivalence Classes and

Todays Expedition TED highlights Equivalence Relations Equivalence Classes and

Todays Expedition TED highlights Equivalence Relations Equivalence Classes and Partitions Boolean Algebra Boolean functions Sum of Products expansion Logic gates and circuits Sections 8.5, 11.1-11.3 in the text

541 views • 15 slides
The Finite Embeddability Property for Topological Quasi-Boolean Algebra 5 Zhe Lin 1 and Mihir

The Finite Embeddability Property for Topological Quasi-Boolean Algebra 5 Zhe Lin 1 and Mihir

The Finite Embeddability Property for Topological Quasi-Boolean Algebra 5 Zhe Lin 1 and Mihir Kumar Chakraborty 2 Southwest University, Chongqing, China. 1 School of Cognitive Science, Jadavpur University, India 2 2019/03/03 Zhe Lin1 and Mihir

594 views • 27 slides
Universal Acceptance Quick Guide What Does Universal Acceptance Mean? ACCEPT Universal

Universal Acceptance Quick Guide What Does Universal Acceptance Mean? ACCEPT Universal

Universal Acceptance Quick Guide What Does Universal Acceptance Mean? ACCEPT Universal Acceptance (UA) is the state where all valid domain names and email addresses are accepted, validated, stored, processed and displayed correctly and

122 views • 8 slides
Equivalence Relations {( a , b ) | a and b are from the the same state}. Observe that these

Equivalence Relations {( a , b ) | a and b are from the the same state}. Observe that these

Equivalence Relations http://localhost/~senning/courses/ma229/slides/equivalence-relations/slide01.html Equivalence Relations http://localhost/~senning/courses/ma229/slides/equivalence-relations/slide02.html Equivalence Relations prev | slides

235 views • 4 slides
Section 4.2: Equivalence Relations What is equality? What is equivalence? Equality is

Section 4.2: Equivalence Relations What is equality? What is equivalence? Equality is

Section 4.2: Equivalence Relations What is equality? What is equivalence? Equality is more basic, fundamental concept. Every element in a set is equal only to itself. The basic equality relation {(x,x) | x S} We tend to assume

893 views • 61 slides
7.5 EQUIVALENCE RELATIONS def: An equivalence relation is a binary rela- tion that is reflexive,

7.5 EQUIVALENCE RELATIONS def: An equivalence relation is a binary rela- tion that is reflexive,

7.5.1 Section 7.5 Equivalence Relations 7.5 EQUIVALENCE RELATIONS def: An equivalence relation is a binary rela- tion that is reflexive, symmetric, and transitive. Set S = { a, b, c, d, e, f } and Example 7.5.1: R = ( a, a ) , ( b, c )

312 views • 4 slides
The relation of embeddability between uncountable torsion-free abelian groups Filippo Calderoni

The relation of embeddability between uncountable torsion-free abelian groups Filippo Calderoni

The relation of embeddability between uncountable torsion-free abelian groups Filippo Calderoni University of Turin March 14, 2017 1/22 Borel reducibility In the framework of (classical) Borel reducibility, relations are defined over Polish

539 views • 53 slides
Embeddability between the right-angled Artin groups of surfaces Takuya Katayama Hiroshima

Embeddability between the right-angled Artin groups of surfaces Takuya Katayama Hiroshima

Embeddability between the right-angled Artin groups of surfaces Takuya Katayama Hiroshima University (JSPS Research Fellow PD) Mathematics of Knots II Nihon University, December 19, 2019 Takuya Katayama (Hiroshima Univ.) RAAGs of surfaces 1

632 views • 23 slides
Embeddability of locally finite metric spaces into Banach spaces is finitely determined Mikhail

Embeddability of locally finite metric spaces into Banach spaces is finitely determined Mikhail

Embeddability of locally finite metric spaces into Banach spaces is finitely determined Mikhail Ostrovskii St. Johns University Queens, New York City, NY e-mail: ostrovsm@stjohns.edu web page: http://facpub.stjohns.edu/ostrovsm March

241 views • 11 slides
Universality of group embeddability Filippo Calderoni University of Turin Polytechnic di Turin

Universality of group embeddability Filippo Calderoni University of Turin Polytechnic di Turin

Universality of group embeddability Filippo Calderoni University of Turin Polytechnic di Turin 27th July 2016 1/22 Borel reducibility In the framework of Borel reducibility, relations are defined over Polish or standard Borel spaces.

467 views • 44 slides
Rayleigh- -Taylor instability Taylor instability Rayleigh in partially ionized in partially

Rayleigh- -Taylor instability Taylor instability Rayleigh in partially ionized in partially

1 Rayleigh- -Taylor instability Taylor instability Rayleigh in partially ionized in partially ionized prominences prominences Antonio J. Daz, R. Soler, E. Khomenko, A. De Vicente, J L. Ballester , M. Collados Workshop on Partially

488 views • 24 slides
The bi-embeddability relation on countable torsion-free abelian groups Filippo Calderoni

The bi-embeddability relation on countable torsion-free abelian groups Filippo Calderoni

The bi-embeddability relation on countable torsion-free abelian groups Filippo Calderoni University of Turin Descriptive Set Theory in Turin September 8, 2017 1/16 Notation countable = countably infinite; 2/16 Notation

497 views • 34 slides
Tech Day: Universal Acceptance Mark van rek Universal Acceptance Todays Objectives

Tech Day: Universal Acceptance Mark van rek Universal Acceptance Todays Objectives

Tech Day: Universal Acceptance Mark van rek Universal Acceptance Todays Objectives Definition of Universal Acceptance Universal Acceptance Steering Group Challenges BiDi Stuff Conclusion 2 Definition of Universal

665 views • 27 slides

More recommend