Related papers: A Division Algorithm for the Gaussian Integers' Mi…

Let $S(A)$ denote the orbit of a complex or real matrix $A$ under a certain equivalence relation such as unitary similarity, unitary equivalence, unitary congruences etc. Efficient gradient-flow algorithms are constructed to determine the…

This paper provides a theorem to compare the minimum total cost of two different Euclidean Random Assignment Problems with the same number of points, using the stochastic order of the costs of one of the pairs in these two problems. The…

In this article, we study the smallest distances between the zeros of Gaussian analytic functions over compact Riemann surfaces. Our main result is that, after appropriate rescaling, the point process of the smallest distances converge to a…

A simple graph G is said to be representable in a real vector space of dimension m if there is an embedding of the vertex set in the vector space such that the Euclidean distance between any two distinct vertices is one of only two distinct…

Let $M$ be a simply-connected compact Riemannian symmetric space, and $U$ a twice-differentiable function on $M$, with unique global minimum at $x^* \in M$. The idea of the present work is to replace the problem of searching for the global…

We prove a structure theorem for multiplicative functions on the Gaussian integers, showing that every bounded multiplicative function on the Gaussian integers can be decomposed into a term which is approximately periodic and another which…

The paper studies some properties of the ring of integer-valued quasi-polynomials. On this ring, theory of generalized Euclidean division and generalized GCD are presented. Applications to finite simple continued fraction expansion and…

In min-min optimization or max-min optimization, one has to compute the gradient of a function defined as a minimum. In most cases, the minimum has no closed-form, and an approximation is obtained via an iterative algorithm. There are two…

Function computation of arbitrarily correlated discrete sources over Gaussian networks with orthogonal components is studied. Two classes of functions are considered: the arithmetic sum function and the type function. The arithmetic sum…

Consider the representation of a rational number as a continued fraction, associated with "odd" Euclidean algorithm. In this paper we prove certain properties for the limit distribution function for sequences of rationals with bounded sum…

We show that any distribution function on $\mathbb{R}^d$ with nonnegative, nonzero and integrable marginal distributions can be characterized by a norm on $\mathbb{R}^{d+1}$, called $F$-norm. We characterize the set of $F$-norms and prove…

By prior work, it is known that any distributed graph algorithm that finds a maximal matching requires $\Omega(\log^* n)$ communication rounds, while it is possible to find a maximal fractional matching in $O(1)$ rounds in bounded-degree…

Matrix Factorization plays an important role in machine learning such as Non-negative Matrix Factorization, Principal Component Analysis, Dictionary Learning, etc. However, most of the studies aim to minimize the loss by measuring the…

This article introduces trimmed estimators for the mean and covariance function of general functional data. The estimators are based on a new measure of outlyingness or data depth that is well defined on any metric space, although this…

Computing partition function is the most important statistical inference task arising in applications of Graphical Models (GM). Since it is computationally intractable, approximate methods have been used to resolve the issue in practice,…

Let D be a Euclidean domain, with fraction field K. Let R(D) be the subring of K generated by the reciprocals of the nonzero elements of D. The main theorem states that if R(D) is not equal to K, then R(D) is a rank 1 discrete valuation…

In this paper, we study and partially classify those Riemannian man-ifolds carrying a non-identically vanishing function f whose Hessian is minus f times the Ricci-tensor of the manifold.

To improve our understanding of connected systems, different tools derived from statistics, signal processing, information theory and statistical physics have been developed in the last decade. Here, we will focus on the graph comparison…

Fragmentation functions are determined for pions, kaons, and nucleons by a global analysis of charged-hadron production data in electron-positron annihilation. The optimum functions are obtained in both leading order (LO) and…

In the paper asymptotic properties of functionals of stationary Gibbs particle processes are derived. Two known techniques from the point process theory in the Euclidean space R^d are extended to the space of compact sets on R^d equipped by…