Related papers: The Specializations in a Scheme

By a theorem of Chevalley the image of a morphism of varieties is a constructible set. The algebraic version of this fact is usually stated as a result on "extension of specializations" or "lifting of prime ideals". We present a difference…

The present document corresponds to the 4 th chapter of my thesis, the problem setting is not definitive, what matters most here are the mathematical results and the methodology of the existence proofs. In this work, we propose a framework…

A standard assumption in the study of logarithmic structures is "fineness", but this assumption is not preserved by intersections, fiber products, and more general limits. We explain how a coherent logarithmic scheme $X$ has a natural…

A stationary subdivision scheme generates the full space of polynomials of degree up to $k$ if and only if its mask satisfies sum rules of order $k+1$, or its symbol satisfies zero conditions of order $k+1$. This property is often called…

Let R be a polynomial ring over k(u), where k is a field k and u is a finite family or inderterminates. The paper introduces the specialization of an arbitrary finitely generated R-module by the substitution of u to elements of k. This…

We characterize the words that can be mapped to arbitrarily high powers by injective morphisms. For all other words, we prove a linear upper bound for the highest power that they can be mapped to, and this bound is optimal up to a constant…

It is well-known that there exist infinite sequences that are the fixed point of non-uniform morphisms, but not $k$-automatic for any $k$. In this note we show that every $k$-automatic sequence is the image of a fixed point of a {\it…

The role of polymorphisms in determining the complexity of constraint satisfaction problems is well established. In this context we study the stability of CSP complexity and polymorphism properties under some basic graph theoretic…

The aim of this paper is to prove characterization theorems for higher order derivations. Among others we prove that the system defining higher order derivations is stable. Further characterization theorems in the spirit of N.~G.~de Bruijn…

A known characterization for entire functions that preserve all nonnegative matrices of order two is shown to characterize polynomials that preserve nonnegative matrices of order two. Equivalent conditions are derived and used to prove that…

Specify a randomized algorithm that, given a very large graph or network, extracts a random subgraph. What can we learn about the input graph from a single subsample? We derive laws of large numbers for the sampler output, by relating…

A large toolbox of numerical schemes for dispersive equations has been established, based on different discretization techniques such as discretizing the variation-of-constants formula (e.g., exponential integrators) or splitting the full…

We give a characterization of genuinely ramified maps of formal orbifolds in the Tannakian framework. In particular we show that a morphism is genuinely ramified if and only if the pullback of every stable bundle remains stable in the…

In this paper we determine the scheme-theoretic fixed points of pinned reductive group schemes acted upon by a group of pinning-preserving automorphisms. The results are used in a companion paper to establish a ramified geometric Satake…

In this short note, we will explain that the good moduli space morphisms behave as if they are proper when we consider sheaf operations, though they are not separated. For example, the decomposition theorem and the base change theorem hold…

We show that given a dominant morphism between two smooth varieties of the same dimension, the induced morphism between the formal neighborhoods of two arcs on these varieties is a closed embedding, of codimension given by the order of…

Let X/S be a quasi-projective morphism over an affine base. We develop in this article a technique for proving the existence of closed subschemes H/S of X/S with various favorable properties. We offer several applications of this technique,…

In this work we study the problem of network morphism, an effective learning scheme to morph a well-trained neural network to a new one with the network function completely preserved. Different from existing work where basic morphing types…

This article first presents two examples of algorithms that extracts information on scheme out of its defining equations. We also give a review on the notion of Castelnuovo-Mumford regularity, its main properties (in particular its relation…

We introduce an invariant, associated to a coherent sheaf over a projective morphism of schemes, which controls when sheaf cohomology can be passed through the given morphism. We then use this invariant to estimate the stability indexes of…