We consider the Hamiltonian cycle problem (HCP) embedded in a controlled Markov decision process. In this setting, HCP reduces to an optimization problem on a set of Markov chains corresponding to a given graph. We prove that Hamiltonian cycles are minimizers for the trace of the fundamental matrix on a set of all stochastic transition matrices. In case of doubly stochastic matrices with symmet...

We study a certain class of classical one-dimensional piecewise linear maps. For these systems we introduce an infinite family of Markov partitions in equal cells. The symbolic dynamics generated by these systems is described by bi-stochastic (doubly stochastic) matrices. We analyse the structure of graphs generated from the corresponding symbolic dynamics. We demonstrate that the spectra of qu...

Discord, originally notable as a signature of bipartite quantum correlation, in fact can be nonzero classically, i.e. arising from noisy measurements by one the two parties. Here we redefine classical discord to quantify channel distortion, contrast previous restriction state, and then show monotonic relationship between (channel) distortion. We that is equivalent (doubly stochastic) distortion...

We present a multivariate generating function for all n × n nonnegative integral matrices with all row and column sums equal to a positive integer t , the so called semi-magic squares. As a consequence we obtain formulas for all coefficients of the Ehrhart polynomial of the polytope Bn of n×n doubly-stochastic matrices, also known as the Birkhoff polytope. In particular we derive formulas for t...

A pointed quasigroup is said to be semicentral if it is principally isotopic to a group via a permutation on one side and a group automorphism on the other. Convex combinations of permutation matrices given by the one-sided multiplications in a semicentral quasigroup then yield doubly stochastic transition matrices of finite Markov chains in which the entropic behaviour at any time is independe...

Let Ωn denote the set of all n × n doubly stochastic matrices. Two unequal matrices A and B in Ωn are called permanental mates if the permanent function is constant on the line segment t A + (1 − t)B, 0 ≤ t ≤ 1, connecting A and B. We study the perturbation matrix A + E of a symmetric matrix A in Ωn as a permanental mate of A. Also we show an example to disprove Hwang’s conjecture, which states...