Related papers: On the 2-Adic Complexity of the Ding-Helleseth-Mar…

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…

Let K be a number field with euclidean ring of integers O. Let G be a finite-index torsion-free subgroup of Sp(2n, O). We exhibit a finite, geometrically defined spanning set of the top dimensional integral cohomology of G by generalizing…

The fractional Brownian motion can be considered as a Gaussian field indexed by $(t,H)\in {\mathbb{R}_{+}\times (0,1)}$, where $H$ is the Hurst parameter. On compact time intervals, it is known to be almost surely jointly H\"older…

For a class of orthogonal polynomials related to the $q$-Meixner polynomials corresponding to an indeterminate moment problem we give a one-parameter family of orthogonality measures. For these measures we complement the orthogonal…

Nonlinear complexity, as an important measure for assessing the randomness of sequences, is defined as the length of the shortest feedback shift registers that can generate a given sequence. In this paper, the structure of n-periodic binary…

An elementary approach is shown which derives the values of the Gauss sums over $\mathbb F_{p^r}$, $p$ odd, of a cubic character without using Davenport-Hasse's theorem. New links between Gauss sums over different field extensions are shown…

We design efficient algorithms to evaluate modular equations of Siegel and Hilbert type for abelian surfaces over number fields or finite fields using complex approximations. Their output is provably correct when the associated graded ring…

We give an estimation of the existence density for the $2d$ different primes by using a new and simple algorithm for getting the $2d$ different primes. The algorithm is a kind of the sieve method, but the remainders are the central numbers…

We study the 'critical moments' of subcritical Gaussian multiplicative chaos (GMCs) in dimensions $d \leq 2$. In particular, we establish a fully explicit formula for the leading order asymptotics, which is closely related to large…

We present a recursive minimal polynomial theorem for finite sequences over a commutative integral domain $D$. This theorem is relative to any element of $D$. The ingredients are: the arithmetic of Laurent polynomials over $D$, a recursive…

In this paper, the construction of finite-length binary sequences whose nonlinear complexity is not less than half of the length is investigated. By characterizing the structure of the sequences, an algorithm is proposed to generate all…

In this paper we apply the boundary elements method (BEM) and the dual reciprocity boundary elements method (DRBEM) for the numerical solution of two-dimensional time-fractional partial differential equations (TFPDEs). The fractional…

Binary duadic codes are an interesting subclass of cyclic codes since they have large dimensions and their minimum distances may have a square-root bound. In this paper, we present several families of binary duadic codes of length $2^m-1$…

We consider solutions of the $2\times 2$ matrix Hamiltonian of physical systems within the context of the asymptotic iteration method. Our technique is based on transformation of the associated Hamiltonian in the form of the first order…

Let $(A,\mathfrak{m})$ be a regular local ring of dimension $d \geq 1$. Let $\mathcal{D}^2_{fg}(A)$ denote the derived category of $2$-periodic complexes with finitely generated cohomology modules. Let $\mathcal{K}^2(\proj A) $ denote the…

In this paper, we construct a binary linear code connected with the Kloosterman sum for $GL(2,q)$. Here $q$ is a power of two. Then we obtain a recursive formula generating the power moments 2-dimensional Kloosterman sum, equivalently that…

In the first part of the article we study Hamiltonian diffeomorphisms of $\mathbb{R}^{2n}$ which are generated by sub-quadratic Hamiltonians and prove a middle dimensional rigidity result for the image of coisotropic cylinders. The tools…

We study the complexity of counting (weighted) planar graph homomorphism problem $\tt{Pl\text{-}GH}(M)$ parametrized by an arbitrary symmetric non-negative real valued matrix $M$. For matrices with pairwise distinct diagonal values, we…

Electromagnetic field is considered in the framework of Clifford algebra $\C_2$ over a field of complex numbers. It is shown here that a modulo 2 periodicity of complex Clifford algebras may be connected with electromagnetic field.

In this paper we consider finite-dimensional constrained Hamiltonian systems of polynomial type. In order to compute the complete set of constraints and separate them into the first and second classes we apply the modern algorithmic methods…