Related papers: Uniform determinantal representations

This is the first installment of an exposition of an ACL2 formalization of elementary linear algebra, focusing on aspects of the subject that apply to matrices over an arbitrary commutative ring with identity, in anticipation of a future…

We propose a method for constructing systems of polynomial equations that define submanifolds of degenerate binary forms of an arbitrary degeneracy degree. It is appropriate to call these systems of equations "higher discriminants".

Let $\zeta$ be a real transcendental number. We introduce a new method to find upper bounds for the classical exponent $\widehat{w}_{n}(\zeta)$ concerning uniform polynomial approximation. Our method is based on the parametric geometry of…

We establish new, and surprisingly tight, connections between propositional proof complexity and finite model theory. Specifically, we show that the power of several propositional proof systems, such as Horn resolution, bounded-width…

We investigate the problem of r almost-primes represented by sets of quadratic forms and give upper bounds for r. Our results extend work of Diamond and Halberstam in which they investigated the corresponding problem for polynomials.

This paper considers an idempotent and symmetrical algebraic structure as well as some closely related concept. A special notion of determinant is introduced and a Cramer formula is derived for a class of limit systems derived from the…

In this survey we consider polynomial optimization problems, asking to minimize a polynomial function over a compact semialgebraic set, defined by polynomial inequalities. This models a great variety of (in general, nonlinear nonconvex)…

In this paper, we prove that a binary definite quadratic form over F_q[t], where q is odd, is completely determined up to equivalence by the polynomials it represents up to degree 3m-2, where m is the degree of its discriminant. We also…

This report summarizes progress made towards a new approach for enlarging the dynamic aperture of particle accelerators. Unlike prior methods which attempted to move the location of select resonances outward in phase space, our approach…

We study multivariate normal models that are described by linear constraints on the inverse of the covariance matrix. Maximum likelihood estimation for such models leads to the problem of maximizing the determinant function over a…

Let K be a field and let M_n(K) denote the space of n x n matrices with entries in K. Let M be a subspace of M_n(K) of dimension d with the property that there are elements in M with non-zero determinant. Given a basis of M, we define the…

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…

In this paper, we consider the problem of representing any polynomial in terms of the ordered Bell and degenerate ordered Bell polynomials, and more generally of the higher-order ordered Bell and higher-order degenerate ordered Bell…

Aiming to provide weak as possible axiomatic assumptions in which one can develop basic linear algebra, we give a uniform and integral version of the short propositional proofs for the determinant identities demonstrated over $GF(2)$ in…

The nonnegative and positive semidefinite (PSD-) ranks are closely connected to the nonnegative and positive semidefinite extension complexities of a polytope, which are the minimal dimensions of linear and SDP programs which represent this…

The long-standing problem of minimal projections is addressed from a computational point of view. Techniques to determine bounds on the projection constants of univariate polynomial spaces are presented. The upper bound, produced by a…

The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…

We show that for a multivariable polynomial $p(z)=p(z_1, \ldots , z_d)$ with a determinantal representation $$ p(z) = p(0) \det (I_n- K (\oplus_{j=1}^d z_j I_{n_j}))$$ the matrix $K$ is structurally similar to a strictly $J$-contractive…

We first review some invariant theoretic results about the finite subgroups of SU(2) in a quick algebraic way by using the McKay correspondence and quantum affine Cartan matrices. By the way it turns out that some parameters (a,b,h;p,q,r)…

We introduce symmetric arithmetic circuits, i.e. arithmetic circuits with a natural symmetry restriction. In the context of circuits computing polynomials defined on a matrix of variables, such as the determinant or the permanent, the…