Related papers: Some new near-normal sequences

We classify binary completely regular codes of length $m$ with minimum distance $\delta$ for $(m,\delta)=(12,6)$ and $(11,5)$. We prove that such codes are unique up to equivalence, and in particular, are equivalent to certain Hadamard…

Let $n$ be the order of a (quaternary) Hadamard matrix. It is shown that the existence of a projective plane of order $n$ is equivalent to the existence of a balancedly multi-splittable (quaternary) Hadamard matrix of order $n^2$.

We study how universality classes of O(N)-symmetric models depend continuously on the dimension d and the number of field components N. We observe, from a renormalization group perspective, how the implications of the…

We discuss coincidences of pairs (f_1, f_2) of maps between manifolds. We recall briefly the definition of four types of Nielsen numbers which arise naturally from the geometry of generic coincidences. They are lower bounds for the minimum…

The relationship between sequences and secondary structures or shapes in RNA exhibits robust statistical properties summarized by three notions: (1) the notion of a typical shape (that among all sequences of fixed length certain shapes are…

Two new classes of networks are introduced that resemble small-world properties. These networks are recursively constructed but retain a fixed, regular degree. They consist of a one-dimensional lattice backbone overlayed by a hierarchical…

We consider the alternating sign matrices of the odd order that have some kind of central symmetry. Namely, we deal with matrices invariant under the half-turn, quarter-turn and flips in both diagonals. In all these cases, there are two…

A nut graph is a simple graph whose adjacency matrix is singular with $1$-dimensional kernel such that the corresponding eigenvector has no zero entries. In 2020, Fowler et al. characterised for each $d \in \{3,4,\ldots,11\}$ all values $n$…

Given a real number $0.a_1a_2 a_3\dots$ that is normal to base $b$, we examine increasing sequences $n_i$ so that the number $0.a_{n_1}a_{n_2}a_{n_3}\dots$ are normal to base $b$. Classically it is known that if the $n_i$ form an arithmetic…

Peter Lappan in [9] proved that for each $n\in \mathbb{N}=\{1,2,3,\dots\}$, let $f_{1,n}, f_{2,n}$ and $f_{3,n}$ be three continuous functions on $\mathbb{D}:=\{z\in \mathbb{C} : |z| < 1\}$ such that for each $j=1,2,3,$ the sequence…

In this paper, we study $\Delta$- convergence of iterations for a sequence of strongly quasi-nonexpansive mappings as well as the strong convergence of the Halpern type regularization of them in Hadamard spaces. Then, we give some their…

We present new constructions for perfect and odd perfect sequences over the quaternion group $Q_8$. In particular, we show for the first time that perfect and odd perfect quaternion sequences exist in all lengths $2^t$ for $t\geq0$. In…

M. B. Levin used Sobol-Faure low discrepancy sequences with Pascal matrices modulo $2$ to construct, for each integer $b$, a real number $x$ such that the first $N$ terms of the sequence $(b^n x \mod 1)_{n\geq 1}$ have discrepancy $O((\log…

We give a complete characterization of simple graphs whose adjacency matrices generate binary linear complementary dual (LCD) codes. In particular, we completely characterize a distance-regular graph which yields an LCD code in terms of the…

Ascent sequences are those consisting of non-negative integers in which the size of each letter is restricted by the number of ascents preceding it and have been shown to be equinumerous with the (2+2)-free posets of the same size.…

The Stern sequence (s(n)) is defined by s(0) = 0, s(1) = 1, s(2n) = s(n), s(2n+1) = s(n) + s(n+1). Stern showed in 1858 that gcd(s(n),s(n+1)) = 1, and that for every pair of relatively prime positive integers (a,b), there exists a unique n…

Let $n$ be a natural number. Recall that a C*-algebra is said to be $n$-subhomogeneous if all its irreducible representations have dimension at most $n$. In this short note, we give various approximation properties characterising…

In earlier papers, we showed a decomposition of 2-diregular digraphs (2-dds) and used it to provide some sufficient conditions for these graphs to be non-Hamiltonian; we also showed a close connection between the permanent and determinant…

It is conjectured that Hadamard matrices exist for all orders $4t$ ($t>0$). However, despite a sustained effort over more than five decades, the strongest overall existence results are asymptotic results of the form: for all odd natural…

The idea of decomposing a matrix into a product of structured matrices such as triangular, orthogonal, diagonal matrices is a milestone of numerical computations. In this paper, we describe six new classes of matrix decompositions,…