lr structures: algebraic constructions and large vertex-stabilizers (with primoz potocnik )
DESCRIPTION
LR Structures: algebraic constructions and large vertex-stabilizers (with Primoz Potocnik ). SYGN July, 2014, Rogla. A tetravalent graph is a graph in which every vertex has valence (degree) 4. A cycle decomposition is a partition of the edges of the graph into cycles . - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: LR Structures: algebraic constructions and large vertex-stabilizers (with Primoz Potocnik )](https://reader036.vdocument.in/reader036/viewer/2022070423/56816628550346895dd987d6/html5/thumbnails/1.jpg)
LR Structures:algebraic constructions
and large vertex-stabilizers(with Primoz Potocnik)
SYGN July, 2014, Rogla
![Page 2: LR Structures: algebraic constructions and large vertex-stabilizers (with Primoz Potocnik )](https://reader036.vdocument.in/reader036/viewer/2022070423/56816628550346895dd987d6/html5/thumbnails/2.jpg)
A tetravalent graph is a graph in which every vertex
has valence (degree) 4.
![Page 3: LR Structures: algebraic constructions and large vertex-stabilizers (with Primoz Potocnik )](https://reader036.vdocument.in/reader036/viewer/2022070423/56816628550346895dd987d6/html5/thumbnails/3.jpg)
A cycle decomposition is a partition of the edges of the graph into cycles
![Page 4: LR Structures: algebraic constructions and large vertex-stabilizers (with Primoz Potocnik )](https://reader036.vdocument.in/reader036/viewer/2022070423/56816628550346895dd987d6/html5/thumbnails/4.jpg)
For any cycle decomposition
its partial line graph
![Page 5: LR Structures: algebraic constructions and large vertex-stabilizers (with Primoz Potocnik )](https://reader036.vdocument.in/reader036/viewer/2022070423/56816628550346895dd987d6/html5/thumbnails/5.jpg)
For an LR structure, we first need a cycle decomposition
which is bipartite.
![Page 6: LR Structures: algebraic constructions and large vertex-stabilizers (with Primoz Potocnik )](https://reader036.vdocument.in/reader036/viewer/2022070423/56816628550346895dd987d6/html5/thumbnails/6.jpg)
Letting A+ be the group of symmetries which preserve edge
color,
we need A+ to be transitive on vertices.
![Page 7: LR Structures: algebraic constructions and large vertex-stabilizers (with Primoz Potocnik )](https://reader036.vdocument.in/reader036/viewer/2022070423/56816628550346895dd987d6/html5/thumbnails/7.jpg)
Moreover, A+ must have symmetries which are swappers
Green swapper fixes b, v, d, interchanges a,c
a
d v
c
b
Red swapper fixes a, v, c, interchanges b,d
![Page 8: LR Structures: algebraic constructions and large vertex-stabilizers (with Primoz Potocnik )](https://reader036.vdocument.in/reader036/viewer/2022070423/56816628550346895dd987d6/html5/thumbnails/8.jpg)
If we have an LR structure,
Is bipartite, transitive on vertices of each color
then its partial line graph:
and transitive on edges
![Page 9: LR Structures: algebraic constructions and large vertex-stabilizers (with Primoz Potocnik )](https://reader036.vdocument.in/reader036/viewer/2022070423/56816628550346895dd987d6/html5/thumbnails/9.jpg)
There are two ways that an LR structure can be undesirable.
(a b)(c d) or (a b c d) = color-reversing symmetry =>
the structure is self-dual
An alternating 4-cycle => toroidal
(we say it is not ‘smooth’)
a
d vc
b
An LR structure exhibiting neither of these abberations is suitable.
![Page 10: LR Structures: algebraic constructions and large vertex-stabilizers (with Primoz Potocnik )](https://reader036.vdocument.in/reader036/viewer/2022070423/56816628550346895dd987d6/html5/thumbnails/10.jpg)
If an LR structure is suitable, then its partial line graph is
semisymmetric.
And every tetravalent semisymmetric graph of girth 4 is the partial line graph of some suitable LR structure.
![Page 11: LR Structures: algebraic constructions and large vertex-stabilizers (with Primoz Potocnik )](https://reader036.vdocument.in/reader036/viewer/2022070423/56816628550346895dd987d6/html5/thumbnails/11.jpg)
Algebraic Constructions
Let A be a group generated by some a, b, c, d, and
suppose that b = a-1 or a and b each have order 2, and
similarly for c, d.
![Page 12: LR Structures: algebraic constructions and large vertex-stabilizers (with Primoz Potocnik )](https://reader036.vdocument.in/reader036/viewer/2022070423/56816628550346895dd987d6/html5/thumbnails/12.jpg)
Then define the structure to have one vertex for each g in A. Red edges connect g – ag and g – bg; greens are g – cg and g – dg.
This just a coloring of Cay(A, {a, b, c, d}
![Page 13: LR Structures: algebraic constructions and large vertex-stabilizers (with Primoz Potocnik )](https://reader036.vdocument.in/reader036/viewer/2022070423/56816628550346895dd987d6/html5/thumbnails/13.jpg)
To make it an LR structure, we need f, g in Aut(A) such that f fixes a and b
while interchanging c and d, and vice versa for g.
Then f and g act as color-preserving symmetries of the structure, and as swappers at
IdA. We call them Cayley swappers.
![Page 14: LR Structures: algebraic constructions and large vertex-stabilizers (with Primoz Potocnik )](https://reader036.vdocument.in/reader036/viewer/2022070423/56816628550346895dd987d6/html5/thumbnails/14.jpg)
Example: A = Z12, a=3, b = -3 = 9, c = 4, d = -4 = 8.
Then let f=5, g = 7.
![Page 15: LR Structures: algebraic constructions and large vertex-stabilizers (with Primoz Potocnik )](https://reader036.vdocument.in/reader036/viewer/2022070423/56816628550346895dd987d6/html5/thumbnails/15.jpg)
Example: A = Z12, a=3, b = -3 = 9, c = 4, d = -4 = 8.
Unfortunately, 12 – 4 -7 -3 -12 is an alternating 4-cycle, and so this structure is not
suitable.
![Page 16: LR Structures: algebraic constructions and large vertex-stabilizers (with Primoz Potocnik )](https://reader036.vdocument.in/reader036/viewer/2022070423/56816628550346895dd987d6/html5/thumbnails/16.jpg)
If A is any abelian group, the 4-cycle 0 – a – a+c – c – 0 is alternating and so the structure cannot be suitable.
![Page 17: LR Structures: algebraic constructions and large vertex-stabilizers (with Primoz Potocnik )](https://reader036.vdocument.in/reader036/viewer/2022070423/56816628550346895dd987d6/html5/thumbnails/17.jpg)
In general, if A is a group generated by a, b, c, d and R = {a, b}, G = {c, d} generate the red and green edges, then the
structure is smooth if and only if RG ≠GR.
And this happens if and only if RG and GR are disjoint!
![Page 18: LR Structures: algebraic constructions and large vertex-stabilizers (with Primoz Potocnik )](https://reader036.vdocument.in/reader036/viewer/2022070423/56816628550346895dd987d6/html5/thumbnails/18.jpg)
Special case: A = Dn = <ρ, τ|Id = ρn = τ2 = (ρτ)2>.R = {τ, τρc }, G ={τρd, τρe }
Shorthand is:Ai = ρi, Bi = τρi
We call this LR structureDihLRn({0, c}, {d, e})
![Page 19: LR Structures: algebraic constructions and large vertex-stabilizers (with Primoz Potocnik )](https://reader036.vdocument.in/reader036/viewer/2022070423/56816628550346895dd987d6/html5/thumbnails/19.jpg)
Then Ai is red-connected to Bi and Bi+c , and green-
connected to Bi+d and Bi+e.
Then DihLRn({0, c}, {d, e}) has Cayley swappers if c = r, d = 1, e = 1-s, where 1 = r2 = s2, (r-1)(s-1) = 0
and r, s ≠ ±1, r ≠ ±s
![Page 20: LR Structures: algebraic constructions and large vertex-stabilizers (with Primoz Potocnik )](https://reader036.vdocument.in/reader036/viewer/2022070423/56816628550346895dd987d6/html5/thumbnails/20.jpg)
And DihLRn({0, c}, {d, e})
has a non-Cayley swapper only if c = n/2.
Example: DihLR4k({0, 2k}, {1, 1-k})
![Page 21: LR Structures: algebraic constructions and large vertex-stabilizers (with Primoz Potocnik )](https://reader036.vdocument.in/reader036/viewer/2022070423/56816628550346895dd987d6/html5/thumbnails/21.jpg)
Ai+2k
Bi Bi+2
k
Ai Ai
Bi+1 Bi+1-kAi+k
Bi+k+
1
Bi+1Ai+2k
Bi+2k+
1
Bi+1+kAi-k
Bi+1-k Bi+1+2
k
Example: DihLR4k({0, 2k}, {1, 1-k})
![Page 22: LR Structures: algebraic constructions and large vertex-stabilizers (with Primoz Potocnik )](https://reader036.vdocument.in/reader036/viewer/2022070423/56816628550346895dd987d6/html5/thumbnails/22.jpg)
A2+k A2-kB2 B2+2k
B2+k
B2-
k
Bk B-k
A1+k
A1-k
A1+2k
A1
A0
B1-
k
A2k
B1+
k
B1+2k
B1
A-k
Ak
Bi Bi+2
k
Ai Ai
Bi+1 Bi+1-k
![Page 23: LR Structures: algebraic constructions and large vertex-stabilizers (with Primoz Potocnik )](https://reader036.vdocument.in/reader036/viewer/2022070423/56816628550346895dd987d6/html5/thumbnails/23.jpg)
In the LR structure DihLR4k({0, 2k}, {1, 1-k}),
and in its partialline graph,
vertex stabilizers have order:
22k-2
![Page 24: LR Structures: algebraic constructions and large vertex-stabilizers (with Primoz Potocnik )](https://reader036.vdocument.in/reader036/viewer/2022070423/56816628550346895dd987d6/html5/thumbnails/24.jpg)
Poignant moment from research life