Related papers: New results on D-optimal Matrices
In order to correct the pair-errors generated during the transmission of modern high-density data storage that the outputs of the channels consist of overlapping pairs of symbols, a new coding scheme named symbol-pair code is proposed. The…
Correspondence problems are often modelled as quadratic optimization problems over permutations. Common scalable methods for approximating solutions of these NP-hard problems are the spectral relaxation for non-convex energies and the…
We introduce a new class of structured symmetric matrices by extending the notion of perfect elimination ordering from graphs to weighted graphs or matrices. This offers a common framework capturing common vertex elimination orderings of…
I give an overview of recent progress in constructing the KdV, mKdV and NLS type hierarchies with extended N=4 supersymmetry.
This paper studies new properties of the front and back ends of a sorting network, and illustrates the utility of these in the search for new bounds on optimal sorting networks. Search focuses first on the "outsides" of the network and then…
We calculate next to leading order QCD corrections to semi-inclusive polarized deep inelastic scattering and $e^+e^-$ annihilation cross sections for processes where the polarization of the identified final-state hadron can also be…
Starting with a first order in derivatives self-dual model which describes a massive spin-4 mode in $D=2+1$ dimensions, we have obtained a sequence of three more new descriptions, which then give us an interconnected self-dual chain $SD(i)$…
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 consider the classic matroid intersection problem: given two matroids $\M_{1}=(V,\I_{1})$ and $\M_{2}=(V,\I_{2})$ defined over a common ground set $V$, compute a set $S\in\I_{1}\cap\I_{2}$ of largest possible cardinality,…
We solve a design optimization problem for deterministic lateral displacement (DLD) device to sort same-size biological cells by their deformability, in particular to sort red blood cells (RBCs) by their viscosity contrast between the fluid…
A More Sums Than Difference (MSTD) set is a finite set of integers $A$ where the cardinality of its sumset, $A+A$, is greater than the cardinality of its difference set, $A-A$. Since addition is commutative while subtraction isn't, it was…
A new construction of complex Hadamard matrices of composite order d=pq, with primes p,q, is presented which is based on pairs of mutually unbiased bases containing only product states. For product dimensions d < 100, we illustrate the…
Variational and divergence symmetries are studied in this paper for linear equations of maximal symmetry in canonical form, and the associated first integrals are given in explicit form. All the main results obtained are formulated as…
In this paper, we introduce D-star order, T-star order and P-star order on the class of dual matrices. By applying matrix decomposition and dual generalized inverses, we discuss properties, characterizations and relations among these…
In this paper we present a new technique to construct neighborly polytopes, and use it to prove a lower bound of ((r+d)^((r/2+d/2)^2))/(r^((r/2)^2)d^((d/2)^2)e^(3rd/4)) for the number of combinatorial types of vertex-labeled neighborly…
In this note, we present an algorithm that yields many new methods for constructing doubly stochastic and symmetric doubly stochastic matrices for the inverse eigenvalue problem. In addition, we introduce new open problems in this area that…
We give an efficient algorithm for the enumeration up to isomorphism of the inverse semigroups of order n, and we count the number S(n) of inverse semigroups of order n<=15. This improves considerably on the previous highest-known value…
We consider algorithmic approaches to the D-optimality problem for cases where the input design matrix is large and highly structured, in particular implicitly specified as a full quadratic or linear response-surface model in several levels…
One of the longest-standing open problems in computational geometry is to bound the lower envelope of $n$ univariate functions, each pair of which crosses at most $s$ times, for some fixed $s$. This problem is known to be equivalent to…
We develop and analyze several different second-order algorithms for computing a near-optimal solution path of a convex parametric optimization problem with smooth Hessian. Our algorithms are inspired by a differential equation perspective…