Related papers: New results on D-optimal Matrices
It is shown that the matrix KP hierarchy can yield new integrable equations in $(2+1)$-dimensions along with the corresponding Lax pair. For particular gauge choice this may result derivative and also a higher order nonlinear extension of…
We study the problem of estimating the number of defective items $d$ within a pile of $n$ elements up to a multiplicative factor of $\Delta>1$, using deterministic group testing algorithms. We bring lower and upper bounds on the number of…
For two orthonormal bases of a $d$-dimensional complex Hilbert space, the notion of complete incompatibility was introduced recently by De Bi\`{e}vre [Phys. Rev. Lett. 127, 190404 (2021)]. In this work, we introduce the notion of $s$-order…
We construct and give a complete classification of all the differential symmetry breaking operators $\mathbb{D}_{\lambda, \nu}^{N,m}: C^\infty(S^3, \mathcal{V}_\lambda^{2N+1}) \rightarrow C^\infty(S^2, \mathcal{L}_{m, \nu})$, between the…
In this paper we illustrate the rule for finding number of idempotents in the doubly stochastic matrix $D_n$ and also locate the idempotents for the semigroups $D_3$ and $D_4$. Further describe idempotent generated ideals of these…
An order-$s$ Davenport-Schinzel sequence over an $n$-letter alphabet is one avoiding immediate repetitions and alternating subsequences with length $s+2$. The main problem is to determine the maximum length of such a sequence, as a function…
We study the optimal design problem under second-order least squares estimation which is known to outperform ordinary least squares estimation when the error distribution is asymmetric. First, a general approximate theory is developed,…
The notion of lambda-symmetries, originally introduced by C. Muriel and J.L. Romero, is extended to the case of systems of first-order ODE's (and of dynamical systems in particular). It is shown that the existence of a symmetry of this type…
We give an explicit construction, based on Hadamard matrices, for an infinite series of floor{sqrt{d}/2}-neighborly centrally symmetric d-dimensional polytopes with 4d vertices. This appears to be the best explicit version yet of a recent…
Additive spanners are fundamental graph structures with wide applications in network design, graph sparsification, and distance approximation. In particular, a $4$-additive spanner is a subgraph that preserves all pairwise distances up to…
Five equivalence classes had been found for systems of two second-order ordinary differential equations, transformable to linear equations (linearizable systems) by a change of variables. An "optimal (or simplest) canonical form" of linear…
Least-mean squares (LMS) solvers such as Linear / Ridge / Lasso-Regression, SVD and Elastic-Net not only solve fundamental machine learning problems, but are also the building blocks in a variety of other methods, such as decision trees and…
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.
For a second order differential operator $A(\msx) =-\nabla a(\msx)\nabla + b'(\msx)\nabla+ \nabla \big(\msb''(\msx) \cdot\big)$ on a bounded domain $D$ with the Dirichlet boundary conditions on $\partial D$ there exists the inverse…
The structure-preserving doubling algorithm (SDA) is a fairly efficient method for solving problems closely related to Hamiltonian (or Hamiltonian-like) matrices, such as computing the required solutions to algebraic Riccati equations.…
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…
New families of maximum distance separable (MDS) codes are constructed from elliptic curves by exploiting their group structures. In contrast to classical constructions based on divisors supported at a single rational point, the proposed…
In recent years, optimization theory has been greatly impacted by the advent of sum of squares (SOS) optimization. The reliance of this technique on large-scale semidefinite programs however, has limited the scale of problems to which it…
Characterizing simultaneously diagonalizable (SD) matrices has been receiving considerable attention in the recent decades due to its wide applications and its role in matrix analysis. However, the notion of SD matrices is arguably still…
We propose the Lax operators for N=2 supersymmetric matrix generalization of the bosonic (1,s)-KdV hierarchies. The simplest examples - the N=2 supersymmetric a=4 KdV and a=5/2 Boussinesq hierarchies - are discussed in detail.