Related papers: Embedding algorithms and applications to different…

This paper investigates the foundations of deep learning through insight of geometry, algebra and differential calculus. At is core, artificial intelligence relies on assumption that data and its intrinsic structure can be embedded into…

An algorithm for the computation of global discrete conformal parametrizations with prescribed global holonomy signatures for triangle meshes was recently described in [Campen and Zorin 2017]. In this paper we provide a detailed analysis of…

Phylogenetic models have polynomial parametrization maps. For symmetric group-based models, Matsen studied the polynomial inequalities that characterize the joint probabilities in the image of these parametrizations. We employ this…

We present a new numerical method for the isometric embedding of 2-geometries specified by their 2-metrics in three dimensional Euclidean space. Our approach is to directly solve the fundamental embedding equation supplemented by six…

It is well known that selecting a good Mixed Integer Programming (MIP) formulation is crucial for an effective solution with state-of-the art solvers. While best practices and guidelines for constructing good formulations abound, there is…

By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In…

We prove that for any fixed unitary matrix $U$, any abelian self-adjoint algebra of matrices that is invariant under conjugation by $U$ can be embedded into a maximal abelian self-adjoint algebra that is still invariant under conjugation by…

When two or more subsystems of a quantum system interact with each other they can become entangled. In this case the individual subsystems can no longer be described as pure quantum states. For systems with only 2 subsystems this…

This paper designs an alogrithm to compute the minimal combinations of finite sets in Euclidean spaces, and applys the algorithm of study the moment maps and geometric invariant stability of hypersurfaces. The classical example of cubic…

A criterion for determining exactly when an order of a maximal subfield of a central simple algebra over a number field can be embedded into an order of this algebra is given. Various previous results have been generalized and recovered by…

Given a pair of nilpotent orbits in a simple Lie algebra, one can associate a pair of vertex algebras called affine W-algebras. Under some compatibility conditions on these orbits, we prove that one of these W-algebras can be obtained as…

This paper proposes a general framework of Riemannian adaptive optimization methods. The framework encapsulates several stochastic optimization algorithms on Riemannian manifolds and incorporates the mini-batch strategy that is often used…

Taking into account the theoretical results and guidelines given inthis work, we introduce a computational method to construct any 2 step nilpotent quadratic algebra of d generators. Along the work we show that the key of the classification…

We discuss some specializations of the frames of flat orthonormal frame bundles over geometries of indefinite signature, and the resulting symmetries of families of embedded Riemannian or pseudo-Riemannian geometries. The specializations…

This paper proposes and develops a new Newton-type algorithm to solve subdifferential inclusions defined by subgradients of extended-real-valued prox-regular functions. The proposed algorithm is formulated in terms of the second-order…

The polynomial algebra is a deformed SU(2) algebra. Here, we use polynomial algebra as a method to solve a series of deformed oscillators. Meanwhile, we find a series of physics systems corresponding with polynomial algebra with different…

We present higher order polynomial algebras which are the dynamical symmetry algebras of a wide class of multi-mode boson systems in non-linear optics. We construct their unitary representations and the corresponding single-variable…

We have presented some practical consequences on the molecular-dynamics simulations arising from the numerical algorithm published recently in paper Int. J. Mod. Phys. C 16, 413 (2005). The algorithm is not a finite-difference method and…

Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…

Cylindrical algebraic decompositions (CADs) are a key tool in real algebraic geometry, used primarily for eliminating quantifiers over the reals and studying semi-algebraic sets. In this paper we introduce cylindrical algebraic…