English
Related papers

Related papers: Sum-difference exponents for boundedly many slopes…

200 papers

We provide an upper bound on the uniform exponent of approximation to a triple (xi, xi^2, xi^3) by rational numbers with the same denominator, valid for any transcendental real number xi. This upper bound refines a previous result of…

Number Theory · Mathematics 2015-05-13 Damien Roy

Let $f$ be a smooth real function with strictly monotone first $k$ derivatives. We show that for a finite set $A$, with $|A+A|\leq K|A|$, $|2^kf(A)-(2^k-1)f(A)|\gg_k |A|^{k+1-o(1)}/K^{O_k(1)}$. We deduce several new sum-product type…

Number Theory · Mathematics 2020-05-04 Brandon Hanson , Oliver Roche-Newton , Misha Rudnev

A $(d,k)$-set is a subset of $\mathbb{R}^d$ containing a $k$-dimensional unit ball of all possible orientations. Using an approach of D.~Oberlin we prove various Fourier dimension estimates for compact $(d,k)$-sets. Our main interest is in…

Classical Analysis and ODEs · Mathematics 2022-10-11 Jonathan M. Fraser , Terence L. J. Harris , Nicholas G. Kroon

For a fixed unit vector $a=(a_1,a_2,\ldots,a_n)\in S^{n-1}$, we consider the $2^n$ sign vectors $\varepsilon=(\varepsilon^1,\varepsilon^2,\ldots,\varepsilon^n)\in \{+1,-1\}^n$ and the corresponding scalar products $\varepsilon\cdot…

Combinatorics · Mathematics 2017-03-22 Harrie Hendriks , Martien C. A. van Zuijlen

Let $r \ge 2$ and $s \ge 2$ be multiplicatively dependent integers. We establish a lower bound for the sum of the block complexities of the $r$-ary expansion and of the $s$-ary expansion of an irrational real number, viewed as infinite…

Number Theory · Mathematics 2016-09-22 Yann Bugeaud , Dong Han Kim

We construct a compact set in $\mathbb R^2$ of measure 0 containing a piece of a parabola of every aperture between 1 and 2. As a consequence, we improve lower bounds for the $L^p$-$L^q$ norm of the corresponding maximal operator for a…

Classical Analysis and ODEs · Mathematics 2025-05-09 Tongou Yang , Yue Zhong

A finite subset of a Euclidean space is called an $s$-distance set if there exist exactly $s$ values of the Euclidean distances between two distinct points in the set. In this paper, we prove that the maximum cardinality among all…

Metric Geometry · Mathematics 2020-09-29 Hiroshi Nozaki , Masashi Shinohara

Let K be a non-archimedean field, and let f in K(z) be a rational function of degree d>1. If f has potentially good reduction, we give an upper bound, depending only on d, for the minimal degree of an extension L/K such that f is conjugate…

Number Theory · Mathematics 2015-01-05 Robert L. Benedetto

We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by…

Optimization and Control · Mathematics 2014-01-13 Bogdan Dumitrescu , Bogdan C. Sicleru , Florin Avram

We give exponential upper bounds for $P(S \le k)$, in particular $P(S=0)$, where $S$ is a sum of indicator random variables that are positively associated. These bounds allow, in particular, a comparison with the independent case. We give…

Probability · Mathematics 2014-12-22 Matthias Löwe , Franck Vermet

We study sets of $\delta$ tubes in $\mathbb{R}^3$, with the property that not too many tubes can be contained inside a common convex set $V$. We show that the union of tubes from such a set must have almost maximal volume. As a consequence,…

Classical Analysis and ODEs · Mathematics 2025-02-26 Hong Wang , Joshua Zahl

Let $f(t,y,y')=\sum_{i=0}^n a_i(t,y)y'^i=0$ be an irreducible first order ordinary differential equation with polynomial coefficients. Eremenko in 1998 proved that there exists a constant $C$ such that every rational solution of…

Classical Analysis and ODEs · Mathematics 2022-01-28 Shuang Feng , Li-Yong Shen

For an infinite word $\mathbf{x}$, Bugeaud and Kim introduced a new complexity function $\text{rep}(\mathbf{x})$ which is called the exponent of repetition of $\mathbf{x}$. They showed $1\le \text{rep}(\mathbf{x}) \le \sqrt{10}-\frac{3}{2}$…

Dynamical Systems · Mathematics 2021-06-28 Deokwon Sim

We give a new complexity bound for calculating the complex dimension of an algebraic set. Our algorithm is completely deterministic and approaches the best recent randomized complexity bounds. We also present some new, significantly sharper…

Algebraic Geometry · Mathematics 2025-10-20 J. Maurice Rojas

We investigate degree bounds for fields of rational invariants of representations of finite groups. We prove many cases of a bound for $\mathbb{Z}/p\mathbb{Z}$ conjectured by Blum-Smith, Garcia, Hidalgo, and Rodriguez. For arbitrary groups,…

Commutative Algebra · Mathematics 2026-04-22 Ben Blum-Smith , Sylvan Crane , Karla Guzman , Alexis Menenses , Maxine Song-Hurewitz

A (d,k) set is a subset of R^d containing a translate of every k-dimensional plane. Bourgain showed that for 2^{k-1}+k \geq d, every (d,k) set has positive Lebesgue measure. We give an L^p bound for the corresponding maximal operator.

Classical Analysis and ODEs · Mathematics 2007-05-23 Richard Oberlin

In the context of random regular graphs, the size of the maximum cut is probably the second most studied graph parameter after the independence ratio. Zdeborov\'a and Boettcher used the cavity method, a non-rigorous statistical physics…

Combinatorics · Mathematics 2025-06-27 Viktor Harangi

Let P=(p_1,p_2,...,p_N) be a sequence of points in the plane, where p_i=(x_i,y_i) and x_1<x_2<...<x_N. A famous 1935 Erdos--Szekeres theorem asserts that every such P contains a monotone subsequence S of $\sqrt N$ points. Another, equally…

Computational Geometry · Computer Science 2012-03-23 Marek Elias , Jiri Matousek

A $(k,m)$-Furstenberg set $S \subset \mathbb{F}_q^n$ over a finite field is a set that has at least $m$ points in common with a $k$-flat in every direction. The question of determining the smallest size of such sets is a natural…

Combinatorics · Mathematics 2021-10-14 Manik Dhar , Zeev Dvir , Ben Lund

We establish new exponential in dimension lower bounds for the Maximum Halfspace Discrepancy problem, which models linear classification. Both are fundamental problems in computational geometry and machine learning in their exact and…

Computational Geometry · Computer Science 2026-03-20 Alexander Munteanu , Simon Omlor , Jeff M. Phillips