Related papers: Algebraic Curves for Factorized String Solutions
A garland based on a manifold $P$ is a finite set of manifolds homeomorphic to $P$ with some of them glued together at marked points. Fix a manifold $M$ and consider a space $\NN$ of all smooth mappings of garlands based on $P$ into $M$. We…
Factor analysis is a statistical technique that explains correlations among observed random variables with the help of a smaller number of unobserved factors. In traditional full factor analysis, each observed variable is influenced by…
Given a curve $C$ over a number field $K$ equipped with the action of a finite group $G$ by $K$-automorphisms, one obtains a factorisation of $L(C,s)$ into a product of $L$-functions of `motivic pieces of curves' associated to irreducible…
The nonnegative matrix factorization is a widely used, flexible matrix decomposition, finding applications in biology, image and signal processing and information retrieval, among other areas. Here we present a related matrix factorization.…
We refine and advance the study of the local structure of idempotent finite algebras started in [A.Bulatov, The Graph of a Relational Structure and Constraint Satisfaction Problems, LICS, 2004]. We introduce a graph-like structure on an…
We describe a graph-based neural acceleration technique for nonnegative matrix factorization that builds upon a connection between matrices and bipartite graphs that is well-known in certain fields, e.g., sparse linear algebra, but has not…
We extend the formalism introduced in the paper hep-th/0209050 to compute correlation functions in the AdS/CFT correspondence. We show how the on-shell action of a scalar field in a compactification of AdS space can be obtained by flowing…
With the recent success of representation learning methods, which includes deep learning as a special case, there has been considerable interest in developing techniques that incorporate known physical constraints into the learned…
The discrete Lax operators with the spectral parameter on an algebraic curve are defined. A hierarchy of commuting flows on the space of such operators is constructed. It is shown that these flows are linearized by the spectral transform…
We study the computational complexity of graph planarization via edge contraction. The problem CONTRACT asks whether there exists a set $S$ of at most $k$ edges that when contracted produces a planar graph. We work with a more general…
We derive a formula for the adjoint $\overline{A}$ of a square-matrix operation of the form $C=f(A)$, where $f$ is holomorphic in the neighborhood of each eigenvalue. We then apply the formula to derive closed-form expressions in particular…
The purpose of this note is to prove that there is an algebraic stack U parameterizing all curves. The curves that appear in the algebraic stack U are allowed to be arbitrarily singular, non-reduced, disconnected, and reducible. We also…
In this paper, we present a new, graph-based modeling approach and a polynomial-sized linear programming (LP) formulation of the Boolean satisfiability problem (SAT). The approach is illustrated with a numerical example.
We show that the factorization problem $\theta (z)=\theta_2(z)\theta_1(z)$ is solvable in the class of Hilbert space operator-valued functions holomorphic on some neighbourhood of $z=0$ in $\nspace{C}{N}$ and having a zero at $z=0$ (here…
Data processing systems impose multiple views on data as it is processed by the system. These views include spreadsheets, databases, matrices, and graphs. Associative arrays unify and simplify these different approaches into a common…
Algebraic geometry, although little explored in signal processing, provides tools that are very convenient for investigating generic properties in a wide range of applications. Generic properties are properties that hold "almost…
We show that the linear or quadratic 0/1 program\[P:\quad\min\{ c^Tx+x^TFx : \:A\,x =b;\:x\in\{0,1\}^n\},\]can be formulated as a MAX-CUT problem whose associated graph is simply related to the matrices $\F$ and $\A^T\A$.Hence the whole…
In this paper we provide for parsing with respect to grammars expressed in a general TFS-based formalism, a restriction of ALE. Our motivation being the design of an abstract (WAM-like) machine for the formalism, we consider parsing as a…
We resolve a puzzle in the theory of strings propagating on locally flat spacetimes with nontrivial Wilson lines for stringy Z_N gauge symmetries. We find that strings probing such backgrounds are described by consistent worldsheet CFTs.…
We study a family of (potentially non-convex) constrained optimization problems with convex composite structure. Through a novel analysis of non-smooth geometry, we show that proximal-type algorithms applied to exact penalty formulations of…