Matrix-product codes over Fq

Codes C-1,...,C-M of length it over F-q and an M x N matrix A over F-q define a matrix-product code C = [C-1 (...) C-M] (.) A consisting of all matrix products [c(1) (...) c(M)] (.) A. This generalizes the (u/u + v)-, (u + v + w/2u + v/u)-, (a + x/b + x/a + b + x)-, (u + v/u - v)- etc. constructions. We study matrix-product codes using Linear Algebra. This provides a basis for a unified analysis of /C/, d(C), the minimum Hamming distance of C, and C-perpendicular to. It also reveals an interesting connection with MDS codes. We determine /C/ when A is non-singular. To underbound d(C), we need A to be 'non-singular by columns (NSC)'. We investigate NSC matrices. We show that Generalized Reed-Muller codes are iterative NSC matrix-product codes, generalizing the construction of Reed-Muller codes, as are the ternary 'Main Sequence codes'. We obtain a simpler proof of the minimum Hamming distance of such families of codes. If A is square and NSC, C-perpendicular to can be described using C-1(perpendicular to),...,C-M(perpendicular to) and a transformation of A. This yields d(C-perpendicular to). Finally we show that an NSC matrix-product code is a generalized concatenated code.

Matrix Representation of the Stationary Measure for the Multispecies TASEP

In this work we construct the stationary measure of the N species totally asymmetric simple exclusion process in a matrix product formulation. We make the connection between the matrix product formulation and the queueing theory picture of Ferrari and Martin. In particular, in the standard representation, the matrices act on the space of queue lengths. For N > 2 the matrices in fact become tensor products of elements of quadratic algebras. This enables us to give a purely algebraic proof of the stationary measure which we present for N=3.

Numerical Solution of Fractional Diffusion-Wave Equation with two Space Variables by Matrix Method

Mathematics Subject Classi¯cation 2010: 26A33, 65D25, 65M06, 65Z05.

MA167exam00pdf

Exam questions and solutions in PDF

MA167exam00

Exam questions and solutions in LaTex. Diagrams for the questions are all together in the support.zip file, as .eps files

Phase diagram and spectral properties of a new exactly integrable spin-1 quantum chain

The spectral properties and phase diagram of the exactly integrable spin-1 quantum chain introduced by Alcaraz and Bariev are presented. The model has a U(1) symmetry and its integrability is associated with an unknown R-matrix whose dependence on the spectral parameters is not of a different form. The associated Bethe ansatz equations that fix the eigenspectra are distinct from those associated with other known integrable spin models. The model has a free parameter t(p). We show that at the special point t(p) = 1, the model acquires an extra U(1) symmetry and reduces to the deformed SU(3) Perk-Schultz model at a special value of its anisotropy q = exp(i2 pi/3) and in the presence of an external magnetic field. Our analysis is carried out either by solving the associated Bethe ansatz equations or by direct diagonalization of the quantum Hamiltonian for small lattice sizes. The phase diagram is calculated by exploring the consequences of conformal invariance on the finite-size corrections of the Hamiltonian eigenspectrum. The model exhibits a critical phase ruled by the c = 1 conformal field theory separated from a massive phase by first-order phase transitions.

Performance results of running parallel applications on the InteGrade

The InteGrade middleware intends to exploit the idle time of computing resources in computer laboratories. In this work we investigate the performance of running parallel applications with communication among processors on the InteGrade grid. As costly communication on a grid can be prohibitive, we explore the so-called systolic or wavefront paradigm to design the parallel algorithms in which no global communication is used. To evaluate the InteGrade middleware we considered three parallel algorithms that solve the matrix chain product problem, the 0-1 Knapsack Problem, and the local sequence alignment problem, respectively. We show that these three applications running under the InteGrade middleware and MPI take slightly more time than the same applications running on a cluster with only LAM-MPI support. The results can be considered promising and the time difference between the two is not substantial. The overhead of the InteGrade middleware is acceptable, in view of the benefits obtained to facilitate the use of grid computing by the user. These benefits include job submission, checkpointing, security, job migration, etc. Copyright (C) 2009 John Wiley & Sons, Ltd.

Quantum biology. Simulazioni di trasferimento di energia in una struttura dimerica

