Related papers: Periodic complementary sets of binary sequences
Multicriteria Decision Making problems are important both for individuals and groups. Pairwise comparisons have become popular in the theory and practice of preference modelling and quantification. We focus on decision problems where the…
This paper offers a comprehensive treatment of the question as to whether a binary relation can be consistent (transitive) without being decisive (complete), or decisive without being consistent, or simultaneously inconsistent or…
This paper establishes a new Chebyshev criterion for some family of integrals. By virtue of this criterion we obtain several new Chebyshev families. With the help of these new families we can answer the conjecture posed by Gasull et al in…
This paper explores the finiteness of the solution set of the polynomial complementarity problem (PCP). To achieve this goal, we introduce two new classes of structured tensor tuples, namely the nondegenerate tensor tuple and the strong…
We introduce the notion of a ${\cal PT}$-symmetric dimer with a $\chi^{(2)}$ nonlinearity. Similarly to the Kerr case, we argue that such a nonlinearity should be accessible in a pair of optical waveguides with quadratic nonlinearity and…
The classical 1991 result by Brightwell and Winkler states that the number of linear extensions of a poset is #P-complete. We extend this result to posets with certain restrictions. First, we prove that the number of linear extension for…
We obtain new non-existence results of perfect p-ary sequences with period n (called type $[p, n]$). The first case is a class with type [p\equiv5\pmod 8,p^aqn']. The second case contains five types [p\equiv3\pmod 4,p^aq^ln'] for certain…
The existence of $q$-ary linear complementary pairs (LCPs) of codes with $q> 2$ has been completely characterized so far. This paper gives a characterization for the existence of binary LCPs of codes. As a result, we solve an open problem…
In the realm of modern digital communication, cryptography, and signal processing, binary sequences with a low correlation properties play a pivotal role. In the literature, considerable efforts have been dedicated to constructing good…
We study the number of limit cycles bifurcating from a piecewise quadratic system. All the differential systems considered are piecewise in two zones separated by a straight line. We prove the existence of 16 crossing limit cycles in this…
A Barker sequence is a binary sequence for which all nontrivial aperiodic autocorrelations are at most 1 in magnitude. An old conjecture due to Turyn asserts that there is no Barker sequence of length greater than 13. In 1961, Turyn and…
This paper is concerned with the limit cycles for planar semi-quasi-homogeneous polynomial systems. We give some explicit criteria for the nonexistence and existence of periodic orbits. Let $N=N(p,q,m,n)$ be the maximum number of limit…
Given $\{P_n \}$ a sequence of monic orthogonal polynomials, we analyze their linear combinations $\{Q_n \}$with constant coefficients and fixed length $k+1$. Necessary and sufficient conditions are given for the orthogonality of the monic…
The aim of this paper is to formulate necessary conditions and sufficient ones for the existence of closed connected sets of nonstationary $2 \pi$-periodic solutions of $S^1$-symmetric Newtonian systems in $C_{2 \pi}([0,2\pi],\Omega) \times…
We construct periodic families of Poincare complexes, partially solving a question of Hodgson that was posed in the proceedings of the 1982 Northwestern homotopy theory conference. We also construct infinite families of Poincare complexes…
A general explicit upper bound is obtained for the proportion $P(n,m)$ of elements of order dividing $m$, where $n-1 \le m \le cn$ for some constant $c$, in the finite symmetric group $S_n$. This is used to find lower bounds for the…
Denote by p_k the k-th power sum symmetric polynomial n variables. The interpretation of the q-analogue of the binomial coefficient as Hilbert function leads us to discover that n consecutive power sums in n variables form a regular…
Binary Sidel'nikov-Lempel-Cohn-Eastman sequences (or SLCE sequences) over F 2 have even period and almost perfect autocorrelation. However, the evaluation of the linear complexity of these sequences is really difficult. In this paper, we…
In this paper, a new method is presented to compute the 2-adic complexity of pseudo-random sequences. With this method, the 2-adic complexities of all the known sequences with ideal 2-level autocorrelation are uniformly determined. Results…
In the proof of the irrationality of $\zeta(3)$ and $\zeta(2)$, Ap\'ery defined two integer sequences through $3$-term recurrences, which are known as the famous Ap\'ery numbers. Zagier, Almkvist--Zudilin and Cooper successively introduced…