English
Related papers

Related papers: Relations in the Sarkisov Program

200 papers

Markov Decision Processes (MDPs) are stochastic optimization problems that model situations where a decision maker controls a system based on its state. Partially observed Markov decision processes (POMDPs) are generalizations of MDPs where…

Optimization and Control · Mathematics 2019-03-26 Victor Cohen , Axel Parmentier

We describe birational representations of discrete groups generated by involutions, having their origin in the theory of exactly solvable vertex-models in lattice statistical mechanics. These involutions correspond respectively to two kinds…

High Energy Physics - Theory · Physics 2009-10-28 S. Boukraa , J-M. Maillard , G. Rollet

In this paper, we study the geometry of trisections on certain rational elliptic surfaces. We utilize Mumford representations of semi-reduced divisors in order to construct trisections and related plane curves with interesting properties…

Algebraic Geometry · Mathematics 2021-03-16 S. Bannai , N. Kawana , R. Masuya , H. Tokunaga

Nisan showed in 1991 that the width of a smallest noncommutative single-(source,sink) algebraic branching program (ABP) to compute a noncommutative polynomial is given by the ranks of specific matrices. This means that the set of…

Computational Complexity · Computer Science 2020-03-11 Markus Bläser , Christian Ikenmeyer , Meena Mahajan , Anurag Pandey , Nitin Saurabh

The Kripke semantics of various logics arises via categorical dualities between a category of relational frames and their maps, and a category of algebras and logical homomorphisms. When the relational frames are considered as computational…

Logic in Computer Science · Computer Science 2026-05-08 Piotr Kozicki , Alex Kavvos

The present article studies the finite Zariski tangent spaces to an affine variety X as linear codes, in order to characterize their typical or exceptional properties by global geometric conditions on X. The discussion concerns the generic…

Information Theory · Computer Science 2015-05-11 Azniv Kasparian , Evgeniya Velikova

The notion of a successful coupling of Markov processes, based on the idea that both components of the coupled system ``intersect'' in finite time with probability one, is extended to cover situations when the coupling is unnecessarily…

Probability · Mathematics 2007-05-23 Michael Blank , Sergey Pirogov

The transition matrix of a Markov chain $(X_k,k\geq 0)$ on a finite or infinite rooted tree is said to be almost upper-directed if, given $X_k$, the node $X_{k+1}$ is either a descendant of $X_k$ or the parent of $X_k$. It is said to be…

Probability · Mathematics 2024-11-12 Luis Fredes , Jean-François Marckert

We consider a new class of non Markovian processes with a countable number of interacting components. At each time unit, each component can take two values, indicating if it has a spike or not at this precise moment. The system evolves as…

Probability · Mathematics 2015-06-12 Antonio Galves , Eva Löcherbach

The Zariski theorem says that for every hypersurface in a complex projective (resp. affine) space of dimension at least 3 and for every generic plane in the projective (resp. affine) space the natural embedding generates an isomorphism of…

alg-geom · Mathematics 2007-05-23 Shulim Kaliman

Let $K$ be a field and $V$ and $W$ be $K$-vector spaces of dimension $m$ and $n$. Let $\phi$ be the canonical map from $Hom(V,W)$ to $Hom(\wedge^t V,\wedge^t W)$. We investigate the Zariski closure $X_t$ of the image $Y_t$ of $\phi$. In the…

Commutative Algebra · Mathematics 2008-04-02 Winfried Bruns , Aldo Conca

If $\rho$ is a binary relation on a set $X$, the structure ${\mathbb X}=\langle X,\rho\rangle$ is connected iff the minimal equivalence relation containing $\rho$ is the full relation on $X$. We show that, for a set $I$ the following…

Logic · Mathematics 2022-08-02 Miloš S. Kurilić

We consider the minimal model program for varieties that are not Q-factorial. We show that, in many cases, its steps are simpler than expected. In particular, all flips are 1-complemented. The main applications are to log terminal…

Algebraic Geometry · Mathematics 2021-02-02 János Kollár

We present an approach to detecting Zariski pairs in conic line arrangements. Our method introduces a combinatorial condition that reformulates the tubular neighborhood homeomorphism criterion arising in the definition of Zariski pairs.…

Algebraic Geometry · Mathematics 2026-01-05 Meirav Amram , Gal Goren

We construct a new family of minimal non-orientable matroids of rank three. Some of these matroids embed in Desarguesian projective planes. This answers a question of Ziegler: for every prime power $q$, find a minimal non-orientable…

Combinatorics · Mathematics 2022-02-22 Rigoberto Florez , David Forge

We propose new structures called almost o-minimal structures and $\mathfrak X$-structures. The former is a first-order expansion of a dense linear order without endpoints such that the intersection of a definable set with a bounded open…

Logic · Mathematics 2022-06-08 Masato Fujita

The theory of complex trees is introduced as a new approach to study a broad class of self-similar sets. Systems of equations encoded by complex trees tip-to-tip equivalence relations are used to obtain one-parameter families of connected…

Dynamical Systems · Mathematics 2019-11-13 Bernat Espigule

If $q:Y\longrightarrow{B}$ is a fibration and $Z$ is a space, then the free range mapping space $Y!Z$ has a collection of partial maps from $Y$ to $Z$ as underline space, i.e. those such maps whose domains are individual fibre of $q$. It is…

Dynamical Systems · Mathematics 2014-03-28 Manuel Fernando Moreira Galicia

Let M be a module over a commutative ring and let Spec(M) (resp. Max(M)) be the collection of all prime (resp. maximal) submodules of M. We topologize Spec(M) with Zariski topology, which is analogous to that for Spec(R), and consider…

Commutative Algebra · Mathematics 2015-09-29 Habibollah Ansari-Toroghy , Shokoufeh Habibi

Given an initial family of sets, we may take unions, intersections and complements of the sets contained in this family in order to form a new collection of sets; our construction process is done recursively until we obtain the last family.…

Combinatorics · Mathematics 2024-09-11 Jorge Garcia , Rosemarie Bongers , Jonathan Detgen , Walter Morales