相关论文: Unit interval parking functions and the $r$-Fubini…

For any positive integer $r$, the $r$-Fubini number with parameter $n$, denoted by $F_{n,r}$, is equal to the number of ways that the elements of a set with $n+r$ elements can be weak ordered such that the $r$ least elements are in distinct…

Ranking functions used in information retrieval are primarily used in the search engines and they are often adopted for various language processing applications. However, features used in the construction of ranking functions should be…

The action of the symmetric group $S_n$ on the set $Park_n$ of parking functions of size $n$ has received a great deal of attention in algebraic combinatorics. We prove that the action of $S_n$ on $Park_n$ extends to an action of $S_{n+1}$.…

A theoretical development is carried to establish fundamental results about rank-initial embeddings and automorphisms of countable non-standard models of set theory, with a keen eye for their sets of fixed points. These results are then…

Based on the combinatorial interpretation of the ordered Bell numbers, which count all the ordered partitions of the set $[n]=\{1,2,\dots,n\}$, we introduce the Fibonacci partition as a Fibonacci permutation of its blocks. Then we define…

Ranks estimated from data are uncertain and this poses a challenge in many applications. However, estimated ranks are deterministic functions of estimated parameters, so the uncertainty in the ranks must be determined by the uncertainty in…

A permutation $\sigma$ describing the relative orders of the first $n$ iterates of a point $x$ under a self-map $f$ of the interval $I=[0,1]$ is called an \emph{order pattern}. For fixed $f$ and $n$, measuring the points $x\in I$ (according…

In 1966, Konheim and Weiss [33] introduced a now classical parking protocol. The deterministic process and its resultant objects, known as parking functions, have since become a favorite object of study in enumerative combinatorics. In our…

We consider the concept of rank as a measure of the vertical levels and positions of elements of partially ordered sets (posets). We are motivated by the need for algorithmic measures on large, real-world hierarchically-structured data…

Classical parking functions can be defined in terms of drivers with preferred parking spaces searching a linear parking lot for an open parking spot. We may consider this linear parking lot as a collection of $n$ vertices (parking spots)…

This work investigates the duality between two discrete dynamical processes: parking functions, and the Abelian sandpile model (ASM). Specifically, we are interested in the extension of classical parking functions, called $G$-parking…

We show mathematical structure of the function dynamics, i.e., the dynamics of interval maps $f_{n+1} = (1-\e)f_n + \e f_n\circ f_n$ and clarify the types of fixed points, the self-referential structure and the hierarchical structure.

While real-time parking slot detection plays a critical role in valet parking systems, existing methods have limited success in real-world applications. We argue two reasons accounting for the unsatisfactory performance: \romannumeral1, The…

This paper examines the problem of ranking a collection of objects using pairwise comparisons (rankings of two objects). In general, the ranking of $n$ objects can be identified by standard sorting methods using $n log_2 n$ pairwise…

We develop a circular-street argument, in the style of Pollak, to obtain a new proof that there are $C_n = \frac{1}{n+1}\binom{2n}{n}$ weakly increasing parking functions of length $n \geq 1$, where $C_n$ is the $n$th Catalan number.

We give a Cayley type formula to count the number of spanning trees in the complete r-uniform hypergraph for all r >= 3. Similar to the bijection between spanning trees in complete graphs and Parking functions, we derive a bijection from…

Hadwiger's Theorem states that Euclidean-invariant convex-continuous valuations of definable sets are linear combinations of intrinsic volumes. We lift this result from sets to data distributions over sets, specifically, to definable…

Let $\mathcal{P}_n$ be the convex hull in $\mathbb{R}^n$ of all parking functions of length $n$. Stanley found the number of vertices and the number of facets of $\mathcal{P}_n$. Building upon these results, we determine the number of faces…

Ranking entities such as algorithms, devices, methods, or models based on their performances, while accounting for application-specific preferences, is a challenge. To address this challenge, we establish the foundations of a universal…

Parking functions are tuples that describe the parking of $M$ cars on a street with $M$ parking spots. In this paper, we define exact $k$-typed parking functions ($k$-TPFs) to be a variant of classical parking functions. We then establish…