Related papers: Falling stars: a fall-decorated rational shuffle t…

We study new statistics on permutations that are variations on the descent and the inversion statistics. In particular, we consider the alternating descent set of a permutation sigma = sigma_1sigma_2...sigma_n defined as the set of indices…

We find an involution as a combinatorial proof of a Ramanujan's partial theta identity. Based on this involution, we obtain a Franklin type involution for squares in the sense that the classical Franklin involution provides a combinatorial…

The geometric crystal operators and geometric $R$-matrices (or geometric Weyl group actions) give commuting actions on the field of rational functions in $mn$ variables. We study the invariants of various combinations of these actions,…

We prove here that the polynomial <nabla(C_p(1)), e_a h_b h_c> q, t-enumerates, by the statistics dinv and area, the parking functions whose supporting Dyck path touches the main diagonal according to the composition p of size a + b + c and…

We study combinatorial properties of a rational Dyck path by decomposing it into a tuple of Dyck paths. The combinatorial models such as $b$-Stirling permutations, $(b+1)$-ary trees, parenthesis presentations, and binary trees play central…

We construct a generalization of the theory of symmetric functions involving functions of commuting and anticommuting (Grassmannian) variables. These new functions, called symmetric functions in superspace, are invariant under the diagonal…

Let $G$ be an unweighted, undirected graph. An additive $k$-spanner of $G$ is a subgraph $H$ that approximates all distances between pairs of nodes up to an additive error of $+k$, that is, it satisfies $d_H(u,v) \le d_G(u,v)+k$ for all…

We extend the classical theorems of Khintchine and Schmidt in metric Diophantine approximation to the context of self-similar measures on $\mathbb{R}^d$. For this, we establish effective equidistribution of associated random walks on…

We obtain an asymptotic formula for Andrews and Paule's broken $k$-diamond partition function $\Delta_k(n)$ where $k=1$ or $2$. Based on this asymptotic formula, we derive that $\Delta_k(n)$ satisfies the order $d$ Tur\'an inequalities for…

There is the same number of $n \times n$ alternating sign matrices (ASMs) as there is of descending plane partitions (DPPs) with parts no greater than $n$, but finding an explicit bijection is an open problem for about $40$ years now. So…

We use a Hamiltonian (transition matrix) description of height-restricted Dyck paths on the plane in which generating functions for the paths arise as matrix elements of the propagator to evaluate the length and area generating function for…

This paper makes precise the close connection between the affine Hecke algebra, the path model, and the theory of crystals. Section 2 is a basic pictorial exposition of Weyl groups and affine Weyl groups and Section 5 is an exposition of…

We give a counting formula for the set of rectangular increasing tableaux in terms of generalized Narayana numbers. We define small $m$-Schr\"oder paths and give a bijection between the set of increasing rectangular tableaux and small…

We develop symmetric Cartan calculus, an analogue of classical Cartan calculus for symmetric differential forms. We first show that the analogue of the exterior derivative, the symmetric derivative, is not unique and its different choices…

We construct a new topology on the space of stopped paths and introduce a calculus for causal functionals on generic domains of this space. We propose a generic approach to pathwise integration without any assumption on the variation index…

In a series of recent talks Richard Stanley introduced a symmetric function associated to digraphs called the Redei-Berge symmetric function. This symmetric function enumerates descent sets of permutations corresponding to digraphs. We show…

This is the second in a series of articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. The first…

Let $n = \mathrm{p}\!\cdot\!\mathrm{q}$ (p < q) and $\Delta = \lvert p-q \rvert$, where p,q are odd integers, then, it is hypothesized that factorizing this composite n will take O(1) time once the steady state value is reached for any…

For a random walk killed at leaving a cone we suggest two new constructions of a positive harmonic function. These constructions allow one to remove a quite strong extendability assumption, which has been imposed in our previous paper…

Our main contribution here is the discovery of a new family of standard Young tableaux $ {\cal T}^k_n$ which are in bijection with the family ${\cal D}_{m,n}$ of Rational Dyck paths for $m=k\times n\pm 1$ (the so called "Fuss" case). Using…