English
Related papers

Related papers: Popular differences and generalized Sidon sets

200 papers

We introduce and study Minimum Cut Representability, a framework to solve optimization and feasibility problems over stable matchings by representing them as minimum s-t cut problems on digraphs over rotations. We provide necessary and…

Optimization and Control · Mathematics 2025-04-08 Yuri Faenza , Ayoub Foussoul , Chengyue He

The notions and certain fundamental characteristics of the proximal and limiting normal cones with respect to a set are first presented in this paper. We present the ideas of the limiting coderivative and subdifferential with respect to a…

Optimization and Control · Mathematics 2023-07-31 Xiaolong Qin , Vo Duc Thinh , Jen-Chih Yao

A set $D \subseteq \mathbb{N}$ is called $r$-large if every $r$-coloring of $\mathbb{N}$ admits arbitrarily long monochromatic arithmetic progressions $a,a+d,...,a+(k-1)d$ with gap $d \in D$. Closely related to largeness is accessibility; a…

Combinatorics · Mathematics 2025-06-24 Oscar Quester

Robust inference based on the minimization of statistical divergences has proved to be a useful alternative to classical techniques based on maximum likelihood and related methods. Basu et al. (1998) introduced the density power divergence…

Statistics Theory · Mathematics 2025-02-17 Subhrajyoty Roy , Abir Sarkar , Abhik Ghosh , Ayanendranath Basu

We study the variance of sums of the $k$-fold divisor function $d_k(n)$ over sparse arithmetic progressions, with averaging over both residue classes and moduli. In a restricted range, we confirm an averaged version of a recent conjecture…

Number Theory · Mathematics 2019-08-26 Brad Rodgers , Kannan Soundararajan

We consider the following basic, and very broad, statistical problem: Given a known high-dimensional distribution ${\cal D}$ over $\mathbb{R}^n$ and a collection of data points in $\mathbb{R}^n$, distinguish between the two possibilities…

Computational Complexity · Computer Science 2024-11-25 Anindya De , Huan Li , Shivam Nadimpalli , Rocco A. Servedio

For a set of natural numbers $A$, let $R_{A}(n)$ be the number of representations of a natural number $n$ as the sum of two terms from $A$. Many years ago, Nathanson studied the conditions for the set $A$ and $B$ of natural numbers that are…

Number Theory · Mathematics 2025-06-05 Sándor Kiss , Csaba Sándor

We investigate the approximation of $d$-variate periodic functions in Sobolev spaces of dominating mixed (fractional) smoothness $s>0$ on the $d$-dimensional torus, where the approximation error is measured in the $L_2-$norm. In other…

Numerical Analysis · Mathematics 2013-12-24 Thomas Kuehn , Winfried Sickel , Tino Ullrich

We prove that for a large class of multiplicative functions, referred to as generalized divisor functions, it is possible to find a lower bound for the corresponding variance in arithmetic progressions. As a main corollary, we deduce such a…

Number Theory · Mathematics 2020-04-16 Daniele Mastrostefano

We show that, for a finite set $A$ of real numbers, the size of the set $$\frac{A+A}{A+A} = \left\{ \frac{a+b}{c+d} : a,b,c,d \in A, c+d \neq 0 \right \}$$ is bounded from below by $$\left|\frac{A+A}{A+A} \right| \gg \frac{|A|^{2+1/4}}{|A /…

Combinatorics · Mathematics 2016-10-13 Ben Lund

We develop a new simple approach to prove upper bounds for generalizations of the Heilbronn's triangle problem in higher dimensions. Among other things, we show the following: for fixed $d \ge 1$, any subset of $[0, 1]^d$ of size $n$…

Combinatorics · Mathematics 2024-03-14 Dmitrii Zakharov

Let $G = (A \cup B,E)$ be a bipartite graph where the set $A$ consists of agents or main players and the set $B$ consists of jobs or secondary players. Every vertex has a strict ranking of its neighbors. A matching $M$ is popular if for any…

Data Structures and Algorithms · Computer Science 2022-07-13 Telikepalli Kavitha

Let $\mathsf{A}=\{a_1,\dots,a_m\}$, $m\in\mathbb{N}$, be measurable functions on a measurable space $(\mathcal{X},\mathfrak{A})$. If $\mu$ is a positive measure on $(\mathcal{X},\mathfrak{A})$ such that $\int a_i d\mu<\infty$ for all $i$,…

Functional Analysis · Mathematics 2018-09-05 Philipp J. di Dio , Konrad Schmüdgen

It is well-known that for every $N \geq 1$ and $d \geq 1$ there exist point sets $x_1, \dots, x_N \in [0,1]^d$ whose discrepancy with respect to the Lebesgue measure is of order at most $(\log N)^{d-1} N^{-1}$. In a more general setting,…

Combinatorics · Mathematics 2017-03-20 Christoph Aistleitner , Dmitriy Bilyk , Aleksandar Nikolov

By making use of arithmetic information inequalities, we give a strong quantitative bound for the discretised ring theorem. In particular, we show that if $A \subset [1,2]$ is a $(\delta,\sigma)$-set, with $|A| = \delta^{-\sigma},$ then…

Classical Analysis and ODEs · Mathematics 2025-11-19 András Máthé , William O'Regan

We present a variety of new results on finite sets A of integers for which the sumset A+A is larger than the difference set A-A, so-called MSTD (more sums than differences) sets. First we show that there is, up to affine transformation, a…

Number Theory · Mathematics 2015-06-26 Peter Hegarty

Let $A$ be a finite-dimensional local commutative algebra over $R$, $\dim_RA=n$. In this work we consider compact manifolds over $A$, and prove that the real part of an $A$-differentiable function is constant. Also we find estimates for the…

Differential Geometry · Mathematics 2007-05-23 Tagir I. Gaisin

Let $G$ be a finite abelian group of order $n$, and for each $a\in G$ and integer $1\le h\le n$ let $\mathcal{F}_a(h)$ denote the family of all $h$-element subsets of $G$ whose sum is $a$. A problem posed by Katona and Makar-Limanov is to…

Combinatorics · Mathematics 2025-09-11 Jing Wang

A preference profile with $m$ alternatives and $n$ voters is $d$-Manhattan (resp. $d$-Euclidean) if both the alternatives and the voters can be placed into the $d$-dimensional space such that between each pair of alternatives, every voter…

Multiagent Systems · Computer Science 2022-01-25 Jiehua Chen , Martin Nöllenburg , Sofia Simola , Anaïs Villedieu , Markus Wallinger

Let $\mathrm{d}(A)$ be the asymptotic density (if it exists) of a sequence of integers $A$. For any real numbers $0\leq\alpha\leq\beta\leq 1$, we solve the question of the existence of a sequence $A$ of positive integers such that…

Number Theory · Mathematics 2019-05-21 Pierre-Yves Bienvenu , François Hennecart