English
Related papers

Related papers: Non-Martingale Fixed-Point Processes for Iterated …

200 papers

We study in detail the profinite group G arising as geometric \'etale iterated monodromy group of an arbitrary quadratic morphism f with an infinite postcritical orbit over a field of characteristic different from two. This is a…

Group Theory · Mathematics 2013-09-24 Richard Pink

This article provides a method to calculate the fixed-point proportion of any iterated wreath product acting on a $d$-regular tree. Moreover, the method applies to a generalization of iterated wreath products acting on a $d$-regular tree,…

Group Theory · Mathematics 2025-01-17 Santiago Radi

We consider a family of $(2,2)$-rational functions given on the set of complex $p$-adic field $\mathbb{C}_p$. Each such function has a unique fixed point. We study $p$-adic dynamical systems generated by the $(2,2)$-rational functions. We…

Dynamical Systems · Mathematics 2017-11-22 U. A. Rozikov , I. A. Sattarov

Consider a finite l-group acting on the affine space of dimension n over a field k, whose characteristic differs from l. We prove the existence of a fixed point, rational over k, in the following cases: --- The field k is p-special for some…

Algebraic Geometry · Mathematics 2017-10-30 Olivier Haution

It is well known that the propositional modal logic $\mathbf{GL}$ of provability satisfies the de Jongh-Sambin fixed-point property. On the other hand, Montagna showed that the predicate modal system $\mathbf{QGL}$, which is the natural…

Logic · Mathematics 2019-11-25 Sohei Iwata , Taishi Kurahashi

We construct an explicit infinite family of pairwise non-isomorphic infinite simple groups of type $\mathrm{F}_\infty$ (in particular, they are finitely presented) that act faithfully on the circle by orientation-preserving homeomorphisms,…

Group Theory · Mathematics 2025-12-23 Arnaud Brothier , Ryan Seelig

Computing reachability probabilities is a fundamental problem in the analysis of probabilistic programs. This paper aims at a comprehensive and comparative account on various martingale-based methods for over- and under-approximating…

Programming Languages · Computer Science 2018-11-16 Toru Takisaka , Yuichiro Oyabu , Natsuki Urabe , Ichiro Hasuo

In 1980, Odoni initiated the study of the fixed-point proportion of iterated Galois groups of polynomials motivated by prime density problems in arithmetic dynamics. The main goal of the present paper is to completely settle the…

Number Theory · Mathematics 2026-01-23 Jorge Fariña-Asategui , Santiago Radi

We present sufficient conditions, in terms of the jumping kernels, for two large classes of conservative Markov processes of pure-jump type to be purely discontinuous martingales with finite second moment. As an application, we establish…

Probability · Mathematics 2020-09-01 Yuichi Shiozawa , Jian Wang

For each integer $m \geq 1$, we construct a finite-dimensional family of rational maps, given by Blaschke-type products, whose restriction to the unit circle consists of $2m$-multimodal maps. We show that every post-critically finite…

Dynamical Systems · Mathematics 2026-05-08 Edson de Faria , Welington de Melo , Pedro A. S. Salomão , Edson Vargas

Many interesting questions in arithmetic dynamics revolve, in one way or another, around the (local and/or global) reducibility behavior of iterates of a polynomial. We show that for very general families of integer polynomials $f$ (and,…

Number Theory · Mathematics 2025-10-16 Joachim König

We analyze inexact fixed point iterations where the generating function contains an inexact solve of an equation system to answer the question of how tolerances for the inner solves influence the iteration error of the outer fixed point…

Numerical Analysis · Mathematics 2014-03-12 Philipp Birken

We study a class of stationary Markov processes with marginal distributions identifiable by moments such that every conditional moment of degree say $m$ is a polynomial of degree at most $m\;\text{.}\;$ We show that then under some…

Probability · Mathematics 2017-05-19 Paweł J. Szabłowski

In this paper, we develop an Isabelle/HOL library of order-theoretic fixed-point theorems. We keep our formalization as general as possible: we reprove several well-known results about complete orders, often with only antisymmetry or…

Logic in Computer Science · Computer Science 2023-06-22 Jérémy Dubut , Akihisa Yamada

We study isometric actions of Steinberg groups on Hadamard manifolds. We prove some rigidity properties related to these actions. In Particular we show that every isometric action of $St_n(F_p\langle t_1,\ldots ,t_k \rangle)$ on Hadamard…

Group Theory · Mathematics 2019-12-24 Omer Lavy

Let $C$ be a closed cone with nonempty interior $C^\circ$ in a Banach space. Let $f:C^\circ \rightarrow C^\circ$ be an order-preserving subhomogeneous function with a fixed point in $C^\circ$. We introduce a condition which guarantees that…

Functional Analysis · Mathematics 2022-08-16 Brian Lins

We construct a class of nonnegative martingale processes that oscillate indefinitely with high probability. For these processes, we state a uniform rate of the number of oscillations and show that this rate is asymptotically close to the…

Machine Learning · Computer Science 2014-08-18 Jan Leike , Marcus Hutter

Monotone processes, just like martingales, can often be recovered from their final values. Examples include running maxima of supermartingales, as well as running maxima, local times, and various integral functionals of sticky processes…

Probability · Mathematics 2018-02-26 Martin Larsson

We study a class of finite groups $G$ which behave similarly to elementary abelian $p$-groups with $p$ prime, that is, there exists a subgroup $N$ such that all elements of $G\setminus N$ are conjugate or inverse-conjugate under $\Aut(G)$.…

Group Theory · Mathematics 2018-01-30 Lei Wang , Yin Liu

Recently, a novel fixed point operation has been introduced over certain non-monotonic functions between stratified complete lattices and used to give semantics to logic programs with negation and boolean context-free grammars. We prove…

Logic in Computer Science · Computer Science 2015-12-11 Zoltan Esik