Related papers: A Division Algorithm for the Gaussian Integers' Mi…
This work considers low-rank canonical polyadic decomposition (CPD) under a class of non-Euclidean loss functions that frequently arise in statistical machine learning and signal processing. These loss functions are often used for certain…
The normal or Gaussian distribution plays a prominent role in almost all fields of science. However, it is well known that the Gauss (or Euler--Poisson) integral over a finite boundary, as it is necessary for instance for the error function…
Riemannian optimization uses local methods to solve optimization problems whose constraint set is a smooth manifold. A linear step along some descent direction usually leaves the constraints, and hence retraction maps are used to…
In this paper we demonstrate how the geometrically motivated algorithm to determine whether a two generator real Mobius group acting on the Poincare plane is or is not discrete can be interpreted as a non-Euclidean Euclidean algorithm. That…
In many applications of neural network, it is common to introduce huge amounts of input categorical features, as well as output labels. However, since the required network size should have rapid growth with respect to the dimensions of…
Assume that f is a strict convex function with a unique minimum in R^n. We divide the vector of n-variables to d groups of vector subvariables with d at least two. We assume that we can find the partial minimum of f with respect to each…
Let us denote by $\tau(n)$ and $\si(n)$ the number and the sum of the divisors of $n$ and by $\vfi$ Euler's function. We give effective upper bounds for $\frac{n}{\vfi(n)}$ in terms of $\vfi(n)$, and for $\frac{\si(n)}{n}$ in terms of…
We develop a theory of finite-dimensional polyhedral subsets over the Wasserstein space and optimization of functionals over them via first-order methods. Our main application is to the problem of mean-field variational inference, which…
Estimating quantum partition functions is a critical task in a variety of fields. However, the problem is classically intractable in general due to the exponential scaling of the Hamiltonian dimension $N$ in the number of particles. This…
Let $E$ be a measurable subset in a segment $[0,r]$ in the positive part of the real axis in the complex plane, and $U=u-v$ be the difference of subharmonic functions $u\not\equiv -\infty$ and $v\not\equiv-\infty$ on the complex plane. An…
We compute explicitly the normal zeta functions of the Heisenberg groups $H(R)$, where $R$ is a compact discrete valuation ring of characteristic zero. These zeta functions occur as Euler factors of normal zeta functions of Heisenberg…
An algorithm is presented to compute Zolotarev rational functions, that is, rational functions $r_n^*$ of a given degree that are as small as possible on one set $E\subseteq\complex\cup\{\infty\}$ relative to their size on another set…
This paper presents a method to merge Generalized Minimum Distance decoding of Reed-Solomon codes with the extended Euclidean algorithm. By merge, we mean that the steps taken to perform the Generalized Minimum Distance decoding are similar…
In 1991, Z\'emor proposed a hash function which provides data security using the difficulty of writing a given matrix as a product of generator matrices. Tillich and Z\'emor subsequently provided an algorithm finding short collisions for…
Let $K$ be a algebraically closed field of characteristic 0 that is complete with respect to a non-Archimedean absolute value. Let $\phi\in K(z)$ with $\textrm{deg}(\phi)\geq 2$. In this paper we establish uniform logarithmic…
The Euclidean algorithm is the oldest algorithms known to mankind. Given two integral numbers $a_1$ and $a_2$, it computes the greatest common divisor (gcd) of $a_1$ and $a_2$ in a very elegant way. From a lattice perspective, it computes a…
Theoretical background is provided towards the mathematical foundation of the minimum enclosing ball problem. This problem concerns the determination of the unique spherical surface of smallest radius enclosing a given bounded set in the…
Very few studies involve how to construct the efficient RBFs by means of problem features. Recently the present author presented general solution RBF (GS-RBF) methodology to create operator-dependent RBFs successfully [1]. On the other…
Questions concerning small fractional parts of polynomials and pseudo-polynomials have a long history in analytic number theory. In this paper, we improve on earlier work by Madritsch and Tichy. In particular, let $f=P+\phi$ where $P$ is a…
In this paper, we consider the problem of computing the algebraic parametric equation of the Euclidean 1-center function in $\mathbb{R}^d$, $d \geq 2$, for a system of $n$ static points and $m$ mobile points having motion defined by…