Related papers: Symmetry in semidefinite programs
The de Bruijn-Tengbergen-Kruyswijk (BTK) construction is a simple algorithm that produces an explicit symmetric chain decomposition of a product of chains. We linearize the BTK algorithm and show that it produces an explicit symmetric…
The notion of symmetry is defined in the context of Linear and Integer Programming. Symmetric linear and integer programs are studied from a group theoretical viewpoint. We show that for any linear program there exists an optimal solution…
We define modular Terwilliger algebras of association schemes, Terwilliger algebras over a positive characteristic field, and consider basic properties. We give a condition for the modular Terwilliger algebra to be non-semisimple. We show…
We construct complete sets of invariant quantities that are integrals of motion for two Hamiltonian systems obtained through a reduction procedure, thus proving that these systems are maximally superintegrable. We also discuss the reduction…
Orthogonal polynomials with respect to the hypergeometric distribution on lattices in polyhedral domains in ${\mathbb R}^d$, which include hexagons in ${\mathbb R}^2$ and truncated tetrahedrons in ${\mathbb R}^3$, are defined and studied.…
We study semifinite harmonic functions on arbitrary branching graphs. We give a detailed exposition of an algebraic method which allows one to classify semifinite indecomposable harmonic functions on some multiplicative branching graphs.…
We propose a new method for simplifying semidefinite programs (SDP) inspired by symmetry reduction. Specifically, we show if an orthogonal projection map satisfies certain invariance conditions, restricting to its range yields an equivalent…
Finite group symmetry is commonplace in Physics, in particular through crystallographic groups occurring in condensed matter physics -- but also through the inversions (C,P,T and their combinations) occurring in high energy physics and…
Let $Y$ denote a $D$-class symmetric association scheme with $D \geq 3$, and suppose $Y$ is almost-bipartite P- and Q-polynomial. Let $x$ denote a vertex of $Y$ and let $T=T(x)$ denote the corresponding Terwilliger algebra. We prove that…
We describe the reduction procedure for a symplectic Lie algebroid by a Lie subalgebroid and a symmetry Lie group. Moreover, given an invariant Hamiltonian function we obtain the corresponding reduced Hamiltonian dynamics. Several examples…
Symmetric homology is an analog of cyclic homology in which the cyclic groups are replaced by symmetric groups. The foundations for the theory of symmetric homology of algebras are developed in the context of crossed simplicial groups using…
A general algebraic approach, incorporating both invariance groups and dynamic symmetry algebras, is developed to reveal hidden coherent structures (closed complexes and configurations) in quantum many-body physics models due to symmetries…
Motivated by the similarities between the theory of spherical $t$-designs and that of $t$-designs in $Q$-polynomial association schemes, we study two versions of relative $t$-designs, the counterparts of Euclidean $t$-designs for $P$-…
In representation theory of finite-dimensional algebras, (semi)bricks are a generalization of (semi)simple modules, and they have long been studied. The aim of this paper is to study semibricks from the point of view of $\tau$-tilting…
The notion of hidden symmetry algebra used in the context of exactly solvable systems is re-examined from the purely algebraic way, analyzing subspaces of commuting polynomials that generate finite-dimensional quadratic algebras. By…
We present a new simple method for rounding a semidefinite programming relaxation of a constraint satisfaction problem. We apply it to the problem of approximate angular synchronization. Specifically, we are given directed distances on a…
The dictionary learning problem concerns the task of representing data as sparse linear sums drawn from a smaller collection of basic building blocks. In application domains where such techniques are deployed, we frequently encounter…
A semi-projective representation is a homomorphism of a finite group into the group of semi-projective transformations of a finite dimensional vector space over a field. Schur's concept of a representation group for projective…
This short note introduces a geometric representation for binary (or ternary) sequences. The proposed representation is linked to multivariate data plotting according to the radar chart. As an illustrative example, the binary Hamming…
A basis of quasi-invariant module over invariants is explicitly constructed for the two-dimensional Coxeter systems with arbitrary multiplicities. It is proved that this basis consists of $m$-harmonic polynomials, thus the earlier results…