Related papers: Semidefinite programming for permutation codes

In this paper we prove new lower bounds for the maximal size of permutation codes by connecting the theory of permutation codes with the theory of linear block codes. More specifically, using the columns of a parity check matrix of an…

Roundoff errors cannot be avoided when implementing numerical programs with finite precision. The ability to reason about rounding is especially important if one wants to explore a range of potential representations, for instance for FPGAs…

Semidefinite Programming (SDP) provides tight lower bounds for Optimal Power Flow problems. However, solving large-scale SDP problems requires exploiting sparsity. In this paper, we experiment several clique decomposition algorithms that…

For relatively form-compact perturbations of non-negative selfadjoint operators, we obtain an upper bound on the number of discrete eigenvalues in half-planes separated from the positive real axis. The bound is given in terms of a partial…

We give an explicit algebraic description of finite Lorentz transformations of vectors in 10-dimensional Minkowski space by means of a parameterization in terms of the octonions. The possible utility of these results for superstring theory…

The Terwilliger algebras of association schemes over an arbitrary field $\mathbb{F}$ were briefly called the Terwilliger $\mathbb{F}$-algebras of association schemes in [9]. In this paper, the Terwilliger $\mathbb{F}$-algebras of direct…

We describe how orbital graphs can be used to improve the practical performance of many algorithms for permutation groups, including intersection and stabilizer problems. First we explain how orbital graphs can be integrated in partition…

Semidefinite Optimization has become a standard technique in the landscape of Mathematical Programming that has many applications in finite dimensional Quantum Information Theory. This paper presents a way for finite-dimensional relaxations…

Solomon's descent algebra is used to define a family of signed measures M(W,x) for a finite Coxeter group W and non-zero x. The measures corresponding to W of types A and B are known to arise from the theory of card shuffling and to be…

Assuming the generalized Riemann hypothesis, we give asymptotic bounds on the size of intervals that contain primes from a given arithmetic progression using the approach developed by Carneiro, Milinovich and Soundararajan [Comment. Math.…

Suppose $\mu$ is a partition of $n$ and $\lambda$ a composition of $n$, and let $S^\mu$, $M^\lambda$ denote the Specht module and permutation module defined by Dipper and James for the Iwahori--Hecke algebra $\mathscr{H}_n$ of the symmetric…

In contrast with many other convex optimization classes, state-of-the-art semidefinite programming solvers are yet unable to efficiently solve large scale instances. This work aims to reduce this scalability gap by proposing a novel…

In this paper we describe a class of codes called {\it permutation codes}. This class of codes is a generalization of cyclic codes and quasi-cyclic codes. We also give some examples of optimal permutation codes over binary, ternary, and…

The rank modulation scheme has been proposed for efficient writing and storing data in non-volatile memory storage. Error-correction in the rank modulation scheme is done by considering permutation codes. In this paper we consider codes in…

The robust truss topology optimization against the uncertain static external load can be formulated as mixed-integer semidefinite programming. Although a global optimal solution can be computed with a branch-and-bound method, it is very…

Packing problems in discrete geometry can be modeled as finding independent sets in infinite graphs where one is interested in independent sets which are as large as possible. For finite graphs one popular way to compute upper bounds for…

We construct new, efficient, and accurate high-order finite differencing operators which satisfy summation by parts. Since these operators are not uniquely defined, we consider several optimization criteria: minimizing the bandwidth, the…

We define a 3-algebra with structure constants being symmetric in the first two indices. We also introduce an invariant anti-symmetric tensor into this 3-algebra and call it a symplectic 3-algebra. The general N=5 superconformal…

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…

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$-…