相关论文: An efficient algorithm for computing the Baker-Cam…
We present an efficient algorithm for determining the Hilbert series of an effective theory and provide a companion code called ECO (Efficient Counting of Operators) in FORM. For example, the Hilbert series for the dimension 15 operators in…
For a simply connected connected simple algebraic group $G$, it is known that a variety $B_{w_0}^-:=B^-\cap U\overline{w_0}U$ has a geometric crystal structure with a positive structure…
We introduce a new algorithm for computing the periods of a smooth complex projective hypersurface. The algorithm intertwine with a new method for computing an explicit basis of the singular homology of the hypersurface. It is based on…
In this paper, based on a generalized scalar auxiliary variable approach with relaxation (R-GSAV), we construct a class of high-order backward differentiation formula (BDF) schemes with variable time steps for the…
An exact representation of the Baker-Campbell-Hausdorff formula as a power series in just one of the two variables is constructed. Closed form coefficients of this series are found in terms of hyperbolic functions, which contain all of the…
In this work we demonstrate new BCH-like relations involving the generators of the su(1, 1), su(2) and so(2, 1) Lie algebras. We use our results to obtain in a straightforward way the composition of an arbitrary number of elements of the…
The construction of $r$-nets offers a powerful tool in computational and metric geometry. We focus on high-dimensional spaces and present a new randomized algorithm which efficiently computes approximate $r$-nets with respect to Euclidean…
The purpose of this paper is twofold. On a technical side, we propose an extension of the Hausdorff distance from metric spaces to spaces equipped with asymmetric distance measures. Specifically, we focus on the family of Bregman…
Efficient state preparation is a challenging and important problem in quantum computing. In this work, we present a recursive state preparation algorithm that combines logarithmic-depth Dicke state circuits with Hamming weight encoders for…
A numerical algorithm that computes the decomposition of any finite-dimen\-sio\-nal unitary reducible representation of a compact Lie group is presented. The algorithm, which does not rely on an algebraic insight on the group structure, is…
We present an effective algorithm for computing the standard cohomology spaces of finitely generated Lie (super) algebras over a commutative field K of characteristic zero. In order to reach explicit representatives of some generators of…
A new differential-recurrence relation for the B-spline functions of the same degree is proved. From this relation, a recursive method of computing the coefficients of B-spline functions of degree $m$ in the Bernstein-B\'{e}zier form is…
Binary Partition Hierarchies (BPH) and minimum spanning trees are fundamental data structures involved in hierarchical analysis such as quasi-flat zones or watershed. However, classical BPH construction algorithms require to have the whole…
Let $\bH$ be the generic Iwahori--Hecke algebra associated with a finite Coxeter group $W$. Recently, we have shown that $\bH$ admits a natural cellular basis in the sense of Graham--Lehrer, provided that $W$ is a Weyl group and all…
An extremely scalable linear-algebraic algorithm was developed for quantum material simulation (electronic state calculation) with 10$^8$ atoms or 100-nm-scale materials. The mathematical foundation is generalized shifted linear equations…
In this work we introduce the contact Heisenberg algebra which is the restriction of the Jacobi algebra on contact manifolds to the linear and constant functions. We give the exact expression of its corresponding Baker-Campbell-Hausdorff…
The $c$-approximate Near Neighbor problem in high dimensional spaces has been mainly addressed by Locality Sensitive Hashing (LSH), which offers polynomial dependence on the dimension, query time sublinear in the size of the dataset, and…
The Reeb space is a fundamental data structure in computational topology that represents the fiber topology of a multi-field (or multiple scalar fields), extending the level set topology of a scalar field. Efficient algorithms have been…
Bayesian networks (BNs) are a foundational model in machine learning and causal inference. Their graphical structure can handle high-dimensional problems, divide them into a sparse collection of smaller ones, underlies Judea Pearl's…
Exact unitary transformations play a central role in the analysis and simulation of many-body quantum systems, yet the conditions under which they can be carried out exactly and efficiently remain incompletely understood. We show that exact…