Related papers: Advances in the merit factor problem for binary se…

Nonparametric regression problems with qualitative constraints such as monotonicity or convexity are ubiquitous in applications. For example, in predicting the yield of a factory in terms of the number of labor hours, the monotonicity of…

We study the relationship between two measures of pseudorandomness for families of binary sequences: family complexity and cross-correlation measure introduced by Ahlswede et al.\ in 2003 and recently by Gyarmati et al., respectively. More…

Three measures of pseudorandomness of finite binary sequences were introduced by Mauduit and S\'ark\"ozy in 1997 and have been studied extensively since then: the normality measure, the well-distribution measure, and the correlation measure…

Motivated by connections with observable phenomena, in particular with soft factorization theorems for scattering amplitudes and with memory effects, renewed interest has been recently shown in the subject of asymptotic symmetries at null…

We establish the asymptotic theory in quantile autoregression when the model parameter is specified with respect to moderate deviations from the unit boundary of the form (1 + c / k) with a convergence sequence that diverges at a rate…

We present a general approach to the problem of determining tight asymptotic lower bounds for generalized central moments of the optimal alignment score of two independent sequences of i.i.d. random variables. At first, these are obtained…

Low correlation (finite length) sequences are used in communications and remote sensing. One seeks codebooks of sequences in which each sequence has low aperiodic autocorrelation at all nonzero shifts, and each pair of distinct sequences…

Soft theorems can be recast as Ward identities of asymptotic symmetries. We review such relation for the leading and subleading soft graviton theorems in arbitrary even dimensions. While soft theorems are trivially generalized to dimensions…

We develop a new method for studying the asymptotics of symmetric polynomials of representation-theoretic origin as the number of variables tends to infinity. Several applications of our method are presented: We prove a number of theorems…

The run vector of a binary sequence reflects the run structure of the sequence, which is given by the set of all substrings of the run length encoding. The run vector and the aperiodic autocorrelations of a binary sequence are strongly…

Building on previous results of Xing, we give new lower bounds on the rate of intersecting codes over large alphabets. The proof is constructive, and uses algebraic geometry, although nothing beyond the basic theory of linear systems on…

The Ap\'ery polynomials and in particular their asymptotic behavior play an essential role in the understanding of the irrationality of \zeta(3). In this paper, we present a method to study the asymptotic behavior of the sequence of the…

The coefficient sequences of multivariate rational functions appear in many areas of combinatorics. Their diagonal coefficient sequences enjoy nice arithmetic and asymptotic properties, and the field of analytic combinatorics in several…

This paper presents results on maximal runs, order of squares, palindromes, and unbordered factors of members of the family of binary pattern sequences with the all-one pattern. Restricting ourselves to binary pattern sequences with the…

Although asymptotic analyses of undirected network models based on degree sequences have started to appear in recent literature, it remains an open problem to study statistical properties of directed network models. In this paper, we…

We show that various aspects of k-automatic sequences -- such as having an unbordered factor of length n -- are both decidable and effectively enumerable. As a consequence it follows that many related sequences are either k-automatic or…

Sequences that are defined by multisums of hypergeometric terms with compact support occur frequently in enumeration problems of combinatorics, algebraic geometry and perturbative quantum field theory. The standard recipe to study the…

We study ternary sequences associated with a multidimensional continued fraction algorithm introduced by the first author. The algorithm is defined by two matrices and we show that it is measurably isomorphic to the shift on the set…

The asymptotic structure of three-dimensional higher-spin anti-de Sitter gravity is analyzed in the metric approach, in which the fields are described by completely symmetric tensors and the dynamics is determined by the standard…

We study sequential multiple testing with independent data streams, where the goal is to identify an unknown subset of signals while controlling commonly used error metrics, including generalized familywise rates and false discovery and…