Related papers: Fixed point combinators as fixed points of higher-…
We present constructions and results about GDDs with two groups and block size 6. We study those GDDs in which each block has configuration (s,t), that is in which each block has exactly s points from one of the two groups and t points from…
Our paper is the first study of what one might call "reverse mathematics of explicit fixpoints". We study two methods of constructing such fixpoints for formulas whose principal connective is the intuitionistic Lewis arrow. Our main…
For a group $G$ and a finite set $A$, denote by $\text{CA}(G;A)$ the monoid of all cellular automata over $A^G$ and by $\text{ICA}(G;A)$ its group of units. We study the minimal cardinality of a generating set, known as the rank, of…
We consider sufficient conditions which guarantee that a planar embedding has a unique fixed point. We study sufficient conditions which imply the appearing of a globally attracting fixed point for such an embedding.
A group $G$ is said to satisfy the finitely generated intersection property (f.g.i.p.) if the intersection of any two finitely generated subgroups of $G$ is again finitely generated. The aim of this article is to understand when the…
We introduce the notion of regular finite decomposition complexity of a metric family. This generalizes Gromov's finite asymptotic dimension and is motivated by the concept of finite decomposition complexity (FDC) due to Guentner, Tessera…
This paper considers discrete and continuous semigroups of (weighted) composition operators on the Fock space. For discrete semigroups consisting of powers of a single operator, the asymptotic behaviour of the semigroups is analysed. For…
We introduce a new class of asymptotic contractions that employs two quasi-metrics defined directly in terms of the underlying mapping. The contraction condition compares these two quantities via a sequence of bounding functions that…
We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…
We derive conditions for the existence of fixed points of cone mappings without assuming scalability of functions. Monotonicity and scalability are often inseparable in the literature in the context of searching for fixed points of…
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…
A $K$-Fibonacci sequence is a binary recurrence sequence where $F_0=0$, $F_1=1$, and $F_n=K\cdot F_{n-1}+F_{n-2}$. These sequences are known to be periodic modulo every positive integer greater than $1$. If the length of one shortest period…
We determine the nature of the fixed point sets of groups of order p, acting on complexes of distinguished p-subgroups (those p-subgroups containing p-central elements in their centers). The case when G has parabolic characteristic p is…
This paper studies the principal components (PC) estimator for high dimensional approximate factor models with weak factors in that the factor loading ($\boldsymbol{\Lambda}^0$) scales sublinearly in the number $N$ of cross-section units,…
Recently, Blecher and Knopfmacher explored the notion of fixed points in integer partitions and hypothesized on the relative number of partitions with and without a fixed point. We resolve their open question by working fixed points into a…
Orthogonality is a notion based on the duality between programs and their environments used to determine when they can be safely combined. For instance, it is a powerful tool to establish termination properties in classical formal systems.…
We establish coupled fixed point theorems for contraction involving rational expressions in partially ordered metric spaces.
In this present article, we get sufficient conditions for the existence and uniqueness of fixed points and common fixed points for single and double mapping satisfying various contractive conditions within the partially ordered…
We introduce a variant of PCPs, that we refer to as rectangular PCPs, wherein proofs are thought of as square matrices, and the random coins used by the verifier can be partitioned into two disjoint sets, one determining the row of each…
For an $n$-by-$n$ matrix $A$, let $f_A$ be its "field of values generating function" defined as $f_A\colon x\mapsto x^*Ax$. We consider two natural versions of the continuity, which we call strong and weak, of $f_A^{-1}$ (which is of course…