Notes on the proof of the van der Waerden permanent conjecture

The permanent of an $n\times n$ matrix $A=(a_{i j})$ with real entries is defined by the sum $$\sum_{\sigma \in S_n} \prod_{i=1}^{n} a_{i \sigma(i)}$$ where $S_n$ denotes the symmetric group on the $n$-element set $\{1,2,\dots,n\}$. In this creative component we survey some known properties of permanents, calculation of permanents for particular types of matrices and their applications in combinatorics and linear algebra. Then we follow the lines of van Lint\u27s exposition of Egorychev\u27s proof for the van der Waerden\u27s conjecture on the permanents of doubly stochastic matrices. The purpose of this component is to provide elementary proofs of several interesting known facts related to permanents of some special matrices. It is an expository survey paper in nature and reports no new findings

Classification of small class association schemes coming from certain combinatorial objects

We explore two- or three-class association schemes. We study aspects of the structure of the relation graphs in association schemes which are not easily revealed by their parameters and spectra. The purpose is to develop some combinatorial methods to characterize the graphs and classify the association schemes, and also to delve deeply into several specific classification problems. We work with several combinatorial objects, including strongly regular graphs, distance-regular graphs, the desarguesian complete set of mutually orthogonal Latin squares, orthogonal arrays, and symmetric Bush-type Hadamard matrices, all of which give rise to many small-class association schemes. We work within the framework of the theory of association schemes.;Our focus is placed on the search for all isomorphism classes of association schemes and characterization of small-class association schemes of specific order. In particular, we examine two-class association schemes (strongly regular graphs) of order 64 and their three-class fission schemes. After we collect \u27feasible\u27 parameter sets for the putative association schemes, we make an attempt to check the realization (existence) of the parameter sets and describe the structure of the schemes chiefly by investigating the structure of their relation graphs. In the course of this thesis, we find a new way to construct orthogonal arrays and investigate their implications for strongly regular graphs, symmetric Bush-type Hadamard matrices, and three-class association schemes. We obtain several results regarding the characterization and classification of two- or three-class association schemes of order 64

Spectra of large time-lagged correlation matrices from Random Matrix Theory

We analyze the spectral properties of large, time-lagged correlation matrices using the tools of random matrix theory. We compare predictions of the one-dimensional spectra, based on approaches already proposed in the literature. Employing the methods of free random variables and diagrammatic techniques, we solve a general random matrix problem, namely the spectrum of a matrix $\frac{1}{T}XAX^{\dagger}$, where $X$ is an $N\times T$ Gaussian random matrix and $A$ is \textit{any} $T\times T$, not necessarily symmetric (Hermitian) matrix. As a particular application, we present the spectral features of the large lagged correlation matrices as a function of the depth of the time-lag. We also analyze the properties of left and right eigenvector correlations for the time-lagged matrices. We positively verify our results by the numerical simulations.Comment: 44 pages, 11 figures; v2 typos corrected, final versio

The Stochastic-Quantum Theorem

This paper introduces several new classes of mathematical structures that have close connections with physics and with the theory of dynamical systems. The most general of these structures, called generalized stochastic systems, collectively encompass many important kinds of stochastic processes, including Markov chains and random dynamical systems. This paper then states and proves a new theorem that establishes a precise correspondence between any generalized stochastic system and a unitarily evolving quantum system. This theorem therefore leads to a new formulation of quantum theory, alongside the Hilbert-space, path-integral, and quasiprobability formulations. The theorem also provides a first-principles explanation for why quantum systems are based on the complex numbers, Hilbert spaces, linear-unitary time evolution, and the Born rule. In addition, the theorem suggests that by selecting a suitable Hilbert space, together with an appropriate choice of unitary evolution, one can simulate any generalized stochastic system on a quantum computer, thereby potentially opening up an extensive set of novel applications for quantum computing

Glosarium Matematika

273 p.; 24 cm