English
Related papers

Related papers: Rudin-Shapiro-Like Sequences with Maximum Asymptot…

200 papers

This is a study of the sequences of Betti numbers of finitely generated modules over a complete intersection local ring, $R$. The subsequences $\{\beta^R_{i}(M)\}_{i\geq 0}$ with even, respectively, odd $i$ are known to be eventually given…

Commutative Algebra · Mathematics 2024-07-16 Luchezar L. Avramov , Alexandra Seceleanu , Zheng Yang

We study an asymptotical behavior of the maximal degree in the degree distribution in an evolving tree model combining the local choice and the Mori's preferential attachment. In the considered model, the random graph is constructed in the…

Probability · Mathematics 2017-10-27 Yury Malyshkin

A nearly linear recurrence sequence (nlrs) is a complex sequence $(a_n)$ with the property that there exist complex numbers $A_0$,$\ldots$, $A_{d-1}$ such that the sequence $\big(a_{n+d}+A_{d-1}a_{n+d-1}+\cdots +A_0a_n\big)_{n=0}^{\infty}$…

Number Theory · Mathematics 2016-08-02 Shigeki Akiyama , Jan-Hendrik Evertse , Attila Pethő

The Hofstadter Q-sequence, with its simple definition, has defied all attempts at analyzing its behavior. Defined by a simple nested recurrence and an initial condition, the sequence looks approximately linear, though with a lot of noise.…

Number Theory · Mathematics 2016-09-22 Nathan Fox

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…

Econometrics · Economics 2023-08-22 Christis Katsouris

We introduce a construction for perfect periodic autocorrelation sequences over roots of unity. The sequences share similarities to the perfect periodic sequence constructions of Liu, Frank, and Milewski.

Information Theory · Computer Science 2012-12-04 Samuel T. Blake , Andrew Z. Tirkel

We introduce new subclasses of Fourier hyperfunctions of mixed type, satisfying polynomial growth conditions at infinity, and develop their sheaf and duality theory. We use Fourier transformation and duality to examine relations of these…

Functional Analysis · Mathematics 2007-05-23 Andreas U. Schmidt

For each infinite word over a given finite alphabet, we define an increasing sequence of rooted finite graphs, that can be thought as approximations of the famous Sierpinski carpet. These sequences naturally converge to an infinite rooted…

Combinatorics · Mathematics 2018-02-28 Daniele D'Angeli , Alfredo Donno

For over three decades, the pursuit of perfect periodic autocorrelation sequences has been constrained by Mow's conjecture, which posits that no perfect sequence over an $n$-phase alphabet can exist with a length greater than $n^2$. While a…

Information Theory · Computer Science 2026-03-17 Sam Blake

Bogomolny-Leyvraz-Schmit (1996) and Peter (2002) proposed an asymptotic formula for the correlation of the multiplicities in length spectrum on the modular surface, and Lukianov (2007) extended its asymptotic formula to the Riemann surfaces…

Number Theory · Mathematics 2015-02-10 Yasufumi Hashimoto

Let $q$ be an odd prime power and $\mathbb{F}_q$ be the finite field of $q$ elements. We define the Rudin-Shapiro function $R$ on monic polynomials $f=t^n+f_{n-1}t^{n-1}+\dots + f_0\in\mathbb{F}_q[t]$ over $\mathbb{F}_q$ by $$…

Number Theory · Mathematics 2025-08-14 László Mérai

Binary periodic sequences with good autocorrelation property have many applications in many aspects of communication. In past decades many series of such binary sequences have been constructed. In the application of cryptography, such…

Information Theory · Computer Science 2021-05-31 Qiuyue Liu , Shiyuan Qiang , Minghui Yang , Keqin Feng

We study the asymptotic behavior of the Castelnuovo-Mumford regularity along chains of graded ideals in increasingly larger polynomial rings that are invariant under the action of symmetric groups. A linear upper bound for the regularity of…

Commutative Algebra · Mathematics 2020-09-09 Dinh Van Le , Uwe Nagel , Hop D. Nguyen , Tim Roemer

In this paper, we define double almost-Riordan arrays and find that the set of all double almost-Riordan arrays forms a group, called the double almost-Riordan group. We also obtain the sequence characteristics of double almost-Riordan…

Combinatorics · Mathematics 2025-02-14 Tian-Xiao He

Let either $R_k(t) := |P_k(e^{it})|^2$ or $R_k(t) := |Q_k(e^{it})|^2$, where $P_k$ and $Q_k$ are the usual Rudin-Shapiro polynomials of degree $n-1$ with $n=2^k$. In a recent paper we combined close to sharp upper bounds for the modulus of…

Classical Analysis and ODEs · Mathematics 2018-09-24 Tamás Erdélyi

We obtain new uniform bounds for the symmetric tensor rank of multiplication in finite extensions of any finite field Fp or Fp2 where p denotes a prime number greater or equal than 5. In this aim, we use the symmetric Chudnovsky-type…

Number Theory · Mathematics 2017-06-29 Stéphane Ballet , Alexey Zykin

Let A_{R,q} denote a family of covering codes, in which the covering radius R and the size q of the underlying Galois field are fixed, while the code length tends to infinity. In this paper, infinite sets of families A_{R,q}, where R is…

Combinatorics · Mathematics 2009-04-27 Alexander A. Davydov , Massimo Giulietti , Stefano Marcugini , Fernanda Pambianco

We develop a representative-level framework for the Liebscher-Tsirelson random-set construction of Arveson systems from stationary factorizing measure types. We introduce the notion of a measurable factorizing family of probability measures…

Probability · Mathematics 2026-03-10 Remus Floricel

In this paper we study the behaviour at infinity of the Fourier transform of Radon measures supported by the images of fractal sets under an algorithmically random Brownian motion. We show that, under some computability conditions on these…

Computational Complexity · Computer Science 2015-07-01 Willem Louw Fouché , Safari Mukeru , George Davie

We give asymptotic expansions for the moments of the $M_2$-rank generating function and for the $M_2$-rank generating function at roots of unity. For this we apply the Hardy-Ramanujan circle method extended to mock modular forms. Our…

Number Theory · Mathematics 2019-02-25 Chris Jennings-Shaffer , Dillon Reihill