English
Related papers

Related papers: Cicho\'n's maximum with evasion number

200 papers

We relate the (anisotropic) variable coefficient local and nonlocal Calder\'on problems by means of the Caffarelli-Silvestre extension. In particular, we prove that (partial) Dirichlet-to-Neumann data for the fractional Calder\'on problem…

Analysis of PDEs · Mathematics 2023-06-21 Giovanni Covi , Tuhin Ghosh , Angkana Rüland , Gunther Uhlmann

Denote by $\mathcal{NA}$ and $\mathcal{MA}$ the ideals of null-additive and meager-additive subsets of~$2^\omega$, respectively. We prove in ZFC that $\mathrm{add}(\mathcal{NA})=\mathrm{non}(\mathcal{NA})$ and introduce a new (Polish)…

Logic · Mathematics 2025-09-30 Miguel A. Cardona , Diego A. Mejía , Ismael E. Rivera-Madrid

We prove that $\mathop{\mathbb{E}}_{m \leq M} \mathop{\mathbb{E}}_{n \leq N} \Lambda(n) \Lambda\bigl(n + \lfloor m^c \rfloor\bigr) = 1 + \rm{O}(\log^{2 - Bc} N)$, where $c > 2$ is a non-integer, $B \geq 3/c$, and $M$ is of order $N^{1/c}…

Number Theory · Mathematics 2024-11-27 Bora Çalım , Ioannis Iakovakis , Sophie Long , Jack Moffatt , Deborah Wooton

In the setting of nonstandard analysis we introduce the notion of flexible sequence. The terms of flexible sequences are external numbers. These are a sort of analogue for the classical \emph{O$ (\cdot ) $} and \emph{o$ (\cdot ) $} notation…

Logic · Mathematics 2019-09-17 Bruno Dinis , Tran Van Nam , Imme van den Berg

We strengthen a result of Hanke-Schick about the strong Novikov conjecture for low degree cohomology by showing that their non-vanishing result for the maximal group C*-algebra holds for many other exotic group C*-algebras, in particular…

K-Theory and Homology · Mathematics 2020-12-15 Paolo Antonini , Alcides Buss , Alexander Engel , Timo Siebenand

We prove a conjecture that classifies exceptional numbers. This conjecture arises in two different ways, from cryptography and from coding theory. An odd integer $t\geq 3$ is said to be exceptional if $f(x)=x^t$ is APN (Almost Perfect…

Information Theory · Computer Science 2024-05-01 Fernando Hernando , Gary McGuire

Let $f$ be a transcendental entire function and let $I(f)$ denote the set of points that escape to infinity under iteration. We give conditions which ensure that, for certain functions, $I(f)$ is connected. In particular, we show that…

Complex Variables · Mathematics 2008-01-24 P. J. Rippon , G. M. Stallard

We obtain an upper bound for the sum $\sum_{n\leq N} (a_{n}/\varphi (a_{n}))^{s}$, where $\varphi$ is Euler's totient function, $s\in \mathbb{N}$, and $a_{1},\ldots, a_{N}$ are positive integers (not necessarily distinct) with some…

Number Theory · Mathematics 2026-03-09 Artyom Radomskii

Let $h \geq 2$ and let ${ \mathcal A} = (A_1,\ldots, A_h)$ be an $h$-tuple of sets of integers. For nonzero integers $c_1,\ldots, c_h$, consider the linear form $\varphi = c_1 x_1 + c_2x_2 + \cdots + c_h x_h$. The \emph{representation…

Number Theory · Mathematics 2022-12-14 Melvyn B. Nathanson

Given a positive increasing function $\varphi$, we show that for a full measure set of vectors $\alpha\in \mathbb{R}^d$, the maximal ergodic discrepancy of the $d$-linear form sequence $\left\{\sum_{1\le i\le d} k_i\alpha_i \mod…

Number Theory · Mathematics 2021-12-01 Hao Wu

Let $A$ and $B$ be sets of nonnegative integers. For a positive integer $n$ let $R_{A}(n)$ denote the number of representations of $n$ as the sum of two terms from $A$. Let $\displaystyle s_{A}(x) = \max_{n \le x}R_{A}(n)$ and…

Number Theory · Mathematics 2015-07-17 Sándor Z. Kiss , Csaba Sándor

Let $\Lambda$ be a numerical semigroup with embedding dimension $e(\Lambda)$. Define $c(\Lambda)$ to be one plus the largest integer not in $\Lambda$, and define $c'(\Lambda)$ to be the number of elements in $\Lambda$ less than…

Combinatorics · Mathematics 2011-11-14 Alex Zhai

We give an example of a formula involving the sinc function that holds for every N = 0, 1, 2, ..., up to about 10^102832732165, then fails for all larger N. We give another example that begins to fail after about N ~…

Number Theory · Mathematics 2015-08-04 Robert Baillie

In this paper, we present several new a posteriori error estimators and two adaptive mixed finite element methods \textsf{AMFEM1} and \textsf{AMFEM2} for the Hodge Laplacian problem in finite element exterior calculus. We prove that…

Numerical Analysis · Mathematics 2019-08-26 Yuwen Li

The classical Hopf's lemma can be reformulated as uniqueness of continuation result. We aim in the present work to quantify this property. We show precisely that if a solution $u$ of a divergence form elliptic equation attains its maximum…

Analysis of PDEs · Mathematics 2021-05-07 Mourad Choulli , Faouzi Triki , Qi Xue

We introduce a family of maps generating continued fractions where the digit $1$ in the numerator is replaced cyclically by some given non-negative integers $(N_1,\ldots,N_m)$. We prove the convergence of the given algorithm, and study the…

Dynamical Systems · Mathematics 2021-12-09 Karma Dajani , Niels Langeveld

Let $F_{n}$ be the $n$-th Fibonacci number. Put $\varphi=\frac{1+\sqrt5}{2}$. We prove that the following inequalities hold for any real $\alpha$: 1) $\inf_{n \in \mathbb N} ||F_n\alpha||\le\frac{\varphi-1}{\varphi+2}$, 2) $\liminf_{n\to…

Number Theory · Mathematics 2011-12-30 Victoria Zhuravleva

Let $F$ be a totally real field, and $\mathbb{A}_F$ be the adele ring of $F$. Let us fix $N$ to be a positive integer. Let $\pi_1=\otimes\pi_{1,v}$ and $\pi_2=\otimes\pi_{2,v}$ be distinct cohomological cuspidal automorphic representations…

Number Theory · Mathematics 2022-03-15 Dohoon Choi

We introduce a notion of fractional convexity that extends naturally the usual notion of convexity in the Euclidean space to a fractional setting. With this notion of fractional convexity, we study the fractional convex envelope inside a…

Analysis of PDEs · Mathematics 2021-07-14 Leandro M. Del Pezzo , Alexander Quaas , Julio D. Rossi

A multiset of literals, called a clause, is \emph{strongly satisfied} by an assignment if \emph{no} literal evaluates to false. Finding an assignment that maximises the number of strongly satisfied clauses is NP-hard. We present a simple…

Data Structures and Algorithms · Computer Science 2026-03-02 Tamio-Vesa Nakajima , Stanislav Živný