computing autotopism groups of partial latin rectangles a
play

Computing autotopism groups of partial Latin rectangles: a pilot - PowerPoint PPT Presentation

Aug 13, 2022 •45 likes •825 views

Computing autotopism groups of partial Latin rectangles: a pilot study Ra ul M. Falc on (U. Seville ); Daniel Kotlar (Tel-Hai College ); Rebecca J. Stones (Nankai U. ) 19 December 2016 1 2 3 2 4

  1. Computing autotopism groups of partial Latin rectangles: a pilot study Ra´ ul M. Falc´ on (U. Seville ); Daniel Kotlar (Tel-Hai College ); Rebecca J. Stones (Nankai U. ) 19 December 2016 · · · · · · 1 2 3 · · · 2 4 1 5 6 7 · · · · · 1 5 3 4 · 2 · 5 · 3 · 4 · · · · · 4 3 5 1 2 · · · · · · 2 1 3

  2. Partial Latin rectangles An r × s partial Latin rectangle is an r × s matrix containing symbols from [ n ] ∪ {·} such that each row and each column contains at most one copy of any symbol in [ n ]. · 5 4 3 2 · · · 5 1 · · · 4 1

  3. Partial Latin rectangles An r × s partial Latin rectangle is an r × s matrix containing symbols from [ n ] ∪ {·} such that each row and each column contains at most one copy of any symbol in [ n ]. · 5 4 3 2 · · · 5 1 · · · 4 1 Every partial Latin rectangle L ∈ PLR ( r , s , n ) is uniquely determined by its entry set: entry � �� � Ent ( L ) := { ( i , j , L [ i , j ]) : i ∈ [ r ] , j ∈ [ l ] , and L [ i , j ] ∈ [ n ] } . � � (2 , 5 , 1) , (1 , 3 , 4) , (1 , 2 , 5) , Ent (above) = (1 , 5 , 2) , (1 , 4 , 3) , (3 , 4 , 1) , (3 , 1 , 4) , (2 , 1 , 5)

  4. Isotopisms and autotopisms � r × s partial Latin rectangles � on symbol set [ n ] The isotopism θ := ( α, β, γ ) ∈ S r × S s × S n acts on PLR ( r , s , n ). · · · · · 1 2 3 4 3 4 2 · · · · · 3 4 2 1 2 3 4 swap first two rows α = (12) · · · · · · · · · · 5 5 swap last two columns β = (56) · · · · · · · · 6 5 6 5 do nothing to symbols γ = id − − − − − − − − − − − − − − − − − → · · · · · · · · 6 5 5 6 · · · · · · · · · · 6 6

  5. Isotopisms and autotopisms � r × s partial Latin rectangles � on symbol set [ n ] The isotopism θ := ( α, β, γ ) ∈ S r × S s × S n acts on PLR ( r , s , n ). · · · · · 1 2 3 4 3 4 2 · · · · · 3 4 2 1 2 3 4 swap first two rows α = (12) · · · · · · · · · · 5 5 swap last two columns β = (56) · · · · · · · · 6 5 6 5 do nothing to symbols γ = id − − − − − − − − − − − − − − − − − → · · · · · · · · 6 5 5 6 · · · · · · · · · · 6 6 And, in some cases, we can apply an isotopism θ and end up back where we started = ⇒ θ is an autotopism.

  6. Isotopisms and autotopisms � r × s partial Latin rectangles � on symbol set [ n ] The isotopism θ := ( α, β, γ ) ∈ S r × S s × S n acts on PLR ( r , s , n ). · · · · · 1 2 3 4 3 4 2 · · · · · 3 4 2 1 2 3 4 swap first two rows α = (12) · · · · · · · · · · 5 5 swap last two columns β = (56) · · · · · · · · 6 5 6 5 do nothing to symbols γ = id − − − − − − − − − − − − − − − − − → · · · · · · · · 6 5 5 6 · · · · · · · · · · 6 6 And, in some cases, we can apply an isotopism θ and end up back where we started = ⇒ θ is an autotopism. The set of autotopisms form a group, named the autotopism group.

  7. 1 2 3 4 This member of PLR (2 , 2 , 4) has 4 autotopisms. ( id , id , id ), ((12) , id , (13)(24)), ( id , (12) , (12)(34)), ((12) , (12) , (14)(23)),

  8. 1 2 3 4 This member of PLR (2 , 2 , 4) has 4 autotopisms. ( id , id , id ), ((12) , id , (13)(24)), ( id , (12) , (12)(34)), ((12) , (12) , (14)(23)), ...forming a group isomorphic to C 2 × C 2 .

  9. 1 2 3 4 This member of PLR (2 , 2 , 4) has 4 autotopisms. ( id , id , id ), ((12) , id , (13)(24)), ( id , (12) , (12)(34)), ((12) , (12) , (14)(23)), ...forming a group isomorphic to C 2 × C 2 . Note : The row and column permutations determine the autotopism.

  10. How to efficiently compute the autotopism group? Input : partial Latin rectangle. Output : its autotopism group.

  11. How to efficiently compute the autotopism group? Input : partial Latin rectangle. Output : its autotopism group. By the looks of things, the answer is...

  12. How to efficiently compute the autotopism group? Input : partial Latin rectangle. Output : its autotopism group. By the looks of things, the answer is... Basically, the answer depends on the partial Latin rectangle.

  13. How to efficiently compute the autotopism group? Input : partial Latin rectangle. Output : its autotopism group. By the looks of things, the answer is... Basically, the answer depends on the partial Latin rectangle. This work is a “pilot study” to (a) identify design goals of future software for computing the autotopism group, and (b) eliminate unpromising methods.

  14. How to efficiently compute the autotopism group? Input : partial Latin rectangle. Output : its autotopism group. By the looks of things, the answer is... Basically, the answer depends on the partial Latin rectangle. This work is a “pilot study” to (a) identify design goals of future software for computing the autotopism group, and (b) eliminate unpromising methods. We experimentally compare 6 families of methods...

  15. Backtracking methods... Family 1: Alpha-beta backtracking.

  16. Backtracking methods... Family 1: Alpha-beta backtracking. At each level of the α search tree, we designate 3 1 4 · · a 1 α row i �− → row a α · · i 2 provided it doesn’t clash.

  17. Backtracking methods... Family 1: Alpha-beta backtracking. At each level of the α search tree, we designate 3 1 4 · · a 1 α row i �− → row a α · · i 2 provided it doesn’t clash. Once α is determined... β At each level of the β search tree, we designate j b β 3 1 4 column j �− → column b · · 1 provided it doesn’t clash. · · 2

  18. Backtracking methods... Family 1: Alpha-beta backtracking. At each level of the α search tree, we designate 3 1 4 · · a 1 α row i �− → row a α · · i 2 provided it doesn’t clash. Once α is determined... β At each level of the β search tree, we designate j b β 3 1 4 column j �− → column b · · 1 provided it doesn’t clash. · · 2 Then we check if ( α, β, ??) is an autotopism.

  19. Backtracking methods... Family 2: Entrywise backtracking.

  20. Backtracking methods... Family 2: Entrywise backtracking. α ( i ) = a At each level of the search tree, β ( j ) = b we designate γ ( L [ i, j ]) = L [ a, b ] j b θ entry ( i , j , L [ i , j ]) → �− entry ( a , b , L [ a , b ]) a 3 1 4 · · 1 i provided it doesn’t clash. · · 2

  21. Graph methods... Family 3: McKay, Meynert, and Myrvold method.

  22. Graph methods... Family 3: McKay, Meynert, and Myrvold method. Vertex set : Ent ( L ) ∪ { R i : i ∈ [ r ] and row i of L is non-empty } ∪ { S j : j ∈ [ s ] and column j of L is non-empty } ∪ { N k : k ∈ [ n ] and symbol k occurs in L } where each of the four subsets, Ent ( L ), { R i } , { S j } , and { N k } , are assigned a distinct color. Edge set : { R i L [ i , j ]: ( i , j , L [ i , j ]) ∈ Ent ( L ) } ∪ { S j L [ i , j ]: ( i , j , L [ i , j ]) ∈ Ent ( L ) } ∪ { N L [ i , j ] L [ i , j ]: ( i , j , L [ i , j ]) ∈ Ent ( L ) } .

  23. Graph methods... Family 3: McKay, Meynert, and Myrvold method. Vertex set : Ent ( L ) ∪ { R i : i ∈ [ r ] and row i of L is non-empty } ∪ { S j : j ∈ [ s ] and column j of L is non-empty } ∪ { N k : k ∈ [ n ] and symbol k occurs in L } where each of the four subsets, Ent ( L ), { R i } , { S j } , and { N k } , are assigned a distinct color. Edge set : { R i L [ i , j ]: ( i , j , L [ i , j ]) ∈ Ent ( L ) } ∪ { S j L [ i , j ]: ( i , j , L [ i , j ]) ∈ Ent ( L ) } ∪ { N L [ i , j ] L [ i , j ]: ( i , j , L [ i , j ]) ∈ Ent ( L ) } . The automorphism group of this graph is isomorphic to the autotopism group of the partial Latin rectangle.

  24. Graph methods... Family 3: McKay, Meynert, and Myrvold method. Vertex set : Ent ( L ) ∪ { R i : i ∈ [ r ] and row i of L is non-empty } ∪ { S j : j ∈ [ s ] and column j of L is non-empty } ∪ { N k : k ∈ [ n ] and symbol k occurs in L } where each of the four subsets, Ent ( L ), { R i } , { S j } , and { N k } , are assigned a distinct color. Edge set : { R i L [ i , j ]: ( i , j , L [ i , j ]) ∈ Ent ( L ) } ∪ { S j L [ i , j ]: ( i , j , L [ i , j ]) ∈ Ent ( L ) } ∪ { N L [ i , j ] L [ i , j ]: ( i , j , L [ i , j ]) ∈ Ent ( L ) } . The automorphism group of this graph is isomorphic to the autotopism group of the partial Latin rectangle. We compute this using Nauty .

  25. Graph methods... Family 4: Bipartite graph method.

  26. Graph methods... Family 4: Bipartite graph method. column index 1 row index · 5 4 3 2 1 2 transform into bipartite graph · · · 5 1 − − − − − − − − − → 2 3 · · · 4 1 3 4 5 (Edges are colored to illustrate construction.)

  27. Graph methods... Family 4: Bipartite graph method. column index 1 row index · 5 4 3 2 1 2 transform into bipartite graph · · · 5 1 − − − − − − − − − → 2 3 · · · 4 1 3 4 5 (Edges are colored to illustrate construction.) Then compute the automorphism group of the bipartite graph using Nauty .

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Partial Latin rectangles graphs and symmetries of partial Latin rectangles Rebecca J. Stones

