Related papers: Algebraic Curves for Factorized String Solutions
We study the general rational solution of the Yang-Baxter equation with the symmetry algebra sl(3). The R-matrix acting in the tensor product of two arbitrary representations of the symmetry algebra can be represented as the product of the…
We represent vector bundles over a regular algebraic curve as pairs of lattices over the maximal orders of its function field and we give polynomial time algorithms for several tasks: computing determinants of vector bundles, kernels and…
We compare alternative computing strategies for solving the constrained lasso problem. As its name suggests, the constrained lasso extends the widely-used lasso to handle linear constraints, which allow the user to incorporate prior…
Let $ R $ be a regular local ring with maximal ideal $ \mathfrak{m} $. We consider elements $ f \in R $ such that their Newton polyhedron has a loose edge. We show that if the symbolic restriction of $f$ to such an edge is a product of two…
The paper introduces the butterfly factorization as a data-sparse approximation for the matrices that satisfy a complementary low-rank property. The factorization can be constructed efficiently if either fast algorithms for applying the…
In this paper, we describe an algorithm for fitting an analytic and bandlimited closed or open curve to interpolate an arbitrary collection of points in $\mathbb{R}^{2}$. The main idea is to smooth the parametrization of the curve by…
We study the q-deformed Knizhnik-Zamolodchikov equation in path representations of the Temperley-Lieb algebras. We consider two types of open boundary conditions, and in both cases we derive factorised expressions for the solutions of the…
In this note, we explore the correspondence between four-dimensional flat space S-matrix and two-dimensional CFT proposed by Pasterski et al. We demonstrate that the factorization singularities of an n-point cubic diagram reproduces the AdS…
It is well known that an implicit equation of the offset to a rational planar curve can be computed by removing the extraneous components of the resultant of two certain polynomials computed from the parametrization of the curve.…
A collaborative convex framework for factoring a data matrix $X$ into a non-negative product $AS$, with a sparse coefficient matrix $S$, is proposed. We restrict the columns of the dictionary matrix $A$ to coincide with certain columns of…
The factor graph of an instance of a symmetric constraint satisfaction problem on n Boolean variables and m constraints (CSPs such as k-SAT, k-AND, k-LIN) is a bipartite graph describing which variables appear in which constraints. The…
We give an algorithm for constructing the algebraic hull of a given matrix Lie algebra in characteristic zero. It is based on an algorithm for finding integral linear dependencies of the roots of a polynomial, that is probably of…
Regularization techniques are widely employed in optimization-based approaches for solving ill-posed inverse problems in data analysis and scientific computing. These methods are based on augmenting the objective with a penalty function,…
We provide a construction of free factorization algebras in algebraic geometry and link factorization homology of a scheme with coefficients in a free factorization algebra to the homology of its (unordered) configuration spaces. As an…
We present an algorithm for factoring linear differential operators with coefficients in a finite separable extension of F p (x). Our methods rely on specific tools arising in positive characteristic: p-curvature, structure of simple…
We propose a Quantum Spectral Curve for planar string theory on AdS3*S3*S3*S1 supported by pure Ramond-Ramond flux. Our proposal is built on symmetry considerations and integrability-based functional relations. To test our construction, we…
The prescription of the AdS/CFT correspondence is refined by using a regularization procedure, which makes is possible to calculate the divergent local terms in the CFT two-point function. We present the procedure for the example of the…
In exploratory factor analysis, rotation techniques are employed to derive interpretable factor loading matrices. Factor rotations deal with equality-constrained optimization problems aimed at determining a loading matrix based on measure…
Many Ramond-Ramond backgrounds which arise in the AdS/CFT correspondence are described by integrable sigma-models. The equations of motion for classical spinning strings in these backgrounds are exactly solvable by finite-gap integration…
This work investigates the geometry of a nonconvex reformulation of minimizing a general convex loss function $f(X)$ regularized by the matrix nuclear norm $\|X\|_*$. Nuclear-norm regularized matrix inverse problems are at the heart of many…