Related papers: An involution on derangements preserving excedance…
In this note, we prove some and conjecture other results regarding the distribution of descent top and descent bottom sets on some pattern-avoiding permutations. In particular, for 3-letter patterns, we show bijectively that the set of…
In this note we prove optimal inequalities for bounded functions in terms of their deviation from their mean. These results extend and generalize some known inequalities due to Thong (2011) and Perfetti (2011)
A pure excedance in a permutation $\pi=\pi_1\pi_2\ldots \pi_n$ is a position $i<\pi_i$ such that there is no $j<i$ with $i\leq \pi_j<\pi_i$. We present a one-to-one correspondence on the symmetric group that transports pure excedances to…
This paper deals with retraction - intended as isomorphic embedding - in intersection types building left and right inverses as terms of a lambda calculus with a bottom constant. The main result is a necessary and sufficient condition two…
We prove results concerning the joint limiting distribution of the renewal time of denominators and consecutive digits of random irrational numbers in the case of continued fractions with even partial quotients, with odd partial quotients,…
We continue the work of Eriksen, Freij, and Wastlund [3], who study derangements that descend in blocks of prescribed lengths. We generalize their work to derangements that ascend in some blocks and descend in others. In particular, we…
A classic and fundamental result about the decomposition of random sequences into a mixture of simpler ones is de Finetti's Theorem. In its original form it applies to infinite 0-1 valued exchangeable sequences. Later it was extended and…
This work belongs to the framework of inverse problems with linear model. The resolution of this type of problem consists in minimizing (possibly under constraints) a function of discrepancy between the measurements and a physical model of…
We establish maximal trees and graphs for the difference of average distance and proximity proving thus the corresponding conjecture posed in [4]. We also establish maximal trees for the difference of average eccentricity and remoteness and…
We prove central limit theorems for the number of descents and the number of inversions after a shelf-shuffle. In particular, we bound the convergence rate for the number of inversions independently of the number of shelves. Along the way,…
This paper does three things: It proves a central limit theorem for novel permutation statistics (for example, the number of descents plus the number of descents in the inverse). It provides a clear illustration of a new approach to proving…
In their paper \cite{DokosDwyer:Permutat12}, Dokos et al. conjecture that the major index statistic is equidistributed among 1423-avoiding, 2413-avoiding, and 2314-avoiding permutations. In this paper we confirm this conjecture by…
In 2013, Joerg Arndt recorded that the Fibonacci numbers count integer compositions where the first part is greater than the second, the third part is greater than the fourth, etc. We provide a new combinatorial proof that verifies his…
The motivation of this paper is to investigate the joint distribution of succession and Eulerian statistics. We first investigate the enumerators for the joint distribution of descents, big ascents and successions over all permutations in…
We show that if a Lagrangian is invariant under a transformation (with the invariance defined in the standard manner), then the equations of motion obtained from it maintain their form under the transformation. We also show that the…
In this article we establish two fundamental results for the sublevel set persistent homology for stationary processes indexed by the positive integers. The first is a strong law of large numbers for the persistence diagram (treated as a…
In this paper, we survey some of the recent advances on embeddings into finitely generated (left-orderable) simple group such that the overgroup preserves algorithmic, geometric, or algebraic information about the embedded group. We discuss…
We construct a bijection between $321$- and $213$-avoiding permutations that preserves the property of $t$-stack-sortability. Our bijection transforms natural statistics between these two classes of permutations and proves a refinement of…
A lower bound for the interleaving distance on persistence vector spaces is given in terms of rank invariants. This offers an alternative proof of the stability of rank invariants.
We compute the rate of convergence of forward, backward and central finite difference $\theta$-schemes for linear PDEs with an arbitrary odd order spatial derivative term. We prove convergence of the first or second order for smooth and…