Related papers: A Distance Amplification Lemma for Monotonicity
Given a monotonically decreasing $\psi: \mathbb{N} \to [0,\infty)$, Khintchine's Theorem provides an efficient tool to decide whether, for almost every $\alpha \in \mathbb{R}$, there are infinitely many $(p,q) \in \mathbb{Z}^2$ such that…
The model of relative-error property testing of Boolean functions has been the subject of significant recent research effort [CDH+24][CPPS25a][CPPS25b] In this paper we consider the problem of relative-error testing an unknown and arbitrary…
Bilevel optimization minimizes an objective function, defined by an upper-level problem whose feasible region is the solution of a lower-level problem. We study the oracle complexity of finding an $\epsilon$-stationary point with…
An important result of H. Weyl states that for every sequence $\left(a_{n}\right)_{n\geq 1}$ of distinct positive integers the sequence of fractional parts of $\left(a_{n} \alpha \right)_{n \geq1}$ is uniformly distributed modulo one for…
Assuming that a "derivative" ratio rho:=f'/g' of the ratio r:=f/g of differentiable functions f and g is monotonic (that is, rho is increasing or decreasing), it was shown in previous papers that then r can switch at most once, from…
Solutions of a diophantine equation $f(a,b) = g(c,d)$, with $a,b,c,d$ in some finite range, can be efficiently enumerated by sorting the values of $f$ and $g$ in ascending order and searching for collisions. This article considers functions…
We consider the problem of maximizing a monotone submodular function under noise. There has been a great deal of work on optimization of submodular functions under various constraints, resulting in algorithms that provide desirable…
We revisit the problem of online learning with individual fairness, where an online learner strives to maximize predictive accuracy while ensuring that similar individuals are treated similarly. We first extend the frameworks of Gillen et…
We study one class of continuous functions $f$ defined on segment $[0,1]$ by equality $$ f(x)=\delta_{\alpha_1(x)1}+\sum^{\infty}_{k=2}\left[\delta_{\alpha_k(x)k}\prod^{k-1}_{j=1}g_{\alpha_j…
Answering a question of Ben Yaacov, Ibarluc\'ia, and Tsankov [5], we show an explicit way to construct an affine formula for the distance between two $n$-tuples in a $\{0,1\}$-valued $\varnothing$-structure, using $\lceil \log_2 n \rceil$…
We present an algorithm for approximating the edit distance between two strings of length $n$ in time $n^{1+\varepsilon}$ up to a constant factor, for any $\varepsilon>0$. Our result completes a research direction set forth in the recent…
As it follows from the theory of almost periodic functions the set of integer solutions $q$ to the Kronecker system $|\omega_{j} q - \theta_{j}| < \varepsilon \pmod 1$, $j=1,\ldots,m$, where $1,\omega_{1},\ldots,\omega_{m}$ are linearly…
We present a new algorithm for finding an $\epsilon$-approximate fixed point of an $\ell_\infty$-contracting function $f : [0, 1]^d \rightarrow [0, 1]^d$. Our algorithm is based on the query-efficient algorithm by Chen, Li, and Yannakakis…
This paper deals with the limit behaviour of the solutions of quasi-linear equations of the form \ $\ds -\limfunc{div}\left(a\left(x, x/{\varepsilon _h},Du_h\right)\right)=f_h$ on $\Omega $ with Dirichlet boundary conditions. The sequence…
The biharmonic distance is a fundamental metric on graphs that measures the dissimilarity between two nodes, capturing both local and global structures. It has found applications across various fields, including network centrality, graph…
The main aim of this paper is to study the functional inequality \begin{equation*} \int_{[0,1]}f\bigl((1-t)x+ty\bigr)d\mu(t)\geq 0, \qquad x,y\in I \mbox{ with } x<y, \end{equation*} for a continuous unknown function $f:I\to{\mathbb R}$,…
This paper systematically investigates the absolute monotonicity of two function families associated with the Gaussian hypergeometric function $F(a, b; c; x)$ (where $a,b,c\in\mathbb{R}_+$): $\mathcal{F}_p(x)=(1-x)^pF(a,b;c;x)$ and…
A fault-tolerant distance labeling scheme assigns a label to each vertex and edge of an undirected weighted graph $G$ with $n$ vertices so that, for any edge set $F$ of size $|F| \leq f$, one can approximate the distance between $p$ and $q$…
We enhance constrained-based data quality with approximate band conditional order dependencies (abcODs). Band ODs model the semantics of attributes that are monotonically related with small variations without there being an intrinsic…
The proximal point algorithm (PPA) has been developed to solve the monotone variational inequality problem. It provides a theoretical foundation for some methods, such as the augmented Lagrangian method (ALM) and the alternating direction…