Related papers: Symmetry in semidefinite programs
We present a notion of symmetry for 1+1-dimensional integrable systems which is consistent with their group theoretic description and reproduces in special cases the known Baecklund transformation for the generalized Korteweg-deVries…
Semigroup theory is a branch of abstract algebra, and it provides mathematical tools for the theory of computation. Finite semigroups can describe state transition systems and thus they model physically realizable computers. Engineering…
We introduce new polynomial invariants of a finite-dimensional semisimple and cosemisimple Hopf algebra A over a field by using the braiding structures of A. We investigate basic properties of the polynomial invariants including stability…
Group Theory techniques can aid greatly the determination of magnetic structures. The integration of their calculations into new and existing refinement programs is an ongoing development that will simplify and make more rigorous the…
The $\star_M$-family of tensor-tensor products is a framework which generalizes many properties from linear algebra to third order tensors. Here, we investigate positive semidefiniteness and semidefinite programming under the…
Following our approach to metric Lie algebras developed in math.DG/0312243 we propose a way of understanding pseudo-Riemannian symmetric spaces which are not semi-simple. We introduce cohomology sets (called quadratic cohomology) associated…
Statistical models that possess symmetry arise in diverse settings such as random fields associated to geophysical phenomena, exchangeable processes in Bayesian statistics, and cyclostationary processes in engineering. We formalize the…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
By the Fourier transformations, any group-invariant functions over finite Abelian groups are transformed into group-invariant functions over the character groups. In this paper, we calculate matrix elements of this transformations under…
In this paper, we study harmonic analysis on finite homogeneous spaces whose associated permutation representation decomposes with multiplicity. After a careful look at Frobenius reciprocity and transitivity of induction, and the…
We show that the Terwilliger algebra of a quasi-thin association scheme over a field is always a quasi-hereditary cellular algebra in the sense of Cline-Parshall-Scott and of Graham-Lehrer, repsectively, and that the basic algebra of the…
The article addresses the problem whether indefinite double sums involving a generic sequence can be simplified in terms of indefinite single sums. Depending on the structure of the double sum, the proposed summation machinery may provide…
We present an application of the program of groupoidification leading up to a sketch of a categorification of the Hecke algebroid --- the category of permutation representations of a finite group. As an immediate consequence, we obtain a…
The completely bounded trace and spectral norms in finite dimensions are shown to be expressible by semidefinite programs. This provides an efficient method by which these norms may be both calculated and verified, and gives alternate…
To address difficult optimization problems, convex relaxations based on semidefinite programming are now common place in many fields. Although solvable in polynomial time, large semidefinite programs tend to be computationally challenging.…
Lie group theory states that knowledge of a $m$-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by $m$ the number of equations. We apply this principle by finding some \emph{affine…
We introduce a Sinkhorn-type algorithm for producing quantum permutation matrices encoding symmetries of graphs. Our algorithm generates square matrices whose entries are orthogonal projections onto one-dimensional subspaces satisfying a…
With the surge of multi- and manycores, much research has focused on algorithms for mapping and scheduling on these complex platforms. Large classes of these algorithms face scalability problems. This is why diverse methods are commonly…
Diagram semigroups are interesting algebraic and combinatorial objects, several types of them originating from questions in computer science and in physics. Here we describe diagram semigroups in a general framework and extend our…
Lie group theory states that knowledge of a $m$-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by $m$ the number of equation. We apply this principle by finding dilatations and…