Related papers: On the $k$-error linear complexity of binary seque…

Primitive roots of 1 mod p^k (k>2 and odd prime p) are sought, in cyclic units group G_k = A_k B_k mod p^k, coprime to p, of order (p-1)p^{k-1}. 'Core' subgroup A_k has order p-1 independent of k, and p+1 generates 'extension' subgroup B_k…

We consider rate R = k/n causal linear codes that map a sequence of k-dimensional binary vectors {b_t} to a sequence of n-dimensional binary vectors {c_t}, such that each c_t is a function of {b_1,b_2,...,b_t}. Such a code is called anytime…

Permutation polynomials over a ring of modulo $2^w$ are compatible with digital computers and digital signal processors, and so they are in particular expected to be useful for cryptography and pseudo random number generator. In general,…

Since the introduction of the Kolmogorov complexity of binary sequences in the 1960s, there have been significant advancements in the topic of complexity measures for randomness assessment, which are of fundamental importance in theoretical…

Linear differential equations with polynomial coefficients over a field $K$ of positive characteristic $p$ with local exponents in the prime field have a basis of solutions in the differential extension $\mathcal{R}_p=K(z_1, z_2,…

Two words $w_1$ and $w_2$ are said to be $k$-binomial equivalent if every non-empty word $x$ of length at most $k$ over the alphabet of $w_1$ and $w_2$ appears as a scattered factor of $w_1$ exactly as many times as it appears as a…

We prove a priori estimates for solutions of order $2$ linear elliptic PDEs in divergence form on subanalytic domains. More precisely, we study the solutions of a strongly elliptic equation $Lu=f$, with $f\in L^2(\mathcal{\Omega})$ and…

We consider quantum, nondterministic and probabilistic versions of known computational model Ordered Read-$k$-times Branching Programs or Ordered Binary Decision Diagrams with repeated test ($k$-QOBDD, $k$-NOBDD and $k$-POBDD). We show…

Let $f=a\x+\x^{3q-2}\in\Bbb F_{q^2}[\x]$, where $a\in\Bbb F_{q^2}^*$. We prove that $f$ is a permutation polynomial of $\Bbb F_{q^2}$ if and only if one of the following occurs: (i) $q=2^e$, $e$ odd, and $a^{\frac{q+1}3}$ is a primitive…

In this work, we study the computational complexity of quantum determinants, a $q$-deformation of matrix permanents: Given a complex number $q$ on the unit circle in the complex plane and an $n\times n$ matrix $X$, the $q$-permanent of $X$…

In the present paper we consider $F_k(x)=x^{k}-\sum_{t=0}^{k-1}x^t,$ the characteristic polynomial of the $k$-th order Fibonacci sequence, the latter denoted $G(k,l).$ We determine the limits of the real roots of certain odd and even degree…

We consider the computational complexity of training depth-2 neural networks composed of rectified linear units (ReLUs). We show that, even for the case of a single ReLU, finding a set of weights that minimizes the squared error (even…

The paper provides results regarding the computational complexity of hybrid system identification. More precisely, we focus on the estimation of piecewise affine (PWA) maps from input-output data and analyze the complexity of computing a…

Let $K$ be a totally real number field and consider a Fermat-type equation $Aa^p+Bb^q=Cc^r$ over $K$. We call the triple of exponents $(p,q,r)$ the signature of the equation. We prove various results concerning the solutions to the Fermat…

We prove that the binary complexity of solving ordinary polynomial differential equations in terms of Puiseux series is single exponential in the number of terms in the series. Such a bound was given by Grigoriev [10] for Riccatti…

We study the relationship between two measures of pseudorandomness for families of binary sequences: family complexity and cross-correlation measure introduced by Ahlswede et al.\ in 2003 and recently by Gyarmati et al., respectively. More…

We study the logarithm of the least common multiple of the sequence of integers given by $1^2+1, 2^2+1,..., n^2+1$. Using a result of Homma on the distribution of roots of quadratic polynomials modulo primes we calculate the error term for…

The motivation for this paper is to study the complexity of constant-width arithmetic circuits. Our main results are the following. 1. For every k > 1, we provide an explicit polynomial that can be computed by a linear-sized monotone…

This document is a companion for the Maple program : Discrete series and K-types for U(p,q) available on:http://www.math.jussieu.fr/~vergne We explain an algorithm to compute the multiplicities of an irreducible representation of U(p)x U(q)…

Many famous integer sequences including the Catalan numbers and the Motzkin numbers can be expressed in the form $ConstantTermOf\left[P(x)^nQ(x)\right]$ for Laurent polynomials $Q$, and symmetric Laurent trinomials $P$. In this paper we…