Related papers: Algebraic Geometry of Error Amplification: the Pro…
The purpose of this paper is to explore the question "to what extent could we produce formal, machine-verifiable, proofs in real algebraic geometry?" The question has been asked before but as yet the leading algorithms for answering such…
The interplay rich between algebraic geometry and string and gauge theories has recently been immensely aided by advances in computational algebra. However, these symbolic (Gr\"{o}bner) methods are severely limited by algorithmic issues…
This survey describes probabilistic algorithms for linear algebra computations, such as factorizing matrices and solving linear systems. It focuses on techniques that have a proven track record for real-world problem instances. The paper…
We initiate the study of positive geometry and scattering forms for tree-level amplitudes with matter particles in the (anti-)fundamental representation of the color/flavor group. As a toy example, we study the bi-color scalar theory, which…
We prove an extension criterion for codimension one foliations on projective hypersurfaces based on the degree of the foliation and the degree of the hypersurface, and we ensure, in some instances, an isomorphism between the corresponding…
Multiplicative gating is widely used in neural architectures and has recently been applied to attention layers to improve performance and training stability in large language models. Despite the success of gated attention, the mathematical…
The {\sc Directed Maximum Leaf Out-Branching} problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this paper, we improve known parameterized algorithms and…
This paper describes a simple greedy D-approximation algorithm for any covering problem whose objective function is submodular and non-decreasing, and whose feasible region can be expressed as the intersection of arbitrary (closed upwards)…
We study the optimal approximation of the solution of an operator equation by certain n-term approximations with respect to specific classes of frames. We study worst case errors and the optimal order of convergence and define suitable…
Combining the techniques of approximation algorithms and parameterized complexity has long been considered a promising research area, but relatively few results are currently known. In this paper we study the parameterized approximability…
This paper is a continuation of ``Operads, Grothendieck topologies and deformation theory'' (alg-geom/9502010). We show how to develop a cohomology theory that would control deformations of a sheaf of associative algebras over a scheme by…
The techniques and analysis presented in this thesis provide new methods to solve optimization problems posed on Riemannian manifolds. These methods are applied to the subspace tracking problem found in adaptive signal processing and…
We develop novel tools for computing the likelihood correspondence of an arrangement of hypersurfaces in a projective space. This uses the module of logarithmic derivations. This object is well-studied in the linear case, when the…
This paper continues math.GR/0608302's study of amenability of affine algebras (based on the notion of almost-invariant finite-dimensional subspace), and applies it to graded algebras associated with finitely generated groups. Due to a…
Converting a parametric curve into the implicit form, which is called implicitization, has always been a popular but challenging problem in geometric modeling and related applications. However, the existing methods mostly suffer from the…
In the present paper, it was studied the boundary behavior of the so-called lower Q-homeomorphisms in the plane that are a natural generalization of the quasiconformal mappings. In particular, it was found a series of effective conditions…
This thesis establishes new quantitative records in several problems of incidence geometry and growth. After the necessary background in Chapters 1, 2 and 3, the following results are proven. Chapter 4 gives new results in the incidence…
We discuss various problems regarding the structure of the foliation of some foliated submanifolds S of C^n, in particular Levi flat ones. As a general scheme, we suppose that S is bounded along a coordinate (or a subset of coordinates),…
In this work we study the geometric properties of spacelike foliations by hypersurfaces on a Lorentz manifold. We find an equation that relates the foliation with the ambient manifold and apply it to investigate conditions for the leaves…
In this paper we develop new Newton and conjugate gradient algorithms on the Grassmann and Stiefel manifolds. These manifolds represent the constraints that arise in such areas as the symmetric eigenvalue problem, nonlinear eigenvalue…