English
Related papers

Related papers: Br\"uck Conjecture with hyper-order less than one

200 papers

We put a new conjecture on primes from the point of view of its binary expansions and make a step towards justification.

Number Theory · Mathematics 2007-06-11 Vladimir Shevelev

Many theorems of mathematics have the form that for a certain problem, e.g. a differential equation or polynomial (in)equality, there exists a solution. The sequential version then states that for a sequence of problems, there is a sequence…

Logic · Mathematics 2024-03-21 Dag Normann , Sam Sanders

The document tries to put focus on sequences with certain properties and periods leading to the first value smaller than the starting value in the Collatz problem. With the idea that, if all starting numbers lead ultimately to a smaller…

General Mathematics · Mathematics 2025-02-14 J. Stöckl

We investigate a class of fourth-order differential systems with instantaneous and non-instantaneous impulses. Our technical approach is mainly based on a variant of Clark's theorem without the global assumptions. Under locally subquadratic…

Analysis of PDEs · Mathematics 2025-04-17 Lijuan Kang , Xingyong Zhang , Cuiling Liu

We show that the higher order linear differential equation possesses all solutions of infinite order under certain conditions by extending the work of authors about second order differential equation \cite{dsm2}.

Complex Variables · Mathematics 2020-04-10 Dinesh Kumar , Sanjay Kumar , Manisha Saini

We show that for any $i > 0$, it is decidable, given a regular language, whether it is expressible in the $\Sigma_i[<]$ fragment of first-order logic FO[<]. This settles a question open since 1971. Our main technical result relies on the…

Formal Languages and Automata Theory · Computer Science 2025-02-03 Corentin Barloy , Michaël Cadilhac , Charles Paperman , Howard Straubing

The Rearrangement Conjecture states that if two words over $\mathbb{P}$ are Wilf-equivalent in the factor order on $\mathbb{P}^\ast$ then they are rearrangements of each other. We introduce the notion of strong Wilf-equivalence and prove…

Combinatorics · Mathematics 2014-09-15 Jay Pantone , Vincent Vatter

By a proper cover of a finite group G we mean an extension of a nontrivial finite group by G. Our purpose is to show that a proper cover of a finite simple group L of Lie type always contains an element whose order differs from the element…

Group Theory · Mathematics 2015-02-03 M. A. Grechkoseeva

We prove that epimorphisms are surjective in certain categories of ordered F-algebras. It then turns out that epimorphisms are also surjective in the category of all (unordered) algebras of type F.

Rings and Algebras · Mathematics 2017-11-15 Nasir Sohail , Boza Tasic

It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their power series expansions. We show that the linear differential…

Symbolic Computation · Computer Science 2008-04-03 Alin Bostan , Frédéric Chyzak , Bruno Salvy , Grégoire Lecerf , Éric Schost

This is a conitunation of [1] and [2]. We prove that if function $f$ belongs to the class $\Lambda_{\omega} \overset{\text{def}}{=} \{f: \omega_{f}(\delta)\leq \text{const} \omega(\delta)\} $ for an arbitrary modulus of continuity $\omega$,…

Functional Analysis · Mathematics 2016-05-18 Qinbo Liu

The theory of Frobenius groups with Frobenius complements of even order largely reduces to tractable algebraic number theory. If we consider only Frobenius complements with an upper bound $s$ on the number of distinct primes dividing the…

Group Theory · Mathematics 2021-02-09 Ron Brown

We present a sufficient condition for the Riemann hypothesis. This condition is the existence of a special ordering on the set of finite products of distinct odd primes.

Number Theory · Mathematics 2025-05-20 Young Deuk Kim

We prove that the uniform recurrence of morphic sequences is decidable. For this we show that the number of derived sequences of uniformly recurrent morphic sequences is bounded. As a corollary we obtain that uniformly recurrent morphic…

Combinatorics · Mathematics 2012-09-03 Fabien Durand

A famous conjecture of Graham asserts that every set $A \subseteq \mathbb{Z}_p \setminus \{0\}$ can be ordered so that all partial sums are distinct. Bedert and Kravitz proved that this statement holds whenever $|A| \leq e^{c(\log…

Combinatorics · Mathematics 2025-08-20 Simone Costa , Stefano Della Fiore , Eva R. Engel

In this article, we improve the convergence order of some finite volume solutions approximating some second order elliptic problems. We prove that finite volume approximations of order $O(h^{k+1})$, with $k$ integer, can be obtained after…

Numerical Analysis · Mathematics 2007-05-23 Bilal Atfeh , Abdallah Bradji

Graham conjectured in 1971 that for any prime $p$, any subset $S\subseteq \mathbb{Z}_p\setminus \{0\}$ admits an ordering $s_1,s_2,\dots,s_{|S|}$ where all partial sums $s_1, s_1+s_2,\dots,s_1+s_2+\dots+s_{|S|}$ are distinct. We prove this…

Combinatorics · Mathematics 2026-02-18 Huy Tuan Pham , Lisa Sauermann

We show that Kaplansky's unit conjecture is true, under the assumption that the underlying field is complex.

Algebraic Geometry · Mathematics 2022-10-14 Kwok Kwan Wong

In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…

Computational Complexity · Computer Science 2016-08-15 Peter Franek , Stefan Ratschan , Piotr Zgliczynski

In this article, we study the quantitative uniqueness of solutions to second order elliptic equations with singular lower order terms. We quantify the strong unique continuation property by estimating the maximal vanishing order of…

Analysis of PDEs · Mathematics 2017-05-24 Blair Davey , Jiuyi Zhu