Related papers: An algorithm for computing syzygies on $V[X]$ when…
In this paper, we first present an algorithm for computing the Hermite normal form of pseudo-matrices over Pr\"ufer domains. This algorithm allows us to provide constructive proofs of the main theoretical results on finitely presented…
This paper examines necessary and sufficient conditions for the uniqueness of dynamic Groves mechanisms when the domain of valuations is restricted. Our approach is to appropriately define the total valuation function, which is the expected…
Fix a finite field $\mathbb{F}$. Let $\mathrm{VI}$ be a skeleton of the category of finite dimensional $\mathbb{F}$-vector spaces and injective $\mathbb{F}$-linear maps. We study $\mathrm{VI}^m$-modules over a noetherian commutative ring in…
Recently, Qiu, Xu, Ye and Yu proved that for product system of finitely many minimal systems, the maximal $\infty$-step pro-nilfactor of the system is the topological characteristic factor. In this paper, we extend the result to…
We consider a model of quantum computation we call "Varying-$Z$" (V$Z$), defined by applying controllable $Z$-diagonal Hamiltonians in the presence of a uniform and constant external $X$-field, and prove that it is universal, even in 1D.…
In this paper we study the complexity of quantum query algorithms computing the value of Boolean function and its relation to the degree of algebraic polynomial representing this function. We pay special attention to Boolean functions with…
We provide a new algorithm for evaluating the gamma function at any (rational) point and a new infinite product representation free from the presence of Euler and Mascheroni constant.Formulae and inequalities seemingly new are obtained as…
We describe an algorithm for using a quantum computer to calculate mean values of observables and the partition function of a quantum system. Our algorithm includes two sub-algorithms. The first sub-algorithm is for calculating, with…
The singular value decomposition (SVD) allows to write a matrix as a product of a left singular vectors matrix, a nonnegative singular values diagonal matrix and a right singular vectors matrix. Among the applications of the SVD are the…
We perform the sewing of two (dual) Ramond reggeon vertices and derive an algorithm by means of which the so obtained four-Ramond reggeon vertex may be explicitly computed at arbitrary oscillator (mass) level. A closed form of the…
Given a sequence of related modules $M_n$ defined over a sequence of related polynomial rings, one may ask how to simultaneously compute a finite Gr\"obner basis for each $M_n$. Furthermore, one may ask how to simultaneously compute the…
The BV formalism is a well-established method for analyzing symmetries and quantization of field theories. In this paper we use the BV formalism to derive partition functions of gauge invariant operators up to equations of motions and their…
We present an exact Bayesian inference method for inferring posterior distributions encoded by probabilistic programs featuring possibly unbounded loops. Our method is built on a denotational semantics represented by probability generating…
In this paper, we study a fundamental problem in submodular optimization, which is called sequential submodular maximization. Specifically, we aim to select and rank a group of $k$ items from a ground set $V$ such that the weighted…
Given a non-negative integer $n$, we establish a formula for the number of finite magmas on a set with cardinality $n$ up to isomorphism. We then generalize the method to operations with arbitrary finite arity, which yields a corrected…
This paper aims at a better understanding of matrix factorization (MF), factorization machines (FM), and their combination with deep algorithms' application in recommendation systems. Specifically, this paper will focus on Singular Value…
For a continuous function $f$ defined on a closed and bounded domain, there is at least one maximum and one minimum. First, we introduce some preliminaries which are necessary through the paper. We then present an algorithm, which is…
Submodular functions can be exactly minimized in polynomial time, and the special case that graph cuts solve with max flow \cite{KZ:PAMI04} has had significant impact in computer vision \cite{BVZ:PAMI01,Kwatra:SIGGRAPH03,Rother:GrabCut04}.…
We propose a variational method for constructing the eigenvalues and generalized eigenvalues for an arbitrary $N\times N$ complex matrix. The quantum part of our algorithm is based on encoding the matrix elements into the pure state of a…
In this work, we propose a new computing process, named DeepBEVdose, which is essentially distinct to the previous deep learning-based dose calculation methods.We present a novel image-domain dose calculation algorithm to automatically…