相关论文: The Defective Parking Space and Defective Kreweras…

A variation of Waring's problem from classical number theory is the question, ``What is the smallest number $s$ such that any generic homogeneous polynomial of degree $d$ in $n+1$ variables may be written as the sum of at most $s$ products…

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…

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…

Many objects, especially these made by humans, are symmetric, e.g. cars and aeroplanes. This paper addresses the estimation of 3D structures of symmetric objects from multiple images of the same object category, e.g. different cars, seen…

An (n,d)-permutation code is a subset C of Sym(n) such that the Hamming distance d_H between any two distinct elements of C is at least equal to d. In this paper, we use the characterisation of the isometry group of the metric space…

For any given partial order in a $d$-dimensional euclidean space, under mild regularity assumptions, we show that the intersection of closed (generalized) intervals containing more than 1/2 of the probability mass, is a non-empty compact…

We construct a symmetric invertible binary pairing function $F(m,n)$ on the set of positive integers with a property of $F(m,n)=F(n,m)$. Then we provide a complete proof of its symmetry and bijectivity, from which the construction of…

The shuffle conjecture expresses a relationship between parking functions, diagonal harmonics, and the Bergeron-Garsia $\nabla$ operator. Recent conjectures about a family of modified Hall-Littlewood operators made by Haglund, Morse, and…

We determine the numerical invariants of blocks with defect group D_{2^n} * C_{2^m} = Q_{2^n} * C_{2^m} (central product), where n > 2 and m > 1. As a consequence, we prove Brauer's k(B)-conjecture, Olsson's conjecture (and more generally…

This paper provides an exploration of parking functions, a classical combinatorial object. We present two viewpoints on their structure and properties: through poset of noncrossing partitions and polytopes.

This paper investigates the existence of $m$-stiff configurations in the unit sphere $S^{d-1}$, which are spherical $(2m-1)$-designs that lie on $m$ parallel hyperplanes. We establish two non-existence results: (1) for each fixed integer $m…

We consider correlation functions in 6d $(2,0)$ theories of two $\frac{1}{2}$-BPS operators inserted away from a $\frac{1}{2}$-BPS surface defect. In the large central charge limit the leading connected contribution corresponds to sums of…

Parking functions are well researched and interesting results are found in the listed references and more. Some introductory results stemming from application to degree sequences of simple connected graphs are provided in this paper.…

We consider the inversion enumerator I_n(q), which counts labeled trees or, equivalently, parking functions. This polynomial has a natural extension to generalized parking functions. Substituting q = -1 into this generalized polynomial…

In this paper, we study degenerate CR embeddings $f$ of a strictly pseudoconvex hypersurface $M\subset \bC^{n+1}$ into a sphere $\bS$ in a higher dimensional complex space $\bC^{N+1}$. The degeneracy of the mapping $f$ will be characterized…

Under the linear regression framework, we study the variable selection problem when the underlying model is assumed to have a small number of nonzero coefficients (i.e., the underlying linear model is sparse). Non-convex penalties in…

In this paper, we explore the fixed point theory of $n$-valued maps using configuration spaces and braid groups, focussing on two fundamental problems, the Wecken property, and the computation of the Nielsen number. We show that the…

We recall the occupancy problem introduced by Konheim & Weiss in 1966 and we consider parking functions as hash maps. Each car $c_i$ prefers parking space $p_i$ (the hash map $c_i \mapsto p_i$ with $c_i$ is a key and $p_i$ an index into an…

We propose a generalized car parking problem where either a car of size $\sigma$ or of size $m\sigma$ ($m>1$) is sequentially parked on a line with probability $q$ and $(1-q)$, respectively. The free parameter $q$ interpolates between the…

A self-map $T$ of a $\nu$-generalized metric space $(X,d\,)$ is said to be a Ciric-Matkowski contraction if $d(Tx,Ty)<d(x,y)$, for $x\neq y$, and, for every $\epsilon>0$, there is $\delta>0$ such that $d(x,y)<\delta+\epsilon$ implies…