Related papers: A Note on Gram-Schmidt's Algorithm for a General A…
Gaussian process regression is widely used because of its ability to provide well-calibrated uncertainty estimates and handle small or sparse datasets. However, it struggles with high-dimensional data. One possible way to scale this…
The convergence of a new general variable metric algorithm based on compositions of averaged operators is established. Applications to monotone operator splitting are presented.
An algorithm is presented that generates sets of size equal to the degree of a given variety defined by a homogeneous ideal. This algorithm suggests a versatile framework to study various problems in combinatorial algebraic geometry and…
I show how applying a symplectic Gram-Schmidt orthogonalization to the normalizer of a quantum code gives a different way of determining the code's logical operators. This approach may be more natural in the setting where we produce a…
We study the problem of moving a vertex in an unstructured mesh of triangular, quadrilateral, or tetrahedral elements to optimize the shapes of adjacent elements. We show that many such problems can be solved in linear time using…
Let $G$ be a finite group generated by $k$ elements. The well-known product replacement algorithm provides an effective method for sampling generating sets of $G$. We study a refinement of this algorithm that is designed to output…
Witten's Gauged Linear $\sigma$-Model (GLSM) unifies the Gromov-Witten theory and the Landau-Ginzburg theory, and provides a global perspective on mirror symmetry. In this article, we summarize a mathematically rigorous construction of the…
A set of Hamiltonians that are not self-adjoint but have the spectrum of the harmonic oscillator is studied. The eigenvectors of these operators and those of their Hermitian conjugates form a bi-orthogonal system that provides a…
The affine Grassmannian is a noncompact smooth manifold that parameterizes all affine subspaces of a fixed dimension. It is a natural generalization of Euclidean space, points being zero-dimensional affine subspaces. We will realize the…
Given a set D of nonnegative integers, we derive the asymptotic number of graphs with a givenvnumber of vertices, edges, and such that the degree of every vertex is in D. This generalizes existing results, such as the enumeration of graphs…
We call Krawtchouk-Griffiths systems, or KG-systems, systems of multivariate polynomials orthogonal with respect to corresponding multinomial distributions. The original Krawtchouk polynomials are orthogonal with respect to a binomial…
A Geometric programming (GP) is a type of mathematical problem characterized by objective and constraint functions that have a special form. Many methods have been developed to solve large scale engineering design GP problems. In this paper…
Frames are the most natural generalization of orthonormal bases that allow the inclusion of redundant systems. In this article, we introduce the concept of frames generated by graphs in finite-dimensional spaces and study their properties.…
In this paper, we give an algorithm to infer the positions of the vertices of an unknown tetrahedron, given a sample of points which are uniformly distributed within the tetrahedron. The accuracy of the algorithm is demonstrated using some…
A planar orthogonal drawing {\Gamma} of a connected planar graph G is a geometric representation of G such that the vertices are drawn as distinct points of the plane, the edges are drawn as chains of horizontal and vertical segments, and…
In three-dimensional Euclidean geometry, the scalar product produces a number associated to two vectors, while the vector product computes a vector perpendicular to them. These are key tools of physics, chemistry and engineering and…
By using the theory of analytic vectors and manifolds modelled on normed spaces, we provide a rigorous symplectic differential geometric approach to $t$-dependent Schr\"odinger equations on separable (possibly infinite-dimensional) Hilbert…
This paper is about producing a new kind of the pairs which we call it MS-pairs. To produce these pairs, we use an algorithm for dividing a natural number $x$ by two for two arbitrary numbers and consider their related graphs. We present…
We describe a uniformly fast algorithm for generating points \vec{x} uniformly in a hypercube with the restriction that the difference between each pair of coordinates is bounded. We discuss the quality of the algorithm in the sense of its…
We introduce a convenient framework for constructing and analyzing orthogonal Thom spectra arising from virtual vector bundles. This framework enables us to set up a theory of orientations and graded Thom isomorphisms with good…