Related papers: Sequences with high nonlinear complexity
Inspired by the works in [1] and [8] we introduce what we call $k$-th-order fluctuation fields and study their scaling limits. This construction is done in the context of particle systems with the property of orthogonal self-duality. This…
We introduce a notion of computable randomness for infinite sequences that generalises the classical version in two important ways. First, our definition of computable randomness is associated with imprecise probability models, in the sense…
We estimate the maximum-order complexity of a binary sequence in terms of its correlation measures. Roughly speaking, we show that any sequence with small correlation measure up to a sufficiently large order $k$ cannot have very small…
We define the topological complexity sequence of a group as the sequence of topological complexities of its Milnor constructions. This sequence may be regarded as an intrinsic refinement of the topological complexity of a group and, unlike…
Higher-order tree-level processes in strong laser fields, i.e. cascades, are in general extremely difficult to calculate, but in some regimes the dominant contribution comes from a sequence of first-order processes, i.e. nonlinear Compton…
A step-search sequential quadratic programming method is proposed for solving nonlinear equality constrained stochastic optimization problems. It is assumed that constraint function values and derivatives are available, but only stochastic…
Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…
We study weakest precondition reasoning about the (co)variance of outcomes and the variance of run-times of probabilistic programs with conditioning. For outcomes, we show that approximating (co)variances is computationally more difficult…
In this work we extend our study on a link between automaticity and certain algebraic power series over finite fields. Our starting point is a family of sequences in a finite field of characteristic $2$, recently introduced by the first…
Let $1<g_1<\ldots<g_{\varphi(p-1)}<p-1$ be the ordered primitive roots modulo~$p$. We study the pseudorandomness of the binary sequence $(s_n)$ defined by $s_n\equiv g_{n+1}+g_{n+2}\bmod 2$, $n=0,1,\ldots$. In particular, we study the…
We investigate the $k$-error linear complexity of pseudorandom binary sequences of period $p^{\mathfrak{r}}$ derived from the Euler quotients modulo $p^{\mathfrak{r}-1}$, a power of an odd prime $p$ for $\mathfrak{r}\geq 2$. When…
The paper studies discrete time processes and their predictability and randomness in deterministic pathwise setting, without using probabilistic assumptions on the ensemble. We suggest some approaches to quantification of randomness based…
The paper investigates the properties of a nonlinear recursive sequence which includes several ones studied formerly in the literature.
We provide a construction of binary pseudorandom sequences based on Hardy fields $\mathcal{H}$ as considered by Boshernitzan. In particular we give upper bounds for the well distribution measure and the correlation measure defined by…
We present deterministic techniques for computing upper and lower bounds on marginal probabilities in sigmoid and noisy-OR networks. These techniques become useful when the size of the network (or clique size) precludes exact computations.…
We characterize the expressive power of quantum circuits with the pseudo-dimension, a measure of complexity for probabilistic concept classes. We prove pseudo-dimension bounds on the output probability distributions of quantum circuits; the…
We introduce a hierarchy of fast-growing complexity classes and show its suitability for completeness statements of many non elementary problems. This hierarchy allows the classification of many decision problems with a non-elementary…
In this note, we extend the result of \cite{PoulyG16} about the complexity of solving polynomial differential equations over unbounded domains to work with non-rational input. In order to deal with arbitrary input, we phrase the result in…
We estimate the frequency of polynomial iterations which falls in a given multiplicative subgroup of a finite field of $p$ elements. We also give a lower bound on the size of the subgroup which is multiplicatively generated by the first $N$…
We prove lower bounds for higher-order methods in smooth non-convex finite-sum optimization. Our contribution is threefold: We first show that a deterministic algorithm cannot profit from the finite-sum structure of the objective, and that…