English
Related papers

Related papers: Variations and extensions of Croft's problem

200 papers

We observe that if f is a continuous function on an interval I and x_0 \in I, then f is operator monotone if and only if the function (f(x) - f(x_0)/(x - x_0) is strongly operator convex. Then starting with an operator monotone function…

Functional Analysis · Mathematics 2017-12-25 Lawrence G. Brown

We study some variants of the Erd\H{o}s similarity problem. We pose the question if every measurable subset of the real line with positive measure contains a similar copy of an infinite geometric progression. We construct a compact subset…

Metric Geometry · Mathematics 2023-10-20 Alex Burgin , Samuel Goldberg , Tamás Keleti , Connor MacMahon , Xianzhi Wang

Assuming the Continuum Hypothesis, there is a compact first countable connected space of weight aleph_1 with no totally disconnected perfect subsets. Each such space, however, may be destroyed by some proper forcing order which does not add…

General Topology · Mathematics 2007-05-23 Joan E. Hart , Kenneth Kunen

The stipulation that no measurable quantity could have an infinite value is indispensable in physics. At the same time, in mathematics, the possibility of considering an infinite procedure as a whole is usually taken for granted. However,…

Quantum Physics · Physics 2022-12-07 Arkady Bolotin

We discuss the occurrence of positive solutions which decay to 0 as $| x|\to+\infty$ to the differential equation $\Delta u+f(x,u)+g(| x|)x\cdot\nabla u=0$, $| x|>R>0$, $x\in\mathbb{R}^{n}$, where $n\geq 3$, $g$ is nonnegative valued and…

Analysis of PDEs · Mathematics 2010-01-07 Fahd Jarad , Octavian G. Mustafa , Donal O'Regan

Various problems on integers lead to the class of congruence preserving functions on rings, i.e. functions verifying $a-b$ divides $f(a)-f(b)$ for all $a,b$. We characterized these classes of functions in terms of sums of rational…

Number Theory · Mathematics 2015-06-02 Patrick Cégielski , Serge Grigorieff , Irène Guessarian

There are infinite processes (matrix products, continued fractions, $(r,s)$-matrix continued fractions, recurrence sequences) which, under certain circumstances, do not converge but instead diverge in a very predictable way. We give a…

Number Theory · Mathematics 2019-01-07 Douglas Bowman , James Mc Laughlin

In this work we prove that an entire function $f(z)$ has only negative zeros if and only if its order is strictly less $1$, its root sequence is real-part dominating and there exists an nonnegative integer $m$ the real function…

Classical Analysis and ODEs · Mathematics 2023-12-27 Ruiming Zhang

In this paper we study the asymptotic behaviour of two relatively new complexity functions defined on infinite words and their relationship to periodicity. Given a factor $u$ of an infinite word $x$, we say $u$ is closed if it is a letter…

Combinatorics · Mathematics 2023-01-04 O. Parshina , M. Postic

Maximum satisfiability is a canonical NP-hard optimization problem that appears empirically hard for random instances. Let us say that a Conjunctive normal form (CNF) formula consisting of $k$-clauses is $p$-satisfiable if there exists a…

Probability · Mathematics 2007-05-23 Dimitris Achlioptas , Assaf Naor , Yuval Peres

Let $\mu(n)$ denote the M\"obius function, define $M(x)= \sum_{n\leq x}^{}\mu (n)$. The main result of this paper is to prove that \begin{equation*} \displaystyle\lim_{x \to +\infty}\frac{M(x)}{x}=0 \end{equation*} which is equivalent to…

General Mathematics · Mathematics 2023-02-24 Junda Pan

The famous Jacobian Conjecture asks if a morphism $f:K[x,y]\to K[x,y]$ with invertible Jacobian, is invertible ($K$ is a characteristic zero field). A known result says that if $K[f(x),f(y)] \subseteq K[x,y]$ is an integral extension, then…

Commutative Algebra · Mathematics 2015-06-18 Vered Moskowicz

We study pure exploration problems in which the set of correct answers is possibly infinite. For example, such problems arise when regressing a continuous function on the means of the bandit or when learning Nash equilibria by querying…

Machine Learning · Computer Science 2026-03-11 Riccardo Poiani , Martino Bernasconi , Andrea Celli

For decreasing sequences $\{t_{n}\}_{n=1}^{\infty}$ converging to zero, we obtain the almost everywhere convergence results for sequences of Schr\"{o}dinger means $e^{it_{n}\Delta}f$, where $f \in H^{s}(\mathbb{R}^{N}), N\geq 2$. The…

Classical Analysis and ODEs · Mathematics 2025-04-30 Wenjuan Li , Huiju Wang , Dunyan Yan

Let $C$ be a compact convex subset of $\mathbb{R}^n$, $f:C\to\mathbb{R}$ be a convex function, and $m\in\{1, 2, ..., \infty\}$. Assume that, along with $f$, we are given a family of polynomials satisfying Whitney's extension condition for…

Classical Analysis and ODEs · Mathematics 2019-03-05 Daniel Azagra , Carlos Mudarra

Given a positive integer $N$ and real number $\alpha\in [0, 1]$, let $m(\alpha,N)$ denote the minimum, over all sets $A\subset \mathbb{Z}/N\mathbb{Z}$ of size at least $\alpha N$, of the normalized count of 3-term arithmetic progressions…

Combinatorics · Mathematics 2014-09-11 Pablo Candela , Olof Sisask

Let $X$ be a compact metric space and let $|A|$ denote the cardinality of a set $A$. We prove that if $f\colon X\to X$ is a homeomorphism and $|X|=\infty$ then for all $\delta>0$ there is $A\subset X$ such that $|A|=4$ and for all $k\in Z$…

Dynamical Systems · Mathematics 2014-04-03 Alfonso Artigue

We prove that if $f(x) = \sum_{k=0}^\infty a_k x^k,$ $a_k >0, $ is an entire function such that the sequence $Q := \left( \frac{a_k^2}{a_{k-1}a_{k+1}} \right)_{k=1}^\infty$ is non-decreasing and $\frac{a_1^2}{a_{0}a_{2}} \geq 2\sqrt[3]{2},$…

Complex Variables · Mathematics 2020-12-17 Thu Hien Nguyen , Anna Vishnyakova

This paper provides a new and more direct proof of the assertion that a Turing computable function of the natural numbers is primitive recursive if and only if the time complexity of the corresponding Turing machine is bounded by a…

Formal Languages and Automata Theory · Computer Science 2025-10-22 Daniel G. Schwartz

A function f is continuous iff the PRE-image f^{-1}[V] of any open set V is open again. Dual to this topological property, f is called OPEN iff the IMAGE f[U] of any open set U is open again. Several classical Open Mapping Theorems in…

Logic in Computer Science · Computer Science 2010-05-10 Martin Ziegler