Exponent matrices appeared in the study of tiled orders over discrete valuation rings. Many properties of such orders are formulated using this notion. We think that such matrices are of interest in them own right, in particular, it is convenient to write finite partially ordered sets (posets) and finite metric spaces as special exponent matrices. Note that when we defined a quiver Q(E) of a re...

We study Farrell Nil-groups associated to a finite order automorphism of a ring R. We show that any such Farrell Nil-group is either trivial, or infinitely generated (as an abelian group). Building on this first result, we then show that any finite group that occurs in such a Farrell Nil-group occurs with infinite multiplicity. If the original finite group is a direct summand, then the countabl...

This paper is a study of some of the critical properties of a simple model for flux. The model is motivated by gauge theory and is equivalent to the Ising model in three dimensions. The phase with condensed flux is studied. This is the ordered phase of the Ising model and the high temperature, deconfined phase of the gauge theory. The flux picture will be used in this phase. Near the transition...

Kramers-Kronig (K-K) relations exist as a consequence of causality, placing nonlocal constraints on the relationship between dispersion and absorption. The finite-bandwidth method of applying these relations is examined where the K-K integrals are restricted to the spectrum of the experimental data. These finite-bandwidth K-K relations are known to work with resonant-type data and here are appl...

We analyze the asymptotic performance of ensembles of random binning Slepian-Wolf codes, where each type class of the source might have a different coding rate. In particular, we first provide the exact encoder excess rate exponent as well as the decoder error exponent. Then, using the error exponent expression, we determine the optimal rate function, namely, the minimal rate for each type clas...

Here we write in a unified fashion (using “R(P,Q,D)” [1]) the random coding exponents in channel coding and lossy source coding. We derive their explicit forms and show, that, for a given random codebook distribution Q, the channel decoding error exponent can be viewed as an encoding success exponent in lossy source coding, and the channel correct-decoding exponent can be viewed as an encoding ...