In this article we discuss a data structure, which combines advantages of two different ways for representing graphs: adjacency matrix and collection of adjacency lists. This data structure can fast add and search edges (advantages of adjacency matrix), use linear amount of memory, let to obtain adjacency list for certain vertex (advantages of collection of adjacency lists). Basic knowledge of ...

Dynamical linked cluster expansions are linked cluster expansions with hopping parameter terms endowed with their own dynamics. This amounts to a generalization from 2-point to point-link-point interactions. We develop an associated graph theory with a generalized notion of connectivity and describe an algorithmic generation of the new multiple-line graphs . We indicate physical applications to...

The Kruskal Count is a card trick invented by Martin Kruskal in which a magician “guesses” a card selected by a subject according to a certain counting procedure. With high probability the magician can correctly “guess” the card. The success of the trick is based on a mathematical principle related to coupling models for Markov chains. This paper analyzes in detail two simplified variants of th...

background and aim: quick speech in noise (q-sin) test has popularity for evaluating speech recognition in noise. the present study has been paid to build five new persian lists with respect to all possible factors affecting the test, to determine validity of the test and to run five lists for normal hearing subjects and assessment of reliability. methods: to build lists, frequent, familiar and...

Richard Ehrenborg [1] has provided a nice magic trick that can be used to illustrate many properties of Hamming codes. His paper includes a set of manipulatives that can be used to implement the trick. An improved version of this Hamming code magic trick is described in a recent paper in Math Horizons [3]. In this paper, we introduce a similar magic trick that is based on a Reed–Solomon code. I...

Programs routinely use complicated pointer (linked list-type) data structures such as linked lists, doubly linked lists, diierent types of trees, etc. These data structures are usually deened inductively: e.g., a tree can be deened as a structure that results from an empty tree by an arbitrary sequence of adding and deleting elements. When the program runs, these data structures take dynamicall...