Related papers: Interval parking functions
We answer an open problem of arXiv:1204.1760 and arXiv:1205.4293, extending their work to irreducible well--generated complex reflection groups $W$. We define a combinatorial $W$-noncrossing parking space and an algebraic $W$-parking space…
Parametric Interval Markov Chains (pIMCs) are a specification formalism that extend Markov Chains (MCs) and Interval Markov Chains (IMCs) by taking into account imprecision in the transition probability values: transitions in pIMCs are…
We construct an action of the braid group on $n$ strands on the set of parking functions of $n$ cars such that elementary braids have orbits of length 2 or 3. The construction is motivated by a theorem of Lyashko and Looijenga stating that…
Automorphic loops are loops in which all inner mappings are automorphisms. This variety of loops includes groups and commutative Moufang loops. A half-isomorphism $f : G \longrightarrow K$ between multiplicative systems $G$ and $K$ is a…
In Persistent Homology and Topology, filtrations are usually given by introducing an ordered collection of sets or a continuous function from a topological space to $\R^n$. A natural question arises, whether these approaches are equivalent…
For any continuous probability measure $\mu$ on ${\mathbb R}$ we construct an IFS with probabilities having $\mu$ as its unique measure-attractor.
Consider the vector space $\mathbb{K}\mathcal{P}$ spanned by parking functions. By representing parking functions as labeled digraphs, Hivert, Novelli and Thibon constructed a cocommutative Hopf algebra PQSym$^{*}$ on…
A parking function of length n is a sequence (b_1, b_2,..., b_n) of nonnegative integers whose nondecreasing rearrangement (a_1, a_2,...,a_n) has the property that a_i < i for every i. A well-known result about parking functions is that the…
Parking accurately and safely in highly constrained spaces remains a critical challenge. Unlike structured driving environments, parking requires executing complex maneuvers such as frequent gear shifts and steering saturation. Recent…
We study the topological properties of attractors of Iterated Function Systems (I.F.S.) on the real line, consisting of affine maps of homogeneous contraction ratio. These maps define what we call a second generation I.F.S.: they are…
Iterated function systems (IFS) can be a surprisingly useful tool for studying structure in data. Here we present results stemming from a 2013 computational study by the author using IFS. The results include fractal patterns that reveal…
We consider the dimension and measure of typical attractors of random iterated function systems (RIFSs). We define a RIFS to be a finite set of (deterministic) iterated function systems (IFSs) acting on the same metric space and, for a…
Intrinsic location functional is a large class of random locations containing locations that one may encounter in many cases, e.g., the location of the path supremum/infimum over a given interval, the first/last hitting time, etc. It has…
We extend the notion of parking function polytopes and study their geometric and combinatorial structure, including normal fans, face posets, and $h$-polynomials, as well as their connections to other classes of polytopes. To capture their…
In a parking function, a car is considered lucky if it is able to park in its preferred spot. Extending work of Harris and Martinez, we enumerate outcomes of parking functions with a fixed set of lucky cars. We then consider a…
We give a systematic account of iterated function systems (IFS) of weak contractions of different types (Browder, Rakotch, topological). We show that the existence of attractors and asymptotically stable invariant measures, and the validity…
We study contraction conditions for an iterated function system of continuous maps on a metric space which are chosen randomly, identically and independently. We investigate metric changes, preserving the topological structure of the space,…
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…
Iterated functions system (IFS) is defined by specifying a set of functions in a classical phase space, which act randomly on an initial point. In an analogous way, we define a quantum iterated functions system (QIFS), where functions act…
Iterated Function Systems (IFSs) have been at the heart of fractal geometry almost from its origin, and several generalizations for the notion of IFS have been suggested. Subdivision schemes are widely used in computer graphics and attempts…