Related papers: Type C parking functions and a zeta map

Let L be a bounded distributive lattice. We give several characterizations of those L^n --> L mappings that are polynomial functions, i.e., functions which can be obtained from projections and constant functions using binary joins and…

We recall that a parking function of length $n+1$ is said to be prime if removing any instance of 1 yields a parking function of length $n$. In this article, we study prime parking functions from multiple lenses. We derive an explicit…

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…

We present a general bijective approach to planar hypermaps with two main results. First we obtain unified bijections for all classes of maps or hypermaps defined by face-degree constraints and girth constraints. To any such class we…

We define two types of Witten's zeta functions according to Cartan's classification of compact symmetric spaces. The type II is the original Witten zeta function constructed by means of irreducible representations of the simple compact Lie…

Given a positive-integer-valued vector $u=(u_1, \dots, u_m)$ with $u_1<\cdots<u_m$. A $u$-parking function of length $m$ is a sequence $\pi=(\pi_1, \dots, \pi_m)$ of positive integers whose non-decreasing rearrangement $(\lambda_1, \dots,…

We recall that the $k$-Naples parking functions of length $n$ (a generalization of parking functions) are defined by requiring that a car which finds its preferred spot occupied must first back up a spot at a time (up to $k$ spots) before…

We consider maps on orientable surfaces. A map is called \emph{unicellular} if it has a single face. A \emph{covered map} is a map (of genus $g$) with a marked unicellular spanning submap (which can have any genus in $\{0,1,...,g\}$). Our…

In this essay I will give a strictly subjective selection of different types of zeta functions. Instead of providing a complete list, I will rather try to give the central concepts and ideas underlying the theory. This article is going to…

Autonomous parking systems start with the detection of available parking slots. Parking slot detection performance has been dramatically improved by deep learning techniques. Deep learning-based object detection methods can be categorized…

Autonomous valet parking is a specific application for autonomous vehicles. In this task, vehicles need to navigate in narrow, crowded and GPS-denied parking lots. Accurate localization ability is of great importance. Traditional…

We study a generalization of the Svarc genus of a fiber map. For an arbitrary collection E of spaces and a map f:X-->Y, we define a numerical invariant, the E-sectional category of f, in terms of open covers of Y. We obtain several basic…

In this paper, we introduce a subcategory $\widetilde{Sh}_*$ of Sh$_*$ and obtain some results in this subcategory. First we show that there is a natural bijection $Sh (\Sigma (X, x), (Y,y))\cong Sh((X,x),Sh((I, \dot{I}),(Y,y)))$, for every…

Smart-parking solutions use sensors, cameras, and data analysis to improve parking efficiency and reduce traffic congestion. Computer vision-based methods have been used extensively in recent years to tackle the problem of parking lot…

In genome rearrangement theory, one of the elusive questions raised in recent years is the enumeration of rearrangement scenarios between two genomes. This problem is related to the uniform generation of rearrangement scenarios, and the…

We introduce an object called a tree growing sequence (TGS) in an effort to generalize bijective correspondences between $G$-parking functions, spanning trees, and the set of monomials in the Tutte polynomial of a graph $G$. A tree growing…

A generalization is provided for the notion of tags, as used in various formulations of physical scenarios. It leads to the definition of tagged vector spaces, based on a set of axioms for tags and their extractors. As an application, such…

For complete metric spaces $X$ and $Y$, a description of linear biseparating maps between spaces of vector-valued Lipschitz functions defined on $X$ and $Y$ is provided. In particular it is proved that $X$ and $Y$ are bi-Lipschitz…

Recall that $\alpha=(a_1,a_2,\ldots,a_n)\in[n]^n$ is a parking function if its nondecreasing rearrangement $\beta=(b_1,b_2,\ldots,b_n)$ satisfies $b_i\leq i$ for all $1\leq i\leq n$. In this article, we study parking functions based on…

In this paper, we give part-preserving bijections between three fundamental families of objects that serve as natural framework for many problems in enumerative combinatorics. Specifically, we consider compositions, Dyck paths, and…