相关论文: Symmetry in semidefinite programs
In the last years many results in the area of semidefinite programming were obtained for invariant (finite dimensional, or infinite dimensional) semidefinite programs - SDPs which have symmetry. This was done for a variety of problems and…
We investigate the representation of symmetric polynomials as a sum of squares. Since this task is solved using semidefinite programming tools we explore the geometric, algebraic, and computational implications of the presence of discrete…
For a matrix *-algebra B, consider the matrix *-algebra A consisting of the symmetric tensors in the n-fold tensor product of B. Examples of such algebras in coding theory include the Bose-Mesner algebra and Terwilliger algebra of the…
In this paper, we present a novel approach to synthesize invariant clusters for polynomial programs. An invariant cluster is a set of program invariants that share a common structure, which could, for example, be used to save the needs for…
We initiate study of the Terwilliger algebra and related semidefinite programming techniques for the conjugacy scheme of the symmetric group Sym$(n)$. In particular, we compute orbits of ordered pairs on Sym$(n)$ acted upon by conjugation…
We survey recent generalizations and improvements of the linear programming method that involve semidefinite programming. A general framework using group representations and tools from graph theory is provided.
In this paper we construct a hierarchy of multivariate polynomial approximation kernels via semidefinite programming. We give details on the implementation of the semidefinite programs defining the kernels. Finally, we show how a symmetry…
This is a note for constructing fundamental invariants and computing the Hilbert series of the invariant subalgebras of tensor products of polynomial rings under the action by a direct product of symmetric groups. Our computation relies on…
This paper investigates the Terwilliger algebra of some group association schemes related to codes. In addition, it also shows the generators of invariant rings appearing by E-polynomials.
It is well-known that the symmetry group of a Feynman diagram can give important information on possible strategies for its evaluation, and the mathematical objects that will be involved. Motivated by ongoing work on multi-loop multi-photon…
In [3], Hanaki defined the Terwilliger algebras of association schemes over a commutative unital ring. In this paper, we call the Terwilliger algebras of association schemes over a field $\mathbb{F}$ the Terwilliger $\mathbb{F}$-algebras of…
Terwilliger algebras are finite-dimensional semisimple algebras that were first introduced by Paul Terwilliger in 1992 in studies of association schemes and distance-regular graphs. The Terwilliger algebras of the conjugacy class…
This paper deals with exploiting symmetry for solving linear and integer programming problems. Basic properties of linear representations of finite groups can be used to reduce symmetric linear programming to solving linear programs of…
We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…
Polynomial optimization problems are infinite-dimensional, nonconvex, NP-hard, and are often handled in practice with the moment-sums of squares hierarchy of semidefinite programming bounds. We consider problems where the objective function…
Connecting orbits are important invariant structures in the state space of nonlinear systems and various techniques are designed for their computation. However, a uniform analytic approximation of the whole orbit seems rare. Here, based on…
Solution and analysis of mathematical programming problems may be simplified when these problems are symmetric under appropriate linear transformations. In particular, a knowledge of the symmetries may help reduce the problem dimension, cut…
The idea that symmetries simplify or reduce the complexity of a system has been remarkably fruitful in physics, and especially in quantum mechanics. On a mathematical level, symmetry groups single out a certain structure in the Hilbert…
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…
A general method to construct basis functions for fermionic systems which account for the $SU(2)$ symmetry and for the translational invariance of the Hamiltonian is presented. The method does not depend on the dimensionality of the system…