相关论文: Lowest Terms Revisited
This paper studies the logarithmic moments of the smallest denominator of all rationals in a shrinking interval with random center. Convergence follows from the more general results in [arXiv:2310.11251, Bull. Lond. Math. Soc., to appear],…
We study the minimal denominator problem in function fields. In particular, we compute the probability distribution function of the the random variable which returns the degree of the smallest denominator $Q$, for which the ball of a fixed…
We present a provably more efficient implementation of the Minimum Norm Point Algorithm conceived by Fujishige than the one presented in \cite{FUJI06}. The algorithm solves the minimization problem for a class of functions known as…
An index $e$ in a numbering of partial-recursive functions is called minimal if every lesser index computes a different function from $e$. Since the 1960's it has been known that, in any reasonable programming language, no effective…
In this paper we find the formula that gives the n-th smallest term in a given finite sequence of real numbers.
In this paper, we introduce telescoping continued fractions to find lower bounds for the error term $r_n$ in Stirling's approximation $\displaystyle n! = \sqrt{2\pi}n^{n+1/2}e^{-n}e^{r_n}.$ This improves lower bounds given earlier by…
We use bounds on bilinear forms with Kloosterman fractions and improve the error term in the asymptotic formula of Balazard and Martin (2023) on the average value of the smallest denominators of rational numbers in short intervals.
We present an algorithm based on continuation techniques that can be applied to solve numerically minimization problems with equality constraints. We focus on problems with a great number of local minima which are hard to obtain by local…
We establish higher dimensional versions of a recent theorem by Chen and Haynes [Int. J. Number Theory 19 (2023), 1405-1413] on the expected value of the smallest denominator of rational points in a randomly shifted interval of small…
We give sparsity results and present algorithms for calculating minimum (vector) 1-norm universal solvers connected to least-squares problems. In particular, besides universal least-squares solvers, we consider minimum-rank universal…
We provide a geometric interpretation for a normalized version of the minimal denominator function, $$q_{\min}(x,\delta)=\min\left\{q\in \mathbb{N}: \text{ there exists } p\in\mathbb{Z} \text{ such that } \frac{p}{q}\in…
We establish general assumptions under which a constrained vari- ational problem involving the fractional gradient and a local nonlin- earity admits minimizers.
This is an introduction to small divisors problems. The material treated in this book was brought together for a PhD course I tought at the University of Pisa in the spring of 1999. Here is a Table of Contents: Part I One Dimensional Small…
Computing the partition function and the marginals of a global probability distribution are two important issues in any probabilistic inference problem. In a previous work, we presented sub-tree based upper and lower bounds on the partition…
We introduce and study a new complexity function in combinatorics on words, which takes into account the smallest second occurrence time of a factor of an infinite word. We characterize the eventually periodic words and the Sturmian words…
We compute a \emph{sparse} solution to the classical least-squares problem $\min_x||A x -b||,$ where $A$ is an arbitrary matrix. We describe a novel algorithm for this sparse least-squares problem. The algorithm operates as follows: first,…
We formulate the issue of minimality of self-adjoint operators on a Hilbert space as a semi-definite problem, linking the work by Overton in [1] to the characterization of minimal hermitian matrices. This motivates us to investigate the…
The minimum k-partition problem is a challenging combinatorial problem with a diverse set of applications ranging from telecommunications to sports scheduling. It generalizes the max-cut problem and has been extensively studied since the…
We investigate the partitioning of partial orders into a minimal number of heapable subsets. We prove a characterization result reminiscent of the proof of Dilworth's theorem, which yields as a byproduct a flow-based algorithm for computing…
In this survey article we revisit Hilbert's $19^{\text{th}}$ problem concerning the regularity of minimizers of variational integrals. We first discuss the classical theory (that is, the statement and resolution of Hilbert's problem in all…