Related papers: The linear programming relaxation permutation symm…
A permutation $\tau$ in the symmetric group $S_j$ is minimally overlapping if any two consecutive occurrences of $\tau$ in a permutation $\sigma$ can share at most one element. B\'ona \cite{B} showed that the proportion of minimal…
Let $\Gamma_{g}$ be the fundamental group of a closed connected orientable surface of genus $g\geq2$. We develop a new method for integrating over the representation space $\mathbb{X}_{g,n}=\mathrm{Hom}(\Gamma_{g},S_{n})$ where $S_{n}$ is…
By a map we mean a $2$-cell decomposition of a closed compact surface, i.e., an embedding of a graph such that every face is homeomorphic to an open disc. Automorphism of a map can be thought of as a permutation of the vertices which…
Let $\gg$ be the Lie algebra of a compact Lie group and let $\theta$ be any automorphism of $\gg$. Let $\gk$ denote the fixed point subalgebra $\gg^\theta$. In this paper we present LiE programs that, for any finite dimensional complex…
The notion of rigidity of Lie algebra is linked to the following problem: when does a Lie brackets $\mu$ on a vector space g satisfy that every Lie bracket $\mu_1$ sufficiently close to $\mu$ is of the form $\mu_1 = P.\mu $ for some P in…
A bar-joint framework $(G,p)$ is the combination of a finite simple graph $G=(V,E)$ and a placement $p:V\rightarrow \mathbb{R}^d$. The framework is rigid if the only edge-length preserving continuous motions of the vertices arise from…
We consider building, given a straight-line program (SLP) consisting of $g$ productions deriving a two-dimensional string $T$ of size $N\times N$, a structure capable of providing random access to any character of $T$. For one-dimensional…
Label assignment problems with large state spaces are important tasks especially in computer vision. Often the pairwise interaction (or smoothness prior) between labels assigned at adjacent nodes (or pixels) can be described as a function…
Many problems of interest in computer vision can be formulated as a problem of finding consistent correspondences between two feature sets. Feature correspondence (matching) problem with one-to-one mapping constraint is usually formulated…
Let $i(\infty,k)$ be the limiting proportion, as $n \rightarrow \infty$, of permutations in the symmetric group of degree $n$ that fix a $k$-set. We give an algorithm for computing $i(\infty,k)$ and state the values of $i(\infty,k)$ for $k…
Assuming Stanley's $P$-partition conjecture holds, the regular Schur labeled skew shape posets with underlying set $\{1,2,\ldots, n\}$ are precisely the posets $P$ such that the $P$-partition generating function is symmetric and the set of…
Concepts of consistency have long played a key role in constraint programming but never developed in integer programming (IP). Consistency nonetheless plays a role in IP as well. For example, cutting planes can reduce backtracking by…
A skew morphism of a finite group $B$ is a permutation of $B$ fixing the identity and satisfying $\varphi(xy) = \varphi(x)\varphi^{i_x}(y)$ for some integers $i_x$ indexed by $x \in B$. The enumeration of skew morphisms of finite cyclic…
Let $K$ be a complete discretely valued field whose residue field has characteristic different from $2$. Let $(D,\sigma)$ be a $K-$division algebra with involution of the first kind, and $h$ be a $K-$anisotropic $\epsilon$-hermitian form…
This paper investigates two related optimal input selection problems for fixed (non-switched) and switched structured systems. More precisely, we consider selecting the minimum cost of inputs from a prior set of inputs, and selecting the…
An integer program (IP) with a finite number of feasible solutions may have an unbounded linear programming relaxation if it contains irrational parameters, due to implicit constraints enforced by the irrational numbers. We show that those…
A polynomial-time algorithm for 0-1 integer linear programmings has been proposed. This method continues the classic idea of solving ILP with its LP relaxation. The innovation is that every constraint in the LP is reconstructed into a…
This is a survey on the infinite group problem, an infinite-dimensional relaxation of integer linear optimization problems introduced by Ralph Gomory and Ellis Johnson in their groundbreaking papers titled "Some continuous functions related…
Here we study the complexity of string problems as a function of the size of a program that generates input. We consider straight-line programs (SLP), since all algorithms on SLP-generated strings could be applied to processing…
The paper provides a connection between Commutative Algebra and Integer Programming and contains two parts. The first one is devoted to the asymptotic behavior of integer programs with a fixed cost linear functional and the constraint sets…