Related papers: Inseparable local uniformization

In algebraic geometry specialisations and valuations play and important role. In this paper we start investigating analogous structures for Zariski structures. Specifically, we look into the existence and uniqueness properties of extensions…

For all simple and finite extension of a valued field, we prove that its defect is the product of the effective degrees of the complete set of key polynomials associated. As a consequence, we obtain a local uniformization theorem for…

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…

We discuss different generalizations of Zariski decomposition, relations between them and connections with finite generation of divisorial algebras.

We show that in principle, $N$-partite unitary transformations can be perfectly discriminated under local measurement and classical communication (LOCC) despite of their nonlocal properties. Based on this result, some related topics,…

We present a non-standard proof of the fact that the existence of a local (i.e. restricted to a point) characteristic-zero, semi-parametric lifting for a variety defined by the zero locus of polynomial equations over the integers is…

These lecture notes provide a unified overview of most known canonical desingularization methods in characteristic zero. It starts with discussing the classical method, and then proceeds with the recently discovered ones: logarithmic…

We provide a new proof of Alesker's Irreducibility Theorem. We first introduce a new localization technique for polynomial valuations on convex bodies, which we use to independently prove that smooth and translation invariant valuations are…

Let $R$ be the ring of $S$-integers in a number field $K$. Let $\mathcal{B}=\{\beta, \beta^{\ast}\}$ be the multi-set of roots of a nonzero quadratic polynomial over $R$. There are varieties $V(\mathcal{B})_{N,k}$ defined over $R$…

Let $\L_m$ be the scheme of the laws defined by the Jacobi's identities on $\K^m$ with $\K$ a field. A deformation of $\g\in\L_m$, parametrized by a local $\K$-algebra $\A$, is a local $\K$-algebra morphism from the local ring of $\L_m$ at…

We study Abhyankar valuations of excellent equicharacteristic local domains with an algebraically closed residue field. For zero dimensional valuations we prove that whenever the ring is complete and the semigroup of values taken by the…

The purpose of this paper is to provide a new account of multiplicity for finite morphisms between smooth projective varieties. Traditionally, this has been defined using commutative algebra in terms of the length of integral ring…

In this work we show that the classical subject of general valuation theory and Zariski-Riemann varieties has a much wider scope than commutative algebra and desingularization theory. We construct and investigate birational projective limit…

Let K be a field not of characteristic 2 such that every finite separable extension of K is cyclic. Let A be an abelian variety over K. If K is infinite, then A(K) is Zariski-dense in A. If K is not locally finite, the rank of A over K is…

Convergence guarantees for optimization over bounded-rank matrices are delicate to obtain because the feasible set is a non-smooth and non-convex algebraic variety. Existing techniques include projected gradient descent, fixed-rank…

We prove first-order definability of the prime subring inside polynomial rings, whose coefficient rings are (commutative unital) reduced and indecomposable. This is achieved by means of a uniform formula in the language of rings with…

We characterize some major algorithmic randomness notions via differentiability of effective functions. (1) As the main result we show that a real number z in [0,1] is computably random if and only if each nondecreasing computable function…

Let X be a singular affine normal variety with coordinate ring R and assume that there is an R-order admitting a stability structure such that the scheme of relevant semistable representations is smooth, then we construct a partial…

Numerous sophisticated local algorithm were suggested in the literature for various fundamental problems. Notable examples are the MIS and $(\Delta+1)$-coloring algorithms by Barenboim and Elkin [6], by Kuhn [22], and by Panconesi and…

Inverse problems are characterized by their inherent non-uniqueness and sensitivity with respect to data perturbations. Their stable solution requires the application of regularization methods including variational and iterative…