Authors:
Kenneth Caviness
1
;
Colton Davis
1
;
Derek Renck
1
;
Charles Sarr
2
;
Scot Anderson
3
;
Heaven Robles
4
and
Rhys Sharpe
3
Affiliations:
1
School of Engineering and Physics, Southern Adventist University, Taylor Circle, Collegedale, U.S.A.
;
2
Laurelbrook Academy, Campus Drive, Dayton, U.S.A.
;
3
School of Computing, Southern Adventist University, Taylor Circle, Collegedale, U.S.A.
;
4
Biology and Allied Health Department, Southern Adventist University, Taylor Circle, Collegedale, U.S.A.
Keyword(s):
Graph Identification, Concatentation, Indexed Concatenation, Lossless Compression, Edge Difference Set List.
Abstract:
The indexed concatenation notation presented in this paper extends the concept of concatenation in a way similar to the extension of addition to the indexed sum, allowing compact representations of strings, lists, matrices, etc., having internal repetitive or describable structure. In particular, it allows the edge difference set list of any graphical network with a visible pattern to be summarized in an extremely compact and lossless way. Examples highlight the information compression of the technique and showcase its ability to represent complicated, infinite patterns in closed form.