Related papers: On Nominal Syntax and Permutation Fixed Points
In this paper, we investigate a problem dual to the unification problem, namely the Common Term (CT) problem for string rewriting systems. Our main motivation was in computing fixed points in systems, such as loop invariants in programming…
We consider a fixed free and proper action of a locally compact group $G$ on a space $T$, and actions $\alpha:G\to \Aut A$ on $C^*$-algebras for which there is an equivariant embedding of $(C_0(T),\rt)$ in $(M(A),\alpha)$. A recent theorem…
Fixed points represent equilibrium states, stability, and solutions to a range of problems. It has been an active field of research. In this paper, we provide an overview of the main branches of fixed point theory. We discuss the key…
In this paper, we propose a new general and stable fixed-point approach to compute the resolvents of the composition of a set-valued maximal monotone operator with a linear bounded mapping. Weak, strong and linear convergence of the…
In this work, we will present variants Fixed Point Theorem for the affine and classical contexts, as a consequence of general Brouwer's Fixed Point Theorem. For instance, the affine results will allow working on affine balls, which are…
Initial semantics aims to capture inductive structures and their properties as initial objects in suitable categories. We focus on the initial semantics aiming to model the syntax and substitution structure of programming languages with…
Five algebraic notions of termination are formalised, analysed and compared: wellfoundedness or Noetherity, L\"ob's formula, absence of infinite iteration, absence of divergence and normalisation. The study is based on modal semirings,…
In this paper we first introduce the unified definition of the sharp constant that includes constants in three major problems of approximation theory, such as, inequalities for approximating elements, approximation of individual elements,…
We find a formula for the resolution of fixed points in extensions of permutation orbifold conformal field theories by its (half-)integer spin simple currents. We show that the formula gives a unitary and modular invariant S matrix.
Our aim in this paper is to prove some interesting fixed point theorems for the class of asymptotically $T$-regular mappings in the framework of preordered modular G-metric spaces. Our results are novel and generalizes several know results.…
We show that three fixed point structures equipped with (sequential) composition, a sum operation, and a fixed point operation share the same valid equations. These are the theories of (context-free) languages, (regular) tree languages, and…
We study the non-uniqueness of factorizations of non zero-divisors into atoms (irreducibles) in noncommutative rings. To do so, we extend concepts from the commutative theory of non-unique factorizations to a noncommutative setting. Several…
Using an elementary argument, we prove new fixed point theorems for classical elliptic complexes. We obtain new results for conformal relations and coisotropic intersections. We obtain theorems for the average intersections of families of…
We use representation theory of the symmetric group S_n to prove Poisson limit theorems for the distribution of fixed points for three types of non-uniform permutations. First, we give results for the commutator of g and x where g and x are…
A new fixed point principle for complete ordered families of equivalences (COFEs) is presented, which is stronger than the standard Banach-type fixed point principle.
Let $\sigma$ be a permutation of a nonempty finite or countably infinite set $X$ and let $F_X\left( \sigma^k\right)$ count the number of fixed points of the $k$th power of $\sigma$. This paper explains how the arithmetic function $k \mapsto…
This paper concerns the general problem of classifying the finite deterministic automata that admit a synchronizing (or reset) word. (For our purposes it is irrelevant if the automata has initial or final states.) Our departure point is the…
We prove a fixed point theorem for closed-graphed, decomposable-valued correspondences whose domain and range is a decomposable set of functions from an atomless measure space to a topological space. One consequence is an improvement of the…
Tarski gave a general semantics for deductive reasoning: a formula a may be deduced from a set A of formulas iff a holds in all models in which each of the elements of A holds. A more liberal semantics has been considered: a formula a may…
The definition of stable models for propositional formulas with infinite conjunctions and disjunctions can be used to describe the semantics of answer set programming languages. In this note, we enhance that definition by introducing a…