Symmetry in Network Coding
|
|
- Brendan Harper
- 5 years ago
- Views:
Transcription
1 Symmetry in Network Coding Formalization, Graph-theoretic Characterization, and Computation Jayant Apte John Walsh Department of Electrical and Computer Engineering Drexel University, Philadelphia ISIT, 05 Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 / 55
2 Outline Motivation, Context, & Bigger Picture Formalization via Groups Group Action Network Symmetry Group Symmetries of Network Codes and Rate Regions Graph Theoretic Characterization Two Special Network Coding Problem Classes Automorphism Groups Characterization for k-unicast Networks Characterization for MSNC Networks Computation Applications Computation of Polyhedral Bounds on Rate Regions A generalization of partition-symmetrical entropy functions Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 / 55
3 General Network Coding Problem Sources S Network Sinks T Y s Paths... In(i) i Out(i).. s.. t e E U..... U e R e K T β(t) A[R,R,] T B[H(Y ),H(Y ),] T Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 / 55
4 Rate Region Rate region: all possible rate and source entropy vectors satisfying all network constraints. Collect the N network random variables and their joint entropies. Define Γ N :N -dim. cone, region of valid entropy vectors. (revisit later) Constraints from network A: L = {h Γ N : h Y S =Σ s S h Ys } () L = {h Γ N : h X Out(k) Y s =0} () L = {h Γ N : h X Out(i) X In(i) =0} () L = {(h T, R T ) T R N + E + : R e h Ue, e E} () L 5 = {h Γ N : h Y β(t) U In(t) =0}. (5) Rate region (cone) in terms of edge rates and source entropies (derived from [Yan, Yeung, Zhang TranIT 0]): R (A) = proj RE,H(Y S )(con(γ N L ) L 5 ) (6) Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 / 55
5 Rate Region Example A(, ) network and its rate region R (A) Rate region: a cone with dimensions of all variables in the network Y s Y s g g U U t U t Y t Y Y g R H(Y ) s Y Y R H(Y ) R + R H(Y )+H(Y )+H(Y ) R + R H(Y )+H(Y ) R + R +R H(Y )+H(Y )+H(Y ) Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 5 / 55
6 Rate Regions through Algorithms & Software NETWORK CODING PROBLEMS X X X R e MAJOR RECENT FOCUS OF ASPITRG: CAPACITY REGION & Codes that achieve it A H(X ). H(X K ) R. R E 0 X,X X,X X Y E E E EXAMPLE: X,X D D D D X X X X, Y R + R H(X) R + R H(X) R + R H(X) R + R +R H(X)+H(Y ) R +R +R H(X)+H(Y ) R + R + R H(X)+H(Y ) R +R +R H(X)+H(Y ) Jayant Apte, Congduan Li, and John MacLaren Walsh, Algorithms for Computing Network Coding Rate Regions via Single Element Extensions of Matroids, in IEEE International Symposium on Information Theory (ISIT 0), Jul. 0, pp [Online]. Available: Apte_ISIT_0.pdf Congduan Li, Jayant Apte, John MacLaren Walsh, Steven Weber, A new computational approach for determining rate regions and optimal codes for coded networks, in The 0 IEEE International Symposium on Network Coding (NetCod 0), Jun. 0. [Online]. Available: Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 6 / 55
7 Listing Networks & Calculating Their Rate Regions List of All Networks up to a Certain Size All Their Rate Regions Our Software Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 7 / 55
8 Listing Networks & Calculating Their Rate Regions List of All Networks up to a Certain Size All Their Rate Regions Our Software group networks into equivalence classes (only differing in labels) Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 8 / 55
9 Listing Networks & Calculating Their Rate Regions List of All Networks up to a Certain Size All Their Rate Regions Our Software group networks into equivalence classes (only differing in labels) list only canonical representative of each equivalence class, (Li NetCod '5 & Trans IT sub) Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 9 / 55
10 Listing Networks & Calculating Their Rate Regions List of All Networks up to a Certain Size group networks into equivalence classes (only differing in labels) All Their Rate Regions list only canonical representative of each equivalence class (Li NetCod '5 & Trans IT sub) Our Software network symmetry group (today's talk) determines size of the equivalence class, & is constructed in enumeration Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 0 / 55
11 Listing Networks & Calculating Their Rate Regions List of All Networks up to a Certain Size All Their Rate Regions Our Software network symmetry group (today's talk) determines size of the equivalence class, & is constructed in enumeration network symmetry group can be exploited to reduce complexity of rate region calculation (Apte,Walsh NetCod'5) Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 / 55
12 Rate Region Database Network Coding Rate Region Database rate region extremal codes converse proof rate region extremal codes converse proof rate region extremal codes converse proof Database of ~7000 Rate Regions of >00k Networks (Li Trans IT sub 0) Database of ~65k Rate Regions of > 7M or 55B and bounds for ~.8T more (Li Trans IT sub 05) Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 / 55
13 Rate Region Database Network Coding Rate Region Database rate region extremal codes converse proof rate region extremal codes converse proof rate region extremal codes converse proof Database of ~7000 Rate Regions of >00k Networks (Li Trans IT sub 0) Database of ~65k Rate Regions of > 7M or 55B and bounds for ~.8T more (Li Trans IT sub 05) What now? Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 / 55
14 Rate Region Database Network Coding Rate Region Database rate region extremal codes converse proof rate region extremal codes converse proof rate region extremal codes converse proof Database of ~7000 Rate Regions of >00k Networks (Li Trans IT sub 0) Database of ~65k Rate Regions of > 7M or 55B and bounds for ~.8T more (Li Trans IT sub 05) What now? Submit 65,000 transactions papers? Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 / 55
15 Rate Region Database Network Coding Rate Region Database rate region extremal codes converse proof rate region extremal codes converse proof rate region extremal codes converse proof Database of ~7000 Rate Regions of >00k Networks (Li Trans IT sub 0) Database of ~65k Rate Regions of > 7M or 55B and bounds for ~.8T more (Li Trans IT sub 05) What now? Analyze, learn, and explain something! Can't read and remember 65,000 network proofs. Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 5 / 55
16 Rate Region Database Network Coding Rate Region Database rate region extremal codes converse proof rate region extremal codes converse proof rate region extremal codes converse proof Database of ~7000 Rate Regions of >00k Networks (Li Trans IT sub 0) Database of ~65k Rate Regions of > 7M or 55B and bounds for ~.8T more (Li Trans IT sub 05) Investigate Structure through Network Hierarchy Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 6 / 55
17 Hierarchy: Embedding Operators & Forbidden Embedded Networks Minor-closed graphs: finite number of forbidden minors [RobertsonSeymour98-00] Rota s conjecture in matroid theory: finite number of forbidden minors for F q representability [Oxley0] Embedding Operators w/big Small rate region expression [Li Allerton 0, Li Trans IT sub 0] Forbidden embedded networks for F q codes sufficiency. Sources Network Destinations Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 7 / 55
18 Example: Forbidden embedded networks Goal: minimal forbidden networks for sufficiency Scalar binary codes considered k =,, ; E =,,, 760 non-isomorphic MDCS 9 sufficient, 58 insufficient minimal forbidden minors [Li, et. al TransIT sub 0] 58 / 760 insufficient 9 / 760 sufficient forbidden embedded networks Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 8 / 55
19 Hierarchy: Combination Operators Combination operators [Li ITW sub 05, Li Trans IT sub 05] Rules for combining smaller networks into large ones. Rate region of large expressed in terms of those of small. Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 9 / 55
20 Hierarchy: Combination Operators: Ex. [Li ITW sub 05] 5 6 X X X X X 5 X 6 0 R R 7 R 9 R 0 R 0 R R 6 R 7 R R R R 6 5 R 7 8 {,} X {,,} {} R R A : X R 5 {6} {5} R 5 6 {6} X X 5 R A : ' ' {,} {,} {5} {6} A : 0 {,5} 5 6 X 5 X R 8 R 6 R7 {,} {} {} {} {} {6} {6} {5} R i H(X ),i=, R 6 H(X 6 ) R H(X ) R + R H(X )+H(X ) R 7 + R 8 H(X 6 ) R H(X ) R + R +R 5 H(X )+H(X ) R 6 + R 7 H(X 5 )+H(X 6 ) R + R H(X )+H(X ) R 6 + R 7 +R 8 H(X 5 )+H(X 6 ) R 6 A : 5 R i H(X ),i=, R + R H(X )+H(X ) R i H(X ),i=,, R + R i H(X )+H(X ),i=, R + R i + R 5 H(X )+H(X ),i=, R 6 H(X 6 ) R i + R 8 H(X 6 ),i=7, 7 R 6 + R i H(X 5 )+H(X 6 ),i=7, 7 R 6 + R i +R 8 H(X 5 )+H(X 6 ),i=7, 7 R 9 H(X ) R 0 i= H(X i) R H(X 5 ) R H(X )+H(X 5 ) R 0 + R + R H(X )+H(X 5 )+H(X 6 ) X A : ' ' ' X X X R 9 R 0' 0 R 0 R R {','} {','} R 9 H(X ) {5'} {6'} {'5'} R 0 H(X )+H(X )+H(X ) R H(X 5 ) 6' A 5 : 5' X 5 ' X R H(X )+H(X 5 ) R 0 + R + R H(X )+H(X 5 )+H(X 6 ) Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 0 / 55
21 Hierarchy: Both Embedding & Combination Ops [Li Trans IT sub 05] Network Cap: no beyond Large size Combinations reach a portion of large networks Moderate size Small size Embeddings enlarge the reachable portion Tiny size Use operators together to get RR for big networks. Partial Network Closure. Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 / 55
22 Hierarchy: Both Embedding & Combination Ops [Li Trans IT sub 05] Start with the single (, ), single (, ), and the four (, ) networks; These 6 tiny networks can generate new 65 networks w/ small cap! :.6:;75/< 99==5>7.5=705.65; ;?9@0.8!"#"$!"#%$!%#%$!"#"$!"#%$!%#%$!&#"$ % % % % % %!&#%$ ' &' &' ' &' &'!(#($ " " " ) &* &+!(#"$ &" &+ &+ "' &"& &**!(#%$ ',- &'& ' *&+ +%)!"#($ ( " ( % &' &&!"#"$ (% (% (% %( "*" )""!"#%$ ' &"* &"* ' ("+& *%)&!%#($ ' ' " ' ' "!%#"$ ' ' &- ' ' %%!%#%$ ' ' (*" ' ' %%"'.// %+ (,( *+) )) "%'' &&+"* Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 / 55
23 Hierarchy: Both Embedding & Combination Ops [Li Trans IT sub 05] With the increase of cap size, number of new networks increases! :.6:;75/< 99==5>7.5=705.65; % % % % % %!&#%$ ' &' &' ' &' &'!(#($ " " " ) &* &+!(#"$ &" &+ &+ "' &"& &**!(#%$ ',- &'& ' *&+ +%)!"#($ ( " ( % &' &&!"#"$ (% (% (% %( "*" )""!"#%$ ' &"* &"* ' ("+& *%)&!%#($ ' ' " ' ' "!%#"$ ' ' &- ' ' %%!%#%$ ' ' (*" ' ' %%"'.// %+ (,( *+) )) "%'' &&+"* Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 / 55
24 Hierarchy: Both Embedding & Combination Ops [Li Trans IT sub 05] Embedding operations are important in the process! :.6:;75/< 99==5>7.5=705.65; % % % % % %!&#%$ ' &' &' ' &' &'!(#($ " " " ) &* &+!(#"$ &" &+ &+ "' &"& &**!(#%$ ',- &'& ' *&+ +%)!"#($ ( " ( % &' &&!"#"$ (% (% (% %( "*" )""!"#%$ ' &"* &"* ' ("+& *%)&!%#($ ' ' " ' ' "!%#"$ ' ' &- ' ' %%!%#%$ ' ' (*" ' ' %%"'.// %+ (,( *+) )) "%'' &&+"* Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 / 55
25 Listing Networks & Calculating Their Rate Regions List of All Networks up to a Certain Size group networks into equivalence classes (only differing in labels) All Their Rate Regions list only canonical representative of each equivalence class (Li NetCod '5 & Trans IT sub) Our Software network symmetry group (today's talk) determines size of the equivalence class, & is constructed in enumeration Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 5 / 55
26 Outline Motivation, Context, & Bigger Picture Formalization via Groups Group Action Network Symmetry Group Symmetries of Network Codes and Rate Regions Graph Theoretic Characterization Two Special Network Coding Problem Classes Automorphism Groups Characterization for k-unicast Networks Characterization for MSNC Networks Computation Applications Computation of Polyhedral Bounds on Rate Regions A generalization of partition-symmetrical entropy functions Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 6 / 55
27 Group Action Action of a finite group on a set Definition a The (left) group action of a group G S n on set S is the map φ : G S S :(g, x) φ(g, x) thatsatisfies: G φ((g h), x) =φ(g,φ(h, x)), g, h G, x S G φ(e, x) =x, x S a denotes subgroups, S n denotes symmetric group Denote φ(g, x) asx g and, φ(g, X )asx g for x S, andx S For X S, anelementg G is said to stabilize X setwise if X g = X The collection of all group elements g G that setwise stabilize a subset X S forms a group called stabilizer subgroup, denoted as G X. Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 7 / 55
28 Group Action on Network Constraints Example Recall network constraints L 5 = L L L L L 5 Let [n] be the set of subscripts of RVs in X n and ˆL be the set of sets of constraints arising from different network coding problems The natural action of G S n on [n] induces following sequence of actions: Act ([n]) induced Act(X n ) induced Act( X n ) induced Act( ˆL) Let g =(, )(, )(7, 8) G S 8 (natural action on [8] and X 8 ) {, } {, }, {,,, 8} {,,, 7} (induced action on X 8 ) {h {,} = h {,,,8} } {h {,} = h {,,,7} } {h 8 R 8 } {h 7 R 7 } (induced action on ˆL) Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 8 / 55
29 Rate Region Rate region: all possible rate and source entropy vectors satisfying all network constraints. Collect the N network random variables and their joint entropies. Define Γ N :N -dim. cone, region of valid entropy vectors. (revisit later) Constraints from network A: L = {h Γ N : h Y S =Σ s S h Ys } (7) L = {h Γ N : h X Out(k) Y s =0} (8) L = {h Γ N : h X Out(i) X In(i) =0} (9) L = {(h T, R T ) T R N + E + : R e h Ue, e E} (0) L 5 = {h Γ N : h Y β(t) U In(t) =0}. () Rate region (cone) in terms of edge rates and source entropies (derived from [Yan, Yeung, Zhang TranIT 0]): R (A) = proj RE,H(Y S )(con(γ N L ) L 5 ) () Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 9 / 55
30 Group Action on Network Constraints Example Recall network constraints L 5 = L L L L L 5 Let [n] be the set of subscripts of RVs in X n and ˆL be the set of sets of constraints arising from different network coding problems The natural action of G S n on [n] induces following sequence of actions: Act ([n]) induced Act(X n ) induced Act( X n ) induced Act( ˆL) Let g =(, )(, )(7, 8) G S 8 (natural action on [8] and X 8 ) {, } {, }, {,,, 8} {,,, 7} (induced action on X 8 ) {h {,} = h {,,,8} } {h {,} = h {,,,7} } {h 8 R 8 } {h 7 R 7 } (induced action on ˆL) Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 0 / 55
31 Outline Motivation, Context, & Bigger Picture Formalization via Groups Group Action Network Symmetry Group Symmetries of Network Codes and Rate Regions Graph Theoretic Characterization Two Special Network Coding Problem Classes Automorphism Groups Characterization for k-unicast Networks Characterization for MSNC Networks Computation Applications Computation of Polyhedral Bounds on Rate Regions A generalization of partition-symmetrical entropy functions Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 / 55
32 Network Symmetry Group Definition (Network Symmetry Group) The network symmetry group G I of a MSNC instance I =(G =(V, E), S, T,β) is the subgroup of S n, n = S + E, that stabilizes L 5 setwise under its induced action on ˆL. Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 / 55
33 Network Symmetry Group Example :;7<7:;7:67! " /! ) #! $"%)( 0"%)0,0&%*0'%+0-%.! " /! ) #! $"%)(! " #! $"%&%'(! ) #! $)%*%+( ), " :;7 6:=5>9:=! ) #! $)%*%+(! $&%*( #! $,%&%*(!, #! $,%-%.(! $'%-( #! $)%'%-(! " #! $"%&%'(! $&%*( #! $,%&%*(!, #! $,%-%.(! $+%.( #! $"%+%.(! $+%.( #! $"%+%.(! $'%-( #! $)%'%-( 5>=7 6:=5>9:= & ' * Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 / 55
34 Network Symmetry Group Example :;7<7:;7:67! " /! ) #! $"%)( 0"%)0,0&%*0'%+0-%.! " /! ) #! $"%)(! " #! $"%&%'(! ) #! $)%*%+( ), " :;7 6:=5>9:=! ) #! $)%*%+(! $&%*( #! $,%&%*(!, #! $,%-%.(! $'%-( #! $)%'%-(! " #! $"%&%'(! $&%*( #! $,%&%*(!, #! $,%-%.(! $+%.( #! $"%+%.(! $+%.( #! $"%+%.(! $'%-( #! $)%'%-( 5>=7 6:=5>9:= & ' * Network Symmetry Group of Butterfly Network is of order with (,)()(,5)(6,7)(8,9) being the only non-trivial symmetry Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 / 55
35 Outline Motivation, Context, & Bigger Picture Formalization via Groups Group Action Network Symmetry Group Symmetries of Network Codes and Rate Regions Graph Theoretic Characterization Two Special Network Coding Problem Classes Automorphism Groups Characterization for k-unicast Networks Characterization for MSNC Networks Computation Applications Computation of Polyhedral Bounds on Rate Regions A generalization of partition-symmetrical entropy functions Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 / 55
36 Symmetries of Network Codes Definition A network code ({f e }, {g t }) for a MSNC instance I is an assignment of a function f e to each edge e E and a function g t to each sink t T. Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 5 / 55
37 Symmetries of Network Codes Definition A network code ({f e }, {g t }) for a MSNC instance I is an assignment of a function f e to each edge e E and a function g t to each sink t T. Theorem Let G I be the NSG associated with MSNC instance I. Then,forany g G I,ifanetworkcode({f i }, {g t }) satisfies L 5,sodoes ({f i g }, {g t g }) for every g G I. Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 5 / 55
38 Symmetries of Rate Regions Theorem If ω, r is an achievable source information rates and edge rates vector pair for a MSNC instance I, soare[ω s g s S], [R e g e E] for every g G I. Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 6 / 55
39 Symmetries of Rate Regions Theorem If ω, r is an achievable source information rates and edge rates vector pair for a MSNC instance I, soare[ω s g s S], [R e g e E] for every g G I. Example +-*5+.6$7.*/,.*,'%7.*+ ********* +-*5+.6$7.*/,.*,'%7. #$%&'(!!"! #$%&'(!!"! 8"8! #$%&'(! #$%&'( #$%&')*$+,-*%./*&.,0/*'-.( Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 6 / 55
40 Outline Motivation, Context, & Bigger Picture Formalization via Groups Group Action Network Symmetry Group Symmetries of Network Codes and Rate Regions Graph Theoretic Characterization Two Special Network Coding Problem Classes Automorphism Groups Characterization for k-unicast Networks Characterization for MSNC Networks Computation Applications Computation of Polyhedral Bounds on Rate Regions A generalization of partition-symmetrical entropy functions Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 7 / 55
41 Two Special Problems MSNC Multisource Network Coding Described by tuple (G, S, T,β) β : T S \ allows arbitrary subset demands Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 8 / 55
42 Two Special Problems MSNC Multisource Network Coding Described by tuple (G, S, T,β) k-unc k-unicast Network Coding Described by tuple (G, S, T,β) β : T S \ allows arbitrary subset demands β : T S is a bijection Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 8 / 55
43 Outline Motivation, Context, & Bigger Picture Formalization via Groups Group Action Network Symmetry Group Symmetries of Network Codes and Rate Regions Graph Theoretic Characterization Two Special Network Coding Problem Classes Automorphism Groups Characterization for k-unicast Networks Characterization for MSNC Networks Computation Applications Computation of Polyhedral Bounds on Rate Regions A generalization of partition-symmetrical entropy functions Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 9 / 55
44 Automorphism Groups Several combinatorial objects can be described as collections of subsets of some set eg. graphs, digraphs, linear codes and so on Automorphism group of a combinatorial object is the group containing all permutations that keep the collection of subsets invariant Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 0 / 55
45 Automorphism Groups Several combinatorial objects can be described as collections of subsets of some set eg. graphs, digraphs, linear codes and so on Automorphism group of a combinatorial object is the group containing all permutations that keep the collection of subsets invariant Example )%$'*-%&&!'"('&"'#('&!'#((! " $%&!'"'#( )*+,*$'* -*+,*.*/0/+0*05*"*,67,,*05*) # :68;9*/0.+,*.*#<* =>?6.+0,*05*&!'"'#( )%$'*-%&8!'"9'8!'#9(! " # $%&!'"'#( )*+,*$'* -*+,*.*,67,*05 :68;9*/0.+,*.*+@+A**.@*8"'#9 Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 0 / 55
46 Outline Motivation, Context, & Bigger Picture Formalization via Groups Group Action Network Symmetry Group Symmetries of Network Codes and Rate Regions Graph Theoretic Characterization Two Special Network Coding Problem Classes Automorphism Groups Characterization for k-unicast Networks Characterization for MSNC Networks Computation Applications Computation of Polyhedral Bounds on Rate Regions A generalization of partition-symmetrical entropy functions Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 / 55
47 NSG via Graphs for k-unicast Construction. Start with the underlying DAG G =(V, E). Add a feedback edges F = {(t,β(t)) t T}to create circulation graph G c =(V, E F c ). Take line graph: vertices are edges of G c, edges are length directed paths in G c to create dual circulation graph G c. Associate random variables with vertices of G c Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 / 55
48 NSG via Graphs for k-unicast Construction. Start with the underlying DAG G =(V, E). Add a feedback edges F = {(t,β(t)) t T}to create circulation graph G c =(V, E F c ). Take line graph: vertices are edges of G c, edges are length directed paths in G c to create dual circulation graph G c. Associate random variables with vertices of G c Theorem The network symmetry group of a k-unc instance is G I = G Fc Aut(G c ), the group of permutations of X n induced by the subgroup of automorphism group of its dual circulation graph that setwise stabilizes the feedback edge set. Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 / 55
49 NSG via Graphs for k-unicast Example!-5-',6#*,&7 >?? A A C B C B )',7-.(*/0-+8 &'(&")*#'+,-.(*/0 $>D?% 9(+:)7;-<=;;7#('76 $ADB% $?DA% $ADC% $@D?% $>DB% $CD>% $@DC% symmetries are the subgroup of!"#$ % that setwise stabilizes the feedback edges {(6,),(5,)} $BD@% Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 / 55
50 NSG via Graphs for k-unicast Example.*/0*")'&)!5!"#!$%&'"()*+#&, : : < ; < ; ********%")5*+#&,-*(6!"#!$%&'"()*+#&,- =:>;? =8>:? =7>8? =:><? =9>8? =7>;? )5'@(#/*ABB5'#A*+#($,***** =<>7? **!()'&")*"C5)'"'A **&)C =9><? =;>9? Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 / 55
51 Outline Motivation, Context, & Bigger Picture Formalization via Groups Group Action Network Symmetry Group Symmetries of Network Codes and Rate Regions Graph Theoretic Characterization Two Special Network Coding Problem Classes Automorphism Groups Characterization for k-unicast Networks Characterization for MSNC Networks Computation Applications Computation of Polyhedral Bounds on Rate Regions A generalization of partition-symmetrical entropy functions Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 5 / 55
52 NSG via Graphs for MSNC Networks A slightly more complicated characterization. Start with underlying DAG G =(V, E). Add new vertices S, edges E S and F c to create circulation graph G c. Take line graph to create dual circulation graph Gc. Compute AUT(Gc ) 5. Obtain network symmetry group as an induced group Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 6 / 55
53 NSG via Graphs for MSNC Networks A slightly more complicated characterization. Start with underlying DAG G =(V, E). Add new vertices S, edges E S and F c to create circulation graph G c. Take line graph to create dual circulation graph G c. Compute AUT(G c ) 5. Obtain network symmetry group as an induced group Theorem The network symmetry group of a MSNC instance is the group of permutations induced onto E E S by the subgroup of Aut(G c ) that stabilizes E S setwise. Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 6 / 55
54 NSG via Graphs for MSNC Networks Example,-./ :;65<-.=96>? & ( ) *! " & ( ) * &+ (+ )+ *+! " # $ % # $ % &' && &( &) &' && &( &) Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 7 / 55
55 NSG via Graphs for MSNC Networks Example +,-./0-,5,67 & ( ) *! " # $ % &' && &( &) The Network Symmetry group is generated by: g =(, )(, )(5, 7)(6, 8) (9, )(0, )(, ) (, )(5, )(6, )(8, 9) g =(, )(7, 8)(, )(5, 6) (7, 8)(9, 0)(, )(, ) g =(, )(5, 6)(, 5)(, 6) (7, 9)(8, 0)(, )(, ) A group of order 8 Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 8 / 55
56 Outline Motivation, Context, & Bigger Picture Formalization via Groups Group Action Network Symmetry Group Symmetries of Network Codes and Rate Regions Graph Theoretic Characterization Two Special Network Coding Problem Classes Automorphism Groups Characterization for k-unicast Networks Characterization for MSNC Networks Computation Applications Computation of Polyhedral Bounds on Rate Regions A generalization of partition-symmetrical entropy functions Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 9 / 55
57 Computing NSGs One can use off-the-shelf (di)graph automorphism group computation software for computing NSGs nauty: No Automorphisms, Yes? implements Brendan McKay s canonical labeling algorithm We used SageMath s implementation of the same algorithm Can also be enumerated along with canonical networks [Li, Walsh, Weber, NetCod 05, Trans IT sub 05] Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, / 55
58 Outline Motivation, Context, & Bigger Picture Formalization via Groups Group Action Network Symmetry Group Symmetries of Network Codes and Rate Regions Graph Theoretic Characterization Two Special Network Coding Problem Classes Automorphism Groups Characterization for k-unicast Networks Characterization for MSNC Networks Computation Applications Computation of Polyhedral Bounds on Rate Regions A generalization of partition-symmetrical entropy functions Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 5 / 55
59 Computation of Polyhedral Bounds on Rate Regions Let H n R n +n Act ([n]) induced Act(X n ) induced Act( X n ) induced Act(H n) Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 5 / 55
60 Computation of Polyhedral Bounds on Rate Regions Let H n R n +n Act ([n]) induced Act(X n ) induced Act( X n ) induced Act(H n) Let L 5 be the intersection of hyperplanes and halfspaces in H n associated with network constraints Γ n L 5 is stabilized setwise under action of NSG on H n NSG gives polyhedral symmetry group of Γ n L 5 NSG gives polyhedral symmetry group of proj ω,r (Γ n L 5 ) Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 5 / 55
61 Computation of Polyhedral Bounds on Rate Regions Let H n R n +n Act ([n]) induced Act(X n ) induced Act( X n ) induced Act(H n) Let L 5 be the intersection of hyperplanes and halfspaces in H n associated with network constraints Γ n L 5 is stabilized setwise under action of NSG on H n NSG gives polyhedral symmetry group of Γ n L 5 NSG gives polyhedral symmetry group of proj ω,r (Γ n L 5 ) Extend to any outer/inner polyhedral bound Γ k n, k {in,out} provided that Γ k n is stabilised setwise under induced action of S n on H n e.g. ZY, DFZ non-shannon outer bounds, matroid inner bounds, subspace inner bounds Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 5 / 55
62 Outline Motivation, Context, & Bigger Picture Formalization via Groups Group Action Network Symmetry Group Symmetries of Network Codes and Rate Regions Graph Theoretic Characterization Two Special Network Coding Problem Classes Automorphism Groups Characterization for k-unicast Networks Characterization for MSNC Networks Computation Applications Computation of Polyhedral Bounds on Rate Regions A generalization of partition-symmetrical entropy functions Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 5 / 55
63 Ageneralizationofpartition-symmetricalentropyfunctions Let Fix G (S) fors H n be the subset of S fixed under the induced action of G on H n Let p be the partition of X n arising from orbits of G I,Σ p be the partition respecting subgroup of S n Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 5 / 55
64 Ageneralizationofpartition-symmetricalentropyfunctions Let Fix G (S) fors H n be the subset of S fixed under the induced action of G on H n Let p be the partition of X n arising from orbits of G I,Σ p be the partition respecting subgroup of S n Qi Chen and R. W. Yeung [arxiv] defined following regions: Ψ p =Fix Σp (Γ n ), Ψ p =Fix Σp (Γ n) () For a MSNC instance I, one can also define: Ψ I =Fix G I(Γ n ), Ψ I =Fix G I(Γ n) () Theorem For a MSNC instance I with NSG G I and associated orbits in X n denoted as p, Ψ p Ψ I and Ψ p Ψ I Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, 05 5 / 55
65 Conclusions Defined a network symmetry group Showed that it gives symmetries of rate regions & codes Showed how to calculate it with graph automorphism based tools Mentioned applications in enumeration [Li Walsh Weber Trans IT Sub 05], rate region calculation [Apte Walsh NetCod 5], and partition-symmetrical entropy functions Provided context in computational network coding research Jayant Apte, John Walsh (Drexel University) Symmetry in Network Coding ISIT, / 55
Exploiting Symmetry in Computing Polyhedral Bounds on Network Coding Rate Regions
Exploiting Symmetry in Computing Polyhedral Bounds on Network Coding Rate Regions Jayant Apte John Walsh Department of Electrical and Computer Engineering Drexel University, Philadelphia NetCod, 205 NSF
More informationSymmetry in Network Coding
Symmetry in Network Coding Jayant Apte, John MacLaren Walsh Drexel University, Dept. of ECE, Philadelphia, PA 19104, USA jsa46@drexel.edu, jwalsh@coe.drexel.edu Abstract We establish connections between
More informationMultiterminal Networks: Rate Regions, Codes, Computations, & Forbidden Minors
Multiterminal etworks: Rate Regions, Codes, Computations, & Forbidden Minors Ph D Thesis Proposal Congduan Li ASPITRG & MAL Drexel University congduanli@gmailcom October 5, 204 C Li (ASPITRG & MAL) Thesis
More informationNetwork Combination Operations Preserving the Sufficiency of Linear Network Codes
Network Combination Operations Preserving the Sufficiency of Linear Network Codes Congduan Li, Steven Weber, John MacLaren Walsh ECE Department, Drexel University Philadelphia, PA 904 Abstract Operations
More informationOn Multi-source Multi-sink Hyperedge Networks: Enumeration, Rate Region Computation, & Hierarchy
On Multi-ource Multi-ink Hyperedge Network: Enumeration, Rate Region Computation, & Hierarchy Ph D Diertation Defene Congduan Li ASPITRG & MANL Drexel Univerity congduanli@gmailcom May 9, 05 C Li (ASPITRG
More informationAlgorithms for Computing Network Coding Rate Regions via Single Element Extensions of Matroids
Algorithms for Computing Network Coding Rate Regions via Single Element Extensions of Matroids Jayant Apte, Congduan Li, John MacLaren Walsh Drexel University, Dept. of ECE, Philadelphia, PA 19104, USA
More informationCharacterizing the Region of Entropic Vectors via Information Geometry
Characterizing the Region of Entropic Vectors via Information Geometry John MacLaren Walsh Department of Electrical and Computer Engineering Drexel University Philadelphia, PA jwalsh@ece.drexel.edu Thanks
More informationMatroid Bounds on the Region of Entropic Vectors
Matroid Bounds on the Region of Entropic Vectors Congduan Li, John MacLaren Walsh, Steven Weber Drexel University, Dept of ECE, Philadelphia, PA 19104, USA congduanli@drexeledu, jwalsh@coedrexeledu, sweber@coedrexeledu
More informationSymmetries in Entropy Space
1 Symmetries in Entropy Space Jayant Apte, Qi Chen, John MacLaren Walsh Department of Electrical and Computer Engineering Drexel University Philadelphia, PA jwalsh@ece.drexel.edu Thanks to NSF CCF-1421828
More informationOn Multi-source Multi-Sink Hyperedge Networks: Enumeration, Rate Region. Computation, and Hierarchy. A Thesis. Submitted to the Faculty
On Multi-source Multi-Sink Hyperedge Networks: Enumeration, Rate Region Computation, and Hierarchy A Thesis Submitted to the Faculty of Drexel University by Congduan Li in partial fulfillment of the requirements
More informationSymmetries in the Entropy Space
Symmetries in the Entropy Space Jayant Apte, Qi Chen, John MacLaren Walsh Abstract This paper investigates when Shannon-type inequalities completely characterize the part of the closure of the entropy
More informationNon-isomorphic Distribution Supports for Calculating Entropic Vectors
Non-isomorphic Distribution Supports for Calculating Entropic Vectors Yunshu Liu & John MacLaren Walsh Adaptive Signal Processing and Information Theory Research Group Department of Electrical and Computer
More informationA computational approach for determining rate regions and codes using entropic vector bounds
1 A computational approach for determining rate regions and codes using entropic vector bounds Congduan Li, John MacLaren Walsh, Steven Weber Drexel University, Dept. of ECE, Philadelphia, PA 19104, USA
More informationA new computational approach for determining rate regions and optimal codes for coded networks
A new computational approach for determining rate regions and optimal codes for coded networks Congduan Li, Jayant Apte, John MacLaren Walsh, Steven Weber Drexel University, Dept. of ECE, Philadelphia,
More informationEntropic Vectors: Polyhedral Computation & Information Geometry
Entropic Vectors: Polyhedral Computation & Information Geometry John MacLaren Walsh Department of Electrical and Computer Engineering Drexel University Philadelphia, PA jwalsh@ece.drexel.edu Thanks to
More informationPartition Symmetrical Entropy Functions*
Partition Symmetrical Entropy Functions* Jayant Apte ASPITRG *Chen, Qi; Yeung, Raymond W., Partition Symmetrical Entropy Functions, arxiv:1407.7405v1 [cs.it] Outline Sneak Peak Background: Basic facts
More information. Relationships Among Bounds for the Region of Entropic Vectors in Four Variables
. Relationships Among Bounds for the Region of Entropic Vectors in Four Variables John MacLaren Walsh and Steven Weber Department of Electrical and Computer Engineering, Drexel University, Philadelphia,
More informationNetwork Coding on Directed Acyclic Graphs
Network Coding on Directed Acyclic Graphs John MacLaren Walsh, Ph.D. Multiterminal Information Theory, Spring Quarter, 0 Reference These notes are directly derived from Chapter of R. W. Yeung s Information
More informationBounding the Entropic Region via Information Geometry
Bounding the ntropic Region via Information Geometry Yunshu Liu John MacLaren Walsh Dept. of C, Drexel University, Philadelphia, PA 19104, USA yunshu.liu@drexel.edu jwalsh@coe.drexel.edu Abstract This
More informationNetworks and Matroids
Adaptive Signal Processing and Information Theory Research Group ECE Department, Drexel University June 1, 2012 Outline 1 Mappings and Definitions Source Mapping: S : V 2 µ, µ is message set. Message Assignment:
More informationCapacity Region of the Permutation Channel
Capacity Region of the Permutation Channel John MacLaren Walsh and Steven Weber Abstract We discuss the capacity region of a degraded broadcast channel (DBC) formed from a channel that randomly permutes
More informationPermutation Groups. John Bamberg, Michael Giudici and Cheryl Praeger. Centre for the Mathematics of Symmetry and Computation
Notation Basics of permutation group theory Arc-transitive graphs Primitivity Normal subgroups of primitive groups Permutation Groups John Bamberg, Michael Giudici and Cheryl Praeger Centre for the Mathematics
More informationThe Capacity Region for Multi-source Multi-sink Network Coding
The Capacity Region for Multi-source Multi-sink Network Coding Xijin Yan Dept. of Electrical Eng. - Systems University of Southern California Los Angeles, CA, U.S.A. xyan@usc.edu Raymond W. Yeung Dept.
More informationThis document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore.
This document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore. Title Finite nilpotent metacyclic groups never violate the Ingleton inequality Author(s) Stancu, Radu; Oggier,
More informationRate region for a class of delay mitigating codes and P2P networks
Rate region for a class of delay mitigating codes and P2P networks Steven Weber, Congduan Li, John MacLaren Walsh Drexel University, Dept of ECE, Philadelphia, PA 19104 Abstract This paper identifies the
More informationExtremal Entropy: Information Geometry, Numerical Entropy Mapping, and Machine Learning Application of Associated Conditional Independences.
Extremal Entropy: Information Geometry, Numerical Entropy Mapping, and Machine Learning Application of Associated Conditional Independences A Thesis Submitted to the Faculty of Drexel University by Yunshu
More informationPartial cubes: structures, characterizations, and constructions
Partial cubes: structures, characterizations, and constructions Sergei Ovchinnikov San Francisco State University, Mathematics Department, 1600 Holloway Ave., San Francisco, CA 94132 Abstract Partial cubes
More informationCharacterising Probability Distributions via Entropies
1 Characterising Probability Distributions via Entropies Satyajit Thakor, Terence Chan and Alex Grant Indian Institute of Technology Mandi University of South Australia Myriota Pty Ltd arxiv:1602.03618v2
More informationThe Golay code. Robert A. Wilson. 01/12/08, QMUL, Pure Mathematics Seminar
The Golay code Robert A. Wilson 01/12/08, QMUL, Pure Mathematics Seminar 1 Introduction This is the third talk in a projected series of five. It is more-or-less independent of the first two talks in the
More informationGeneralized Network Sharing Outer Bound and the Two-Unicast Problem
Generalized Network Sharing Outer Bound and the Two-Unicast Problem Sudeep U. Kamath, David N. C. Tse and Venkat Anantharam Wireless Foundations, Dept of EECS, University of California at Berkeley, Berkeley,
More informationLinearly Representable Entropy Vectors and their Relation to Network Coding Solutions
2009 IEEE Information Theory Workshop Linearly Representable Entropy Vectors and their Relation to Network Coding Solutions Asaf Cohen, Michelle Effros, Salman Avestimehr and Ralf Koetter Abstract In this
More information1 Fields and vector spaces
1 Fields and vector spaces In this section we revise some algebraic preliminaries and establish notation. 1.1 Division rings and fields A division ring, or skew field, is a structure F with two binary
More informationIsomorphisms. 0 a 1, 1 a 3, 2 a 9, 3 a 7
Isomorphisms Consider the following Cayley tables for the groups Z 4, U(), R (= the group of symmetries of a nonsquare rhombus, consisting of four elements: the two rotations about the center, R 8, and
More informationSherali-Adams Relaxations of Graph Isomorphism Polytopes. Peter N. Malkin* and Mohammed Omar + UC Davis
Sherali-Adams Relaxations of Graph Isomorphism Polytopes Peter N. Malkin* and Mohammed Omar + UC Davis University of Washington May 18th 2010 *Partly funded by an IBM OCR grant and the NSF. + Partly funded
More informationCombining the cycle index and the Tutte polynomial?
Combining the cycle index and the Tutte polynomial? Peter J. Cameron University of St Andrews Combinatorics Seminar University of Vienna 23 March 2017 Selections Students often meet the following table
More informationOn Linear Subspace Codes Closed under Intersection
On Linear Subspace Codes Closed under Intersection Pranab Basu Navin Kashyap Abstract Subspace codes are subsets of the projective space P q(n), which is the set of all subspaces of the vector space F
More informationSOME DESIGNS AND CODES FROM L 2 (q) Communicated by Alireza Abdollahi
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 3 No. 1 (2014), pp. 15-28. c 2014 University of Isfahan www.combinatorics.ir www.ui.ac.ir SOME DESIGNS AND CODES FROM
More informationAUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS
AUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS MAX GOLDBERG Abstract. We explore ways to concisely describe circulant graphs, highly symmetric graphs with properties that are easier to generalize
More informationExtremal Entropy: Information Geometry, Numerical Entropy Mapping, and Machine Learning Application of Associated Conditional Independences
Extremal Entropy: Information Geometry, Numerical Entropy Mapping, and Machine Learning Application of Associated Conditional Independences Ph.D. Dissertation Defense Yunshu Liu Adaptive Signal Processing
More informationOn Graph Isomorphism Problem
On Graph Isomorphism Problem Wenxue Du School of Mathematical Science, Anhui University, Hefei, 30601, China E-mail: wenxuedu@gmail.com Abstract arxiv:1710.0956v1 [math.co 6 Oct 017 Let G and H be two
More informationComputing Isomorphism [Ch.7, Kreher & Stinson] [Ch.3, Kaski & Östergård]
Computing Isomorphism [Ch.7, Kreher & Stinson] [Ch.3, Kaski & Östergård] Winter 2009 Introduction Isomorphism of Combinatorial Objects In general, isomorphism is an equivalence relation on a set of objects.
More information2014 IEEE International Symposium on Information Theory. Two-unicast is hard. David N.C. Tse
Two-unicast is hard Sudeep Kamath ECE Department, University of California, San Diego, CA, USA sukamath@ucsd.edu David N.C. Tse EECS Department, University of California, Berkeley, CA, USA dtse@eecs.berkeley.edu
More informationQuotients of vertex-transitive graphs
Chapter 5 Quotients of vertex-transitive graphs This chapter will study some operations on vertex-transitive graphs. 5.1 Quotient graphs Let Γ = (V,E) be a digraph. For a partition B of V,thequotient Γ
More informationOn an algebra related to orbit-counting. Peter J. Cameron. Queen Mary and Westeld College. London E1 4NS U.K. Abstract
On an algebra related to orbit-counting Peter J. Cameron School of Mathematical Sciences Queen Mary and Westeld College London E1 4NS U.K. Abstract With any permutation group G on an innite set is associated
More informationCS 468: Computational Topology Group Theory Fall b c b a b a c b a c b c c b a
Q: What s purple and commutes? A: An abelian grape! Anonymous Group Theory Last lecture, we learned about a combinatorial method for characterizing spaces: using simplicial complexes as triangulations
More informationDISTRIBUTIVE LATTICES ON GRAPH ORIENTATIONS
DISTRIBUTIVE LATTICES ON GRAPH ORIENTATIONS KOLJA B. KNAUER ABSTRACT. Propp gave a construction method for distributive lattices on a class of orientations of a graph called c-orientations. Given a distributive
More informationPermutation groups/1. 1 Automorphism groups, permutation groups, abstract
Permutation groups Whatever you have to do with a structure-endowed entity Σ try to determine its group of automorphisms... You can expect to gain a deep insight into the constitution of Σ in this way.
More informationDERIVATIONS. Introduction to non-associative algebra. Playing havoc with the product rule? BERNARD RUSSO University of California, Irvine
DERIVATIONS Introduction to non-associative algebra OR Playing havoc with the product rule? PART VI COHOMOLOGY OF LIE ALGEBRAS BERNARD RUSSO University of California, Irvine FULLERTON COLLEGE DEPARTMENT
More informationThe Capacity of a Network
The Capacity of a Network April Rasala Lehman MIT Collaborators: Nick Harvey and Robert Kleinberg MIT What is the Capacity of a Network? Source a Source b c d e Sink f Sink What is the Capacity of a Network?
More informationTame definable topological dynamics
Tame definable topological dynamics Artem Chernikov (Paris 7) Géométrie et Théorie des Modèles, 4 Oct 2013, ENS, Paris Joint work with Pierre Simon, continues previous work with Anand Pillay and Pierre
More informationUnless otherwise specified, V denotes an arbitrary finite-dimensional vector space.
MAT 90 // 0 points Exam Solutions Unless otherwise specified, V denotes an arbitrary finite-dimensional vector space..(0) Prove: a central arrangement A in V is essential if and only if the dual projective
More informationThe alternating groups
Chapter 1 The alternating groups 1.1 Introduction The most familiar of the finite (non-abelian) simple groups are the alternating groups A n, which are subgroups of index 2 in the symmetric groups S n.
More informationCharacteristic-Dependent Linear Rank Inequalities and Network Coding Applications
haracteristic-ependent Linear Rank Inequalities and Network oding pplications Randall ougherty, Eric Freiling, and Kenneth Zeger bstract Two characteristic-dependent linear rank inequalities are given
More information1. Quivers and their representations: Basic definitions and examples.
1 Quivers and their representations: Basic definitions and examples 11 Quivers A quiver Q (sometimes also called a directed graph) consists of vertices and oriented edges (arrows): loops and multiple arrows
More informationA Little Beyond: Linear Algebra
A Little Beyond: Linear Algebra Akshay Tiwary March 6, 2016 Any suggestions, questions and remarks are welcome! 1 A little extra Linear Algebra 1. Show that any set of non-zero polynomials in [x], no two
More informationChapter 9: Group actions
Chapter 9: Group actions Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Summer I 2014 M. Macauley (Clemson) Chapter 9: Group actions
More informationSum-networks from undirected graphs: Construction and capacity analysis
Electrical and Computer Engineering Conference Papers Posters and Presentations Electrical and Computer Engineering 014 Sum-networks from undirected graphs: Construction and capacity analysis Ardhendu
More informationOvergroups of Intersections of Maximal Subgroups of the. Symmetric Group. Jeffrey Kuan
Overgroups of Intersections of Maximal Subgroups of the Symmetric Group Jeffrey Kuan Abstract The O Nan-Scott theorem weakly classifies the maximal subgroups of the symmetric group S, providing some information
More informationAmobile satellite communication system, like Motorola s
I TRANSACTIONS ON INFORMATION THORY, VOL. 45, NO. 4, MAY 1999 1111 Distributed Source Coding for Satellite Communications Raymond W. Yeung, Senior Member, I, Zhen Zhang, Senior Member, I Abstract Inspired
More informationGroups and Symmetries
Groups and Symmetries Definition: Symmetry A symmetry of a shape is a rigid motion that takes vertices to vertices, edges to edges. Note: A rigid motion preserves angles and distances. Definition: Group
More informationBoolean Inner-Product Spaces and Boolean Matrices
Boolean Inner-Product Spaces and Boolean Matrices Stan Gudder Department of Mathematics, University of Denver, Denver CO 80208 Frédéric Latrémolière Department of Mathematics, University of Denver, Denver
More informationSemiregular automorphisms of vertex-transitive graphs
Semiregular automorphisms of vertex-transitive graphs Michael Giudici http://www.maths.uwa.edu.au/ giudici/research.html Semiregular automorphisms A semiregular automorphism of a graph is a nontrivial
More informationThe Witt designs, Golay codes and Mathieu groups
The Witt designs, Golay codes and Mathieu groups 1 The Golay codes Let V be a vector space over F q with fixed basis e 1,..., e n. A code C is a subset of V. A linear code is a subspace of V. The vector
More informationCombinatorial and physical content of Kirchhoff polynomials
Combinatorial and physical content of Kirchhoff polynomials Karen Yeats May 19, 2009 Spanning trees Let G be a connected graph, potentially with multiple edges and loops in the sense of a graph theorist.
More informationReverse Edge Cut-Set Bounds for Secure Network Coding
Reverse Edge Cut-Set Bounds for Secure Network Coding Wentao Huang and Tracey Ho California Institute of Technology Michael Langberg University at Buffalo, SUNY Joerg Kliewer New Jersey Institute of Technology
More informationVector Spaces. distributive law u,v. Associative Law. 1 v v. Let 1 be the unit element in F, then
1 Def: V be a set of elements with a binary operation + is defined. F be a field. A multiplication operator between a F and v V is also defined. The V is called a vector space over the field F if: V is
More informationRandom Linear Intersession Network Coding With Selective Cancelling
2009 IEEE Information Theory Workshop Random Linear Intersession Network Coding With Selective Cancelling Chih-Chun Wang Center of Wireless Systems and Applications (CWSA) School of ECE, Purdue University
More informationDetermining a Binary Matroid from its Small Circuits
Determining a Binary Matroid from its Small Circuits James Oxley Department of Mathematics Louisiana State University Louisiana, USA oxley@math.lsu.edu Charles Semple School of Mathematics and Statistics
More informationSUPPLEMENT ON THE SYMMETRIC GROUP
SUPPLEMENT ON THE SYMMETRIC GROUP RUSS WOODROOFE I presented a couple of aspects of the theory of the symmetric group S n differently than what is in Herstein. These notes will sketch this material. You
More information2 Permutation Groups
2 Permutation Groups Last Time Orbit/Stabilizer algorithm: Orbit of a point. Transversal of transporter elements. Generators for stabilizer. Today: Use in a ``divide-and-conquer approach for permutation
More informationOn the intersection of infinite matroids
On the intersection of infinite matroids Elad Aigner-Horev Johannes Carmesin Jan-Oliver Fröhlich University of Hamburg 9 July 2012 Abstract We show that the infinite matroid intersection conjecture of
More informationEntropy, mixing, and independence
Entropy, mixing, and independence David Kerr Texas A&M University Joint work with Hanfeng Li Let (X, µ) be a probability space. Two sets A, B X are independent if µ(a B) = µ(a)µ(b). Suppose that we have
More informationA tool oriented approach to network capacity. Ralf Koetter Michelle Effros Muriel Medard
A tool oriented approach to network capacity Ralf Koetter Michelle Effros Muriel Medard ralf.koetter@tum.de effros@caltech.edu medard@mit.edu The main theorem of NC [Ahlswede, Cai, Li Young, 2001] Links
More informationPermutation Groups and Transformation Semigroups Lecture 2: Semigroups
Permutation Groups and Transformation Semigroups Lecture 2: Semigroups Peter J. Cameron Permutation Groups summer school, Marienheide 18 22 September 2017 I am assuming that you know what a group is, but
More informationNotes on cycle generating functions
Notes on cycle generating functions. The cycle generating function of a species A combinatorial species is a rule attaching to each finite set X a set of structures on X, in such a way that the allowed
More informationStrongly regular graphs constructed from groups
Strongly regular graphs constructed from groups Dean Crnković Department of Mathematics University of Rijeka Croatia Symmetry vs Regularity Pilsen, Czech Republic, July 2018 This work has been fully supported
More informationThe rank of connection matrices and the dimension of graph algebras
The rank of connection matrices and the dimension of graph algebras László Lovász Microsoft Research One Microsoft Way Redmond, WA 98052 August 2004 Microsoft Research Technical Report TR-2004-82 Contents
More informationFourier Coefficients and Automorphic Discrete Spectrum of Classical Groups. Dihua Jiang University of Minnesota
Fourier Coefficients and Automorphic Discrete Spectrum of Classical Groups Dihua Jiang University of Minnesota KIAS, Seoul November 16, 2015 Square-Integrable Automorphic Forms G a reductive algebraic
More informationNick Gill. 13th July Joint with Hunt (USW) and Spiga (Milano Bicocca).
13th July 2016 Joint with Hunt and Spiga (Milano Bicocca). Overview Beautiful sets From here on, G is a group acting on a set Ω, and Λ is a subset of Ω. Write G Λ for the set-wise stabilizer of Λ. Write
More informationTHE SEMISIMPLE SUBALGEBRAS OF EXCEPTIONAL LIE ALGEBRAS
Trudy Moskov. Matem. Obw. Trans. Moscow Math. Soc. Tom 67 (2006) 2006, Pages 225 259 S 0077-1554(06)00156-7 Article electronically published on December 27, 2006 THE SEMISIMPLE SUBALGEBRAS OF EXCEPTIONAL
More informationSELF-DUAL GRAPHS BRIGITTE SERVATIUS AND HERMAN SERVATIUS
SELF-DUAL GRAPHS BRIGITTE SERVATIUS AND HERMAN SERVATIUS Abstract. We consider the three forms of self-duality that can be exhibited by a planar graph G, map self-duality, graph self-duality and matroid
More information3 Galois Theory. 3.1 Definitions and Examples
3 Galois Theory 3.1 Definitions and Examples This section of notes roughly follows Section 14.1 in Dummit and Foote. Let F be a field and let f (x) 2 F[x]. In the previous chapter, we proved that there
More informationORBIT-HOMOGENEITY IN PERMUTATION GROUPS
Submitted exclusively to the London Mathematical Society DOI: 10.1112/S0000000000000000 ORBIT-HOMOGENEITY IN PERMUTATION GROUPS PETER J. CAMERON and ALEXANDER W. DENT Abstract This paper introduces the
More informationCounting matrices over finite fields
Counting matrices over finite fields Steven Sam Massachusetts Institute of Technology September 30, 2011 1/19 Invertible matrices F q is a finite field with q = p r elements. [n] = 1 qn 1 q = qn 1 +q n
More informationOptimal Index Codes via a Duality between Index Coding and Network Coding
Optimal Index Codes via a Duality between Index Coding and Network Coding Ashok Choudhary, Vamsi Krishna Gummadi, Prasad Krishnan Signal Processing and Communications Research Centre, International Institute
More informationMarch 3, The large and small in model theory: What are the amalgamation spectra of. infinitary classes? John T. Baldwin
large and large and March 3, 2015 Characterizing cardinals by L ω1,ω large and L ω1,ω satisfies downward Lowenheim Skolem to ℵ 0 for sentences. It does not satisfy upward Lowenheim Skolem. Definition sentence
More informationA combinatorial view on derived codes
A combinatorial view on derived codes Relinde Jurrius (joint work with Philippe Cara) Vrije Universiteit Brussel, Belgium University of Neuchâtel, Switzerland Finite Geometries September 16, 2014 Relinde
More informationEdinburgh, December 2009
From totally nonnegative matrices to quantum matrices and back, via Poisson geometry Edinburgh, December 2009 Joint work with Ken Goodearl and Stéphane Launois Papers available at: http://www.maths.ed.ac.uk/~tom/preprints.html
More informationEntropy Vectors and Network Information Theory
Entropy Vectors and Network Information Theory Sormeh Shadbakht and Babak Hassibi Department of Electrical Engineering Caltech Lee Center Workshop May 25, 2007 1 Sormeh Shadbakht and Babak Hassibi Entropy
More informationPOLYA S ENUMERATION ALEC ZHANG
POLYA S ENUMERATION ALEC ZHANG Abstract. We explore Polya s theory of counting from first principles, first building up the necessary algebra and group theory before proving Polya s Enumeration Theorem
More informationSpherical varieties and arc spaces
Spherical varieties and arc spaces Victor Batyrev, ESI, Vienna 19, 20 January 2017 1 Lecture 1 This is a joint work with Anne Moreau. Let us begin with a few notations. We consider G a reductive connected
More informationTHE REPRESENTATION THEORY, GEOMETRY, AND COMBINATORICS OF BRANCHED COVERS
THE REPRESENTATION THEORY, GEOMETRY, AND COMBINATORICS OF BRANCHED COVERS BRIAN OSSERMAN Abstract. The study of branched covers of the Riemann sphere has connections to many fields. We recall the classical
More informationQUIVERS AND LATTICES.
QUIVERS AND LATTICES. KEVIN MCGERTY We will discuss two classification results in quite different areas which turn out to have the same answer. This note is an slightly expanded version of the talk given
More informationMATH 25 CLASS 21 NOTES, NOV Contents. 2. Subgroups 2 3. Isomorphisms 4
MATH 25 CLASS 21 NOTES, NOV 7 2011 Contents 1. Groups: definition 1 2. Subgroups 2 3. Isomorphisms 4 1. Groups: definition Even though we have been learning number theory without using any other parts
More informationComparison for infinitesimal automorphisms. of parabolic geometries
Comparison techniques for infinitesimal automorphisms of parabolic geometries University of Vienna Faculty of Mathematics Srni, January 2012 This talk reports on joint work in progress with Karin Melnick
More informationThe Shannon s basic inequalities refer to the following fundamental properties of entropy function:
COMMUNICATIONS IN INFORMATION AND SYSTEMS c 2003 International Press Vol. 3, No. 1, pp. 47-60, June 2003 004 ON A NEW NON-SHANNON TYPE INFORMATION INEQUALITY ZHEN ZHANG Abstract. Recently, K. Makarychev,
More informationREU 2007 Discrete Math Lecture 2
REU 2007 Discrete Math Lecture 2 Instructor: László Babai Scribe: Shawn Drenning June 19, 2007. Proofread by instructor. Last updated June 20, 1 a.m. Exercise 2.0.1. Let G be an abelian group and A G be
More informationCoding theory: algebraic geometry of linear algebra David R. Kohel
Coding theory: algebraic geometry of linear algebra David R. Kohel 1. Introduction. Let R be a ring whose underlying set we call the alphabet. A linear code C over R is a free R-module V of rank k, an
More informationCS632 Notes on Relational Query Languages I
CS632 Notes on Relational Query Languages I A. Demers 6 Feb 2003 1 Introduction Here we define relations, and introduce our notational conventions, which are taken almost directly from [AD93]. We begin
More informationComputable Differential Fields
Computable Differential Fields Russell Miller Queens College & CUNY Graduate Center New York, NY Mathematisches Forschungsinstitut Oberwolfach 10 February 2012 (Joint work with Alexey Ovchinnikov & Dmitry
More information