相关论文: Constructions of Augmented Orthogonal Arrays

The reachability problem asks to decide if there exists a path from one vertex to another in a digraph. In a grid digraph, the vertices are the points of a two-dimensional square grid, and an edge can occur between a vertex and its…

The spectrum of a graph is closely related to many graph parameters. In particular, the spectral gap of a regular graph which is the difference between its valency and second eigenvalue, is widely seen an algebraic measure of connectivity…

A (t,s)-rack is a rack structure defined on a module over the ring $\ddot\Lambda=\mathbb{Z}[t^{\pm 1},s]/(s^2-(1-t)s)$. We identify necessary and sufficient conditions for two $(t,s)$-racks to be isomorphic. We define enhancements of the…

Many idealized problems in signal processing, machine learning and statistics can be reduced to the problem of finding the symmetric canonical decomposition of an underlying symmetric and orthogonally decomposable (SOD) tensor. Drawing…

We revisit the results on admissible transformations between normal linear systems of second-order ordinary differential equations with an arbitrary number of dependent variables under several appropriate gauges of the arbitrary elements…

We introduce the concept of n-OU and n-OO matrix sets, a collection of n mutually-orthogonal unitary and real orthogonal matrices under Hilbert-Schmidt inner product. We give a detailed characterization of order-three n-OO matrix sets under…

A large distance between true and reconstructed core locations of an extensive air shower (EAS) may results in great systematic mis-estimation of EAS parameters. The reconstruction of those EASs whose core locations are outside the boundary…

In the paper, the algebra $\mathscr{A}(n)$, which is generated by an upper triangular generating matrix with triple relations, is introduced. It is shown that there exists an isomorphism between the algebra $\mathscr{A}(n)$ and the…

Orthogonal drawings, i.e., embeddings of graphs into grids, are a classic topic in Graph Drawing. Often the goal is to find a drawing that minimizes the number of bends on the edges. A key ingredient for bend minimization algorithms is the…

The maximal rate for non-square Complex Orthogonal Designs (CODs) with $n$ transmit antennas is ${1/2}+\frac{1}{n}$ if $n$ is even and ${1/2}+\frac{1}{n+1}$ if $n$ is odd, which are close to 1/2 for large values of $n.$ A class of maximal…

We study the connection between mutually unbiased bases and mutually orthogonal extraordinary supersquares, a wider class of squares which does not contain only the Latin squares. We show that there are four types of complete sets of…

An $(n,r,s)$-system is an $r$-uniform hypergraph on $n$ vertices such that every pair of edges has an intersection of size less than $s$. Using probabilistic arguments, R\"{o}dl and \v{S}i\v{n}ajov\'{a} showed that for all fixed integers…

We prove that every simply connected orthogonal polygon of $n$ vertices can be partitioned into $\left\lfloor\frac{3 n +4}{16}\right\rfloor$ (simply connected) orthogonal polygons of at most 8 vertices. It yields a new and shorter proof of…

Given an Orthogonal Array we analyze the aberrations of the sub-fractions which are obtained by the deletion of some of its points. We provide formulae to compute the Generalized Word-Length Pattern of any sub-fraction. In the case of the…

The division algebras R, C, H, O are used to construct and analyze the N=1,2,4,8 supersymmetric extensions of the KdV hamiltonian equation. In particular a global N=8 super-KdV system is introduced and shown to admit a Poisson bracket…

Covering arrays find important application in software and hardware interaction testing. For practical applications it is useful to determine or bound the minimum number of rows, CAN$(t,k,v)$, in a covering array for given values of the…

We construct a new family of $K_s$-free graphs that leads to improved lower bounds for Ramsey numbers across a wide range of parameters. For any fixed $s \ge 4$, we show that the off-diagonal Ramsey numbers satisfy $r(s, k) \ge k^{s-2 +…

We define a new topological invariant of line arrangements in the complex projective plane. This invariant is a root of unity defined under some combinatorial restrictions for arrangements endowed with some special torsion character on the…

Context: Detecting arrays are mathematical structures aimed at fault identification in combinatorial interaction testing. However, they cannot be directly applied to systems that have constraints among test parameters. Such constraints are…

An algorithm has been devised to compute the inner and outer product between two arbitrary multi-dimensional arrays A and B in a single piece of code. It was derived using A Mathematics of Arrays (MoA) and the $\psi$-calculus. Extensive…