Related papers: The linear programming relaxation permutation symm…
Near isometric orthogonal embeddings to lower dimensions are a fundamental tool in data science and machine learning. In this paper, we present the construction of such embeddings that minimizes the maximum distortion for a given set of…
Given a set $I \subseteq \mathbb{N}$, consider the sequences $\{d_n(I)\},\{p_n(I)\}$ where for any $n$, $d_n(I)$ and $p_n(I)$ respectively count the number of permutations in the symmetric group $\mathfrak{S}_n$ whose descent set…
The endomorphism algebras of the permutation modules for transitive permutation groups, known as Hecke algebras, are fundamental objects in representation theory. While group algebras are known to be symmetric over any field, it is natural…
Permutation resemblance measures the distance of a function from being a permutation. Here we show how to determine the permutation resemblance through linear integer programming techniques. We also present an algorithm for constructing…
Let S be a principally embedded sl_2 subalgebra in sl_n for n > 2. A special case of results of the third author and Gregg Zuckerman implies that there exists a positive integer b(n) such that for any finite-dimensional irreducible sl_n…
Let $L_n$ be the free metabelian Leibniz algebra generated by the set $X_n=\{x_1,\ldots,x_n\}$ over a field $K$ of characteristic zero. This is the free algebra of rank $n$ in the variety of solvable of class $2$ Leibniz algebras. We call…
The family of symmetric powers of an $L$-function associated with an elliptic curve with complex multiplication has received much attention from algebraic, automorphic and p-adic points of view. Here we examine one explicit such family from…
An uniform LP duality is an useful property of conic matrix systems. A consistent linear conic optimization problem yields uniform LP duality if for any linear cost function, for which the primal problem has finite optimal value, the…
Integer Linear Programming (ILP) can be seen as the archetypical problem for NP-complete optimization problems, and a wide range of problems in artificial intelligence are solved in practice via a translation to ILP. Despite its huge range…
The paper is a part of an ongoing program which aims to show that the existential theory in free groups (hyperbolic groups or even toral relatively hyperbolic) is NP-complete. For that we study compression of solutions with straight-line…
Positive linear programs (LP), also known as packing and covering linear programs, are an important class of problems that bridges computer science, operations research, and optimization. Despite the consistent efforts on this problem, all…
The linear programming (LP) approach has a long history in the theory of approximate dynamic programming. When it comes to computation, however, the LP approach often suffers from poor scalability. In this work, we introduce a relaxed…
Mixed-integer linear programming (MILP) is at the core of many advanced algorithms for solving fundamental problems in combinatorial optimization. The complexity of solving MILPs directly correlates with their support size, which is the…
In this paper we study different restrictions imposed over the set of permutations of size $n$, $S_n$, and for specific classes of restrictions study the cycle structure of corresponding permutations. More specifically, we prove that for…
In this paper we consider the integral orthogonal group with respect to the quadratic form of signature $(2,3)$ given by $\left(\begin{smallmatrix} 0 & 1 \\ 1 & 0 \end{smallmatrix}\right) \perp \left(\begin{smallmatrix} 0 & 1 \\ 1 & 0…
We consider fundamental algorithmic number theoretic problems and their relation to a class of block structured Integer Linear Programs (ILPs) called $2$-stage stochastic. A $2$-stage stochastic ILP is an integer program of the form $\min…
We consider the general polynomial optimization problem $P: f^*=\min \{f(x)\,:\,x\in K\}$ where $K$ is a compact basic semi-algebraic set. We first show that the standard Lagrangian relaxation yields a lower bound as close as desired to the…
We relate the linear asymptotic representation theory of the symmetric groups to its spin counterpart. In particular, we give explicit formulas which express the normalized irreducible spin characters evaluated on a strict partition $\xi$…
In this paper, we study existence of isometric embedding of $S_q^m$ into $S_p^n,$ where $1\leq p\neq q\leq \infty$ and $n\geq m\geq 2.$ We show that for all $n\geq m\geq 2$ if there exists a linear isometry from $S_q^m$ into $S_p^n$, where…
We consider the problem of exact and inexact matching of weighted undirected graphs, in which a bijective correspondence is sought to minimize a quadratic weight disagreement. This computationally challenging problem is often relaxed as a…