Related papers: Hilbert Bases for Orthogonal Arrays

In this paper we provide a general method to construct four-parameter families of complex Hadamard matrices of order six. Our approach is to write a 6-dimensional matrix as composed of four blocks, each one in the form of a circulant…

In this paper, we give new, tight subexponential lower bounds for a number of graph embedding problems. We introduce two related combinatorial problems, which we call String Crafting and Orthogonal Vector crafting, and show that these…

Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Combining the use of our data structure for characterizing feasible packings with our new classes of…

We give an efficient algorithm to enumerate all elements of a Pareto front in a multi-objective optimization problem in which the space of values is finite for all objectives. Our algorithm uses a feasibility check for a search space…

We compute the completion of the local ring of the Hilbert scheme of degree $n+1$ subschemes of $\mathbb{A}^n$ at the point corresponding to the ideal $\langle x_1,\ldots,x_n\rangle^2$, and describe the completion of the universal family.…

We deal with linear programming problems involving absolute values in their formulations, so that they are no more expressible as standard linear programs. The presence of absolute values causes the problems to be nonconvex and nonsmooth,…

In this article, we present what we believe to be a simple way to motivate the use of Hilbert spaces in quantum mechanics. To achieve this, we study the way the notion of dimension can, at a very primitive level, be defined as the…

The complexity of computing the Lempel-Ziv factorization and the set of all runs (= maximal repetitions) is studied in the decision tree model of computation over ordered alphabet. It is known that both these problems can be solved by RAM…

A weight basis for each finite-dimensional irreducible representation of the orthogonal Lie algebra o(2n) is constructed. The basis vectors are parametrized by the D-type Gelfand--Tsetlin patterns. Explicit formulas for the matrix elements…

Bidiagonal matrices are widespread in numerical linear algebra, not least because of their use in the standard algorithm for computing the singular value decomposition and their appearance as LU factors of tridiagonal matrices. We show that…

It is a challenging open problem to construct an explicit 1-factorization of the bipartite Kneser graph $H(v,t)$, which contains as vertices all $t$-element and $(v-t)$-element subsets of $[v]:=\{1,\ldots,v\}$ and an edge between any two…

Let $\A_0, \A_1, \ldots, \A_n$ be given square matrices of size $m$ with rational coefficients. The paper focuses on the exact computation of one point in each connected component of the real determinantal variety $\{\X \in\RR^n \: :\:…

The main contributions of this paper are the proposition and the convergence analysis of a class of inertial projection-type algorithm for solving variational inequality problems in real Hilbert spaces where the underline operator is…

We study how the supporting hyperplanes produced by the projection process can complement the method of alternating projections and its variants for the convex set intersection problem. For the problem of finding the closest point in the…

We give a new proof of Fejes T\'oth's zone conjecture: for any sequence $v_1,v_2,...,v_n$ of unit vectors in a real Hilbert space $\mathcal{H}$, there exists a unit vector $v$ in $\mathcal{H}$ such that \begin{equation*} |\langle v_k,v…

We consider matrix problems in Hilbert spaces (orthoscalar representations of quivers and posets). A criterion of tameness of the problem of classification of indecomposable orthoscalar representations of a quiver is given.

We develop the theory of resolvent degree, introduced by Brauer \cite{Br} in order to study the complexity of formulas for roots of polynomials and to give a precise formulation of Hilbert's 13th Problem. We extend the context of this…

Sets of bilinear constraints are important in various machine learning models. Mathematically, they are hyperbolas in a product space. In this paper, we give a complete formula for projections onto sets of bilinear constraints or hyperbolas…

In this paper, we will investigate the jet schemes of determinantal varieties. It is quite often the case that the geometric information concerning the jet schemes of an algebraic variety can be described, but the more refined algebraic…

In this paper it is investigated how to find a matrix representation of operators on a Hilbert space with Bessel sequences, frames and Riesz bases. In many applications these sequences are often preferable to orthonormal bases (ONBs).…