English
Related papers

Related papers: On $k$-error linear complexity of pseudorandom bin…

200 papers

We study the relative complexity of equivalence relations and preorders from computability theory and complexity theory. Given binary relations $R, S$, a componentwise reducibility is defined by $ R\le S \iff \ex f \, \forall x, y \, [xRy…

Logic · Mathematics 2018-02-12 Egor Ianovski , Keng Meng Ng , Russell Miller , Andre Nies

We develop a unified second-order parameterized complexity theory for spaces of integrable functions. This generalizes the well-established case of second-order parameterized complexity theory for spaces of continuous functions.…

Computational Complexity · Computer Science 2025-06-16 Aras Bacho , Martin Ziegler

This technical note extends recent results on the computational complexity of globally minimizing the error of piecewise-affine models to the related problem of minimizing the error of switching linear regression models. In particular, we…

Machine Learning · Statistics 2016-07-05 Fabien Lauer

For every modulus $q\ge3$, we define a family of subsets $\mathcal{A}$ of the multiplicative group $(\mathbb{Z}/{q}\mathbb{Z})^\times$ for which the Euler product $\prod_{p\text{mod}q\in\mathcal{A}}(1-p^{-s})$ can be computed in double…

Number Theory · Mathematics 2019-09-20 Salma Ettahri , Olivier Ramaré , Léon Surel

An M-sequence generated by a primitive polynomial has many interesting and desirable properties. A pseudo-random array is the two-dimensional generalization of an M-sequence. There are non-primitive polynomials all of whose non-zero…

Information Theory · Computer Science 2025-08-20 Simon Blackburn , Yeow Meng Chee , Tuvi Etzion , Huimin Lao

In recent years, studying degenerate versions of various special polynomials and numbers have attracted many mathematicians. Here we introduce degenerate type 2 Bernoulli polynomials, fully degenerate type 2 Bernoulli polynomials and…

Number Theory · Mathematics 2019-03-12 Dae San Kim , Han Young Kim , Sung-Soo Pyo , Taekyun Kim

We show that the discrete complex, and numerous hypercomplex, Fourier transforms defined and used so far by a number of researchers can be unified into a single framework based on a matrix exponential version of Euler's formula…

Rings and Algebras · Mathematics 2012-09-13 Stephen J. Sangwine , Todd A. Ell

We study the problem of strongly refuting semirandom $k$-LIN$(\mathbb{F})$ instances: systems of $k$-sparse inhomogeneous linear equations over a finite field $\mathbb{F}$. For the case of $\mathbb{F} = \mathbb{F}_2$, this is the…

Data Structures and Algorithms · Computer Science 2025-08-26 Nicholas Kocurek , Peter Manohar

Sequences with high linear complexity have wide applications in cryptography. In this paper, a new class of quaternary sequences over $\mathbb{F}_4$ with period $2p^mq^n$ is constructed using generalized cyclotomic classes. Results show…

Information Theory · Computer Science 2020-01-30 Qiuyan Wang , Chenhuang Wu , Minghui Yang , Yang Yan

It is known that Hall's sextic residue sequence has some desirable features of pseudorandomness: an ideal two-level autocorrelation and linear complexity of the order of magnitude of its period $p$. Here we study its correlation measure of…

Number Theory · Mathematics 2019-10-31 Hassan Aly , Arne Winterhof

Let $p>5$ be a prime. Motivated by the known formulae $\sum_{k=1}^\infty(-1)^k/(k^3\binom{2k}{k})=-2\zeta(3)/5$ and $\sum_{k=0}^\infty \binom{2k}{k}^2/((2k+1)16^k)=4G/\pi$$ (where $G=\sum_{k=0}^\infty(-1)^k/(2k+1)^2$ is the Catalan…

Number Theory · Mathematics 2013-12-04 Zhi-Wei Sun

Continued fraction expansions and Hankel determinants of automatic sequences are extensively studied during the last two decades. These studies found applications in number theory in evaluating irrationality exponents. The present paper is…

Combinatorics · Mathematics 2019-08-14 Guoniu Han , Yining Hu

Linear complexity is an important parameter for arrays that are used in applications related to information security. In this work we survey constructions of two and three dimensional arrays, and present new results on the multidimensional…

Information Theory · Computer Science 2022-08-01 Rafael Arce , Carlos Hernández , José Ortiz , Ivelisse Rubio , Jaziel Torres

This article presents a strongly polynomial-time algorithm for the general linear programming problem. This algorithm is an implicit reduction procedure that works as follows. Primal and dual problems are combined into a special system of…

Optimization and Control · Mathematics 2026-03-24 Samuel Awoniyi

For a restricted Lie superalgebra g over an algebraically closed field of characteristic p > 2, we generalize the deformation method of Premet and Skryabin to obtain results on the p-power and 2-power divisibility of dimensions of…

Representation Theory · Mathematics 2009-10-13 Lei Zhao

We show that for primes $p < 10^{14}$ the period length $\kappa (p^2)$ of the Fibonacci sequence modulo $p^2$ is never equal to its period length modulo $p$. The investigation involves an extensive search by computer. As an application, we…

Number Theory · Mathematics 2010-06-07 Andreas-Stephan Elsenhans , Jörg Jahnel

For any odd prime p we obtain q-analogues of Van Hamme's supercongruence: $$ \sum_{k=0}^{\frac{p-1}{2}}{2k\choose k}^3\frac{1}{64^k} \equiv 0 \pmod{p^2} \quad\text{for}\quad p\equiv 3\pmod 4, $$ and Rodriguez-Villegas' Beukers-like…

Number Theory · Mathematics 2014-08-05 Victor J. W. Guo , Jiang Zeng

For a purely $N$-periodic continued fraction $\xi=[\overline{a_0,a_1,\dots,a_{N-1}}]=[a_0,a_1,\cdots]$, with $a_k=a_{k+N}$ for all $k\ge 0$, and convergents $h_n/k_n=[a_0,a_1,\dots,a_n]$, we obtain explicit expressions for the weighted…

Number Theory · Mathematics 2026-01-14 Kevin Calderon , Nikita Kalinin

In this paper we consider weakly holomorphic modular forms (i.e. those meromorphic modular forms for which poles only possibly occur at the cusps) of weight $2-k\in 2\Z$ for the full modular group $\SL_2(\Z)$. The space has a distinguished…

Number Theory · Mathematics 2011-04-19 Ben Kane

A recent article of Berndt and Yee found congruences modulo 3^k for certain ratios of Eisenstein series. For all but one of these, we show there are no simple congruences a(pn+c) = 0 modulo p when p>= 13 is prime. This follows from a more…

Number Theory · Mathematics 2009-10-02 Michael Dewar