Related papers: A Multi-Dimensional Block-Circulant Perfect Array …
In this paper we study properties of complete sets and of completions of sets in Banach spaces. We consider the family of completions of a given set and its size; we also study in detail the relationships concerning diameters, radii, and…
For a type-I $(K,M,Z,N)$-ZCCS, it follows $K \leq M \left\lfloor \frac{N}{Z}\right\rfloor$. In this paper, we propose a construction of type-II $(p^{k+n},p^k,p^{n+r}-p^r+1,p^{n+r})$-$Z$ complementary code set (ZCCS) using an extended…
Multicarrier code-division multiple-access (MC-CDMA) combines an orthogonal frequency division multiplexing (OFDM) modulation and a code-division multiple-access (CDMA) scheme to exploits the benefits of both the technologies. The high…
With a computer-aided approach based on the connection with equitable partitions, we establish the uniqueness of the orthogonal array OA$(1536,13,2,7)$, constructed in [D.G.Fon-Der-Flaass. Perfect $2$-Colorings of a Hypercube, Sib. Math. J.…
We present a construction for complementary pairs of arrays that exploits a set of mutually-unbiased bases, and enumerate these arrays as well as the corresponding set of complementary sequences obtained from the arrays by projection. We…
In this paper, we prove existence of optimal complementary dual codes (LCD codes) over large finite fields. We also give methods to generate orthogonal matrices over finite fields and then apply them to construct LCD codes. Construction…
Perfect matching width is a treewidth-like parameter designed for graphs with perfect matchings. The concept was originally introduced by Norine for the study of non-bipartite Pfaffian graphs. Additionally, perfect matching width appears to…
The fractionalization of global symmetry charges is a striking hallmark of topological quantum order. Here, we discuss the fractionalization of subsystem symmetries in two-dimensional topological phases. In line with previous no-go…
We introduce a symmetry class for higher dimensional partitions - fully complementary higher dimensional partitions (FCPs) - and prove a formula for their generating function. By studying symmetry classes of FCPs in dimension 2, we define…
The Krotov combining construction of perfect 1-error-correcting binary codes from 2000 and a theorem of Heden saying that every non-full-rank perfect 1-error-correcting binary code can be constructed by this combining construction is…
Our aim is to give a fairly complete account on the construction of compatible model structures on exact categories and symmetric monoidal exact categories, in some cases generalizing previously known results. We describe the close…
The paper constructs an infinite sequence of strongly regular directed graphs. The construction is based on representing adjacency matrices as block matrices composed of circulant blocks, together with the use of a compactification…
We present a completeness characterization of box splines on three-directional triangulations, also called Type-I box spline spaces, based on edge-contact smoothness properties. For any given Type-I box spline, of specific maximum degree…
An Orthogonally resolvable Matching Design OMD$(n, k)$ is a partition of the edges the complete graph $K_n$ into matchings of size $k$, called blocks, such that the blocks can be resolved in two different ways. Such a design can be…
We provide an equivariant extension of Carlsson's BGG correspondence in characteristic two. As an application we classify perfect cochain complexes of $(\mathbb{Z}/2\times \mathbb{Z}/2)\rtimes Q$-representations with four-dimensional total…
We introduce appropriate definitions of dimensions in order to characterize the fractal properties of complex networks. We compute these dimensions in a hierarchically structured network of particular interest. In spite of the nontrivial…
Here we consider higher Chern classes of vector bundles of conformal blocks on $\overline{\operatorname{M}}_{0,n}$, giving explicit formulas for them, and extending various results that hold for first Chern classes to them. We use these…
In the paper we first construct a new cotorsion pair, in the category of chain complexes, from two given cotorsion pairs in the category of modules, and then we consider completeness of such pairs under certain conditions.
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''…
Near MDS (NMDS) codes are closely related to interesting objects in finite geometry and have nice applications in combinatorics and cryptography. But there are many unsolved problems about construction of NMDS codes. In this paper, by using…