English
Related papers

Related papers: Generalized difference sets and autocorrelation in…

200 papers

Let $\varepsilon>0$. We construct an explicit, full-measure set of $\alpha \in[0,1]$ such that if $\gamma \in \mathbb{R}$ then, for almost all $\beta \in[0,1]$, if $\delta \in \mathbb{R}$ then there are infinitely many integers $n\geq 1$…

Number Theory · Mathematics 2023-07-28 Sam Chow , Niclas Technau

The notion of minimal complements was introduced by Nathanson in 2011. Since then, the existence or the inexistence of minimal complements of sets have been extensively studied. Recently, the study of inverse problems, i.e., which sets can…

Combinatorics · Mathematics 2021-08-10 Arindam Biswas , Jyoti Prakash Saha

In this paper we slightly improve the regularity theory for the so called optimal design problem. We first establish the uniform rectifiability of the boundary of the optimal set, for a larger class of minimizers, in any dimension. As an…

Optimization and Control · Mathematics 2025-05-29 Lorenzo Lamberti , Antoine Lemenant

Asymptotic properties of random regular graphs are object of extensive study in mathematics. In this note we argue, based on theory of spin glasses, that in random regular graphs the maximum cut size asymptotically equals the number of…

Disordered Systems and Neural Networks · Physics 2010-02-25 Lenka Zdeborová , Stefan Boettcher

Let $\left\{a_1, \dots, a_n\right\} \subset \mathbb{N}$ be a set of positive integers, $a_n$ denoting the largest element, so that for any two of the $2^n$ subsets the sum of all elements is distinct. Erd\H{o}s asked whether this implies…

Number Theory · Mathematics 2023-01-03 Stefan Steinerberger

We show that for large enough $n$, the number of non-isomorphic pseudoline arrangements of order $n$ is greater than $2^{c\cdot n^2}$ for some constant $c > 0.2604$, improving the previous best bound of $c>0.2083$ by Dumitrescu and Mandal…

Computational Geometry · Computer Science 2024-02-22 Justin Dallant

The positive discrepancy of a graph $G$ of edge density $p=e(G)/\binom{v(G)}{2}$ is defined as $$\mbox{disc}^{+}(G)=\max_{U\subset V(G)}e(G[U])-p\binom{|U|}{2}.$$ In 1993, Alon proved (using the equivalent terminology of minimum bisections)…

Combinatorics · Mathematics 2023-11-21 Eero Räty , Benny Sudakov , István Tomon

This paper studies properties of a subdifferential defined using a generalized conjugation scheme. We relate this subdifferential together with the domain of an appropriate conjugate function and the {\epsilon}-directional derivative. In…

Optimization and Control · Mathematics 2025-01-15 M. D. Fajardo , J. Vidal-Nunez

We consider a translation and dilation invariant system consisting of k diagonal equations of degrees 1,2,...,k with integer coefficients in s variables, where s is sufficiently large in terms of k. We show via the Hardy-Littlewood circle…

Number Theory · Mathematics 2010-10-11 Matthew L. Smith

The generalised colouring numbers $\mathrm{adm}_r(G)$, $\mathrm{col}_r(G)$, and $\mathrm{wcol}_r(G)$ were introduced by Kierstead and Yang as generalisations of the usual colouring number, also known as the degeneracy of a graph, and have…

Discrete Mathematics · Computer Science 2016-06-30 Stephan Kreutzer , Michał Pilipczuk , Roman Rabinovich , Sebastian Siebertz

The main result of this paper is an improvement of the upper bound on the cardinal invariant ${\mathord{\mathrm{cov}}}^{\ast}({\mathcal{Z}}_{0})$ that was discovered by Raghavan and Shelah in an earlier paper. Here ${\mathcal{Z}}_{0}$ is…

Logic · Mathematics 2017-12-12 Dilip Raghavan

Let $(G, +)$ be an abelian group. In 2004, Eliahou and Kervaire found an explicit formula for the smallest possible cardinality of the sumset $A+A$, where $A \subseteq G$ has fixed cardinality $r$. We consider instead the smallest possible…

Combinatorics · Mathematics 2017-03-30 Mitchell Lee

Cohen and Kontorovich (COLT 2023) initiated the study of what we call here the Binomial Empirical Process: the maximal absolute value of a sequence of inhomogeneous normalized and centered binomials. They almost fully analyzed the case…

Probability · Mathematics 2024-02-13 Moïse Blanchard , Doron Cohen , Aryeh Kontorovich

Let $hA$ denote the $h$-fold sumset of a subset $A$ of an abelian group. Resolving a problem of Nathanson, we show that for any prescribed permutations $\sigma_1, \ldots, \sigma_H \in \mathfrak{S}_n$, there exist finite subsets $A_1,…

Combinatorics · Mathematics 2025-01-07 Noah Kravitz

Let $E\subset [0,1]$ be a set that supports a probability measure $\mu$ with the property that $|\widehat{\mu}(t)|\ll (\log |t|)^{-A}$ for some constant $A>2.$ Let $\mathcal{A}=(q_n)_{n\in \N}$ be a positive, real-valued, lacunary sequence.…

Number Theory · Mathematics 2024-09-06 Bo Tan , Qing-Long Zhou

It is proved that the Fibonacci and the Frolov point sets, which are known to be very good for numerical integration, have optimal rate of decay of dispersion with respect to the cardinality of sets. This implies that the Fibonacci and the…

Numerical Analysis · Mathematics 2017-10-05 V. N. Temlyakov

We investigate the continuous non-monotone DR-submodular maximization problem subject to a down-closed convex solvable constraint. Our first contribution is to construct an example to demonstrate that (first-order) stationary points can…

Data Structures and Algorithms · Computer Science 2024-03-27 Shengminjie Chen , Donglei Du , Wenguo Yang , Dachuan Xu , Suixiang Gao

We consider the problem of recovering a linear combination of Dirac delta functions and derivatives from a finite number of Fourier samples corrupted by noise. This is a generalized version of the well-known spike recovery problem, which is…

Numerical Analysis · Mathematics 2016-10-13 Dmitry Batenkov

Galileo, in the XVII century, observed that the small oscillations of a pendulum seem to have constant period. In fact, the Taylor expansion of the period map of the pendulum is constant up to second order in the initial angular velocity…

Dynamical Systems · Mathematics 2009-08-07 C. A. A. de Carvalho , M. M. Peixoto , D. Pinheiro , A. A. Pinto

Cheeger's fundamental inequality states that any edge-weighted graph has a vertex subset $S$ such that its expansion (a.k.a. conductance) is bounded as follows: \[ \phi(S) \defeq \frac{w(S,\bar{S})}{\min \set{w(S), w(\bar{S})}} \leq…

Data Structures and Algorithms · Computer Science 2015-03-19 Anand Louis , Prasad Raghavendra , Prasad Tetali , Santosh Vempala
‹ Prev 1 3 4 5 6 7 10 Next ›