Related papers: Triple arrays from difference sets
We show how one can use the skew braces constructed using abelian maps to generate families of skew bracoids as defined by Martin-Lyons and Truman. Under certain circumstances, these bracoids give right non-degenerate solutions to the…
In this paper we construct exponentionally many non-isomorphic skew Hadamard difference sets over an elementary abelian group of order $q^3$.
A $(v,k,\lambda, \mu)$-partial difference set (PDS) is a subset $D$ of a group $G$ such that $|G| = v$, $|D| = k$, and every nonidentity element $x$ of $G$ can be written in either $\lambda$ or $\mu$ different ways as a product $gh^{-1}$,…
We study the problem of constructing mutually unbiased bases in dimension six. This approach is based on an efficient numerical method designed to find solutions to the quantum state reconstruction problem in finite dimensions. Our…
We construct 3-manifolds which have at least two inequivalent embeddings such that both complementary regions have abelian fundamental group.
It is shown that a normalized complex Hadamard matrix of order $6$ having three distinct columns, each containing at least one $-1$ entry necessarily belongs to the transposed Fourier family, or to the family of $2$-circulant complex…
We study pairs and triples consisting of triangular numbers such that the product of any two distinct elements decreased by 1 is a perfect square. For a positive integer $n$, we establish a necessary condition for the $n$-th triangular…
A linking system of difference sets is a collection of mutually related group difference sets, whose advantageous properties have been used to extend classical constructions of systems of linked symmetric designs. The central problems are…
Recently, Feng and Xiang \cite{FX113} found a new construction of skew Hadamard difference sets in elementary abelian groups. In this paper, we introduce a new invariant for equivalence of skew Hadamard difference sets, namely triple…
The traditional construction of primitive Pythagorean triples by the formulas of two independent variables does not allow their ordering. The paper shows a new view on the construction of primitive Pythagorean triples. A method for…
In this work, we provide a simple way to construct $d$-abelian categories via bounded derived categories for certain values of $d$. Namely, let ${\mathcal C}$ be an abelian category, and let ${\mathcal C}[0,m]$ denote the full subcategory…
A difference matrix over a group is a discrete structure that is intimately related to many other combinatorial designs, including mutually orthogonal Latin squares, orthogonal arrays, and transversal designs. Interest in constructing…
In this note, we apply some techniques developed in [1]-[3] to give a particular construction of bivariate Abelian Codes from cyclic codes, multiplying their dimension and preserving their apparent distance. We show that, in the case of…
We construct finite sets of real numbers that have a small difference set and strong local properties. In particular, we construct a set $A$ of $n$ real numbers such that $|A-A|=n^{\log_2 3}$ and that every subset $A'\subseteq A$ of size…
Difference sets have been studied for more than 80 years. Techniques from algebraic number theory, group theory, finite geometry, and digital communications engineering have been used to establish constructive and nonexistence results. We…
Most of the examples of wavelet sets are for dilation sets which are groups. We find a necessary and sufficient condition under which subspace wavelet sets exist for dilation sets of the form $A B$, which are not necessarily groups. We…
In this paper, the author introduces new methods to construct Archimedean copulas. The generator of each copula fulfills the sufficient conditions as regards the boundary and being continuous, decreasing, and convex. Each inverse generator…
In this paper, we study a class of linear codes defined by characteristic functions of certain subsets of a finite field. We derive a sufficient and necessary condition for such a code to be a minimal linear code by a character-theoretical…
We start by constructing a new root system for rational triple singularities and determine the number of roots for each rational triple singularity. Then we show that, for each root, we obtain a linear free divisor. So we obtain a new…
A graph is $n$-e.c. ($n$-existentially closed) if for every pair of subsets $A, B$ of vertex set $V$ of the graph such that $A \cap B = \emptyset$ and $|A| + |B| = n$, there is a vertex $z$ not in $A \cup B$ joined to each vertex of $A$ and…