English
Related papers

Related papers: Perfect Sequences and Arrays over the Unit Quatern…

200 papers

We propose a new method of constructing q-ary propelinear perfect codes. The approach utilizes permutations of the fixed length q-ary vectors that arise from the automorphisms of the regular subgroups of the affine group. For any prime q it…

Combinatorics · Mathematics 2021-12-17 Ivan Mogilnykh

We prove two-term supercongruences for generalizations of recently discovered sporadic sequences of Cooper. We also discuss recent progress and future directions concerning other types of supercongruences.

Number Theory · Mathematics 2021-02-04 Robert Osburn , Brundaban Sahu , Armin Straub

A coprime array receiver processes a collection of received-signal snapshots to estimate the autocorrelation matrix of a larger (virtual) uniform linear array, known as coarray. By the received-signal model, this matrix has to be (i)…

Signal Processing · Electrical Eng. & Systems 2020-08-31 Dimitris G. Chachlakis , Panos P. Markopoulos

Let $ \prod_{i=1}^d (X-\alpha_i Y) \in{\mathbb C}[X,Y]$ be a binary form and let $\epsilon_1,\dots,\epsilon_d$ be nonzero complex numbers. We consider the family of binary forms $ \prod_{i=1}^d (X-\alpha_i \epsilon_i^aY)$, $a\in {\mathbb…

Number Theory · Mathematics 2018-02-15 Claude Levesque , Michel Waldschmidt

In Cayley graphs on the additive group of a small vector space over GF$(q)$, $q=2,3$, we look for completely regular (CR) codes whose parameters are new in Hamming graphs over the same field. The existence of a CR code in such Cayley graph…

Combinatorics · Mathematics 2024-11-15 Sergey Goryainov , Denis Krotov

Cross Z-complementary pairs (CZCPs) are a special kind of Z-complementary pairs (ZCPs) having zero autocorrelation sums around the in-phase position and end-shift position, also having zero cross-correlation sums around the end-shift…

Information Theory · Computer Science 2021-12-30 Hui Zhang , Cuiling Fan , Sihem Mesnager

In this paper, we study the periodicity structure of finite field linear recurring sequences whose period is not necessarily maximal and determine necessary and sufficient conditions for the characteristic polynomial~\(f\) to have exactly…

Combinatorics · Mathematics 2021-03-02 Ghurumuruhan Ganesan

We discuss the question whether the existence of perfect matchings in a cubic graph can be seen from the spectrum of its adjacency matrix. For regular graphs in general and for three edge-disjoint perfect matchings in a cubic graph (that…

Combinatorics · Mathematics 2026-01-08 Willem H. Haemers

A number which is either the square of an integer or two times the square of an integer is called squarish. There are two main results in the literature on graphs whose number of perfect matchings is squarish: one due to Jockusch (for…

Combinatorics · Mathematics 2024-04-16 Seok Hyun Byun , Mihai Ciucu

Let $S=(C \times D)/G$ be a surface isogenous to a higher product of unmixed type with $p_g=q=0$, $G=(\mathbb{Z}/2)^3$ or $(\mathbb{Z}/2)^4$. We construct exceptional sequences of maximal length and quasiphantom categories on $S$.

Algebraic Geometry · Mathematics 2014-05-19 Kyoung-Seog Lee

We consider a notion of exact sequences in any -not necessarily exact- pointed category relative to a given (E;M)-factorization structure. We apply this notion to introduce and investigate a new notion of exact sequences of semimodules over…

Category Theory · Mathematics 2011-11-03 Jawad Abuhlail

We deduce that the fundamental groups of the orbit configuration spaces of an effective and properly discontinuous action of a discrete group on a connected aspherical 2-manifold, with isolated fixed points, fit into a four-term exact…

Geometric Topology · Mathematics 2026-04-17 S. K. Roushon

We introduce a construction for families of 2n-dimensional arrays with asymptotically optimal pairwise cross-correlation. These arrays are constructed using a circulant array of n-dimensional Legendre arrays. We also introduce an…

Information Theory · Computer Science 2020-02-24 Sam Blake

We develop a family of simple rank one theories built over quite arbitrary sequences of finite hypergraphs. (This extends an idea from the recent proof that Keisler's order has continuum many classes, however, the construction does not…

Logic · Mathematics 2024-07-24 M. Malliaris , S. Shelah

Sequences with low/zero ambiguity zone (LAZ/ZAZ) properties are useful in modern communication and radar systems operating over mobile environments. This paper first presents a new family of ZAZ sequence sets motivated by the ``modulating''…

Information Theory · Computer Science 2025-03-20 Liying Tian , Xiaoshi Song , Zilong Liu , Yubo Li

The paper studies different variants of almost periodicity notion. We introduce the class of eventually strongly almost periodic sequences where some suffix is strongly almost periodic (=uniformly recurrent). The class of almost periodic…

Discrete Mathematics · Computer Science 2007-05-23 Yuri Pritykin

Starting from a result of Stewart, Tijdeman and Ruzsa on iterated difference sequences, we introduce the notion of iterated compositions of linear operations. We prove a general result on the stability of such compositions (with bounded…

Number Theory · Mathematics 2010-05-21 Norbert Hegyvári , Francois Hennecart , Alain Plagne

We introduce two-dimensional toroidal arrays that are a variant of the de Bruijn tori. We call them nested perfect toroidal arrays. Instead of asking that every array of a given size has exactly one occurrence, we partition the positions in…

Information Theory · Computer Science 2023-01-03 Verónica Becher , Olivier Carton

This paper initiates a theoretical investigation of $\frac{1}{4}$-oscillatory chain sequences $\{a_n\}$, generalizing Szwarc's classical framework for non-oscillatory chains \cite{Sz94, Sz98, Sz02, Sz03} to sequences fluctuating around…

Dynamical Systems · Mathematics 2026-05-13 Zejun Dai , Daxiong Piao , Jinglai Qiao

Let PCS_p^N denote a set of p binary sequences of length N such that the sum of their periodic auto-correlation functions is a delta-function. In the 1990, Boemer and Antweiler addressed the problem of constructing such sequences. They…

Information Theory · Computer Science 2009-09-01 Dragomir Z. Djokovic