相关论文: On the 2-Adic Complexity of the Ding-Helleseth-Mar…
We consider finite iterated generalized harmonic sums weighted by the binomial $\binom{2k}{k}$ in numerators and denominators. A large class of these functions emerges in the calculation of massive Feynman diagrams with local operator…
Let $D_{n,\gamma}$ be the complex of graphs on $n$ vertices and domination number at least $\gamma$. We prove that $D_{n,n-2}$ has the homotopy type of a finite wedge of 2-spheres. This is done by using discrete Morse theory techniques.…
We describe the trace representations of two families of binary sequences derived from Fermat quotients modulo an odd prime $p$ (one is the binary threshold sequences, the other is the Legendre-Fermat quotient sequences) via determining the…
We study the complexity of multiplication of two elements in a finite field extension given by their coordinates in a normal basis. We show how to control this complexity using the arithmetic and geometry of algebraic curves.
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…
The determination of the density functions for products of random elements from specified classes of matrices is a basic problem in random matrix theory and is also of interest in theoretical physics. For connected simple Lie groups of…
We extend existing results for the Nielsen complexity of scalar primaries and spinning primaries in four dimensions by including supersymmetry. Specifically, we study the Nielsen complexity of circuits that transform a superconformal…
In many time-harmonic electromagnetic wave problems, the considered geometry exhibits an axial symmetry. In this case, by exploiting a Fourier expansion along the azimuthal direction, fully three-dimensional (3D) calculations can be carried…
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…
In recent developments, a general approach for solving Riemann--Hilbert problems numerically has been developed. We review this numerical framework, and apply it to the calculation of orthogonal polynomials on the real line. Combining this…
We consider the case of the Dark Two Higgs Doublet Model (D2HDM) where a $U(1)'$ symmetry group and an extra Higgs doublet are added to the Standard Model. This model leads to a gauge singlet particle as an interesting Dark Matter (DM)…
In this paper, constructions of some double circulant self-dual codes by generalized cyclotomic classes of order two are presented. This technique is applied to [72, 36, 12] binary highest know self-dual codes to obtain self-dual codes over…
Discrete Hahn polynomials (DHPs) and their moments are considered to be one of the efficient orthogonal moments and they are applied in various scientific areas such as image processing and feature extraction. Commonly, DHPs are used as…
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…
Gau{\ss}-Manin determinant connections associated to irregular connections on a curve are studied. The determinant of the Fourier transform of an irregular connection is calculated. The determinant of cohomology of the standard rank 2…
Inspired by the works of L. Carlitz and Z.-W. Sun on cyclotomic matrices, in this paper, we investigate certain cyclotomic matrices involving Gauss sums over finite fields, which can be viewed as finite field analogues of certain matrices…
The Hamiltonian cycle problem (HCP) in digraphs D with degree bound two is solved by two mappings in this paper. The first bijection is between an incidence matrix C_{nm} of simple digraph and an incidence matrix F of balanced bipartite…
We consider the $k$-error linear complexity of binary sequences derived from Eluer quotients modulo $2p$ ($p>3$ is an odd prime), recently introduced by J. Zhang and C. Zhao. We adopt certain decimal sequences to determine the values of…
We show that, with the exception of the words $a^2ba^2$ and $b^2ab^2$, all (finite or infinite) binary patterns in the Prouhet-Thue-Morse sequence can actually be found in that sequence as segments (up to exchange of letters in the infinite…
Given a sequence of finite element spaces which form a de Rham sequence, we will construct a dual representation of these spaces with associated differential operators which connect these spaces such that they also form a de Rham sequence.…