English
Related papers

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

200 papers

Motivated by the home-field advantage in sports, we propose a generalized Bradley--Terry model that incorporates covariate information for paired comparisons. It has an $n$-dimensional merit parameter $\bs{\beta}$ and a fixed-dimensional…

Methodology · Statistics 2025-07-31 Ting Yan

We introduce a class of paired binary matrices called admixed arrays, which arise in analyses of large-scale genetic data and can be viewed as weighted edge colorings of complete bipartite graphs. This combinatorial structure gives rise to…

Combinatorics · Mathematics 2026-04-13 Alan J. Aw

We consider the sequential composite binary hypothesis testing problem in which one of the hypotheses is governed by a single distribution while the other is governed by a family of distributions whose parameters belong to a known set…

Information Theory · Computer Science 2022-03-30 Jiachun Pan , Yonglong Li , Vincent Y. F. Tan

The asymptotic critical exponent measures for a sequence the maximum repetition rate of factors of growing length. The infimum of asymptotic critical exponents of sequences of a certain class is called the asymptotic repetition threshold of…

Combinatorics · Mathematics 2024-09-12 Lubomíra Dvořáková , Karel Klouda , Edita Pelantová

Over the last several decades, improvements in the fields of analytic combinatorics and computer algebra have made determining the asymptotic behaviour of sequences satisfying linear recurrence relations with polynomial coefficients largely…

Symbolic Computation · Computer Science 2023-06-27 Ruiwen Dong , Stephen Melczer , Marc Mezzarobba

The correlation measure is a testimony of the pseudorandomness of a sequence $\infw{s}$ and provides information about the independence of some parts of $\infw{s}$ and their shifts. Combined with the well-distribution measure, a sequence…

Combinatorics · Mathematics 2024-08-27 Pierre Popoli , Manon Stipulanti

Binary $m$-sequences are ones with the largest period $n=2^m-1$ among the binary sequences produced by linear shift registers with length $m$. They have a wide range of applications in communication since they have several desirable…

Information Theory · Computer Science 2022-12-01 Xiaoyan Jing , Aixian Zhang , Keqin Feng

In this work, we analyze the asymptotic convergence factor of minimal residual iteration (MRI) (or GMRES(1)) for solving linear systems $Ax=b$ based on vector-dependent nonlinear eigenvalue problems. The worst-case root-convergence factor…

Numerical Analysis · Mathematics 2025-01-20 Yunhui He

We investigate two fundamental questions intersecting coding theory and combinatorial geometry, with emphasis on their connections. These are the problem of computing the asymptotic density of MRD codes in the rank metric, and the Critical…

Combinatorics · Mathematics 2022-01-19 Anina Gruica , Alberto Ravagnani , John Sheekey , Ferdinando Zullo

The notion of Fej\'er monotonicity is instrumental in unifying the convergence proofs of many iterative methods, such as the Krasnoselskii-Mann iteration, the proximal point method, the Douglas-Rachford splitting algorithm, and many others.…

Optimization and Control · Mathematics 2021-06-30 Heinz H. Bauschke , Manish Krishan Lal , Xianfu Wang

The extent to which a sequence of finite length differs from a shifted version of itself is measured by its aperiodic autocorrelations. Of particular interest are sequences whose entries are 1 or -1, called binary sequences, and sequences…

Information Theory · Computer Science 2016-02-12 Kai-Uwe Schmidt

In this paper we study a sequence involving the prime numbers by deriving two asymptotic formulas and finding new upper and lower bounds, which improve the currently known estimates.

Number Theory · Mathematics 2015-04-20 Christian Axler

We investigate the relation between the subleading soft graviton theorem and asymptotic symmetries in gravity in even dimensions $d=2+2m$ higher than four. After rewriting the subleading soft graviton theorem as a Ward identity, we argue…

High Energy Physics - Theory · Physics 2022-01-24 Dimitri Colferai , Stefano Lionetti

Binary sequences with minimal autocorrelations have applications in communication engineering, mathematics and computer science. In statistical physics they appear as groundstates of the Bernasconi model. Finding these sequences is a…

Statistical Mechanics · Physics 2016-03-25 Tom Packebusch , Stephan Mertens

A family of binary sequences is presented and proved to have optimal correlation property and large linear span. It includes the small set of Kasami sequences, No sequence set and TN sequence set as special cases. An explicit lower bound…

Cryptography and Security · Computer Science 2016-09-07 Xiangyong Zeng , Lei Hu , Qingchong Liu

Tensor parameters that are amortized or regularized over large tensor powers, often called "asymptotic" tensor parameters, play a central role in several areas including algebraic complexity theory (constructing fast matrix multiplication…

Computational Complexity · Computer Science 2025-09-11 Jop Briët , Matthias Christandl , Itai Leigh , Amir Shpilka , Jeroen Zuiddam

Pursley and Sarwate established a lower bound on a combined measure of autocorrelation and crosscorrelation for a pair $(f,g)$ of binary sequences (i.e., sequences with terms in $\{-1,1\}$). If $f$ is a nonzero sequence, then its…

Information Theory · Computer Science 2022-03-08 Daniel J. Katz , Eli Moore

This paper re-examines the problem of estimating risk premia in linear factor pricing models. Typically, the data used in the empirical literature are characterized by weakness of some pricing factors, strong cross-sectional dependence in…

Econometrics · Economics 2019-04-09 Stanislav Anatolyev , Anna Mikusheva

We achieve new results on skew polynomial rings and their quotients, including the first explicit example of a skew polynomial ring where the ratio of the degree of a skew polynomial to the degree of its bound is not extremal. These methods…

Combinatorics · Mathematics 2025-02-20 F. J. Lobillo , Paolo Santonastaso , John Sheekey

This work is motivated by the long-standing open problem of designing asymptotically order-optimal aperiodic polyphase sequence sets with respect to the celebrated Welch bound. Attempts were made by Mow over 30 years ago, but a…

Information Theory · Computer Science 2026-01-26 Huaning Liu , Zilong Liu