Related papers: Stability and Arithmetic
Translation and rotation numbers have played an interesting and important role in the qualitative description of various dynamical systems. In this exposition we are especially interested in applications which lead to proofs of periodic…
We introduce new genuine zetas. There are two types, i.e., the pure non- abelian zetas defined using semi-stable bundles, and the group zetas defined for reductive groups. Basic properties such as rationality and functional equation are…
This paper aims to initialize a dynamical aspect of symbolic integration by studying stability problems in differential fields. We present some basic properties of stable elementary functions and D-finite power series that enable us to…
We prove a structure theorem for stable functions on amenable groups, which extends the arithmetic regularity lemma for stable subsets of finite groups. Given a group $G$, a function $f\colon G\to [-1,1]$ is called stable if the binary…
We study $\varepsilon$-stability in continuous logic. We first consider stability in a model, where we obtain a definability of types result with a better approximation than that in the literature. We also prove forking symmetry for…
In this paper we study some stability criteria for some semilinear integral equations with a function as initial condition and with additive noise, which is a Young integral that could be a functional of fractional Brownian motion. Namely,…
Let $R$ be an order in an algebraic number field. If $R$ is a principal order, then many explicit results on its arithmetic are available. Among others, $R$ is half-factorial if and only if the class group of $R$ has at most two elements.…
On a given arithmetic surface, inspired by work of Miyaoka, we consider vector bundles which are extensions of a line bundle by another one. We give sufficient conditions for their restriction to the generic fiber to be semi-stable. We then…
A finitely generated quadratic module or preordering in the real polynomial ring is called stable, if it admits a certain degree bound on the sums of squares in the representation of polynomials. Stability, first defined explicitly by…
Proposed is a program for what we call Geometric Arithmetic, based on our works on non-abelian zeta functions and non-abelian class field theory. Key words are stability and adelic intersection-cohomology theory.
We introduce a relaxation of stability, called almost sure stability, which is insensitive to perturbations by subsets of Loeb measure $0$ in a non-standard finite group. We show that almost sure stability satisfies a stationarity principle…
We study pairs $(f, \Gamma)$ consisting of a non-Archimedean rational function $f$ and a finite set of vertices $\Gamma$ in the Berkovich projective line, under a certain stability hypothesis. We prove that stability can always be attained…
For a dynamical system on n-dimensional projective space over a number field or a function field, we show that semi-stable reduction implies the minimality of the resultant. We use this to show that every such dynamical system over a number…
We propose a new way of thinking about one parameter persistence. We believe topological persistence is fundamentally not about decomposition theorems but a central role is played by a choice of metrics. Choosing a pseudometric between…
The special uniformity of zeta functions claims that pure non-abelian zeta functions coincide with group zeta functions associated to the special linear groups. Naturally associated are three aspects, namely, the analytic, arithmetic, and…
We describe moduli spaces of logarithmic rank $2$ connections on elliptic curves with $n \geq 1$ poles and generic residues. In particular, we generalize a previous work by the first and second named authors. Our main approach is to analyze…
We classify the stable formulas in the theory of Dense Linear Orders without endpoints, the stable formulas in the theory of Divisible Abelian Groups, and the stable formulas without parameters in the theory of Real Closed Fields. The third…
We survey classical and recent developments in numerical linear algebra, focusing on two issues: computational complexity, or arithmetic costs, and numerical stability, or performance under roundoff error. We present a brief account of the…
We investigate the stability properties of an abstract class of semi-linear systems. Our main result establishes rational rates of decay for classical solutions assuming a certain non-uniform observability estimate for the linear part and…
H\"older stability estimate and uniqueness are proven for a retrospective problem of Mean Field Games with a non-quadratic Hamiltonian. The previous result was only for the quadratic Hamiltonian. The main tool is the apparatus of Carleman…