La quantum biology (QB) è un campo di ricerca emergente che cerca di affronta- re fenomeni quantistici non triviali all’interno dei contesti biologici dotandosi di dati sperimentali di esplorazioni teoriche e tecniche numeriche. I sistemi biologici sono per definizione sistemi aperti, caldi,umidi e rumorosi, e queste condizioni sono per loro imprenscindibili; si pensa sia un sistema soggetto ad una veloce decoerenza che sopprime ogni dinamica quantistica controllata. La QB, tramite i principi di noise assisted transport e di antenna fononica sostiene che la presenza di un adeguato livello di rumore ambientale aumenti l’efficienza di un network di trasporto,inoltre se all’interno dello spettro ambientale vi sono specifici modi vibrazionali persistenti si hanno effetti di risonanza che rigenerano la coerenza quantistica. L’interazione ambiente-sistema è di tipo non Markoviano,non perturbativo e di forte non equi- librio, ed il rumore non è trattato come tradizionale rumore bianco. La tecnica numerica che per prima ha predetto la rigenerazione della coerenza all’interno di questi network proteici è stato il TEBD, Time Evolving Block Decimation, uno schema numerico che permette di simulare sistemi 1-D a molti corpi, caratterizzati da interazioni di primi vicini e leggermente entangled. Tramite gli algoritmi numerici di Orthopol l’hamiltoniana spin-bosone viene proiettata su una catena discreta 1-D, tenendo conto degli effetti di interazione ambiente-sistema contenuti nello spettro(il quale determina la dinamica del sistema).Infine si esegue l’evoluzione dello stato.

[Local treatment of chronic skin wounds in a Swiss out-patient wound centre 2010]

In Switzerland around 30,000 patients suffer from chronic skin wounds. Appropriate topical wound care along with treatment of the causes of the wounds enables to heal a lot of these patients and to avoid secondary disease such as infections. Thereby, the final goal of wound care is stable reepithelisation. Based on experience with chronic leg ulcers mainly in our out-patient wound centre, we give a survey of the wound dressings we actually use and discuss their wound-phase adapted application. Furthermore, we address the two tissue engineering products reimbursed in Switzerland, Apligraf and EpiDex, as well as the biological matrix product Oasis. The crucial question, which treatment options will be offered in future to the wound patients by our health regulatory and insurance systems, is open to debate.

On the origin of a trace inequality

Numerous authors are apparently unaware that bounds on the trace of a matrix product presented in 1995 were originally published in 1990.

A scalarization technique for computing the power and exponential moments of gaussian random matrices

We consider the problems of computing the power and exponential moments EXs and EetX of square Gaussian random matrices X=A+BWC for positive integer s and real t, where W is a standard normal random vector and A, B, C are appropriately dimensioned constant matrices. We solve the problems by a matrix product scalarization technique and interpret the solutions in system-theoretic terms. The results of the paper are applicable to Bayesian prediction in multivariate autoregressive time series and mean-reverting diffusion processes.

Continuum tensor network field states, path integral representations and spatial symmetries

A natural way to generalize tensor network variational classes to quantum field systems is via a continuous tensor contraction. This approach is first illustrated for the class of quantum field states known as continuous matrix-product states (cMPS). As a simple example of the path-integral representation we show that the state of a dynamically evolving quantum field admits a natural representation as a cMPS. A completeness argument is also provided that shows that all states in Fock space admit a cMPS representation when the number of variational parameters tends to infinity. Beyond this, we obtain a well-behaved field limit of projected entangled-pair states (PEPS) in two dimensions that provide an abstract class of quantum field states with natural symmetries. We demonstrate how symmetries of the physical field state are encoded within the dynamics of an auxiliary field system of one dimension less. In particular, the imposition of Euclidean symmetries on the physical system requires that the auxiliary system involved in the class' definition must be Lorentz-invariant. The physical field states automatically inherit entropy area laws from the PEPS class, and are fully described by the dissipative dynamics of a lower dimensional virtual field system. Our results lie at the intersection many-body physics, quantum field theory and quantum information theory, and facilitate future exchanges of ideas and insights between these disciplines.

Fundamental limitations in the purifications of tensor networks

We show a fundamental limitation in the description of quantum many-body mixed states with tensor networks in purification form. Namely, we show that there exist mixed states which can be represented as a translationally invariant (TI) matrix product density operator valid for all system sizes, but for which there does not exist a TI purification valid for all system sizes. The proof is based on an undecidable problem and on the uniqueness of canonical forms of matrix product states. The result also holds for classical states.

An augmented Lanczos algorithm for the efficient computation of a dot-product of a function of a large sparse symmetric matrix

The Lanczos algorithm is appreciated in many situations due to its speed. and economy of storage. However, the advantage that the Lanczos basis vectors need not be kept is lost when the algorithm is used to compute the action of a matrix function on a vector. Either the basis vectors need to be kept, or the Lanczos process needs to be applied twice. In this study we describe an augmented Lanczos algorithm to compute a dot product relative to a function of a large sparse symmetric matrix, without keeping the basis vectors.