The embedding problem of Markov chains examines whether a stochastic matrix$\mathbf{P} $ can arise as the transition matrix from time 0 to time 1 of a continuous-time Markov chain. When the chain is homogeneous, it checks if $ \mathbf{P}=\exp{\mathbf{Q}}$ for a rate matrix $ \mathbf{Q}$ with zero row sums and non-negative off-diagonal elements, called a Markov generator. It is known that a Markov generator may not always exist or be unique. This paper addresses finding $ \mathbf{Q}$, assuming that the process has at most one jump per unit time interval, and focuses on the problem of aligning the conditional one-jump transition matrix from time 0 to time 1 with $ \mathbf{P}$. We derive a formula for this matrix in terms of $ \mathbf{Q}$ and establish that for any $ \mathbf{P}$ with non-zero diagonal entries, a unique $ \mathbf{Q}$, called the ${\unicode{x1D7D9}}$-generator, exists. We compare the ${\unicode{x1D7D9}}$-generator with the one-jump rate matrix from Jarrow, Lando, and Turnbull (1997), showing which is a better approximate Markov generator of $ \mathbf{P}$ in some practical cases.

The practically important classes of equal-input and of monotone Markov matrices are revisited, with special focus on embeddability, infinite divisibility, and mutual relations. Several uniqueness results for the classic Markov embedding problem are obtained in the process. To achieve our results, we need to employ various algebraic and geometric tools, including commutativity, permutation invariance, and convexity. Of particular relevance in several demarcation results are Markov matrices that are idempotents.

We describe topological obstructions (involving periodic points, topological entropy and rotation sets) for a homeomorphism on a compact manifold to embed in a continuous flow. We prove that homeomorphisms in a $C^{0}$-open and dense set of homeomorphisms isotopic to the identity in compact manifolds of dimension at least two are not the time-1 map of a continuous flow. Such property is also true for volume-preserving homeomorphisms in compact manifolds of dimension at least five. In the case of conservative homeomorphisms of the torus $\mathbb {T}^{d} (d\ge 2)$ isotopic to identity, we describe necessary conditions for a homeomorphism to be flowable in terms of the rotation sets.

Let $k$ be a field and $\mathbb{V}$ the affine threefold in $\mathbb{A}^4_k$ defined by $x^m y=F(x, z, t)$, $m \ge 2$. In this paper, we show that $\mathbb{V} \cong \mathbb{A}^3_k$ if and only if $f(z, t): = F(0, z, t)$ is a coordinate of $k[z, t]$. In particular, when $k$ is a field of positive characteristic and $f$ defines a non-trivial line in the affine plane $\mathbb{A}^2_k$ (we shall call such a $\mathbb{V}$ as an Asanuma threefold), then $\mathbb{V}\ncong \mathbb{A}^3_k$ although $\mathbb{V} \times \mathbb{A}^1_k \cong \mathbb{A}^4_k$, thereby providing a family of counter-examples to Zariski’s cancellation conjecture for the affine 3-space in positive characteristic. Our main result also proves a special case of the embedding conjecture of Abhyankar–Sathaye in arbitrary characteristic.

When a discrete-time homogenous Markov chain is observed at time intervals that correspond to its time unit, then the transition probabilities of the chain can be estimated using known maximum likelihood estimators. In this paper we consider a situation when a Markov chain is observed on time intervals with length equal to twice the time unit of the Markov chain. The issue then arises of characterizing probability matrices whose square root(s) are also probability matrices. This characterization is referred to in the literature as the embedding problem for discrete time Markov chains. The probability matrix which has probability root(s) is called embeddable.

In this paper for two-state Markov chains, necessary and sufficient conditions for embeddability are formulated and the probability square roots of the transition matrix are presented in analytic form. In finding conditions for the existence of probability square roots for (k x k) transition matrices, properties of row-normalized matrices are examined. Besides the existence of probability square roots, the uniqueness of these solutions is discussed: In the case of nonuniqueness, a procedure is introduced to identify a transition matrix that takes into account the specificity of the concrete context. In the case of nonexistence of a probability root, the concept of an approximate probability root is introduced as a solution of an optimization problem related to approximate nonnegative matrix factorization.

An open hierarchical (manpower) system divided into a totally ordered set of k grades is discussed. The transitions occur only from one grade to the next or to an additional (k+1)th grade representing the external environment of the system. The model used to describe the dynamics of the system is a continuous-time homogeneous Markov chain with k+1 states and infinitesimal generator R = (r ij ) satisfying r ij = 0 if i > j or i + 1 < j ≤ k (i, j = 1,…,k+1), the transition matrix P between times 0 and 1 being P = expR . In this paper, two-wave panel data about the hierarchical system are considered and the resulting fact that, in general, the maximum-likelihood estimated transition matrix cannot be written as an exponential of an infinitesimal generator R having the form described above. The purpose of this paper is to investigate when this can be ascribed to the effect of sampling variability.