English
Related papers

Related papers: Drawing Sound Conclusions from Unsound Premises

200 papers

In this paper we study a quantitative notion of exactness within Diophantine approximation. Given $\Psi:(0,\infty)\to (0,\infty)$ and $\omega:(0,\infty)\to (0,1)$ satisfying $\lim_{q\to\infty}\omega(q)=0$, we study the set of points, which…

Number Theory · Mathematics 2025-10-22 Simon Baker , Benjamin Ward

Certain reduced free products of C*-algebras, (A,phi)=(A_1,phi_1)*(A_2,\phi_2), taken with respect to faithful states, at least one of which is not a trace, are shown to be purely infinite and simple. It is assumed that one of the A_i…

Operator Algebras · Mathematics 2007-05-23 Ken Dykema

We give negative answers to two questions of Bergelson, Moreira, and Richter concerning recurrence along functions from a Hardy field. For the pair \(f_1(t)=t^{3/2}\) and \(f_2(t)=\lambda t^{3/2}+t\), where \(\lambda\in\mathbb…

Number Theory · Mathematics 2026-05-19 Kangbo Ouyang , Leiye Xu , Shuhao Zhang

Let $\omega$ be a continuous weight on $\mathbb R^+$ and let $L^1(\omega)$ be the corresponding convolution algebra. By results of Gr{\o}nb{\ae}k and Bade & Dales the continuous derivations from $L^1(\omega)$ to its dual space…

Functional Analysis · Mathematics 2011-11-18 Thomas Vils Pedersen

Let $\Omega=(a,b)\subset\mathbb{R}$, $0\leq m,n\in L^{1}(\Omega)$, $\lambda,\mu>0$ be real parameters, and $\phi:\mathbb{R}\rightarrow\mathbb{R}$ be an odd increasing homeomorphism. In this paper we consider the existence of positive…

Classical Analysis and ODEs · Mathematics 2024-06-06 Uriel Kaufmann , Leandro Milne

The set $\Mfib$ of fibbinary numbers is defined via a bijection between the set $\BB{N}$ of natural numbers and $\Mfib$. Since the elements of $\Mfib$ do not exhaust $\BB{N}$, the structure of the complement $\overline{\Mfib}$ of $\Mfib$ in…

Number Theory · Mathematics 2024-06-19 A. J. Macfarlane

In this paper we investigate the complexity-theoretical aspects of cyclic and non-wellfounded proofs in the context of parsimonious logic, a variant of linear logic where the exponential modality ! is interpreted as a constructor for…

Logic in Computer Science · Computer Science 2025-09-12 Matteo Acclavio , Gianluca Curzi , Giulio Guerrieri

It is shown that a class of optical physical unclonable functions (PUFs) can be learned to arbitrary precision with arbitrarily high probability, even in the presence of noise, given access to polynomially many challenge-response pairs and…

Machine Learning · Computer Science 2023-09-08 Apollo Albright , Boris Gelfand , Michael Dixon

We consider biharmonic maps $\phi:(M,g)\rightarrow (N,h)$ from a complete Riemannian manifold into a Riemannian manifold with non-positive sectional curvature. Assume that $\alpha$ satisfies $1<\alpha<\infty$. If for such an $\alpha$,…

Differential Geometry · Mathematics 2013-08-29 Shun Maeta

We study systems of polynomial equations in several classes of finitely generated rings and algebras. For each ring $R$ (or algebra) in one of these classes we obtain an interpretation by systems of equations of a ring of integers $O$ of a…

Rings and Algebras · Mathematics 2022-10-26 Albert Garreta , Alexei Miasnikov , Denis Ovchinnikov

We study -- within the framework of propositional proof complexity -- the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiable formula has many satisfying assignments, where ``many'' stands for an…

Computational Complexity · Computer Science 2010-04-19 Nachum Dershowitz , Iddo Tzameret

We investigate the behaviour of solutions $\phi = \phi^{(p)}$ to the one-dimensional nonlinear wave equation $-\phi_{tt} + \phi_{xx} = -|\phi|^{p-1} \phi$ with initial data $\phi(0,x) = \phi_0(x)$, $\phi_t(0,x) = \phi_1(x)$, in the high…

Analysis of PDEs · Mathematics 2009-02-20 Terence Tao

We consider inverse problems consisting of the reconstruction of an unknown signal $f$ from noisy measurements $y=Ff+\text{noise}$, where $Ff$ is a function on a Riemannian manifold without boundary $\mathcal M$. We consider the case when…

Functional Analysis · Mathematics 2026-04-24 Giovanni S. Alberti , Ernesto De Vito , Bianca Gariboldi , Giacomo Gigante

Among other things, we prove that, for a doubling weight $w$, $0< p\leq\infty$, $r\in{\mathbb N}_0$, and $0<\alpha <r+1 - 1/\lambda_p$, we have \[ E_n(f)_{p, w_n} = O(n^{-\alpha}) \iff \omega_\varphi^{r+1}(f, n^{-1})_{p, w_n} =…

Classical Analysis and ODEs · Mathematics 2015-07-20 Kirill A. Kopotun

In this paper we construct an infinite sequence of binary irreducible polynomials starting from any irreducible polynomial $f_0 \in \F_2 [x]$. If $f_0$ is of degree $n = 2^l \cdot m$, where $m$ is odd and $l$ is a non-negative integer,…

Dynamical Systems · Mathematics 2013-08-27 Simone Ugolini

We show that there exists a positive arithmetical formula $\psi(x,R)$, where $x \in \omega$, $R \subseteq \omega$, with no hyperarithmetical fixed point. This answers a question of Gerhard J\"{a}ger. As corollaries we obtain results on the…

Logic · Mathematics 2022-03-03 Vassilios Gregoriades

We study the asymptotics and fine-scale behavior of quantitative combinatorial measures of infinite words and related dynamical and algebraic structures. We construct infinite recurrent words $w$ whose complexity functions $p_w(n)$ are…

Combinatorics · Mathematics 2025-08-26 Be'eri Greenfeld , Carlos Gustavo Moreira , Efim Zelmanov

We prove that if the linear-time and polynomial-time hierarchies coincide, then every model of $\Pi_1(\mathbb{N}) + \neg \Omega_1$ has a proper end-extension to a model of $\Pi_1(\mathbb{N})$, and so $\Pi_1(\mathbb{N}) + \neg \Omega_1…

Logic · Mathematics 2014-11-26 Leszek Aleksander Kołodziejczyk

Let $f$ be a continuous function on the unit circle $\Gamma$, whose Fourier series is $\omega$-absolutely convergent for some weight $\omega$ on the set of integers $\mathcal{Z}$. If $f$ is nowhere vanishing on $\Gamma$, then there exists a…

Complex Variables · Mathematics 2007-05-23 S. J. Bhatt , H. V. Dedania

K\"onig's lemma is a fundamental result about trees with countless applications in mathematics and computer science. In contrapositive form, it states that if a tree is finitely branching and well-founded (i.e. has no infinite paths), then…

Logic in Computer Science · Computer Science 2026-02-20 Henning Urbat , Thorsten Wißmann
‹ Prev 1 4 5 6 7 8 10 Next ›