Partial Latin rectangles graphs and symmetries of partial Latin rectangles Rebecca J. Stones

Partial Latin rectangles graphs and symmetries of partial Latin rectangles Rebecca J. Stones (Nankai University, China ); with Ra ul M. Falc on (University of Seville, Spain ). February 25, 2017 Monash conference... My hometown, and

1k views • 86 slides
Totally Symmetric Partial Latin Squares with Trivial Autotopism Groups Trent G. Marbach

Totally Symmetric Partial Latin Squares with Trivial Autotopism Groups Trent G. Marbach

Outline Introduction Totally symmetric Latin squares without symmetry Conclusion Totally Symmetric Partial Latin Squares with Trivial Autotopism Groups Trent G. Marbach trent.marbach@outlook.com Joint work with Ra ul Falc on

391 views • 26 slides
Concurrence designs based on partial Latin rectangles autotopisms. Ra ul Falc on

Concurrence designs based on partial Latin rectangles autotopisms. Ra ul Falc on

Concurrence designs based on partial Latin rectangles autotopisms. Ra ul Falc on Department of Applied Mathematics I University of Seville (Spain) rafalgan@us.es Introduction. Incidence structures. Partial Latin rectangles.

1.22k views • 87 slides
Weights of partial Latin rectangles with specified symmetry groups Rebecca J. Stones (Nankai

Weights of partial Latin rectangles with specified symmetry groups Rebecca J. Stones (Nankai

Weights of partial Latin rectangles with specified symmetry groups Rebecca J. Stones (Nankai University, China); with Ra ul M. Falc on (University of Seville, Spain). August 31, 2015 End user license agreement Disclaimer : This talk is

907 views • 89 slides
0 1 2 3 2 1 1 3 0 0 1 2 3 2 1 1 3 0

0 1 2 3 2 1 1 3 0 0 1 2 3 2 1 1 3 0

Enumerating partial Latin rectangles Ra ul F alcon (U. Seville ), Rebecca J. Stones (Nankai U. ) 21 May 2018 0 1 2 3 2 1 1 3 0 0 1 2 3 2 1 1 3 0 A partial Latin rectangle

578 views • 55 slides
A Latin square autotopism secret sharing scheme Talk by Rebecca J. Stones Co-authors: Ming Su,

A Latin square autotopism secret sharing scheme Talk by Rebecca J. Stones Co-authors: Ming Su,

A Latin square autotopism secret sharing scheme Talk by Rebecca J. Stones Co-authors: Ming Su, Xiaoguang Liu, Gang Wang, (Nankai University) and Sheng Lin (Tianjin University of Technology). September 12, 2014 Secret sharing schemes Secret

1.43k views • 86 slides
Computing the sets of totally symmetric and totally conjugate orthogonal partial Latin squares by

Computing the sets of totally symmetric and totally conjugate orthogonal partial Latin squares by

Computing the sets of totally symmetric and totally conjugate orthogonal partial Latin squares by means of a SAT solver Ra ul M. Falc on Department of Applied Mathematics I. University of Seville. (Joint work with Oscar J. Falc on

521 views • 36 slides
Group embeddings of partial Latin squares Ian Wanless Monash University Latin squares Latin

Group embeddings of partial Latin squares Ian Wanless Monash University Latin squares Latin

Group embeddings of partial Latin squares Ian Wanless Monash University Latin squares Latin squares A latin square of order n is an n n matrix in which each of n symbols occurs exactly once in each row and once in each column. 1 2 3

1.1k views • 81 slides
Partial Groups and Homology Groups, Partial Groups, Homology, Topology The homology of a

Partial Groups and Homology Groups, Partial Groups, Homology, Topology The homology of a

Partial Groups and Homology Groups, Partial Groups, Homology, Topology The homology of a group. The bar construction. Can the homology of a group be computed effectively? Partial Groups. Examples from Topology. How is the

754 views • 30 slides
Partial list of prescription abbreviations Abbreviation Latin Meaning aa ana of each ad ad

Partial list of prescription abbreviations Abbreviation Latin Meaning aa ana of each ad ad

Partial list of prescription abbreviations Abbreviation Latin Meaning aa ana of each ad ad up to a.c. ante cibum before meals a.d. auris dextra right ear use as much as one desires; ad lib. ad libitum freely admov. admove apply

200 views • 5 slides
Strictly Completing Partial Latin Squares Jaromy Kuhl Department of Mathematics and Statistics

Strictly Completing Partial Latin Squares Jaromy Kuhl Department of Mathematics and Statistics

Strictly Completing Partial Latin Squares Jaromy Kuhl Department of Mathematics and Statistics University of West Florida May 2011 Jaromy Kuhl (UWF) Strictly Completing Partial Latin Squares May 2011 1 / 25 Contents Introduction 1 Jaromy

932 views • 67 slides
Semi-Latin squares, permutation groups, and statistical optimality Leonard Soicher Queen Mary,

Semi-Latin squares, permutation groups, and statistical optimality Leonard Soicher Queen Mary,

Semi-Latin squares, permutation groups, and statistical optimality Leonard Soicher Queen Mary, University of London Ottawa-Carleton Discrete Mathematics Days: 13-14 May 2011 Leonard Soicher (QMUL) Semi-Latin squares, groups, and optimality

744 views • 62 slides
Epimorphisms between knot groups: determination of the partial order Masaaki Suzuki Akita

Epimorphisms between knot groups: determination of the partial order Masaaki Suzuki Akita

Epimorphisms between knot groups: determination of the partial order Masaaki Suzuki Akita University September 14, 2010 Macky Epimorphisms between knot groups Twisted Alexander polynomial G : a finitely presentable group : G Z l : a

515 views • 50 slides
with many orthogonal mates Emine ule Yazc Ko University Joint work with D. Donovan and

with many orthogonal mates Emine ule Yazc Ko University Joint work with D. Donovan and

Embedding partial Latin squares into Latin squares with many orthogonal mates Emine ule Yazc Ko University Joint work with D. Donovan and M. Grannell TUBITAK 116F166 LATIN SQUARES Latin square of order n is an n x n array on the

1.09k views • 36 slides
New examples of partial difference sets in finite nonabelian groups Eric Swartz The University

New examples of partial difference sets in finite nonabelian groups Eric Swartz The University

New examples of partial difference sets in finite nonabelian groups Eric Swartz The University of Western Australia 5 August 2013 Introduction Definitions Definition The groups, graphs, etc., considered in this talk will be finite.

717 views • 22 slides
Partial Crossed Product Description of the Cuntz-Li Algebras Giuliano Boava Groups, Dynamical

Partial Crossed Product Description of the Cuntz-Li Algebras Giuliano Boava Groups, Dynamical

Preliminaries Partial Group Algebra Description Partial Crossed Product Description Application in Bost-Connes Algebra Partial Crossed Product Description of the Cuntz-Li Algebras Giuliano Boava Groups, Dynamical Systems and C -Algebras

846 views • 68 slides
Basics of Geographic Analysis in R Spatial Autocorrelation and Spatial Weights Yuri M. Zhukov

Basics of Geographic Analysis in R Spatial Autocorrelation and Spatial Weights Yuri M. Zhukov

Basics of Geographic Analysis in R Spatial Autocorrelation and Spatial Weights Yuri M. Zhukov GOV 2525: Political Geography February 25, 2013 Outline 1. Introduction 2. Spatial Data and Basic Visualization in R 3. Spatial Autocorrelation 4.

424 views • 38 slides
SET-PARTITION TABLEAUX Tom Halverson Macalester College FPSAC 2019 Ljubljana July 2, 2019

SET-PARTITION TABLEAUX Tom Halverson Macalester College FPSAC 2019 Ljubljana July 2, 2019

SET-PARTITION TABLEAUX Tom Halverson Macalester College FPSAC 2019 Ljubljana July 2, 2019 1/25 Set-Partition Tableaux Integer Partition: Organization: I. Origins: Representation 8 , 13 14 Theory of the Symmetric 2 , 3 1 , 6 , 10 16

586 views • 30 slides
More on games (Ch. 5.4-5.7) Announcements Midterm will be on gradescope (got an email from

More on games (Ch. 5.4-5.7) Announcements Midterm will be on gradescope (got an email from

More on games (Ch. 5.4-5.7) Announcements Midterm will be on gradescope (got an email from them... signup optional) Mid-state evaluation So far we assumed that you have to reach a terminal state then propagate backwards (with possibly

759 views • 42 slides
Telescopers for Rational and Algebraic Functions via Residues Shaoshi Chen Department of

Telescopers for Rational and Algebraic Functions via Residues Shaoshi Chen Department of

1 / 22 Telescopers for Rational and Algebraic Functions via Residues Shaoshi Chen Department of Mathematics North Carolina State University, Raleigh July 19, 2012 Joint with Manuel Kauers and Michael F. Singer Shaoshi Chen Telescopers and

516 views • 22 slides
Geographic Data Science - Lecture V Space, formally Dani Arribas-Bel Today The need to

Geographic Data Science - Lecture V Space, formally Dani Arribas-Bel Today The need to

Geographic Data Science - Lecture V Space, formally Dani Arribas-Bel Today The need to represent space formally Spatial weights matrices What Why Types The spatial lag The Moran Plot Space, formally For a statistical method to be

551 views • 43 slides
Algorithms R OBERT S EDGEWICK | K EVIN W AYNE C OMBINATORIAL S EARCH introduction

Algorithms R OBERT S EDGEWICK | K EVIN W AYNE C OMBINATORIAL S EARCH introduction

Algorithms R OBERT S EDGEWICK | K EVIN W AYNE C OMBINATORIAL S EARCH introduction permutations backtracking Algorithms counting F O U R T H E D I T I O N subsets R OBERT S EDGEWICK | K EVIN W AYNE paths in a graph

738 views • 50 slides
Proving Correctness of a KRK Chess Endgame Strategy by SAT-based Constraint Solving Marko

Proving Correctness of a KRK Chess Endgame Strategy by SAT-based Constraint Solving Marko

Introduction Reduction to SAT and URSA system Chess Endgame Strategies and Bratkos Strategy for KRK URSA Specification of KRK Endgame and of Strategy Correctness of Strategy Discussion and Conclusions Proving Correctness of a KRK Chess

390 views • 27 slides
A Generalized Linear Outline Evaluation Model Evaluation function construction GLEM

A Generalized Linear Outline Evaluation Model Evaluation function construction GLEM

A Generalized Linear Outline Evaluation Model Evaluation function construction GLEM Building pattern-based evaluations Michael Buro

429 views • 5 slides

More recommend