English
Related papers

Related papers: Drawing Sound Conclusions from Unsound Premises

200 papers

The sufficient conditions for solvability of a linear Diophantine equation $\sum_{i=1}^{n}a_ix_i=b$ (with $a_1,a_2,...,a_n\in \mathbb{N}$) in non-negative integers $x_1,x_2,...,x_n$ are given. The explicit formulas are given for Frobenius…

Number Theory · Mathematics 2026-02-13 Eteri Samsonadze

For integers $a_0,a_1,\ldots,a_n$ with $|a_0a_n|=1$ and either $\alpha =u$ with $1\leq u \leq 50$ or $\alpha=u+ \frac{1}{2}$ with $1 \leq u \leq 45$, we prove that $\psi_n^{(\alpha)}(x;a_0,a_1,\cdots,a_n)$ is irreducible except for an…

Number Theory · Mathematics 2019-01-07 Shanta Laishram , Saranya G. Nair , Tarlok Nath Shorey

The polynomial Fre\u{\i}man--Ruzsa conjecture is a fundamental open question in additive combinatorics. However, over the integers (or more generally $\mathbb{R}^d$ or $\mathbb{Z}^d$) the optimal formulation has not been fully pinned down.…

Number Theory · Mathematics 2017-09-29 Freddie Manners

We revise the analysis of the acoustic wave equation, addressing the question whether the classical well-posedness implies the existence of an isomorphism between prescribed solution and data spaces. This question is of interest for the…

Numerical Analysis · Mathematics 2026-03-31 Giancarlo Sangalli , Davide Terazzi , Pietro Zanotti

We consider positive solutions, possibly unbounded, to the semilinear equation $-\Delta u=f(u)$ on continuous epigraphs bounded from below. Under the homogeneous Dirichlet boundary condition, we prove new monotonicity results for $u$, when…

Analysis of PDEs · Mathematics 2025-02-10 Nicolas Beuvin , Alberto Farina , Berardino Sciunzi

A finite word $w$ is called \emph{rich} if it contains $\vert w\vert+1$ distinct palindromic factors including the empty word. Let $q\geq 2$ be the size of the alphabet. Let $R(n)$ be the number of rich words of length $n$. Let $d>1$ be a…

Combinatorics · Mathematics 2022-12-20 Josef Rukavicka

The sufficient conditions for insolvability of the Diophantine equation $\sum_{i=1}^{m}x_i^{n}=bc^{n}$ ($n, m \geq 2$, $b, c\in \mathbb{N}$) in nonnegative integers are obtained for the case where the canonical decomposition of the number…

Number Theory · Mathematics 2025-05-14 Eteri Samsonadze

We prove various uniqueness results from null infinity, for linear waves on asymptotically flat space-times. Assuming vanishing of the solution to infinite order on suitable parts of future and past null infinities, we derive that the…

Analysis of PDEs · Mathematics 2021-08-16 Spyros Alexakis , Volker Schlue , Arick Shao

We make an analytical proof for Lehmer's totient conjecture. Lehmer conjectured that there is no solution for the congruence equation $n-1\equiv 0~(mod~\phi(n))$ with composite integers,$n$, where $\phi(n)$ denotes Euler's totient function.…

General Mathematics · Mathematics 2016-08-30 Ahmad Sabihi

We consider the problem of Ambrosetti-Prodi type \begin{equation}\label{0}\quad\begin{cases} \Delta u + e^u = s\phi_1 + h(x) &\hbox{in} \Omega, u=0 & \hbox{on} \partial \Omega, \end{cases} \nonumber \end{equation} where $\Omega$ is a…

Analysis of PDEs · Mathematics 2007-05-23 Manuel del Pino , Claudio Muñoz

Given an alphabet $S$, we consider the size of the subsets of the full sequence space $S^{\rm {\bf Z}}$ determined by the additional restriction that $x_i\not=x_{i+f(n)},\ i\in {\rm {\bf Z}},\ n\in {\rm {\bf N}}.$ Here $f$ is a positive,…

Probability · Mathematics 2015-03-20 Kari Eloranta

We study Fibonacci compositions, which are compositions of natural numbers that only use Fibonacci numbers, in two different contexts. We first prove inequalities comparing the number of Fibonacci compositions to regular compositions where…

Number Theory · Mathematics 2022-11-29 Joshua M. Siktar

We prove that every MAD family can be destroyed by a proper forcing that preserves $P$-points. With this result, we prove that it is consistent that $\omega_{1}=\mathfrak{u}<\mathfrak{a,}$ solving a nearly 20 year old problem of Shelah and…

Logic · Mathematics 2021-06-08 Osvaldo Guzman , Damjan Kalajdzievski

Consider a system \Psi of non-constant affine-linear forms \psi_1,...,\psi_t: Z^d -> Z, no two of which are linearly dependent. Let N be a large integer, and let K be a convex subset of [-N,N]^d. A famous and difficult open conjecture of…

Number Theory · Mathematics 2008-04-22 Ben Green , Terence Tao

We study the complexity of satisfiability problems in probabilistic and causal reasoning. Given random variables $X_1, X_2,\ldots$ over finite domains, the basic terms are probabilities of propositional formulas over atomic events $X_i =…

Computational Complexity · Computer Science 2025-04-29 Markus Bläser , Julian Dörfler , Maciej Liśkiewicz , Benito van der Zander

Nonuniformity is a central concept in computational complexity with powerful connections to circuit complexity and randomness. Nonuniform reductions have been used to study the isomorphism conjecture for NP and completeness for larger…

Computational Complexity · Computer Science 2018-01-19 John M. Hitchcock , Hadi Shafei

This paper considers the model problem of reconstructing an object from incomplete frequency samples. Consider a discrete-time signal $f \in \C^N$ and a randomly chosen set of frequencies $\Omega$ of mean size $\tau N$. Is it possible to…

Numerical Analysis · Mathematics 2007-05-23 Emmanuel Candes , Justin Romberg , Terence Tao

In this paper, we consider the isoperimetric problem in the space $\mathbb{R}^N$ with density. Our result states that, if the density f is l.s.c. and converges to a positive limit at infinity, being smaller than this limit far from the…

Analysis of PDEs · Mathematics 2014-11-20 Guido De Philippis , Giovanni Franzina , Aldo Pratelli

We construct an oracle relative to which $\mathrm{P} = \mathrm{NP} \cap \mathrm{coNP}$, but there are no many-one complete sets in $\mathrm{UP}$, no many-one complete disjoint $\mathrm{NP}$-pairs, and no many-one complete disjoint…

Computational Complexity · Computer Science 2022-03-22 Anton Ehrmanntraut , Fabian Egidy , Christian Glaßer

If $S$ is a given regular $n$-simplex, $n \ge 2$, of edge length $a$, then the distances $a_1$, $\cdots$, $a_{n+1}$ of an arbitrary point in its affine hull to its vertices are related by the fairly known elegant relation $\phi_{n+1}…

Commutative Algebra · Mathematics 2017-01-03 Mowaffaq Hajja , Mostafa Hayajneh , Bach Nguyen , Shadi Shaqaqha
‹ Prev 1 3 4 5 6 7 10 Next ›