Related papers: Transition Matrix Theory
In this short note, we revisit Zeilberger's proof of the classical matrix-tree theorem and give a unified concise proof of variants of this theorem, some known and some new.
We present a set of principles and methodologies which may serve as foundations of a unifying theory of Mathematics. These principles are based on a new view of Grothendieck toposes as unifying spaces being able to act as `bridges' for…
A generalization of von Staudt's theorem that every permutation of the projective line that preserves harmonic quadruples is a projective semilinear map is given. It is then concluded that any proper supergroup of permutations of the…
The Euclidean algorithm makes possible a simple but powerful generalization of Taylor's theorem. Instead of expanding a function in a series around a single point, one spreads out the spectrum to include any number of points with given…
We provide sufficient conditions for systems of polynomial equations over general (real or complex) algebras to have a solution. This generalizes known results on quaternions, octonions and matrix algebras. We also generalize the…
We study compactifications of Matrix theory on twisted tori and non-commutative versions of them. As a first step, we review the construction of multidimensional twisted tori realized as nilmanifolds based on certain nilpotent Lie algebras.…
Linear time-invariant systems are very popular models in system theory and applications. A fundamental problem in system identification that remains rather unaddressed in extant literature is to leverage commonalities amongst related linear…
Some tools and ideas are interchanged between random matrix theory and multivariate statistics. In the context of the random matrix theory, classes of spherical and generalised Wishart random matrix ensemble, containing as particular cases…
In this paper we consider the problem of quantizing theories defined over configuration spaces described by non-commuting parameters. If one tries to do that by generalizing the path-integral formalism, the first problem one has to deal…
We present a unitary approach to the construction of representations and intertwining operators. We apply it to the $C^*$-algebras, groups, Gabor type unitary systems and wavelets. We give an application of our method to the theory of…
This work concludes a series of four papers on the foundational theory of orbifolds and stacks. We apply the abstract theory, developed in its predecessors, to orbifolds derived from manifolds. Specifically, we show how the very concrete…
In the theory of generalized cluster algebras, we build the so-called cluster formula and $D$-matrix pattern. Then as applications, some fundamental conjectures of generalized cluster algebras are solved affirmatively.
We review the development of random-matrix theory (RMT) during the last decade. We emphasize both the theoretical aspects, and the application of the theory to a number of fields. These comprise chaotic and disordered systems, the…
Random matrices now play a role in many parts of computational mathematics. To advance these applications, it is desirable to have tools that are flexible, easy to use, and powerful. Over the last 25 years, researchers have developed a…
We develop a general theory of Markov chains realizable as random walks on $\mathscr R$-trivial monoids. It provides explicit and simple formulas for the eigenvalues of the transition matrix, for multiplicities of the eigenvalues via…
In one complex variable, the cross ratio is a well-known quantity associated with four given points in the complex plane that remains invariant under linear fractional maps. In particular, if one knows where three points in the complex…
Motivated by an ongoing project on computer aided derivation of asymptotic models governed by partial differential equations, we introduce a class of term transformations that consists of traversal strategies and insertion of contexts. We…
This paper gives the most general form of the Adler-Kostant-Symes Theorem, and many applications of it, both finite and infinite dimensional, the former yielding algebraic completely integrable (a.c.i.) systems, and the latter examples in…
Graph theory provides fundamental concepts for many fields of science like statistical physics, network analysis and theoretical computer science. Here we give a pedagogical introduction to graph theory, divided into three sections. In the…
We generalize the dual notions of "expansion" and "collapse" so they can be applied to arbitrary metric spaces. We also expand the theory to allow for infinitely many such moves. Those tools are then employed to prove a variety of…