Eigenvalues of a statistical mechanics matrix

We consider the problem of finding the spectrum of an n × n matrix which arises in the study of a certain model of long-range interactions in a one-dimensional statistical mechanics system. Our analysis exhibits a curious resemblance of the suitably normalized distribution of eigenvalues to the Marčenko–Pastur law in the limit n → ∞.     

Time-resolved vibrational spectroscopy

Call for papers

Time-resolved vibrational spectroscopy     

On the theory of collective motion in nuclei. III. From Hamiltonian dynamics to vortex-free fluidity

It is assumed that the Hamiltonian for collective motion in nuclei is invariant under the orthogonal group O(n, $\text{R}$). For degenerate orbits in phase space it is shown that the classical Hamiltonian equations reduce to the equations of a vortex-free fluid with a velocity field determined by independent equations of motion.     

Control of continuous sedimentation of ideal suspensions as an initial and boundary value problem

We present the control of continuous sedimentation in an ideal thickener as an initial and boundary value problem and construct the entropy solution.     

Induced product representations of extended Cuntz algebras

Let _H be the extended Cuntz algebra over the Hilbert space H. Since its zero grade part _H⁰ is the C^*-inductive limit of B(H^r), we look for some family of representations on an inductive limit of H^r as r. When such construction is shaped according to the structure of _H⁰, von Neumanns notion of a reference sequence of unit vectors for Hilbert infinite tensor products emerges; after a further Rieffel induction step, a class IPR[H] of representations of _H arises. For any two such representations, we describe explicitly their associated intertwiners. Any two representations in IPR[H] are either disjoint or unitarily equivalent. Actions of the group by translation on sequences of unit vectors are involved, as well as the ideals of .     

CAS-supported multiple representations in elementary linear algebra

Usually the Gaussian algorithm (GA) is presented at school as a method of solving a given system of linear equations by reducing it to a “triangular form”. In contrast to this technically oriented view, I will demonstrate a CAS-supported learning environment which includes a visual representation of GA and an activity-oriented «Gauss-game». This game stresses the concept of elementary matrices and leads directly to a partial, implementation of GA in the form of a «semi-automatic” functional CAS-program. These multiple representation of GA tries to take into consideration the research results on mental representations, to design rich variations of student activities and thereby to lead leading to webbeb concepts around GA. The CAS MuPAD is used.