Related papers: Algebraic Curves for Factorized String Solutions
We construct the universal realized limit sketch associated to a given limit sketch. The construction uses factorization systems to organize the classical argument of [2], yielding a streamlined and conceptually unified formulation of the…
We present algorithms for parametrizing by radicals an irreducible curve, not necessarily plane, when the genus is less o equal to 4 and they are defined over an algebraically closed field of characteristic zero. In addition, we also…
We investigate the local contribution of the braid monodromy factorization in the context of the links obtained by the closure of these braids. We consider plane curves which are arrangements of lines and conics as well as some algebraic…
A higher order difference equation may be generally defined in an arbitrary nonempty set S as: \[ f_{n}(x_{n},x_{n-1},...,x_{n-k})=g_{n}(x_{n},x_{n-1},...,x_{n-k}) \] where $f_{n},g_{n} :S^{k+1}\rightarrow S$ are given functions for…
We combine the newly discovered technique, which computes explicit formulas for the image of an algebraic curve under rational transformation, with techniques that enable to compute braid monodromies of such curves. We use this combination…
We derive the general formula, at a finite cutoff, for the change in the boundary condition of a scalar field in AdS under a Multiple-trace deformation of the dual CFT. Our analysis suggests that fluctuations around the classical solution…
The self-expressive property of data points, i.e., each data point can be linearly represented by the other data points in the same subspace, has proven effective in leading subspace clustering methods. Most self-expressive methods usually…
We study linear difference equations with variable coefficients in a ring using a new nonlinear method. In a ring with identity, if the homogeneous part of the linear equation has a solution in the unit group of the ring (i.e., a unitary…
We consider a core language of graph queries. These queries are seen as formulas to be solved with respect to graph-oriented databases. For this purpose, we first define a graph query algebra where some operations over graphs and sets of…
We describe algebraic curves $ X : F(x, y) = 0 $ defined over $\overline{\mathbb{Q}}$ that satisfy the following property: there exist a number field $k$ and an infinite set $S \subset k$ such that, for every $y \in S$, the roots of the…
We prove that linearizing certain families of polynomial optimization problems leads to new functorial operations in real convex sets. We show that under some conditions these operations can be computed or approximated in ways amenable to…
Low-harmonic formulas for closed relativistic strings are given. General parametrizations are presented for the addition of second- and third-harmonic waves to the fundamental wave. The method of determination of the parametrizations is…
We formulate the stringy nonrelativistic limits of the flat space and AdS$_5\times$S$^5$ string as coset models, based on the string Bargmann and extended string Newton-Hooke algebras respectively. Our construction mimics the typical…
We show that a structural matrix algebra $A$ is isomorphic to the endomorphism algebra of an algebraic-combinatorial object called a generalized flag. If the flag is equipped with a group grading, an algebra grading is induced on $A$. We…
We use the theory of algebraic effects to give a complete equational axiomatization for dynamic threads. Our method is based on parameterized algebraic theories, which give a concrete syntax for strong monads on functor categories, and are…
We propose a method for constructing the Lax connection of two-dimensional relativistic integrable sigma models on coset spaces by means of exponentiation of a suitable operator. We derive a simple quadratic relation that this operator must…
The computational cost of many signal processing and machine learning techniques is often dominated by the cost of applying certain linear operators to high-dimensional vectors. This paper introduces an algorithm aimed at reducing the…
In this paper, we present a generalized version of the matrix chain algorithm to generate efficient code for linear algebra problems, a task for which human experts often invest days or even weeks of works. The standard matrix chain problem…
We develop a linear-algebraic framework for dimensional analysis in systems with constraints, particularly when variables are numerous or related by implicit relations so that direct elimination is impractical. By expressing both…
Based on results about open string correlation functions, a nonassociative algebra was proposed in a recent paper for D-branes in a background with nonvanishing $H$. We show that our associative algebra obtained by quantizing the endpoints…