Related papers: Preference-restricted parking functions
We continue the study of parking assortments, a generalization of parking functions introduced by Chen, Harris, Mart\'{i}nez, Pab\'{o}n-Cancel, and Sargent. Given $n$ cars of lengths $\mathbf{y}=(y_1,y_2,\dots,y_n) \in \mathbb{N}^n$, we…
Participatory budgeting refers to the practice of allocating public resources by collecting and aggregating individual preferences. Most existing studies in this field often assume an additive utility function, where each individual holds a…
A compression function is a map that slims down an observational set into a subset of reduced size, while preserving its informational content. In multiple applications, the condition that one new observation makes the compressed set change…
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…
The Piecewise Polynomial Interpolation (PPI) function approach is aimed at solving nonlinear programming problems with disjoint feasible regions. In such problems, disjointedness is generally associated with prohibited operating zones,…
If the moments of a probability measure on $\R$ are interpreted as a specialization of complete homogeneous symmetric functions, its free cumulants are, up to sign, the corresponding specializations of a sequence of Schur positive symmetric…
Submodular functions are discrete functions that model laws of diminishing returns and enjoy numerous algorithmic applications. They have been used in many areas, including combinatorial optimization, machine learning, and economics. In…
This article proposes two different approaches to automatically create a map for valid on-street car parking spaces. For this, we use car sharing park-out events data. The first one uses spatial aggregation and the second a machine learning…
We investigate simple strategies that embody the decisions that one faces when trying to park near a popular destination. Should one park far from the target (destination), where finding a spot is easy, but then be faced with a long walk,…
We study the problem of enumerating answers of Conjunctive Queries ranked according to a given ranking function. Our main contribution is a novel algorithm with small preprocessing time, logarithmic delay, and non-trivial space usage during…
Ultrafunctions are a particular class of functions defined on a hyperreal field $\mathbb{R}^{\ast}\supset\mathbb{R}$. They have been introduced and studied in some previous works. In this paper we introduce a particular space of…
Planar functions are special functions from a finite field to itself that give rise to finite projective planes and other combinatorial objects. We consider polynomials over a finite field $K$ that induce planar functions on infinitely many…
Parking occupancy in the area is defined by three major parameters - the rate of cars arrivals, the dwell time of already parked cars, and the willingness of drivers who are searching but yet did not find a vacant parking spot, to continue…
Let $G$ be a connected graph with vertex set $\{0,1,2,...,n\}$. We allow $G$ to have multiple edges and loops. In this paper, we give a characterization of external activity by some parameters of $G$-parking functions. In particular, we…
Quicksort is a classical divide-and-conquer sorting algorithm. It is a comparison sort that makes an average of $2(n+1)H_n - 4n$ comparisons on an array of size $n$ ordered uniformly at random, where $H_n = \sum_{i=1}^n\frac{1}{i}$ is the…
We present an automatic method for weighting the contributions of preference functions used in disambiguation. Initial scaling factors are derived as the solution to a least-squares minimization problem, and improvements are then made by…
To infer a function value on a specific point $x$, it is essential to assign higher weights to the points closer to $x$, which is called local polynomial / multivariable regression. In many practical cases, a limited sample size may ruin…
This paper studies a practical regional demand continuous multifacility location problems whose main goal is to locate a given number of services and entry points in each region to distribute certain products to the users at minimum…
We consider the task of computing (combined) function mapping and routing for requests in Software-Defined Networks (SDNs). Function mapping refers to the assignment of nodes in the substrate network to various processing stages that…
All over the world, especially in the university environment, planning managers and traffic engineers are constantly faced with the problem of inadequate allocation of car parking spaces to demanded users. Users could either prefer reserved…