Related papers: Simple Generating Functions for Certain Young Tabl…
The hook length formula gives a product formula for the number of standard Young tableaux of a partition shape. The number of standard Young tableaux of a skew shape does not always have a product formula. However, for some special skew…
We provide simple necessary and sufficient conditions for the existence of a standard Young tableau of a given shape and major index $r$ mod $n$, for all $r$. Our result generalizes the $r=1$ case due essentially to (1974) and proves a…
It is well known that the behaviour of a branching process is completely described by the generating function of the offspring law and its fixed points. Branching random walks are a natural generalization of branching processes: a branching…
Intrigued by the product formula prod_{i=1}^{n-2} C_i for the volume of the Chan-Robbins-Yuen polytope CRY_n, where C_i is the ith Catalan number, we construct a family of polytopes P_{m,n}, whose volumes are given by the product…
Main purpose of this paper is to reconstruct generating function of the Bernstein type polynomials. Some properties this generating functions are given. By applying this generating function, not only derivative of these polynomials but also…
Every binary De~Bruijn sequence of order n satisfies a recursion 0=x_n+x_0+g(x_{n-1}, ..., x_1). Given a function f on (n-1) bits, let N(f; r) be the number of functions generating a De Bruijn sequence of order n which are obtained by…
In this paper we consider an aggregation model f: X1 x ... x Xn --> Y for arbitrary sets X1, ..., Xn and a finite distributive lattice Y, factorizable as f(x1, ..., xn) = p(u1(x1), ..., un(xn)), where p is an n-variable lattice polynomial…
This paper completely characterizes the standard Young tableaux that can be reconstructed from their sets or multisets of $1$-minors. In particular, any standard Young tableau with at least $5$ entries can be reconstructed from its set of…
A generating function of the number of homomorphisms from the fundamental group of a compact oriented or non-orientable surface without boundary into a finite group is obtained in terms of an integral over a real group algebra. We calculate…
Mullineux defined an involution on the set of $e$-regular partitions of $n$. When $e=p$ is prime, these partitions label irreducible symmetric group modules in characteristic $p$. Mullineux's conjecture, since proven, was that this…
P\'olya urns are urns where at each unit of time a ball is drawn and replaced with some other balls according to its colour. We introduce a more general model: the replacement rule depends on the colour of the drawn ball and the value of…
Additive tree functionals represent the cost of many divide-and-conquer algorithms. We derive the limiting distribution of the additive functionals induced by toll functions of the form (a) n^\alpha when \alpha > 0 and (b) log n (the…
Given a function $f\in C(\mathbb{R}^d)$ of linear growth, we give a new way of representing accumulation points of \begin{equation} \int_\Omega f(v_i(z))d\mu(z), \end{equation} where $\mu\in \mathcal{M}^+(\Omega)$, and $(v_i)_{i\in…
In this paper, we obtain inequalities on $M_2$-ranks of overpartitions modulo $6$. Let $\overline{N}_2(s,m,n)$ to be the number of overpartitions of $n$ whose $M_2$-rank is congruent to $s$ modulo $m$. For $M_2$-ranks modulo $3$, Lovejoy…
In this work, we consider a new type of Fourier-like representation of Boolean function $f\colon\{+1,-1\}^n\to\{+1,-1\}$ \[ f(x) = \cos\left(\pi\sum_{S\subseteq[n]}\phi_S \prod_{i\in S} x_i\right). \] This representation, which we call the…
We consider the isotropic perimeter generating functions of three-choice, imperfect, and 1-punctured staircase polygons, whose 8th order linear Fuchsian ODEs are previously known. We derive simple relationships between the three generating…
We prove that the number of oscillating tableaux of length $n$ with at most $k$ columns, starting at $\emptyset$ and ending at the one-column shape $(1^m)$, is equal to the number of standard Young tableaux of size~$n$ with $m$ columns of…
Let $\mathbb{A}_n^m$ be an arbitrary $n$-dimensional commutative associative algebra over the field of complex numbers with $m$ idempotents. Let $e_1=1,e_2,\ldots,e_k$ with $2\leq k\leq 2n$ be elements of $\mathbb{A}_n^m$ which are linearly…
Functional equations (FE) arise quite naturally in the analysis of stochastic systems of different kinds : queueing and telecommunication networks, random walks, enumeration of planar lattice walks, etc. Frequently, the object is to…
We show that all invertible $n \times n$ matrices over any finite field $\mathbb{F}_q$ can be generated in a Gray code fashion. More specifically, there exists a listing such that (1) each matrix appears exactly once, and (2) two…