English
Related papers

Related papers: Some Enumerations for Parking Functions

200 papers

A sequence of $\{a_n\}_{n\ge 0}$ satisfies the Briggs inequality if \begin{align*} a_n^2(a_n^2-a_{n-1}a_{n+1})>a_{n-1}^2(a_{n+1}^2-a_na_{n+2}) \end{align*} holds for any $n\ge 1$. In this paper we show that both the partition function…

Combinatorics · Mathematics 2024-08-30 Xin-Bei Liu , Zhong-Xue Zhang

We obtain asymptotics for sums of the form $$ \sum_{n=1}^P e(\alpha_kn^k + \alpha_1n), $$ involving lower order main terms. As an application, we show that for almost all $\alpha_2 \in [0,1)$ one has $$ \sup_{\alpha_1 \in [0,1)} \Big|…

Number Theory · Mathematics 2020-01-17 Julia Brandes , Scott T. Parsell , Konstantinos Poulias , George Shakan , Robert C. Vaughan

We show that the notion of parkization of a word, a variant of the classical standardization, allows to introduce an internal product on the Hopf algebra of parking functions. Its Catalan subalgebra is stable under this operation and…

Combinatorics · Mathematics 2013-02-12 Jean-Christophe Novelli , Jean-Yves Thibon

In this paper, we explore parking distributions on caterpillar trees, focusing on two primary statistics: the number of lucky cars and the frequency with which cars prefer specific parking spaces. We use first-return decomposition to reveal…

Combinatorics · Mathematics 2025-09-03 Amanuel T. Getachew

We propose a notion of iterating functions $f:X^{k}\rightarrow X$ in a way that represents recurrence relations of the form $a_{n+k}=f(a_{n},a_{n+1},...,a_{n+k-1})$. We define a function as $n$-involutory when its $n$th iterate is the…

General Mathematics · Mathematics 2020-11-02 Suneil Parimoo

Improving on some results of J.-L. Nicolas \cite {Ndeb}, the elements of the set ${\cal A}={\cal A}(1+z+z^3+z^4+z^5)$, for which the partition function $p({\cal A},n)$ (i.e. the number of partitions of $n$ with parts in ${\cal A}$) is even…

Number Theory · Mathematics 2008-10-23 Fethi Ben Said , Jean-Louis Nicolas , Ahlem Zekraoui

Parking plays a central role in transport policies and has wide-ranging consequences: While the average time spent searching for parking exceeds dozens of hours per driver every year in many Western cities, the associated cruising traffic…

Statistical Mechanics · Physics 2023-01-09 Nilankur Dutta , Thibault Charlottin , Alexandre Nicolas

Parking is an inevitable issue in the fast-growing developing countries. Increasing number of vehicles require more and more urban land to be allocated for parking. However, a little attention has been conferred to the parking issues in…

Machine Learning · Statistics 2023-10-12 Janak Parmar , Pritikana Das , Sanjaykumar Dave

For each skew shape we define a nonhomogeneous symmetric function, generalizing a construction of Pak and Postnikov. In two special cases, we show that the coefficients of this function when expanded in the complete homogeneous basis are…

Combinatorics · Mathematics 2008-12-04 Drew Armstrong , Sen-Peng Eu

Let $\A=\{a_1<a_2<a_3.....<a_n<...\}$ be an infinite sequence of integers and let $R_2(n)=|\{(i,j):\ \ a_i+a_j=n;\ \ a_i,a_j\in \A;\ \ i\le j\}|$. We define $S_k=\s_{l=1}^k(R_2(2l)-R_2(2l+1))$. We prove that, if $L^{\infty}$ norm of…

Number Theory · Mathematics 2014-11-27 R. Balasubramanian , Sumit Giri

We propose an extension of the framework for discussing the computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represented only through approximation. The key idea…

Computational Complexity · Computer Science 2013-05-03 Akitoshi Kawamura , Stephen Cook

We construct iteratively a sequence of numbers k_{n} and Beurling functions A_{n} converging pointwise to -1 in [0,1]. We prove results which seems to suggest that each A_{n} is equal to a well known approximating sequence of functions…

Number Theory · Mathematics 2007-05-23 F. Auil

The partition function $p(n)$ and many of its related restricted partition functions have recently been shown independently to satisfy log-concavity: $p(n)^2 \geq p(n-1)p(n+1)$ for $n\geq 26$, and satisfy the inequality: $p(n)p(m) \geq…

Number Theory · Mathematics 2025-05-13 Arindam Roy

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…

Combinatorics · Mathematics 2025-02-05 Jason Stack

We examine the behavior of the coefficients of powers of polynomials over a finite field of prime order. Extending the work of Allouche-Berthe, 1997, we study a(n), the number of occurring strings of length n among coefficients of any power…

Combinatorics · Mathematics 2013-04-18 Kevin Garbe

Given a barrier $0 \leq b_0 \leq b_1 \leq ...$, let $f(n)$ be the number of nondecreasing integer sequences $0 \leq a_0 \leq a_1 \leq ... \leq a_n$ for which $a_j \leq b_j$ for all $0 \leq j \leq n$. Known formul\ae for $f(n)$ include an $n…

Combinatorics · Mathematics 2009-06-26 Robin Pemantle , Herbert S. Wilf

P(n,s) denotes the number of permutations of 1,2,...n that have exactly s sequences. Canfield and Wilf [math.CO/0609704] recently showed that P(n,s) can be written as a sum of s polynomials in n. We determine these polynomials explicitly…

Combinatorics · Mathematics 2007-05-23 Marcus Kollar

A class of subharmonic functions are proved to have the growth estimates $u(x)= o(x_n^{1-\frac{\alpha}{p}}|x|^{\frac{\gamma}{p}+\frac{n-1}{q}-n+\frac{\alpha}{p}})$ at infinity in the upper half space of ${\bf R}^{n}$, which generalizes the…

Functional Analysis · Mathematics 2008-11-14 Pan Guoshuang , Deng Guantie

The parqueting-reflection principle is shown to also work for constructing harmonic Green functions and harmonic Neumann functions for a class of domains, which are bounded by two arcs in $\mathbb{C}$ with a special intersecting angle…

Complex Variables · Mathematics 2020-10-13 Hanxing Lin

We say that an arithmetical function $S:\mathbb{N}\rightarrow\mathbb{Z}$ has Lucas property if for any prime $p$, \begin{equation*} S(n)\equiv S(n_{0})S(n_{1})\ldots S(n_{r})\pmod p, \end{equation*} where $n=\sum_{i=0}^{r}n_{i}p^{i}$, with…

Number Theory · Mathematics 2016-12-22 Hao Zhong , Tianxin Cai