Related papers: Some New Balanced and Almost Balanced Quaternary S…
We analyse the normal quotient structure of several infinite families of finite connected edge-transitive, four-valent oriented graphs. These families were singled out by Marusic and others to illustrate various different internal…
We construct new, previously unknown parametric families of complex conference matrices and of complex Hadamard matrices of square orders and related them to complex equiangular tight frames.
In this paper, we construct a seven-term exact sequence involving the cohomology groups of a group extension. Although the existence of such a sequence can be derived using spectral sequence arguments, there is little knowledge about some…
A cohomology theory is proposed for the recently discovered heptagon relation -- an algebraic imitation of a 5-dimensional Pachner move 4--3. In particular, `quadratic cohomology' is introduced, and it is shown that it is quite nontrivial,…
Recall that a non-singular planar quartic is a canonically embedded non-hyperelliptic curve of genus three. We say such a curve is symmetric if it admits non-trivial automorphisms. The classification of (necessarily finite) groups appearing…
This paper applies He's new amplitude-frequency relationship recently established by Ji-Huan He (Int J Appl Comput Math 3 1557-1560, 2017) to study periodic solutions of strongly nonlinear systems with odd nonlinearities. Some examples are…
We study the problem of finding an acyclic orientation of an undirected graph with constrained in-degree parities specified by a subset T of vertices. An orientation is called T -odd if a vertex v has odd in-degree if and only if v P T .…
A new approach is proposed to the quantitative estimation of the complexity of multidimensional discrete sequences in terms of the shapes of their trajectories in the extended space of states. This approach is based on the study of the…
New insight into the correspondence between Quantum Chaos and Random Matrix Theory is gained by developing a semiclassical theory for the autocorrelation function of spectral determinants. We study in particular the unitary operators which…
We give sufficient conditions for self-orthogonality with respect to symplectic, Euclidean and Hermitian inner products of a wide family of quasi-cyclic codes of index two. We provide lower bounds for the symplectic weight and the minimum…
Non-smooth saddle-node bifurcations give rise to minimal sets of interesting geometry built of so-called strange non-chaotic attractors. We show that certain families of quasiperiodically driven logistic differential equations undergo a…
Self-orthogonal codes are a subclass of linear codes that are contained within their dual codes. Since self-orthogonal codes are widely used in quantum codes, lattice theory and linear complementary dual (LCD) codes, they have received…
Computing the diameter, and more generally, all eccentricities of an undirected graph is an important problem in algorithmic graph theory and the challenge is to identify graph classes for which their computation can be achieved in…
The autocorrelation values of two classes of binary sequences are shown to be good in [6]. We study the 2-adic complexity of these sequences. Our results show that the 2-adic complexity of such sequences is large enough to resist the attack…
A class of binary sequences with period $2p$ is constructed using generalized cyclotomic classes, and their linear complexity, minimal polynomial over ${\mathbb{F}_{{q}}}$ as well as 2-adic complexity are determined using Gauss period and…
A classical branch of graph algorithms is graph transversals, where one seeks a minimum-weight subset of nodes in a node-weighted graph $G$ which intersects all copies of subgraphs~$F$ from a fixed family $\mathcal F$. Many such graph…
Base sequences BS(m,n) are quadruples (A;B;C;D) of {+1,-1}-sequences, A and B of length m and C and D of length n, the sum of whose non-periodic auto-correlation functions is zero. Base sequences and some special subclasses of BS(n+1,n)…
We introduce simple quadrature rules for the family of nonparametric nonconforming quadrilateral element with four degrees of freedom. Our quadrature rules are motivated by the work of Meng {\it et al.} \cite{meng2018new}. First, we…
We show that a number of conditions on oriented graphs, all of which are satisfied with high probability by randomly oriented graphs, are equivalent. These equivalences are similar to those given by Chung, Graham and Wilson in the case of…
We find new constructions of infinite families of skew Hadamard difference sets in elementary abelian groups under the assumption of the existence of cyclotomic strongly regular graphs. Our construction is based on choosing cyclotomic…