Related papers: The linear programming relaxation permutation symm…

The stable torsion length in a group is the stable word length with respect to the set of all torsion elements. We show that the stable torsion length vanishes in crystallographic groups. We then give a linear programming algorithm to…

Denote by $Sp(k,l)$ the quaternionic symplectic group of signature $(k,l)$. We study the deformation rigidity of the embedding $Sp(k,l) \times Sp(1) \hookrightarrow H$, where $H$ is either $Sp(k+1,l)$ or $Sp(k,l+1)$, this is done by…

Let $k$ be an algebraically closed field of positive characteristic $p$. We describe the full lattice of subfunctors of the diagonal $p$-permutation functor $kR_k$ obtained by $k$-linear extension from the functor $R_k$ of linear…

Integer Linear Programming (ILP) serves as a versatile framework for modeling a wide range of combinatorial optimization problems, typically addressed by sophisticated exact solvers or heuristics. While learning-based approaches have…

Interior point methods (IPMs) are a common approach for solving linear programs (LPs) with strong theoretical guarantees and solid empirical performance. The time complexity of these methods is dominated by the cost of solving a linear…

For an arbitrary finite permutation group $G$, subgroup of the symmetric group $S_\ell$, we determine the permutations involving only members of $G$ as $\ell$-patterns, i.e., avoiding all patterns in the set $S_\ell \setminus G$. The set of…

MAP inference for general energy functions remains a challenging problem. While most efforts are channeled towards improving the linear programming (LP) based relaxation, this work is motivated by the quadratic programming (QP) relaxation.…

Graphical models with High Order Potentials (HOPs) have received considerable interest in recent years. While there are a variety of approaches to inference in these models, nearly all of them amount to solving a linear program (LP)…

Consider a reductive linear algebraic group $G$ acting linearly on a polynomial ring $S$ over an infinite field; key examples are the general linear group, the symplectic group, the orthogonal group, and the special linear group, with the…

Let $p\ge 5$ be a prime and let $n$ be a natural number. In this article we describe the irreducible constituents of the induced characters $\phi\big\uparrow^{\mathfrak{S}_n}$ for arbitrary linear characters $\phi$ of a Sylow $p$-subgroup…

Let $p$ be any prime. We determine precisely those irreducible characters of symmetric groups which contain at most $p$ distinct linear constituents in their restriction to a Sylow $p$-subgroup, answering a question of Giannelli and…

This paper studies robust solutions and semidefinite linear programming (SDP) relaxations of a class of convex polynomial programs in the face of data uncertainty. The class of convex programs, called robust SOS-convex programs, includes…

Recent interest on permutation rank modulation shows the Kendall tau metric as an important distance metric. This note documents our first efforts to obtain upper bounds on optimal code sizes (for said metric) ala Delsarte's approach. For…

Let $\mathbb{F}_2^\omega$ denote the countably infinite dimensional vector space over the two element field and $\operatorname{GL}(\omega, 2)$ its automorphism group. Moreover, let $\operatorname{Sym}(\mathbb{F}_2^\omega)$ denote the…

We introduce IsalProgram (Instruction Set and Language for Programming), a novel assembly-like programming language with three distinctive theoretical properties: (1) it is a regular language in the sense of formal language theory, meaning…

It is shown that the problem of reduction can be formulated in a uniform way using the theory of invariants. This provides a powerful tool of analysis and it opens the road to new applications of these algebras, beyond the context of…

This article presents a numerical illustration of a recently proposed strongly polynomial-time algorithm for the general linear programming (LP) problem. Each iteration of the proposed algorithm consists of two Gauss-Jordan pivoting…

Let $S_n$ be the symmetric group on the set $\{1,2,\ldots,n\}$. Given a permutation $\sigma=\sigma_1\sigma_2 \cdots \sigma_n \in S_n$, we say it has a peak at index $i$ if $\sigma_{i-1}<\sigma_i>\sigma_{i+1}$. Let $\text{Peak}(\sigma)$ be…

This paper presents some algorithms in linear algebraic groups. These algorithms solve the word problem and compute the spinor norm for orthogonal groups. This gives us an algorithmic definition of the spinor norm. We compute the double…

For an integer linear optimization (ILO) problem, persistency of its linear optimization (LO) relaxation is a property that for every optimal solution of the relaxation that assigns integer values to some variables, there exists an optimal…