Related papers: Terminal valuations and the Nash problem
Topologies on algebraic and equational theories are used to define germ determined, near-point determined, and point determined rings of smooth functions, without requiring them to be finitely generated. It is proved, that any commutative…
The famous Hadwiger theorem classifies all rigid motion invariant continuous valuations on convex sets as linear conbinations of quermassintegrals. We prove much more general result. We classify continuous valuations which are invariant…
Let p be a singular point of a complex hypersurface whose tangent cone is a quadric of rank at least 3. We show that the space of arcs through p is irreducible. Using a method of de Fernex, this shows that the Nash problem has a negative…
For a mean field game model with a major and infinite minor players, we characterize a notion of Nash equilibrium via a system of so-called master equations, namely a system of nonlinear transport equations in the space of measures. Then,…
We establish the existence of fixed points for set-valued maps defined on metric spaces and satisfying a pointwise or a local version of Banach's contraction property. As an application, we demonstrate the existence of Nash equilibrium in a…
Building on the work of the fourth author in math.AG/9904074, we prove the weak factorization conjecture for birational maps in characteristic zero: a birational map between complete nonsingular varieties over an algebraically closed field…
The purpose of this note is a wide generalization of the topological results of various classes of ideals of rings, semirings, and modules, endowed with Zariski topologies, to strongly irreducible ideals (endowed with Zariski topologies) of…
We define normalized versions of Berkovich spaces over a trivially valued field $k$, obtained as quotients by the action of $\mathbb R_{>0}$ defined by rescaling semivaluations. We associate such a normalized space to any special formal…
For nonexpansive fixed-point problems, Halpern's method with optimal parameters, its so-called H-dual algorithm, and in fact, an infinite family of algorithms containing them, all exhibit the exactly minimax optimal convergence rates. In…
We study the question which henselian fields admit definable henselian valuations (with or without parameters). We show that every field which admits a henselian valuation with non-divisible value group admits a parameter-definable…
Given a field with a set of discrete valuations $V$, we show how the genus of a division algebra over the field is related to the genus of the residue algebras at various valuations in $V$ and the ramification data. When the division…
Finite objects and more specifically finite games are formalized using induction, whereas infinite objects are formalized using coinduction. In this article, after an introduction to the concept of coinduction, we revisit on infinite…
The class of terminal planar networks was recently introduced from a biological perspective in relation to the visualization of phylogenetic networks, and its connection to upward planar networks has been established. We provide a…
We consider a market impact game for $n$ risk-averse agents that are competing in a market model with linear transient price impact and additional transaction costs. For both finite and infinite time horizons, the agents aim to minimize a…
Based on a recently developed rank Theorem for Eisenstein power series, we provide new proofs of the following two results of W. Pawlucki: I) The non regular locus of a complex or real analytic map is an analytic set. II) The set of…
We give an explicit algebraic characterisation of all definable henselian valuations on a dp-minimal real field. Additionally we characterise all dp-minimal real fields that admit a definable henselian valuation with real closed residue…
This work is concerned with the existence and uniqueness of boundary value problems defined on semi-infinite intervals. These kinds of problems seldom admit exactly known solutions and, therefore, the theoretical information on their…
We characterize those valued fields for which the image of the valuation ring under every polynomial in several variables contains an element of maximal value, or zero.
The classical problem of optimal transportation can be formulated as a linear optimization problem on a convex domain: among all joint measures with fixed marginals find the optimal one, where optimality is measured against a cost function.…
We consider the distance from a (square or rectangular) matrix pencil to the nearest matrix pencil in 2-norm that has a set of specified eigenvalues. We derive a singular value optimization characterization for this problem and illustrate…