by a quasi-permutation matrix we mean a square matrix over the complex field c with non-negative integral trace. thus every permutation matrix over c is a quasipermutation matrix. for a given finite group g, let p(g) denote the minimal degree of a faithful permutation representation of g (or of a faithful representation of g by permutation matrices), let q(g) denote the minimal degree of a fait...

The linguistic conceptual distinction between deep and surface structures offers an interesting metaphor for developing new theories of information systems. However, the deep structure notion is both richer and more strongly contested in the linguistic field than can be communicated in published articles about new theories of information systems. This article explores the deep structure notion ...

Skyrms–Lewis signaling games illustrate how meaningful language may evolve from initially meaningless random signals (Lewis, Convention 1969; Skyrms 2008). Here we will consider how incommensurable languages might evolve in the context of signaling games. We will also consider the types of incommensurability exhibited between evolved languages in such games. We will find that sequentially evolv...