English
Related papers

Related papers: Computing Limits of Quotients of Multivariate Real…

200 papers

We design a Quasi-Polynomial time deterministic approximation algorithm for computing the integral of a multi-dimensional separable function, supported by some underlying hyper-graph structure, appropriately defined. Equivalently, our…

Data Structures and Algorithms · Computer Science 2024-02-14 David Gamarnik , Devin Smedira

We propose a simple estimator that allows to calculate the absolute value of a system's partition function from a finite sampling of its canonical ensemble. The estimator utilizes a volume correction term to compensate the effect that the…

Statistical Mechanics · Physics 2024-09-05 Ying-Chih Chiang , Frank Otto , Jonathan W. Essex

We investigate the existence of bounded-memory consistent estimators of various statistical functionals. This question is resolved in the negative in a rather strong sense. We propose various bounded-memory approximations, using techniques…

Computation · Statistics 2011-10-28 Leonid , Kontorovich

This paper focuses on a class of zero-norm composite optimization problems. For this class of nonconvex nonsmooth problems, we establish the Kurdyka-Lojasiewicz property of exponent being a half for its objective function under a suitable…

Optimization and Control · Mathematics 2021-01-26 Yuqia Wu , Shaohua Pan , Shujun Bi

We propose a method to numerically compute fractional derivatives (or the fractional Laplacian) on the whole real line via Riesz fractional integrals. The compactified real line is divided into a number of intervals, thus amounting to a…

Numerical Analysis · Mathematics 2024-01-10 C. Klein , N. Stoilov

We describe an algorithm for finding sharp upper bounds for the total Betti numbers of a saturated ideal given certain constraints on its Hilbert function. This algorithm is implemented in the Macaulay2 package, MaxBettiNumbers, along with…

Commutative Algebra · Mathematics 2020-11-09 Jay White

If the denominator of a rational function of several variables is sum of even powers and the numerator is a monomial, then we give a numerical criterion, using the exponents involved in the expression of the rational function, to decide if…

History and Overview · Mathematics 2014-03-31 Ali Sinan Sertoz

In this paper, we introduce two general subclasses of analytic functions by means of the principle of subordination and investigate the coefficient bounds for functions in theese classes. The well-known results are obtained as a corollary…

Complex Variables · Mathematics 2019-03-25 Serap Bulut

Analytical solutions to the time-dependent Schrodinger equation describing a driven two-level system are invaluable to many areas of physics, but they are also extremely rare. Here, we present a simple algorithm that generates an unlimited…

Quantum Physics · Physics 2012-08-08 Edwin Barnes , S. Das Sarma

We prove a limit theorem for quantum stochastic differential equations with unbounded coefficients which extends the Trotter-Kato theorem for contraction semigroups. From this theorem, general results on the convergence of approximations…

Mathematical Physics · Physics 2008-05-08 Luc Bouten , Ramon van Handel , Andrew Silberfarb

We consider a variable metric linesearch based proximal gradient method for the minimization of the sum of a smooth, possibly nonconvex function plus a convex, possibly nonsmooth term. We prove convergence of this iterative algorithm to a…

Numerical Analysis · Mathematics 2017-04-11 Silvia Bonettini , Ignace Loris , Federica Porta , Marco Prato , Simone Rebegoldi

We present an algorithm for computing asymptotic approximations of roots of polynomials with exp-log function coefficients. The real and imaginary parts of the approximations are given as explicit exp-log expressions. We provide a method…

Symbolic Computation · Computer Science 2019-04-16 Adam Strzeboński

Consider the representation of a rational number in the form, associated with "centered" Euclidean algorithm. We prove a new formula for the limit distribution function for sequences of rationals with bounded sum of partial quotients.

Number Theory · Mathematics 2011-10-25 Elena Zhabitskaya

We show through case studies that it is easier to estimate the fundamental limits of data processing than to construct explicit algorithms to achieve those limits. Focusing on binary classification, data compression, and prediction under…

Information Theory · Computer Science 2017-10-03 Jiantao Jiao , Yanjun Han , Irena Fischer-Hwang , Tsachy Weissman

Critical points of a function subject to a constraint can be either detected by restricting the function to the constraint or by looking for critical points of the Lagrange multiplier functional. Although the critical points of the two…

Differential Geometry · Mathematics 2022-10-25 Urs Frauenfelder , Joa Weber

We examine the number T of queries that a quantum network requires to compute several Boolean functions on {0,1}^N in the black-box model. We show that, in the black-box model, the exponential quantum speed-up obtained for partial functions…

Quantum Physics · Physics 2007-05-23 Robert Beals , Harry Buhrman , Richard Cleve , Michele Mosca , Ronald de Wolf

This paper introduces a very fast method for the computation of the resolvent of fractional powers of operators. The analysis is kept in the continuous setting of (potentially unbounded) self adjoint positive operators in Hilbert spaces.…

Numerical Analysis · Mathematics 2022-10-21 Eleonora Denich , Laura Grazia Dolce , Paolo Novati

The restriction conjecture is one of the famous problems in harmonic analysis. There have been many methods developed in the study of the conjecture for the paraboloid. In this paper, we generalize the multilinear method of Bourgain and…

Classical Analysis and ODEs · Mathematics 2023-08-15 Shengwen Gan , Larry Guth , Changkeun Oh

In this article, we focus on computing the quantiles of a random variable $f(X)$, where $X$ is a $[0,1]^d$-valued random variable, $d \in \mathbb{N}^{\ast}$, and $f:[0,1]^d\to \mathbb{R}$ is a deterministic Lipschitz function. We are…

Probability · Mathematics 2024-10-30 Yurun Gu , Clément Rey

We count the number of polynomials over finite fields with prescribed leading coefficients and a given number of linear factors. This is equivalent to counting codewords in Reed-Solomon codes which are at a certain distance from a received…

Combinatorics · Mathematics 2022-11-11 Zhicheng Gao