Related papers: A few new orders for D-optimal matrices
Complex Hadamard matrices H of order 6 are characterized in a novel manner, according to the presence/absence of order 2 Hadamard submatrices. It is shown that if there exists one such submatrix, H is equivalent to a Hadamard matrix where…
A class of nonlinear models combining a pharmacokinetic compartmental model and a pharmacodynamic Emax model is introduced. The locally D-optimal (LD) design for a four-parameter composed model is found to be a saturated four-point uniform…
The size and complexity of software and hardware systems have significantly increased in the past years. As a result, it is harder to guarantee their correct behavior. One of the most successful methods for automated verification of…
We provide exact and asymptotic formulae for the number of unrestricted, respectively indecomposable, $d$-dimensional matrices where the sum of all matrix entries with one coordinate fixed equals 2.
In this paper, we compute the iterated derived sets of the set of multiple t-values under the usual topology of R. Our results imply that the set of multiple t-values, ordered by >=, is a well-ordered set.
Copositive and completely positive matrices play an increasingly important role in Applied Mathematics, namely as a key concept for approximating NP-hard optimization problems. The cone of copositive matrices of a given order and the cone…
A new class of matrices based on a parametrization of the Feig-Winograd factorization of 8-point DCT is proposed. Such parametrization induces a matrix subspace, which unifies a number of existing methods for DCT approximation. By solving a…
A g-circulant matrix of order n is defined as a matrix of order n where each row is a right cyclic shift in g-places to the preceding row. Using number theory, certain nonnegative g-circulant real matrices are constructed. In particular, it…
In this paper, we introduce two new forms of the dual Hartwig-Spindelb{\"o}ck decomposition and employ them to derive explicit representations for several classes of dual generalized inverses. Building on these representations, we further…
We give an attempt to build a classification of planar integral point sets. For two obtained classes, we provide general constructions of upper bounds for minimal diameter of integral point sets in higher dimensions of certain cardinality.…
The smallest integer v>0 for which no skew-Hadamard matrix of order 4v is known is v=69. We show how to construct several such matrices. We also construct presumably the first example of a skew-Hadamard matrix of order 292, and the first…
In this paper we investigate examples of good and optimal Drinfeld modular towers of function fields. Surprisingly, the optimality of these towers has not been investigated in full detail in the literature. We also give an algorithmic…
Recent developments in termination analysis for declarative programs emphasize the use of appropriate models for the logical theory representing the program at stake as a generic approach to prove termination of declarative programs. In…
A novel factorization for the sum of two single-pair matrices is established as product of lower-triangular, tridiagonal, and upper-triangular matrices, leading to semi-closed-form formulas for tridiagonal matrix inversion. Subsequent…
In the last decade, decision diagrams (DDs) have been the basis for a large array of novel approaches for modeling and solving optimization problems. Many techniques now use DDs as a key tool to achieve state-of-the-art performance within…
Higher order Delaunay triangulations are a generalization of the Delaunay triangulation which provides a class of well-shaped triangulations, over which extra criteria can be optimized. A triangulation is order-$k$ Delaunay if the…
The enumeration of diagonally symmetric alternating sign matrices (DSASMs) is studied, and a Pfaffian formula is obtained for the number of DSASMs of any fixed size, where the entries for the Pfaffian are positive integers given by simple…
We propose a new differentiable probabilistic model over DAGs (DP-DAG). DP-DAG allows fast and differentiable DAG sampling suited to continuous optimization. To this end, DP-DAG samples a DAG by successively (1) sampling a linear ordering…
We introduce deterministic perturbation schemes for the recently proposed random directions stochastic approximation (RDSA) [17], and propose new first-order and second-order algorithms. In the latter case, these are the first second-order…
Algebraic and analytic aspects of self-adjoint operators of order four or more with polynomial coefficients are investigated. As a consequence, a systematic way of constructing such operators is given. The procedure is applied to obtain…