Related papers: Fixed hooks in arbitrary columns
Let $t\geq2$ and $k\geq1$ be integers. A $t$-regular partition of a positive integer $n$ is a partition of $n$ such that none of its parts is divisible by $t$. Let $b_{t,k}(n)$ denote the number of hooks of length $k$ in all the $t$-regular…
The thesis deals with recognizing diffeomorphisms from fractal properties of discrete orbits, generated by iterations of such diffeomorphisms. The notion of fractal properties of a set refers to the box dimension, the Minkowski content and…
We show that every continuous rotative mapping on a closed interval has a fixed point. This gives an answer to some open questions raised by Goebel and Koter.
In this paper using Sperner's lemma for modified partition of a simplex we will constructively prove Brouwer's fixed point theorem for sequentially locally non-constant and uniformly sequentially continuous functions.
We exhibit a bijection between recently-introduced combinatorial objects known as valid hook configurations and certain weighted set partitions. When restricting our attention to set partitions that are matchings, we obtain three new…
We investigate the structure of fixed point sets of self-embeddings of models of arithmetic. In particular, given a countable nonstandard model M of a modest fragment of Peano arithimetic, we provide complete characterizations of (a) the…
We prove fixed point theorems in a space with a distance function that takes values in a partially ordered monoid. On the one hand, such an approach allows one to generalize some fixed point theorems in a broad class of spaces, including…
We use the hook lengths of a partition to define two rectangular tableaux. We prove these tableaux have equal multisets of entries, first by elementary combinatorial arguments, and then using Stanley's Hook Content Formula and symmetric…
Inverse limits, unlike direct limits, can in general be void, [1]. The existence of fixed points for arbitrary mappings $T : X \longrightarrow X$ is conjectured to be equivalent with the fact that related direct limits of all finite…
We study automatic sequences and automatic systems generated by general constant length (nonprimitive) substitutions. While an automatic system is typically uncountable, the set of automatic sequences is countable, implying that most…
In this paper we study a generalized symplectic fixed point problem, first considered by J. Moser in \cite{M}, from the point of view of some relatively recently discovered symplectic rigidity phenomena. This problem has interesting…
In 2010, G.-N. Han obtained the generating function for the number of size $t$ hooks among integer partitions. Here we obtain these generating functions for self-conjugate partitions, which are particularly elegant for even $t$. If…
We consider constrained Horn clause solving from the more general point of view of solving formula equations. Constrained Horn clauses correspond to the subclass of Horn formula equations. We state and prove a fixed-point theorem for Horn…
The aim of this paper is to present some fixed point theorems for generalized contractions by altering distance functions in a complete cone metric spaces endowed with a partial order. We also generalize fixed point theorems of J. Harjani,…
Considering the large number of fractional operators that exist, and since it does not seem that their number will stop increasing soon at the time of writing this paper, it is presented for the first time, as far as the authors know, a…
Let $t\geq2$ and $k\geq1$ be integers. A $t$-regular partition of a positive integer $n$ is a partition of $n$ such that none of its parts is divisible by $t$. Let $b_{t,k}(n)$ denote the number of hooks of length $k$ in all the $t$-regular…
Separation logic and its variants can describe various properties on pointer programs. However, when it comes to properties on sequences, one may find it hard to formalize. To deal with properties on variable-length sequences and multilevel…
In this paper, the notion of $\mathbb{C}$-simulation function is introduced and the existence and uniqueness of common fixed points of two self-mappings satisfying contractive conditions in the setting of complex valued metric spaces via…
We give a quick survey of the various fixed point theorems in computability theory, partial combinatory algebra, and the theory of numberings, as well as generalizations based on those. We also point out several open problems connected to…
The concept of sequential choice functions is introduced and studied. This concept applies to the reduction of the problem of stable matchings with sequential workers to a situation where the workers are linear.