Related papers: The linear programming relaxation permutation symm…
Recently a strong connection has been shown between the tractability of integer programming (IP) with bounded coefficients on the one side and the structure of its constraint matrix on the other side. To that end, integer linear programming…
Advances in the study of relativistic quantum phase space have established the set of Linear Canonical Transformations (LCTs) as a candidate for the fundamental symmetry group associated with relativistic quantum physics. In this framework,…
The irreducible characters of the symmetric group are a symmetric polynomial in the eigenvalues of a permutation matrix. They can therefore be realized as a symmetric function that can be evaluated at a set of variables and form a basis of…
The group algebra of the permutation group is spanned by a set of elements called projectors. The coordinates of permutations expanded in projectors are matrix elements of irreducible representations. The projectors of the permutation group…
We develop a new `subspace layered least squares' interior point method (IPM) for solving linear programs. Applied to an $n$-variable linear program in standard form, the iteration complexity of our IPM is up to an $O(n^{1.5} \log n)$…
We introduce fast randomized algorithms for solving semidefinite programming (SDP) relaxations of the partial permutation synchronization (PPS) problem, a core task in multi-image matching with significant relevance to 3D reconstruction.…
Linear programming (LP) is an extremely useful tool and has been successfully applied to solve various problems in a wide range of areas, including operations research, engineering, economics, or even more abstract mathematical areas such…
In this paper, we consider two formulations for Linear Matrix Inequalities (LMIs) under Slater type constraint qualification assumption, namely, SDP smooth and non-smooth formulations. We also propose two first-order linearly convergent…
We study the conditions under which the convex relaxation of a mixed-integer linear programming formulation for ordered optimization problems, where sorting is part of the decision process, yields integral optimal solutions. Thereby solving…
Quadratic programs with box constraints involve minimizing a possibly nonconvex quadratic function subject to lower and upper bounds on each variable. This is a well-known NP-hard problem that frequently arises in various applications. We…
We introduce a generic technique to obtain linear relaxations of semidefinite programs with provable guarantees based on the commutativity of the constraint and the objective matrices. We study conditions under which the optimal value of…
The purpose of this paper is to provide an octonionic description of the Lie group $SL(2,{\mathbb O})$. The main result states that it can be obtained as a free group generated by invertible and determinant preserving transformations from…
Let $S_n$ denote the set of permutations of $[n]:=\{1,\cdots, n\}$, and denote a permutation $\sigma\in S_n$ by $\sigma=\sigma_1\sigma_2\cdots \sigma_n$. For $l\ge2$ an integer, let $A^{(n)}_{l;k}\subset S_n$ denote the event that the set…
We present an ideal mixed-integer programming (MIP) formulation for a rectified linear unit (ReLU) appearing in a trained neural network. Our formulation requires a single binary variable and no additional continuous variables beyond the…
Logic programs P and Q are strongly equivalent if, given any program R, programs P union R and Q union R are equivalent (that is, have the same answer sets). Strong equivalence is convenient for the study of equivalent transformations of…
In the field of Answer Set Programming (ASP), two logic programs are strongly equivalent if they are ordinarily equivalent under any extensions. This property provides a theoretical foundation for studying many aspects of logic programs…
Internal Pattern Matching (IPM) queries on a text $T$, given two fragments $X$ and $Y$ of $T$ such that $|Y|<2|X|$, ask to compute all exact occurrences of $X$ within $Y$. IPM queries have been introduced by Kociumaka, Radoszewski, Rytter,…
In this paper we postulate an algebraic model to explain how the symmetry of three lepton species plays its role in the Lorentz extension. Inspired by the two-to-one mapping between the group SL (2, C) and the Lorentz group, we design a…
Let $\Omega$ denote a non-empty finite set. Let $S(\Omega)$ stand for the symmetric group on $\Omega$ and let us write $P(\Omega)$ for the power set of $\Omega$. Let $\rho: S(\Omega) \to U(L^2(P(\Omega)))$ be the left unitary representation…
We construct a complex $\mathcal{L}_\bullet^\lambda$ resolving the irreducible representations $\mathcal{S}^{\lambda[n]}$ of the symmetric groups $S_n$ by representations restricted from $GL_n(k)$. This construction lifts to…