English
Related papers

Related papers: Fixed points and cycles of parking functions

200 papers

There are so many vehicles in the world and the number of vehicles is increasing rapidly. To alleviate the parking problems caused by that, the smart parking system has been developed. The parking planning is one of the most important parts…

Data Structures and Algorithms · Computer Science 2017-08-29 Xuejian Zhao , Kui Zhao , Feng Ha

We introduce a fixed point iteration process built on optimization of a linear function over a compact domain. We prove the process always converges to a fixed point and explore the set of fixed points in various convex sets. In particular,…

Optimization and Control · Mathematics 2021-03-18 Pedro Felzenszwalb , Caroline Klivans , Alice Paul

For a directed graph G on vertices {0,1,...,n}, a G-parking function is an n-tuple (b_1,...,b_n) of non-negative integers such that, for every non-empty subset U of {1,...,n}, there exists a vertex j in U for which there are more than b_j…

Combinatorics · Mathematics 2007-05-23 Denis Chebikin , Pavlo Pylyavskyy

Let $\mathbb{F}_q$ be a finite field of odd characteristic. We study R\'edei functions that induce permutations over $\mathbb{P}^1(\mathbb{F}_q)$ whose cycle decomposition contains only cycles of length $1$ and $j$, for an integer $j\geq…

Number Theory · Mathematics 2020-11-10 Juliane Capaverde , Ariane M. Masuda , Virgínia M. Rodrigues

A new mathematical notation is proposed for the iteration of functions. It facilitates the application of the iteration of functions in mathematical and logical expressions, definitions of sets, and formulations of algorithms. Illustrations…

Dynamical Systems · Mathematics 2012-07-03 Valerii Salov

We describe a procedure based on the iteration of an initial function by an appropriated operator, acting on continuous functions, in order to get a fixed point. This fixed point will be a calibrated subaction for the doubling map on the…

Dynamical Systems · Mathematics 2020-10-26 Hermes H. Ferreira , Artur O. Lopes , Elismar R. Oliveira

We describe fixed points of an infinite dimensional non-linear operator related to a hard core (HC) model with a countable set $\mathbb{N}$ of spin values on the Cayley tree. This operator is defined by a countable set of parameters…

Mathematical Physics · Physics 2023-03-22 U. R. Olimov , U. A. Rozikov

We test the umbral methods introduced by Rota and Taylor within the theory of representation of symmetric group. We define a simple bijection between the set of all parking functions of length $n$ and the set of all noncrossing partitions…

Combinatorics · Mathematics 2008-10-30 P. Petrullo , D. Senato

A functional Menger system is a set of $n$-place functions containing $n$ projections and closed under the so-called Menger's composition of $n$-place functions. We give the abstract characterization for subsets of these functional systems…

General Mathematics · Mathematics 2009-03-08 Wieslaw A. Dudek , Valentin S. Trokhimenko

We introduce a weak asymptotic version of nonlinear contraction, termed \emph{asymptotic pointwise contraction}. For a mapping on a metric space, this notion requires the existence of a sequence of functions that dominate the distances…

Functional Analysis · Mathematics 2026-04-15 Jie Shi

We consider iterations of integer-valued functions $\phi$, which have no fixed points in the domain of positive integers. We define a local function $\phi_n$, which is a sub-function of $\phi$ being restricted to the subdomain $\{0, ..., n…

Combinatorics · Mathematics 2014-11-04 Bernd C. Kellner

The set of all permutations, ordered by pattern containment, is a poset. We give a formula for the M\"obius function of intervals $[1,\pi]$ in this poset, for any permutation $\pi$ with at most one descent. We compute the M\"obius function…

Combinatorics · Mathematics 2014-04-03 Jason P Smith

In this paper, we are interested in the number of fixed points of functions $f:A^n\to A^n$ over a finite alphabet $A$ defined on a given signed digraph $D$. We first use techniques from network coding to derive some lower bounds on the…

Discrete Mathematics · Computer Science 2014-09-23 Maximilien Gadouleau , Adrien Richard , Søren Riis

We consider the existence of patterned Hamilton cycles in randomly colored random graphs. Given a string $\Pi$ over a set of colors $\{1,2,\ldots,r\}$, we say that a Hamilton cycle is $\Pi$-colored if the pattern repeats at intervals of…

Combinatorics · Mathematics 2018-05-01 Michael Anastos , Alan Frieze

We introduce the class of bilateral parking procedures on the integer line. While cars try to park in the nearest available spot to their right in the classical case, we consider more general parking rules that allow cars to use the nearest…

Combinatorics · Mathematics 2026-02-20 Philippe Nadeau

In Theorem 1 of the paper [V. Pata, A fixed point theorem in metric spaces, J. Fixed Point Theory Appl., 10 (2011), 299-305] it is proved that Picard's iterates for a function converge to a fixed point if a certain condition (C) is verified…

Functional Analysis · Mathematics 2020-03-24 Constantin Zalinescu

We introduce several associative algebras and series of vector spaces associated to these algebras. Using lattice vertex operators, we obtain dimension and character formulae for these spaces. In particular, we a series of representations…

Representation Theory · Mathematics 2009-03-10 Vladimir Dotsenko

For any irrational $\alpha > 0$ and any initial value $z_{-1} \in \mathbb{C}$, we define a sequence of complex numbers $(z_n)_{n=0}^{\infty}$ as follows: $z_n$ is $z_{n-1} + e^{2 \pi i \alpha n}$ or $z_{n-1} - e^{2 \pi i \alpha n}$,…

Dynamical Systems · Mathematics 2024-11-14 Stefan Steinerberger , Tony Zeng

We obtain a general lower bound for the number of fixed points of a circle action on a compact almost complex manifold $M$ of dimension $2n$ with nonempty fixed point set, provided the Chern number $c_1c_{n-1}[M]$ vanishes. The proof…

Algebraic Topology · Mathematics 2014-04-18 Leonor Godinho , Álvaro Pelayo , Silvia Sabatini

In a recent paper J. Haglund showed that a certain symmetric function expresion enumerates by t^{area} q^{dinv} of the parking functions whose diagonal word is in the shuffle of 12...j and j+1...j+n with k of the cars j+1,...,j+n in the…

Combinatorics · Mathematics 2012-05-29 Adrian Duane , Adriano M. Garsia , Mike Zabrocki