Related papers: Self-scaled barriers for irreducible symmetric con…
We apply supersymmetric localization to N=(2,2) gauged linear sigma models on a hemisphere, with boundary conditions, i.e., D-branes, preserving B-type supersymmetries. We explain how to compute the hemisphere partition function for each…
The decompositions of the Fock and Basic modules of the affine Lie algebra \hat{sl(N)} into irreducible submodules of the Yangian algebra Y(gl(N)) are constructed. Each of the irreducible submodules admits the unique up to normalization…
We show that a class of semidefinite programs (SDP) admits a solution that is a positive semidefinite matrix of rank at most $r$, where $r$ is the rank of the matrix involved in the objective function of the SDP. The optimization problems…
In this paper, we introduce a new kernel function which differs from previous functions, and play an important role for generating a new design of primal-dual interior point algorithms for semidefinite linear complementarity problem. Its…
This paper introduces the notion of calibrated representations for affine Hecke algebras and classifies and constructs all finite dimensional irreducible calibrated representations. The main results are that (1) irreducible calibrated…
This is the first in a series of articles about recovering the full algebraic structure of a boundary conformal field theory (CFT) from the scaling limit of the critical Ising model in slit-strip geometry. Here, we introduce spaces of…
Convex optimization encompasses a wide range of optimization problems that contain many efficiently solvable subclasses. Interior point methods are currently the state-of-the-art approach for solving such problems, particularly effective…
We consider the conic linear program given by a closed convex cone in an Euclidean space and a matrix, where vector on the right-hand-side of the constraint system and the vector defining the objective function are subject to change. Using…
Many real applications problems can be encoded easily as quantified formulas in SMT. However, this simplicity comes at the cost of difficulty during solving by SMT solvers. Different strategies and quantifier instantiation techniques have…
We introduce a generalization of symmetric functions and apply the resulting theory to compute the class in the Grothendieck ring of varieties of the space of geometrically irreducible hypersurfaces of a fixed degree in projective space.
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…
We study the possibility of applying a finite-dimensionality argument in order to address parts of the Baum-Connes conjecture for finitely generated linear groups. This gives an alternative approach to the results of Guentner, Higson, and…
Functional data are frequently accompanied by a parametric template that describes the typical shapes of the functions. However, these parametric templates can incur significant bias, which undermines both utility and interpretability. To…
We prove generalised concentration inequalities for a class of scaled self-bounding functions of independent random variables, referred to as ${(M,a,b)}$ self-bounding. The scaling refers to the fact that the component-wise difference is…
We study quasi-isometric embeddings of symmetric spaces and non-uniform irreducible lattices in semisimple higher rank Lie groups. We show that any quasi-isometric embedding between symmetric spaces of the same rank can be decomposed into a…
We study the structure of the flat space wavefunctional in scalar field theories with nonlinearly realized symmetries. These symmetries imply soft theorems that are satisfied by wavefunction coefficients in the limit where one of the…
We give a characterisation of the spectral properties of linear differential operators with constant coefficients, acting on functions defined on a bounded interval, and determined by general linear boundary conditions. The boundary…
We present new constraint qualification conditions for nonlinear semidefinite programming that extend some of the constant rank-type conditions from nonlinear programming. As an application of these conditions, we provide a unified global…
We resolve a conjecture of Cooper-Fenner-Purewal that a certain sequence of combinatorial matrices which can be used to bound small product-Ramsey numbers is positive semidefinite. Because the connection to Ramsey Theory involves solving…
We present a unified approach for characterizing the boundary of a possibly nonconvex domain. Motivated by the well-known Pascoletti--Serafini method of scalarization, we recast the boundary characterization as a multi-criteria optimization…