Related papers: Fixed Points of Parking Functions
Using techniques introduced by H. Thomas and N. Williams in "Cyclic Symmetry of the Scaled Simplex," we prove that modular sweep maps are bijective. We construct the inverse of the modular sweep map by passing through an intermediary set of…
Let $\Delta$ be an integer $n \times n$-matrix which satisfies the conditions: $\det \Delta\neq 0$, $\Delta_{ij}\leq 0\text{ for }i\neq j,$ and there exists a vector ${\bf r}=(r_1,\ldots,r_n)>0$ such that ${\bf r}\Delta \geq 0$. Here the…
We explore the link between combinatorics and probability generated by the question "What does a random parking function look like?" This gives rise to novel probabilistic interpretations of some elegant, known generating functions. It…
Finite rank median spaces are a simultaneous generalisation of finite dimensional ${\rm CAT}(0)$ cube complexes and real trees. If $\Gamma$ is an irreducible lattice in a product of rank one simple Lie groups, we show that every action of…
In this paper, we complete the enumeration of the number of parking functions of length $n$ avoiding, in the sense defined by Qiu and Remmel, a permutation of length 3, answering several questions of Adeniran and Pudwell. Additionally, we…
Fixed point results with respect to generalized rational contractive mappings in semi-metric spaces endowed with a directed graph are proved. Some examples are provided to illustrate the results. The obtained results extend, improve and…
We study the enumeration problem for different kind of tree parking functions introduced recently, called tree parking functions, tree parking distributions, prime tree parking functions, and prime tree parking distributions, for rooted…
Let G be a group acting on the plane by orientation-preserving homeomorphisms. We show that if for some k>0 there is a ball of radius r > k/\sqrt{3} such that each point x in the ball satisfies |gx -hx| < k for all g, h in G, and the action…
We present numerical evidence that the dynamical zeta function and the Fredholm determinant of intermittent maps with a neutral fix point have branch point singularities at z=1 We consider the power series expansion of zeta function and the…
The central purpose of this article is to establish new inverse and implicit function theorems for differentiable maps with isolated critical points. One of the key ingredients is a discovery of the fact that differentiable maps with…
A theorem of Gerald Schwarz [24, Thm. 1] says that for a linear action of a compact Lie group $G$ on a finite dimensional real vector space $V$ any smooth $G$-invariant function on $V$ can be written as a composite with the Hilbert map. We…
In this article, we prove the existence of common fixed points for a pair of maps on a $q$-spherically complete $T_0$-ultra-quasi-metric space. The present article is a generalization, in the assymmetric setting of the paper of Rao et…
The main purpose of this paper is to find the fixed point in such cases where existing literature remain silent. In this paper we introduce partial completeness, a new type of contraction and many other definitions. Using this approach the…
Parking functions were classically defined for $n$ cars attempting to park on a one-way street with $n$ parking spots, where cars only drive forward. Subsequently, parking functions have been generalized in various ways, including allowing…
We introduce the novel concept of a non-stationary iterated function system by considering a countable sequence of distinct set-valued maps $\{\mathcal{F}_k\}_{k\in \mathbb{N}}$ where each $\mathcal{F}_k$ maps $\mathcal{H}(X)\to…
In this article we discuss a possibility to implement a well-known scheme of proof for contraction mapping theorems in a situation, when convergence, families of Cauchy sequences, and contractiveness of mappings are defined axiomatically.…
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…
Naples parking functions were introduced as a generalization of classical parking functions, in which cars are allowed to park backwards, by checking up to a fixed number of previous slots, before proceedings forward as usual. In our…
A permutation of length $n$ is called a flattened partition if the leading terms of maximal chains of ascents (called runs) are in increasing order. We analogously define flattened parking functions: a subset of parking functions for which…
Consider $n$ cars $C_1, C_2, \ldots, C_n$ that want to park in a parking lot with parking spaces $1,2,\ldots,n$ that appear in order. Each car $C_i$ has a parking preference $\alpha_i \in \{1,2,\ldots,n\}$. The cars appear in order, if…