Related papers: Linear Complexity of Ding-Helleseth Generalized Cy…
We introduce generalized hypergeometric Bernoulli numbers for Dirichlet characters. We study their properties, including relations, expressions and determinants. At the end in Appendix we derive first few expressions of these numbers.
Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for a prime $p$, we determine the explicit complete weight enumerators of a family of linear codes over $\mathbb{F}_p$ with defining set…
We study a simple generalization of the rotation (or circular shift) of the binary sequences. In particular, we show each orbit of this generalized rotation has a certain statistical symmetry. This generalized rotation naturally arises when…
In this article, we study the palindromic length sequences of the ruler sequence and of the period-doubling sequence. We give a precise formula of the palindromic length sequence of the first one and find a lower bound of the limit superior…
Linear complexity is an important parameter for arrays that are used in applications related to information security. In this work we survey constructions of two and three dimensional arrays, and present new results on the multidimensional…
This is the English version of the paper: "Complejidad de los n\'umeros naturales", Gaceta de la Real Sociedad Matem\'atica Espa\~nola 3 (2000) 230--250. In this paper, several conjectures about the complexity of natural numbers are…
We prove a lower bound expressed in the increment sequence on the average-case complexity of the number of inversions of Shellsort. This lower bound is sharp in every case where it could be checked. A special case of this lower bound yields…
Lie symmetries of systems of second-order linear ordinary differential equations with constant coefficients are exhaustively described over both the complex and real fields. The exact lower and upper bounds for the dimensions of the maximal…
We prove that for every $n$-vertex graph $G$, the extension complexity of the correlation polytope of $G$ is $2^{O(\mathrm{tw}(G) + \log n)}$, where $\mathrm{tw}(G)$ is the treewidth of $G$. Our main result is that this bound is tight for…
The dual complex of a singularity is defined, up-to homotopy, using resolutions of singularities. In many cases, for instance for isolated singularities, we identify and study a "minimal" representative of the homotopy class that is well…
A priori estimates for the weak solutions the Dirichlet problem for the uniformly higher-order elliptic equations in a smooth bounded domain $\Omega\subset \Rn$ in generalized weighted Sobolev-Morrey spaces are obtained.
Improved performance in higher-order spectral density estimation is achieved using a general class of infinite-order kernels. These estimates are asymptotically less biased but with the same order of variance as compared to the classical…
In this paper we present a generalization of the classical Hermite polynomials to the framework of Clifford-Dunkl operators. Several basic properties, such as orthogonality relations, recurrence formulae and associated differential…
A class of generalized Schr\"{o}dinger elliptic problems involving concave-convex and other types of nonlinearities is studied. A reasonable overview about the set of solutions is provided when the parameters involved in the equation assume…
We prove that the geodesic complexity of a regular tetrahedron exceeds its topological complexity by 1 or 2. The proof involves a careful analysis of minimal geodesics on the tetrahedron.
We introduce a family of generalized Broughton polynomials and compute the characteristic varieties of complement of a curve arrangement defined by fibers of some generalized Broughton polynomials
The Lie linearizability criteria are extended to complex functions for complex ordinary differential equations. The linearizability of complex ordinary differential equations is used to study the linearizability of corresponding systems of…
This paper presents a combinatorial analog of topological complexity for finite spaces. We demonstrate that this coincides with the genuine topological complexity of the original finite space, and constitutes an upper bound for the…
This paper presents a graded hierarchy or chain of binary operations on the reals and the complex numbers. The operations are related distributively in the sense that any one of them distributes over the next lower operation in the chain.…
Leech's (co)homology groups of finite cyclic monoids are computed.