Related papers: Lehmer Parking Functions and Their Outcomes
In the Page parking (or packing) model on a discrete interval (also known as the discrete R{\'e}nyi packing problem or the unfriendly seating problem), cars of length two successively park uniformly at random on pairs of adjacent places,…
We consider sequences of integers defined by a system of linear inequalities with integer coefficients. We show that when the constraints are strong enough to guarantee that all the entries are nonnegative, the generating function for the…
Bell inequalities can be studied both as constraints in the space of probability distributions and as expectation values of multipartite operators. The latter approach is particularly useful when considering outcomes as eigenvalues of…
We study the problem of the product property for the Lempert function with many poles and consider some properties of this function mostly for plane domains.
Recent work of the author connected several parking function enumeration problems to enumerations of Catalan paths with respect to certain weight functions that are expressed in terms of the ascent lengths. Motivated by this, we generalise…
The lane number that the vehicle is traveling in is a key factor in intelligent vehicle fields. Many lane detection algorithms were proposed and if we can perfectly detect the lanes, we can directly calculate the lane number from the lane…
For any irreducible real reflection group $W$ with Coxeter number $h$, Armstrong, Reiner, and the author introduced a pair of $W \times \ZZ_h$-modules which deserve to be called {\sf $W$-parking spaces} which generalize the type A notion of…
We derive a formula for $p(n)$ (the number of partitions of $n$) in terms of the partial Bell polynomials using Fa\`{a} di Bruno's formula and Euler's pentagonal number theorem.
Let p(n, k) denote the number of partitions of n into parts less than or equal to k. We show several properties of this function modulo 2. First, we prove that for fixed positive integers k and m, p(n,k) is periodic modulo m. Using this, we…
For a connected graph $G$ with sink vertex $q$, a $G$-parking function is a vector of nonnegative integers whose entries are determined by cut-sets in $G$. Such objects also arise as the superstable configurations in the context of…
The generating function for $p_N(n)$, the number of partitions of $n$ into at most $N$ parts, may be written as a product of $N$ factors. We find the behavior of coefficients in the partial fraction decomposition of this product as $N \to…
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…
Data from experimental observations of a class of neurological processes (Freeman K-sets) present functional distribution reproducing Bessel function behavior. We model such processes with couples of damped/amplified oscillators which…
Let [t] be the integral part of the real number t and let 1 P be the characteristic function of the primes. Denote by $\pi$ G (x) the number of primes in the floor function set G(x) := {[ x n ] : 1 n x} and by S 1 P (x) the number of primes…
We show how the Fuss-Catalan numbers $ \frac{1}{p n+1}\binom{pn+1}{n}$ enter different problems of counting simple and multiple planar partitions.
Set partitions are arrangements of distinct objects into groups. The problem of listing all set partitions arises in a variety of settings, in particular in combinatorial optimization tasks. After a brief review, we give practical…
Lehmer's totient problem asks if there exists a composite number $d$ such that its totient divide $d-1$. In this article we generalize the Lehmer's totient problem in algebraic number fields. We introduce the notion of a Lehmer number.…
We show that the graph of a bent function is a Salem set in an appropriate sense. We also establish a simple result that quantifies redundancies in the difference operators of a function, which applies to bent functions over fields of odd…
Let $f: \mathbb{Z}_+\rightarrow \mathbb{Z}_+$ be a polynomial with the property that corresponding to every prime $p$ there exists an integer $\ell$ such that $p\nmid f(\ell)$. In this paper, we establish some equidistributed results…
A functional Menger system is a set of $n$-place functions containing $n$ projections and closed under the so-called Menger's composition of $n$-place functions. We give the abstract characterization for subsets of these functional systems…