Related papers: A few new orders for D-optimal matrices
It was recently shown that arbitrary first-order models canonically extend to models (of the same language) consisting of ultrafilters. The main precursor of this construction was the extension of semigroups to semigroups of ultrafilters, a…
We construct several families of perfect sublattices with minimum $4$ of $\mathbb Z^d$. In particular, the number of $d-$dimensional perfect integral lattices with minimum $4$ grows faster than $d^k$ for every exponent $k$.
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…
The first examples of exceptional terminal singularities are constructed.
Multi-task learning (MTL) has emerged as a pivotal paradigm in machine learning by leveraging shared structures across multiple related tasks. Despite its empirical success, the development of likelihood-based efficiently solvable…
Motivated by the works of Wang and Liu [Linear Algebra Appl., 488 (2016) 235-248; MR3419784] and Mosic [Results Math., 75(2) (2020) 1-21; MR4079761], we provide further results on GD inverses and introduce two new classes for square…
An ordered $r$-matching is an $r$-uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of $r$-dimensional orders. The theory of ordered 2-matchings is well-developed…
We introduce mutually unbiased complex Hadamard (MUCH) matrices and show that the number of MUCH matrices of order 2n, n odd, is at most 2 and the bound is attained for n = 1,5,9. Furthermore, we prove that certain pairs of mutually…
The author determines the structure of automorphism groups of smooth plane curves of degree at least four. Furthermore, he gives some upper bounds for the order of automorphism groups of smooth plane curves and classifies the cases with…
In this article, recent results about point processes are used in sampling theory. Precisely, we define and study a new class of sampling designs: determinantal sampling designs. The law of such designs is known, and there exists a simple…
A new class of integrable mappings and chains is introduced. Corresponding $(1+2)$ integrable systems invariant with respect to such discrete transformations are presented in an explicit form. Their soliton-type solutions are constructed in…
The definition of order indices for density matrices is extended to finite systems. This makes it possible to characterize the level of ordering in such finite systems as macromolecules, nanoclusters, quantum dots, or trapped atoms. The…
A theorem is derived which determines higher order first integrals of autonomous holonomic dynamical systems in a general space, provided the collineations and the Killing tensors -- up to the order of the first integral -- of the kinetic…
This paper studies reduced-order modeling of dynamic networks with strongly connected topology. Given a graph clustering of an original complex network, we construct a quotient graph with less number of vertices, where the edge weights are…
Nine new 2-D OOCs are presented here, all sharing the common feature of a code size that is much larger in relation to the number of time slots than those of constructions appearing previously in the literature. Each of these constructions…
In this paper, we tackle structure learning of Directed Acyclic Graphs (DAGs), with the idea of exploiting available prior knowledge of the domain at hand to guide the search of the best structure. In particular, we assume to know the…
Improved local numerical solution for the ADER-DG numerical method with a local DG predictor for solving the initial value problem for a first-order ODE system is proposed. The improved local numerical solution demonstrates convergence…
In this paper, we generalize existing frameworks for $\mathcal{H}_2\otimes\mathcal{L}_2$-optimal model order reduction to a broad class of parametric linear time-invariant systems. To this end, we derive first-order necessary ptimality…
In this work, we propose an optimization approach for constructing various classes of circulant combinatorial designs that can be defined in terms of autocorrelations. The problem is formulated as a so-called feasibility problem having…
In this paper we have discussed different possible orthogonalities in matrices, namely orthogonal, quasi-orthogonal, semi-orthogonal and non-orthogonal matrices including completely positive matrices, while giving some of their…