Related papers: New results on D-optimal Matrices
Ordinary differential equations (ODEs) and ordinary difference systems (O$\Delta$Ss) invariant under the actions of the Lie groups $\mathrm{SL}_x(2)$, $\mathrm{SL}_y(2)$ and $\mathrm{SL}_x(2)\times\mathrm{SL}_y(2)$ of projective…
Let C be a linear code with length n and minimum distance d. The stopping redundancy of C is defined as the minimum number of rows in a parity-check matrix for C such that the smallest stopping sets in the corresponding Tanner graph have…
This article is the third in a series the aim of which is to use Lie group theory to obtain exact analytic solutions of Delay Ordinary Differential Systems (DODSs). Such a system consists of two equations involving one independent variable…
Several intersection matrices of $s$-subsets vs. $k$-subsets of a $v$-set are introduced in the literature. We study these matrices systematically through counting arguments and generating function techniques. A number of new or known…
We provide an algorithm to construct unitary matrices over finite fields. We present various constructions of Hermitian self-dual code by means of unitary matrices, where some of them generalize the quadratic double circulant constructions.…
We introduce a new duality for $\mathcal{N}=1$ supersymmetric gauged matrix models. This $0d$ duality is an order 4 symmetry, namely an equivalence between four different theories, hence we call it Quadrality. Our proposal is motivated by…
Balanced incomplete block designs (BIBDs) are a class of designs with v treatments and b blocks of size k that are optimal with regards to a wide range of optimality criteria, but it is not clear which designs to choose for combinations of…
Our purpose is to determine the complete set of mutually orthogonal squares of order $d$, which are not necessary Latin. In this article, we introduce the concept of supersquare of order $d$, which is defined with the help of its generating…
Determinant maximization provides an elegant generalization of problems in many areas, including convex geometry, statistics, machine learning, fair allocation of goods, and network design. In an instance of the determinant maximization…
An $s$-extremal optimal unimodular lattice in dimension $52$ is constructed for the first time. This lattice is constructed from a certain self-dual $\mathbb{F}_5$-code by Construction A. In addition, as neighbors of the lattice, two more…
Maximally supersymmetric gauge theories have experienced renewed interest due to the AdS/CFT correspondence and its conjectured S-duality. These gauge theories possess a large amount of symmetry and have quasi-integrable properties. We…
For mappings of finite distortion actively investigated last 15--20 years, problems of a so-called lower order are discussed. It is proved that, mappings with finite length distortion $f:D\rightarrow {\Bbb R}^n,$ $n\ge 2,$ which have…
Preconditioning has long been a staple technique in optimization, often applied to reduce the condition number of a matrix and speed up the convergence of algorithms. Although there are many popular preconditioning techniques in practice,…
We prove some new results on existence of solutions to first--order ordinary differential equations with deviating arguments. Delay differential equations are included in our general framework, which even allows deviations to depend on the…
Balancedly splittable Hadamard matrices are introduced and studied. A connection is made to the Hadamard diagonalizable strongly regular graphs, maximal equiangular lines set, and unbiased Hadamard matrices. Several construction methods are…
Two families of directional direct search methods have emerged in derivative-free and blackbox optimization (DFO and BBO), each based on distinct principles: Mesh Adaptive Direct Search (MADS) and Sufficient Decrease Direct Search (SDDS).…
Let $X=X(n,q)$ be the set of $n\times n$ Hermitian matrices over $\mathbb{F}_{q^2}$. It is well known that $X$ gives rise to a metric translation association scheme whose classes are induced by the rank metric. We study $d$-codes in this…
The Hadamard maximal determinant problem asks for the largest n-by-n determinant with entries in {+1,-1}. When n is congruent to 1 (mod 4), the maximal excess construction of Farmakis & Kounias has been the most successful general method…
Strong difference families are an interesting class of discrete structures which can be used to derive relative difference families. Relative difference families are closely related to $2$-designs, and have applications in constructions for…
An alternative proof of Lie's approach for linearization of scalar second order ODEs is derived using the relationship between $\lambda$-symmetries and first integrals. This relation further leads to a new $\lambda$-symmetry linearization…