Related papers: Constructions and equivalence of Sidon spaces

Let $\cal M$ denote the set ${\cal S}_{n, q}$ of $n \times n$ symmetric matrices with entries in ${\rm GF}(q)$ or the set ${\cal H}_{n, q^2}$ of $n \times n$ Hermitian matrices whose elements are in ${\rm GF}(q^2)$. Then $\cal M$ equipped…

This work rests upon the certainty that only fields of real and complex numbers, quaternions and octonions have algebras of all four arithmetical operations. Also quaternions are good to represent 3-dimensional Euclid space and…

Skew polynomial rings were used to construct finite semifields by Petit in 1966, following from a construction of Ore and Jacobson of associative division algebras. In 1989 Jha and Johnson constructed the so-called cyclic semifields,…

Lattices and Z-modules in Euclidean space possess an infinitude of subsets that are images of the original set under similarity transformation. We classify such self-similar images according to their indices for certain 4D examples that are…

Let $\F_q^n$ be a vector space of dimension $n$ over the finite field $\F_q$. A $q$-analog of a Steiner system (briefly, a $q$-Steiner system), denoted $S_q[t,k,n]$, is a set $S$ of $k$-dimensional subspaces of $\F_q^n$ such that each…

Algebraic number theory relates SIC-POVMs in dimension $d>3$ to those in dimension $d(d-2)$. We define a SIC in dimension $d(d-2)$ to be aligned to a SIC in dimension $d$ if and only if the squares of the overlap phases in dimension $d$…

For a regular coupled cell network, synchrony subspaces are the polydiagonal subspaces that are invariant under the network adjacency matrix. The complete lattice of synchrony subspaces of an $n$-cell regular network can be seen as an…

Cyclic sieving is a well-known phenomenon where certain interesting polynomials, especially $q$-analogues, have useful interpretations related to actions and representations of the cyclic group. We propose a definition of sieving for an…

This paper examines in a new way some known facts about numerical semigroups especially when the number of minimal generators (that is the embedding dimension) is at most three and at least two minimal generators are coprime. For such…

Many groups possess highly symmetric generating sets that are naturally endowed with an underlying combinatorial structure. Such generating sets can prove to be extremely useful both theoretically in providing new existence proofs for…

We give the class of finite groups which arise as the permutation groups of cyclic codes over finite fields. Furthermore, we extend the results of Brand and Huffman et al. and we find the properties of the set of permutations by which two…

We investigate closed subsets (subsemigroups, resp.) of compact-like topological spaces (semigroups, resp.). We prove that each Hausdorff topological space can be embedded as a closed subspace into an H-closed topological space. However,…

In this article, we construct a $16$-dimensional sedenion-like associative algebra, which is an even subalgebra of $2^5$-dimensional Clifford algebra $Cl_{5,0}$. We define the norm on sedenion-like algebra and show that its…

A new construction of naturally reductive spaces is presented. This construction gives a large amount of new families of naturally reductive spaces. First the infinitesimal models of the new naturally reductive spaces are constructed. A…

In 2003 Peter Cameron introduced the concept of a Jordan scheme and asked whether there exist Jordan schemes which are not symmetrisations of coherent configurations (proper Jordan schemes). The question was answered affirmatively by the…

Constant-dimension subspace codes (CDCs), a special class of subspace codes, have attracted significant attention due to their applications in network coding. A fundamental research problem of CDCs is to determine the maximum number of…

Cylindric plane partitions may be thought of as a natural generalization of reverse plane partitions. A generating series for the enumeration of cylindric plane partitions was recently given by Borodin. The first result of this paper is a…

Cyclic codes over finite fields are widely implemented in data storage systems, communication systems, and consumer electronics, as they have very efficient encoding and decoding algorithms. They are also important in theory, as they are…

Due to wide applications of binary sequences with low correlation to communications, various constructions of such sequences have been proposed in literature. However, most of the known constructions via finite fields make use of the…

We construct the quaternion algebra [10] "geometrically" by a three dimensional analogue of the classic two dimensional geometric description of the complex field. The algebraic description of the multiplication operation in three…