Related papers: A new decomposition of ascent sequences and Euler-…

This paper introduces a coordinate descent version of the V\~u-Condat algorithm. By coordinate descent, we mean that only a subset of the coordinates of the primal and dual iterates is updated at each iteration, the other coordinates being…

We compute the limiting distribution of height of a random discrete excursion with step sets consisting of one positive step 1 and arbitrary finite set of non-positive integers. The limit law is the supremum of a Brownian excursion. This is…

We provide new methods to straightforwardly obtain compact and analytic expressions for epsilon-expansions of functions appearing in both field and string theory amplitudes. An algebraic method is presented to explicitly solve for…

Distance correlation has become an increasingly popular tool for detecting the nonlinear dependence between a pair of potentially high-dimensional random vectors. Most existing works have explored its asymptotic distributions under the null…

Generalized Zeckendorf decompositions are expansions of integers as sums of elements of solutions to recurrence relations. The simplest cases are base-$b$ expansions, and the standard Zeckendorf decomposition uses the Fibonacci sequence.…

This paper considers the problem of channel coding with a given (possibly suboptimal) maximum-metric decoding rule. A cost-constrained random-coding ensemble with multiple auxiliary costs is introduced, and is shown to achieve error…

In this paper, we study pattern avoidance in weak ascent sequences, giving some results for patterns of length 3. This is an analogous study to one given by Duncan and Steingr\'imsson (2011) for ascent sequences. More precisely, we provide…

Sampling from the posterior is a key technical problem in Bayesian statistics. Rigorous guarantees are difficult to obtain for Markov Chain Monte Carlo algorithms of common use. In this paper, we study an alternative class of algorithms…

Recently, the study of patterns in inversion sequences was initiated by Corteel-Martinez-Savage-Weselcouch and Mansour-Shattuck independently. Motivated by their works and a double Eulerian equidistribution due to Foata (1977), we…

In this paper, we consider two sets of pattern-avoiding ascent sequences: those avoiding both 201 and 210 and those avoiding 0021. In each case we show that the number of such ascent sequences is given by the binomial convolution of the…

A classical result of Euler states that the tangent numbers are an alternating sum of Eulerian numbers. A dual result of Roselle states that the secant numbers can be obtained by a signed enumeration of derangements. We show that both…

We consider statistics on permutations chosen uniformly at random from fixed parabolic double cosets of the symmetric group. We show that the distribution of fixed points is asymptotically Poisson and establish central limit theorems for…

In this paper, we derive a new representation for the Anger--Weber function, employing the reformulation of the method of steepest descents by C. J. Howls (Howls, Proc. R. Soc. Lond. A 439 (1992) 373--396). As a consequence of this…

A characterization of the exponential distribution based on equidistribution conditions for maxima of random samples with consecutive sizes n-1 and n for an arbitrary and fixed n>2 is proved. This solves an open problem stated recently in…

A new class of random composition structures (the ordered analog of Kingman's partition structures) is defined by a regenerative description of component sizes. Each regenerative composition structure is represented by a process of random…

In this paper, the asymptotic formulas for Eulerian numbers, refined Eulerian numbers and the coefficients of descent polynomials are obtained directly from the spline interpretations of these numbers. Having related these numbers directly…

The family of U-statistics plays a fundamental role in statistics. This paper proves a novel exponential inequality for U-statistics under the time series setting. Explicit mixing conditions are given for guaranteeing fast convergence, the…

We introduce the theory of normal ordered grammars, which gives a natural generalization of the normal ordering problem. To illustrate the main idea, we explore normal ordered grammars associated with the Eulerian polynomials and the…

This paper deals with the asymptotic statistical properties of a class of redescending M-estimators in linear models with increasing dimension. This class is wide enough to include popular high breakdown point estimators such as…

Divisibility sequences are defined by the property that their elements divide each other whenever their indices do. The divisibility sequences that also satisfy a linear recurrence, like the Fibonacci numbers, are generated by polynomials…