相关论文: A lower bound on the 2-adic complexity of modified…

Consider a $1$-dimensional centered Gaussian process $W$ with $\alpha$-H\"older continuous paths on the compact intervals of $\mathbb R_+$ ($\alpha\in ]0,1[$) and $W_0 = 0$, and $X$ the local solution in rough paths sense of Jacobi's…

The problem of determining cyclotomic numbers in terms of the solutions of certain Diophantine systems has been treated by many authors since the age of Gauss. In this paper we obtain an explicit expression for cyclotomic numbers of order…

We present an algorithm for solving the discrete logarithm problem in Jacobians of families of plane curves whose degrees in $X$ and $Y$ are low with respect to their genera. The finite base fields $\FF_q$ are arbitrary, but their sizes…

Let $S_n$ be the symmetric group of all permutations of $\{1, \cdots, n\}$ with two generators: the transposition switching $1$ with $2$ and the cyclic permutation sending $k$ to $k+1$ for $1\leq k\leq n-1$ and $n$ to $1$ (denoted by…

Traditional global stability measure for sequences is hard to determine because of large search space. We propose the $k$-error linear complexity with a zone restriction for measuring the local stability of sequences. Accordingly, we can…

We study the computational complexity of a very basic problem, namely that of finding solutions to a very large set of random linear equations in a finite Galois Field modulo q. Using tools from statistical mechanics we are able to identify…

This article presents a validation of a recently proposed strongly polynomial-time algorithm for the general linear programming problem. The proposed algorithm is an implicit reduction procedure that combines primal and dual linear…

In the recent breakthrough paper by Barbulescu, Gaudry, Joux and Thom{\'e}, a quasi-polynomial time algorithm (QPA) is proposed for the discrete logarithm problem over finite fields of small characteristic. The time complexity analysis of…

The relativistic nuclear recoil, higher-order interelectronic-interaction, and screened QED corrections to the transition energies in Li-like ions are evaluated. The calculation of the relativistic recoil effect is performed to all orders…

We study the bit complexity of two methods, related to the Euclidean algorithm, for computing cubic and quartic analogs of the Jacobi symbol. The main bottleneck in such procedures is computation of a quotient for long division. We give…

We use the Burgess bound and combinatorial sieve to obtain an upper bound on the number of primes $p$ in a dyadic interval $[Q,2Q]$ for which a given interval $[u+1,u+\psi(Q)]$ does not contain a quadratic non-residue modulo $p$. The bound…

We consider the higher-order resummation of Sudakov double logarithms in the presence of multiple coupled gauge interactions. The associated evolution equations depend on the coupled $\beta$ functions of two (or more) coupling constants…

We look for spectral type differential equations satisfied by the generalized Jacobi polynomials which are orthogonal on the interval [-1,1] with respect to a weight function consisting of the classical Jacobi weight function together with…

The spectrum of three-diagonal self-adjoint $p$-periodic Jacobi matrix with positive off-diagonal elements $a_n$ an real diagonal elements $b_n$ consist of intervals separated by $p-1$ gaps $\gamma_i$, where some of the gaps can be…

We derive an upper bound for the time needed to implement a generic unitary transformation in a $d$ dimensional quantum system using $d$ control fields. We show that given the ability to control the diagonal elements of the Hamiltonian,…

We present several series of synchronizing automata with multiple parameters, generalizing previously known results. Let p and q be two arbitrary co-prime positive integers, q > p. We describe reset thresholds of the colorings of primitive…

We consider the weight distributions of the cosets of weight 2 of the generalized $[q+1,q+2-d,d]_q$ doubly extended Reed-Solomon codes (GDRS) of minimum distance $d\ge5$, over the finite field $\mathbb{F}_q$ with $q$ elements. For a GDRS…

A family of quaternary sequences over Z4 is defined based on the Ding-Helleseth generalized cyclotomic classes modulo pq for two distinct odd primes p and q. The linear complexity is determined by computing the defining polynomial of the…

This contribution deals with the sequence $\{\mathbb{U}_{n}^{(a)}(x;q,j)\}_{n\geq 0}$ of monic polynomials, orthogonal with respect to a Sobolev-type inner product related to the Al-Salam--Carlitz I orthogonal polynomials, and involving an…

We construct and study two series of curves whose Jacobians admit complex multiplication. The curves arise as quotients of Galois coverings of the projective line with Galois group metacyclic groups $G_{q,3}$ of order $3q$ with $q \equiv 1…