English
Related papers

Related papers: Trace representation and linear complexity of bina…

200 papers

Linear second order recursive sequences with arbitrary initial conditions are studied. For sequences with the same parameters a ring and a group is attached, and isomorphisms and homomorphisms are established for related parameters. In the…

Number Theory · Mathematics 2025-01-31 Zbigniew Lipinski , Maciej P. Wojtkowski

Generalized cyclotomic sequences of period pq have several desirable randomness properties if the two primes p and q are chosen properly. In particular,Ding deduced the exact formulas for the autocorrelation and the linear complexity of…

Information Theory · Computer Science 2016-05-18 Yuhua Sun , Yang Yan , Fei Li , Tongjiang Yan , Hui Li

In this paper we investigate determinants whose entries are linear combinations of Legendre symbols. We deduce some new results in this direction; for example, we prove that for any prime $p\equiv3\pmod4$ we have…

Number Theory · Mathematics 2024-07-30 Zhi-Wei Sun

An efficient procedure for the computation of the coefficients of Legendre expansions is here presented. We prove that the Legendre coefficients associated with a function f(x) can be represented as the Fourier coefficients of an Abel-type…

Numerical Analysis · Mathematics 2011-06-03 Enrico De Micheli , Giovanni Alberto Viano

We study the $K$-Fibonacci sequence $\mathcal{F}_p$ modulo prime $p$. Cardinalities of sets $|\mathcal{F}_p+\mathcal{F}_p|$ and $|\mathcal{F}_p\cdot\mathcal{F}_p|$ are estimated. We present the method of estimating doubling constant of some…

Number Theory · Mathematics 2026-05-26 Ilya Vyugin , Sashadhar Dutta

The Fermat numbers have many notable properties, including order universality, coprimality, and definition by a recurrence relation. We use arbitrary elliptic curves and rational points of infinite order to generate sequences that are…

Number Theory · Mathematics 2019-02-06 Skye Binegar , Randy Dominick , Meagan Kenney , Jeremy Rouse , Alex Walsh

We consider Proof Complexity in light of the unusual binary encoding of certain combinatorial principles. We contrast this Proof Complexity with the normal unary encoding in several refutation systems, based on Resolution and Integer Linear…

Logic in Computer Science · Computer Science 2022-04-06 Stefan Dantchev , Nicola Galesi , Abdul Ghani , Barnaby Martin

Two general constructions of linear codes with functions over finite fields have been extensively studied in the literature. The first one is given by $\mathcal{C}(f)=\left\{ {\rm Tr}(af(x)+bx)_{x \in \mathbb{F}_{q^m}^*}: a,b \in…

Information Theory · Computer Science 2021-01-22 Xiaoqiang Wang , Dabin Zheng , Cunsheng Ding

We consider Hilbert modular varieties in characteristic p with Iwahori level at p and construct a geometric Jacquet-Langlands relation showing that the irreducible components are isomorphic to products of projective bundles over…

Number Theory · Mathematics 2025-04-14 Fred Diamond , Payman Kassaei , Shu Sasaki

We study how well Fekete polynomials $$ F_p(X) = \sum_{n=0}^{p-1} \left(\frac{n}{p}\right) X^n \in {\mathbb Z}[X] $$ with the coefficients given by Legendre symbols modulo a prime $p$, can be approximated by power series representing…

Number Theory · Mathematics 2016-11-22 Jason Bell , Igor E. Shparlinski

This study involves definitions for multiple-counting regular and summation sequences of rho. My paper introduces and proves recurrent relationships for multiple-counting sequences and shows their association with Fermat's little theorem. I…

Number Theory · Mathematics 2019-01-07 Muhammed Hüsrev Cilasun

Labeled infinite trees provide combinatorial interpretations for many integer sequences generated by nested recurrence relations. Typically, such sequences are monotone increasing. Several of these sequences also have straightforward…

Combinatorics · Mathematics 2022-11-07 Nathan Fox

In this article, we study the modular representations of the special linear group of degree two over a finite field in defining characteristic. In particular, we study the automorphisms of derived category of representations. We have been…

Representation Theory · Mathematics 2017-07-19 William Wong

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…

Information Theory · Computer Science 2017-02-21 Qi Zhang , Jing Yang

An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.

Discrete Mathematics · Computer Science 2011-08-19 Alexander Valyuzhenich

We study a class of Linear Feedback Shift Registers (LFSRs) with characteristic polynomial $f(x)=p(x)q(x)$ where $p(x)$ and $q(x)$ are distinct irreducible polynomials in $\F_2[x]$. Important properties of the LFSRs, such as the cycle…

Information Theory · Computer Science 2018-06-11 Zuling Chang , Martianus Frederic Ezerman , San Ling , Huaxiong Wang

Given any two sequences of complex numbers, we establish simple relations between their binomial convolution and the binomial convolution of their individual binomial transforms. We employ these relations to derive new identities involving…

Combinatorics · Mathematics 2025-12-22 Kunle Adegoke

Representations of primes by simple quadratic forms, such as $\pm a^2\pm qb^2$, is a subject that goes back to Fermat, Lagrange, Legendre, Euler, Gauss and many others. We are interested in a comprehensive list of such results, for $q\le…

Number Theory · Mathematics 2013-04-16 Eugen J. Ionascu , Jeff Patterson

Mersenne numbers and Fermat numbers are two hot and difficult issues in number theory. This paper constructs a special group for every positive odd number other than 1, and discovers an algorithm for determining the multiplicative order of…

General Mathematics · Mathematics 2013-05-10 Shi Yongjin

In this paper we introduce the notion of the $P$-sequences and apply their properties in studying representability of real numbers. Another application of $P$-sequences we find in generating the Prouhet-Tarry-Escott pairs.

Number Theory · Mathematics 2007-05-23 Zarko Mijajlovic , Milos Milosevic , Aleksandar Perovic