Related papers: Definite Determinantal Representations of Multivar…
We propose a symmetric key homomorphic encryption scheme based on the evaluation of multivariate polynomials over a finite field. The proposed scheme is somewhat homomorphic with respect to addition and multiplication. Further, we define a…
We apply the bi-moment determinant method to compute a representation of the matrix product algebra -- a quadratic algebra satisfied by the operators $\mathbf{d}$ and $\mathbf{e}$ -- for the five parameter ($\alpha$, $\beta$, $\gamma$,…
For a square-free bivariate polynomial $p$ of degree $n$ we introduce a simple and fast numerical algorithm for the construction of $n\times n$ matrices $A$, $B$, and $C$ such that $\det(A+xB+yC)=p(x,y)$. This is the minimal size needed to…
We address combinatorial problems that can be formulated as minimization of a partially separable function of discrete variables (energy minimization in graphical models, weighted constraint satisfaction, pseudo-Boolean optimization, 0-1…
We study the problem of learning permutation invariant representations that can capture "flexible" notions of containment. We formalize this problem via a measure theoretic definition of multisets, and obtain a theoretically-motivated…
This paper studies symmetric tensor decompositions. For symmetric tensors, there exist linear relations of recursive patterns among their entries. Such a relation can be represented by a polynomial, which is called a generating polynomial.…
We classify the discriminantly separable polynomials of degree two in each of three variables, defined by a property that all the discriminants as polynomials of two variables are factorized as products of two polynomials of one variable…
Consideration of a question of E. R. Berlekamp led Carlitz, Roselle, and Scoville to give a combinatorial interpretation of the entries of certain matrices of determinant~1 in terms of lattice paths. Here we generalize this result by…
We consider a generalized equation governed by a strongly monotone and Lipschitz single-valued mapping and a maximally monotone set-valued mapping in a Hilbert space. We are interested in the sensitivity of solutions w.r.t. perturbations of…
The determinantal complexity of a polynomial $P \in \mathbb{F}[x_1, \ldots, x_n]$ over a field $\mathbb{F}$ is the dimension of the smallest matrix $M$ whose entries are affine functions in $\mathbb{F}[x_1, \ldots, x_n]$ such that $P =…
In this paper we propose a conseptual framework for the observed properties of discriminants of polylinear forms. The connection with classical problems of linear algebra is shown. A new class of algebraic varieties (hypergrassmanians) is…
In this paper, we consider the problem of deciding the existence of real solutions to a system of polynomial equations having real coefficients, and which are invariant under the action of the symmetric group. We construct and analyze a…
This paper presents a first continuous, linear, conic formulation for the Discrete Ordered Median Problem (DOMP). Starting from a binary, quadratic formulation in the original space of location and allocation variables that are common in…
We study integer-valued matrices with bounded determinants. Such matrices appear in the theory of integer programs (IP) with bounded determinants. For example, Artmann et al. showed that an IP can be solved in strongly polynomial time if…
We introduce Polytopic Matrix Factorization (PMF) as a novel data decomposition approach. In this new framework, we model input data as unknown linear transformations of some latent vectors drawn from a polytope. In this sense, the article…
Given a system of n homogeneous polynomials in n variables which is equivariant with respect to the canonical actions of the symmetric group of n symbols on the variables and on the polynomials, it is proved that its resultant can be…
Finite and Infinite-dimensional representations of symmetry algebras play a significant role in determining the spectral properties of physical Hamiltonians. In this paper, we introduce and apply a practical method to construct infinite…
This paper focuses on the study of a mathematical program with equilibrium constraints, where the objective and the constraint functions are all polynomials. We present a method for finding its global minimizers and global minimum using a…
By applying Fourier transformations to the natural orthogonal oscillator representations of special linear Lie algebras, Luo and the second author (2013) obtained a large family of infinite-dimensional irreducible representations of the…
We provide simple criteria and algorithms for expressing homogeneous polynomials as sums of powers of independent linear forms, or equivalently, for decomposing symmetric tensors into sums of rank-1 symmetric tensors of linearly independent…