Related papers: Sequences with high nonlinear complexity
This paper studies explicit and theoretical bounds for several interesting quantities in number theory, conditionally on the Generalized Riemann Hypothesis. Specifically, we improve the existing explicit bounds for the least quadratic…
We define a metric on $\mathbb{F}_q^n$ using the linear complexity of finite sequences. We will then develop a coding theory for this metric. We will give a Singleton-like bound and we will give constructions of subspaces of…
We propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speedup of the decoding process of Bose-Chaudhuri-Hocquenghem, Reed-Solomon, and some other error-correcting codes.
We study two-layer belief networks of binary random variables in which the conditional probabilities Pr[childlparents] depend monotonically on weighted sums of the parents. In large networks where exact probabilistic inference is…
We study pseudorandomness and pseudorandom generators from the perspective of logical definability. Building on results from ordinary derandomization and finite model theory, we show that it is possible to deterministically construct, in…
Let ${\cal L}$ be an arrangement of $n$ lines in the Euclidean plane. The \emph{$k$-level} of ${\cal L}$ consists of all vertices $v$ of the arrangement which have exactly $k$ lines of ${\cal L}$ passing below $v$. The complexity (the…
We formulate and analyze several finiteness conjectures for linear algebraic groups over higher-dimensional fields. In fact, we prove all of these conjectures for algebraic tori as well as in some other situations. This work relies in an…
In order to study large variations or fluctuations of finite or infinite sequences (time series), we bring to light an 1868 paper of Crofton and the (Cauchy-)Crofton theorem. After surveying occurrences of this result in the literature, we…
For one-dimensional Schroedinger operators with complex-valued potentials, we construct pseudomodes corresponding to large pseudoeigenvalues. Our (non-semi-classical) approach results in substantial progress in achieving optimal conditions…
We present quantum complexity lower and upper bounds for independent set problems in graphs. In particular, we give quantum algorithms for computing a maximal and a maximum independent set in a graph. We present applications of these…
We study lower bounds for the norm of the product of polynomials and their applications to the so called \emph{plank problem.} We are particularly interested in polynomials on finite dimensional Banach spaces, in which case our results…
Depending on the behaviour of the complex-valued electromagnetic potential in the neighbourhood of infinity, pseudomodes of one-dimensional Dirac operators corresponding to large pseudoeigenvalues are constructed. This is a first systematic…
A new approach is proposed to the quantitative estimation of the complexity of multidimensional discrete sequences in terms of the shapes of their trajectories in the extended space of states. This approach is based on the study of the…
Morphic sequences form a natural class of infinite sequences, extending the well-studied class of automatic sequences. Where automatic sequences are known to have several equivalent characterizations and the class of automatic sequences is…
We show that various aspects of k-automatic sequences -- such as having an unbordered factor of length n -- are both decidable and effectively enumerable. As a consequence it follows that many related sequences are either k-automatic or…
We describe new, simple, recursive methods of construction for orientable sequences over an arbitrary finite alphabet, i.e. periodic sequences in which any sub-sequence of n consecutive elements occurs at most once in a period in either…
The concepts of pseudocodeword and pseudoweight play a fundamental role in the finite-length analysis of LDPC codes. The pseudoredundancy of a binary linear code is defined as the minimum number of rows in a parity-check matrix such that…
The paper studies frequency characteristics and predictability of real sequences, i.e., discrete time processes in deterministic setting. We consider band-limitness and predictability of one-sided sequences. We establish predictability of…
We construct an explicit filtration of the ring of algebraic power series by finite dimensional constructible sets, measuring the complexity of these series. As an application, we give a bound on the dimension of the set of algebraic power…
Primitive polynomials over finite fields are crucial for various domains of computer science, including classical pseudo-random number generation, coding theory and post-quantum cryptography. Nevertheless, the pursuit of an efficient…