Related papers: Symmetric Determinantal Representation of Formulas…

In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutative determinant polynomial. Then, more generally, we also…

Valiant's conjecture asserts that the circuit complexity classes VP and VNP are distinct, meaning that the permanent does not admit polynomial-size algebraic circuits. As it is the case in many branches of complexity theory, the…

For bivariate polynomials of degree $n\le 5$ we give fast numerical constructions of determinantal representations with $n\times n$ matrices. Unlike some other available constructions, our approach returns matrices of the smallest possible…

For any finite group $G$ and any prime $p$ one can ask which ordinary irreducible representations remain irreducible in characteristic $p$. We answer this question for $p=2$ when $G$ is a proper double cover of the symmetric group. Our…

We introduce a new approach to representation theory of finite groups that uses some basic algebraic geometry and allows to do all the theory without using characters. With this approach, to any finite group $G$ we associate a finite number…

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…

We investigate the finite-dimensional representation theory of two-parameter quantum orthogonal and symplectic groups that we found in [BGH] under the assumption that $rs^{-1}$ is not a root of unity and extend some results [BW1, BW2]…

Let $S =\{x\in \re^n: g_1(x)\geq 0, ..., g_m(x)\geq 0\}$ be a semialgebraic set defined by multivariate polynomials $g_i(x)$. Assume $S$ is convex, compact and has nonempty interior. Let $S_i =\{x\in \re^n: g_i(x)\geq 0\}$, and $\bdS$…

Using techniques developed in [Lasserre02], we show that some minimum cardinality problems subject to linear inequalities can be represented as finite sequences of semidefinite programs. In particular, we provide a semidefinite…

We extend the notion of representation of a matroid to algebraic structures that we call skew partial fields. Our definition of such representations extends Tutte's definition, using chain groups. We show how such representations behave…

We prove that every real nonnegative ternary quartic whose complex zero set is smooth can be represented as the determinant of a symmetric matrix with quadratic entries which is everywhere positive semidefinite. We show that the…

Finite element simulations have been used to solve various partial differential equations (PDEs) that model physical, chemical, and biological phenomena. The resulting discretized solutions to PDEs often do not satisfy requisite physical…

We investigate algebraic properties of weakly commutative triples, appearing in the theory of integrable nonlinear partial differential equations. Algebraic technique of skew fields of formal pseudodifferential operators as well as skew Ore…

We obtain many objects of discrete differential geometry as reductions of skew parallelogram nets, a system of lattice equations that may be formulated for any unit associative algebra. The Lax representation is linear in the spectral…

We discuss how semidefinite programming can be used to determine the second-order density matrix directly through a variational optimization. We show how the problem of characterizing a physical or N -representable density matrix leads to…

This paper presents generalizations of semidefinite programming formulations of 1-norm optimization problems over infinite dictionaries of vectors of complex exponentials, which were recently proposed for superresolution, gridless…

We survey some important results concerning the finite--dimensional representations of the loop algebra of a simple complex Lie algebra, and their twisted loop subalgebras. In particular, we review the parametrization and description of the…

In this paper we give an alternative construction using Monk like algebras that are binary generated to show that the class of strongly representable atom structures is not elementary. The atom structures of such algebras are cylindric…

An arithmetic matroid is weakly multiplicative if the multiplicity of at least one of its bases is equal to the product of the multiplicities of its elements. We show that if such an arithmetic matroid can be represented by an integer…

The set of linear, differential operators preserving the vector space of couples of polynomials of degrees n and n-2 in one real variable leads to an abstract associative graded algebra A(2). The irreducible, finite dimensional…