Related papers: Relations in the Sarkisov Program
In this work we introduce a new and richer class of finite order Markov chain models and address the following model selection problem: find the Markov model with the minimal set of parameters (minimal Markov model) which is necessary to…
Given a duo module $M$ over an associative (not necessarily commutative) ring $R,$ a Zariski topology is defined on the spectrum $\mathrm{Spec}^{\mathrm{fp}}(M)$ of {\it fully prime} $R$-submodules of $M$. We investigate, in particular, the…
We describe a general program for studying the dynamics of surjective endomorphisms of algebraic varieties that are amenable to techniques from the minimal model program. We obtain density results on the pre-periodic points of surjective…
We consider a Hamiltonian $H$ which is the sum of a deterministic part $H_0$ and of a random potential $V$. For finite $N \times N$ matrices, following a method introduced by Kazakov, we derive a representation of the correlation functions…
For analyzing stationary Yang-Mills connections in higher dimensions, one has to work with Morrey-Sobolev bundles and connections. The transition maps for a Morrey-Sobolev principal $G$-bundles are not continuous and thus the usual notion…
Extended affine root systems appear as the root systems of extended affine Lie algebras. A subclass of extended affine root systems, whose elements are called ``minimal" turns out to be of special interest mostly because of the geometric…
Optimal Morse matchings reveal essential structures of cell complexes which lead to powerful tools to study discrete geometrical objects, in particular discrete 3-manifolds. However, such matchings are known to be NP-hard to compute on…
Markov decision processes (MDPs) describe sequential decision-making processes; MDP policies return for every state in that process an advised action. Classical algorithms can efficiently compute policies that are optimal with respect to,…
We discuss the problem on the connectedness of various webs of lattice polytopes by introducing a geometric point of view from the toric Mori theory. To this end, we provide a combinatorial description of toric Sarkisov links in terms of…
In the set of stochastic, indecomposable, aperiodic (SIA) matrices, the class of stochastic Sarymsakov matrices is the largest known subset (i) that is closed under matrix multiplication and (ii) the infinitely long left-product of the…
The notion of Zariski pairs for projective curves in $\mathbb P^2$ is known since the pioneer paper of Zariski \cite{Zariski} and for further development, we refer the reference in \cite{Bartolo}.In this paper, we introduce a notion of…
Order-preserving couplings are elegant tools for obtaining robust estimates of the time-dependent and stationary distributions of Markov processes that are too complex to be analyzed exactly. The starting point of this paper is to study…
We compare two maps that arise in study of the cohomology of number fields with ramification restricted to a finite set S of primes. One of these maps, which we call an S-reciprocity map, interpolates the values of cup products in…
The classical fiber product in algebraic geometry provides a powerful tool for studying loci where two morphisms to a base scheme, $\phi: X \to S$ and $\psi: Y \to S$, coincide exactly. This condition of strict equality, however, is…
Given a $K$-vector space $V$, let $\sigma(V,K)$ denote the covering number, i.e. the smallest (cardinal) number of proper subspaces whose union covers $V$. Analogously, define $\sigma(M,R)$ for a module $M$ over a unital commutative ring…
An extended formulation of a polyhedron $P$ is a linear description of a polyhedron $Q$ together with a linear map $\pi$ such that $\pi(Q)=P$. These objects are of fundamental importance in polyhedral combinatorics and optimization theory,…
We introduce and study a new class of representations of surface groups into Lie groups of Hermitian type, called weakly maximal representations. They are defined in terms of invariants in bounded cohomology and extend considerably the…
Discriminantal arrangements are hyperplane arrangements, which are generalized braid ones. They are constructed from given hyperplane arrangements, but their combinatorics are not invariant under combinatorial equivalence. However, it is…
Interweaving relations are introduced and studied here in a general Markovian setting as a strengthening of usual intertwining relations between semigroups, obtained by adding a randomized delay feature. They provide a new classification…
We look at equivalence relations on the set of models of a theory -- MERs, for short -- such that the class of equivalent pairs is itself an elementary class, in a language appropriate for pairs of models. We provide many examples of…