中文
相关论文

相关论文: Crosscorrelation of Rudin-Shapiro-Like Polynomials

200 篇论文

In this paper we study the complexity of factorization of polynomials in the free noncommutative ring $\mathbb{F}\langle x_1,x_2,\dots,x_n\rangle$ of polynomials over the field $\mathbb{F}$ and noncommuting variables $x_1,x_2,\ldots,x_n$.…

计算复杂性 · 计算机科学 2015-01-06 V. Arvind , Pushkar S Joglekar , Gaurav Rattan

This article, based on joint work with Gabriel Carroll, Andy Itsara, Ian Le, Gregg Musiker, Gregory Price, Dylan Thurston, and Rui Viana, presents a combinatorial model based on perfect matchings that explains the symmetries of the…

组合数学 · 数学 2020-05-29 James Propp

We investigate connections between radial Fourier multipliers on $R^d$ and certain conical Fourier multipliers on $R^{d+1}$. As an application we obtain a new weak type endpoint bound for the Bochner-Riesz multipliers associated to the…

经典分析与常微分方程 · 数学 2012-03-20 Yaryong Heo , Fedor Nazarov , Andreas Seeger

In the moduli space of degree d polynomials, we prove the equidistribution of postcritically finite polynomials toward the bifurcation measure. More precisely, using complex analytic arguments and pluripotential theory, we prove the…

动力系统 · 数学 2016-12-05 Thomas Gauthier , Gabriel Vigny

Both the Thue-Morse and Rudin-Shapiro sequences are not suitable sequences for cryptography since their expansion complexity is small and their correlation measure of order 2 is large. These facts imply that these sequences are highly…

数论 · 数学 2020-11-09 Pierre Popoli

The problem of constructing polynomials with all coefficients $1$ or $-1$ and large merit factor (equivalently with small $L^4$ norm on the unit circle) arises naturally in complex analysis, condensed matter physics, and digital…

组合数学 · 数学 2016-02-12 Christian Günther , Kai-Uwe Schmidt

Let $n_1$ and $n_2$ be two distinct primes with $\mathrm{gcd}(n_1-1,n_2-1)=4$. In this paper, we compute the autocorrelation values of generalized cyclotomic sequence of order $4$. Our results show that this sequence can have very good…

信息论 · 计算机科学 2016-03-08 Priti Kumari , Pramod Kumar Kewat

The objective of this manuscript is to study directly the Favard type theorem associated with the three term recurrence formula % \[ R_{n+1}(z) = \big[(1+ic_{n+1})z+(1-ic_{n+1})\big] R_{n}(z) - 4 d_{n+1} z R_{n-1}(z), \quad n \geq 1, \] %…

经典分析与常微分方程 · 数学 2015-10-26 Kenier Castillo , Marisa Costa , A. Sri Ranga , Daniel Veronese

A standard approach to compute the roots of a univariate polynomial is to compute the eigenvalues of an associated \emph{confederate} matrix instead, such as, for instance the companion or comrade matrix. The eigenvalues of the confederate…

数值分析 · 数学 2021-05-13 Vanni Noferini , Leonardo Robol , Raf Vandebril

Schubert polynomials were discovered by A. Lascoux and M. Sch\"utzenberger in the study of cohomology rings of flag manifolds in 1980's. These polynomials generalize Schur polynomials, and form a linear basis of multivariate polynomials. In…

计算复杂性 · 计算机科学 2018-05-16 Priyanka Mukhopadhyay , Youming Qiao

Sequences with low aperiodic autocorrelation are used in communications and remote sensing for synchronization and ranging. The autocorrelation demerit factor of a sequence is the sum of the squared magnitudes of its autocorrelation values…

信息论 · 计算机科学 2024-08-19 Daniel J. Katz , Miriam E. Ramirez

We study a.e. convergence on $L^p$, and Lorentz spaces $L^{p,q}$, $p>\tfrac{2d}{d-1}$, for variants of Riesz means at the critical index $d(\tfrac 12-\tfrac 1p)-\tfrac12$. We derive more general results for (quasi-)radial Fourier…

经典分析与常微分方程 · 数学 2016-04-20 Sanghyuk Lee , Andreas Seeger

We study the cluster automorphism group $Aut(\mathcal{A})$ of a coefficient free cluster algebra $\mathcal{A}$ of finite type. A cluster automorphism of $\mathcal{A}$ is a permutation of the cluster variable set $\mathscr{X}$ that is…

表示论 · 数学 2015-10-29 Wen Chang , Bin Zhu

Let $f(x)\in\mathbb{Z}[x]$ be a nonconstant polynomial. Let $n, k$ and $c$ be integers such that $n\ge 1$ and $k\ge 2$. An integer $a$ is called an $f$-exunit in the ring $\mathbb{Z}_n$ of residue classes modulo $n$ if $\gcd(f(a),n)=1$. In…

数论 · 数学 2021-08-03 Junyong Zhao , Shaofang Hong , Chaoxi Zhu

We introduce a family of block-additive automatic sequences, that are obtained by allocating a weight to each couple of digits, and defining the $n$th term of the sequence as being the total weight of the integer $n$ written in base $k$.…

组合数学 · 数学 2020-06-24 Irène Marcovici , Thomas Stoll , Pierre-Adrien Tahay

We identify a recursive structure among factorizations of polynomial values into two integer factors. Polynomials for which this recursive structure characterizes all non-trivial representations of integer factorizations of the polynomial…

数论 · 数学 2014-04-15 Jonathan Burns

The efficacy of numerical methods like integral estimates via Gaussian quadrature formulas depends on the localization of the zeros of the associated family of orthogonal polynomials. In this regard, following the renewed interest in…

经典分析与常微分方程 · 数学 2023-09-13 Luana L. Silva Ribeiro , Alagacone Sri Ranga , Yen Chi Lun

We consider functions of the type $f(z)=z+a_2z^2+a_3z^3+\cdots$ from a family of all analytic and univalent functions in the unit disk. Let $F$ be the inverse function of $f$, given by $F(z)=w+\sum_{n=2}^{\infty}A_nw^n$ defined on some…

复变函数 · 数学 2021-11-02 Vasudevarao Allu , Vibhuti Arora

Binary Sidel'nikov-Lempel-Cohn-Eastman sequences (or SLCE sequences) over F 2 have even period and almost perfect autocorrelation. However, the evaluation of the linear complexity of these sequences is really difficult. In this paper, we…

信息论 · 计算机科学 2017-02-21 Qi Zhang , Jing Yang

In this paper we obtained several properties that the characteristic polynomials of the unit-primitive matrix satisfy. In addition, using these properties we have shown that the recurrence relation given as in the formula (1) is true. In…

组合数学 · 数学 2023-05-09 Byeong-Gil Choe , Hyeong-Kwan Ju