Related papers: A compact representation for minimizers of $k$-sub…
We introduce fusion, contragradient and braiding of Hilbert affine representations of a subfactor planar algebra $P$ (not necessarily having finite depth). We prove that if $N \subset M$ is a subfactor realization of $P$, then the Drinfeld…
A numeric function $\rho$: $\rho(k)=1+\frac{k-1}{k+1}, k \in N$ was considered in [1]. In its terms criterions of finite representability and tameness of marked quivers, posets with equivalence and dyadic posets can be obtained; Dynkin…
Given a minuscule representation of a simple Lie algebra, we find an algebraic model for the action of a regular element and show that these models can be glued together over the adjoint quotient, viewed as the set of all regular conjugacy…
Submodular maximization generalizes many fundamental problems in discrete optimization, including Max-Cut in directed/undirected graphs, maximum coverage, maximum facility location and marketing over social networks. In this paper we…
\emph{$K$-best enumeration}, which asks to output $k$-best solutions without duplication, is a helpful tool in data analysis for many fields. In such fields, graphs typically represent data. Thus subgraph enumeration has been paid much…
We consider the convex optimization problem P: min {f(x): x in K} where "f" is convex continuously differentiable, and K is a compact convex set in Rn with representation {x: g_j(x) >=0, j=1,;;,m} for some continuously differentiable…
In this paper, we introduce a novel technique for constrained submodular maximization, inspired by barrier functions in continuous optimization. This connection not only improves the running time for constrained submodular maximization but…
Minimal representations of a real reductive group G are the `smallest' irreducible unitary representations of G. We discuss special functions that arise in the analysis of L^2-model of minimal representations.
We study the problem of maximizing a non-negative monotone $k$-submodular function $f$ under a knapsack constraint, where a $k$-submodular function is a natural generalization of a submodular function to $k$ dimensions. We present a…
For a compact subset $K$ of the complex plane $\mathbb C,$ let $C(K)$ denote the algebra of continuous functions on $K$. For an open subset $U \subset K,$ let $A(K,U) \subset C(K)$ be the algebra of functions that are analytic in $U.$ We…
Many imaging problems can be formulated as inverse problems expressed as finite-dimensional optimization problems. These optimization problems generally consist of minimizing the sum of a data fidelity and regularization terms. In [23,26],…
This paper investigates connections between discrete and continuous approaches for decomposable submodular function minimization. We provide improved running time estimates for the state-of-the-art continuous algorithms for the problem…
Minimizers sampling is one of the most widely-used mechanisms for sampling strings [Roberts et al., Bioinformatics 2004]. Let $S=S[1]\ldots S[n]$ be a string over a totally ordered alphabet $\Sigma$. Further let $w\geq 2$ and $k\geq 1$ be…
Let $G$ be a connected, linear, real reductive Lie group with compact centre. Let $K<G$ be maximal compact. For a tempered representation $\pi$ of $G$, we realise the restriction $\pi|_K$ as the $K$-equivariant index of a Dirac operator on…
Covering and elimination inequalities are central to combinatorial optimization, yet their role has largely been studied in problem-specific settings or via no-good cuts. This paper introduces a unified perspective that treats these…
The Poincare function is a compact form of counting moduli in local geometric problems. We discuss its property in relation to V.Arnold's conjecture, and derive this conjecture in the case when the pseudogroup acts algebraically and…
Approximate message passing (AMP) is a family of iterative algorithms that generalize matrix power iteration. AMP algorithms are known to optimally solve many average-case optimization problems. In this paper, we show that a large class of…
We introduce a new class of functions that can be minimized in polynomial time in the value oracle model. These are functions $f$ satisfying $f(x)+f(y)\ge f(x \sqcap y)+f(x \sqcup y)$ where the domain of each variable $x_i$ corresponds to…
We consider the problem of computing the minimum of a polynomial function g on a basic closed semialgebraic set E in R^n. We present a probabilistic symbolic algorithm to find a finite set of sample points of the subset E^{min} of E where…
In this paper we solve the Dirichlet problems for different classes of plurisubharmonic functions on compact sets in $\mathbb C^n$ including continuous, pluriharmonic and maximal functions.