English
Related papers

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

200 papers

Motivated by the search for methods to establish strong minimality of certain low order algebraic differential equations, a measure of how far a finite rank stationary type is from being minimal is introduced and studied: The {\em degree of…

Logic · Mathematics 2021-08-06 James Freitag , Rahim Moosa

We prove a version of the Erd\H{o}s--Beck Theorem from discrete geometry for fractal sets in all dimensions. More precisely, let $X\subset \mathbb{R}^n$ Borel and $k \in [0, n-1]$ be an integer. Let $\dim (X \setminus H) = \dim X$ for every…

Classical Analysis and ODEs · Mathematics 2024-06-17 Paige Bright , Caleb Marshall

Using the concepts of Hyperbolic Classification of Natural Numbers, Essential Regions and Goldbach Conjecture Function we prove that the existence of a proof of the Goldbach Conjecture in First-Order Arithmetic would imply the existence of…

General Mathematics · Mathematics 2007-11-08 Fernando Revilla

We prove Union-Closed sets conjecture.

Combinatorics · Mathematics 2024-09-13 Vladimir Blinovsky , Llohann D Speranca

We prove Los conjecture = Morley theorem in ZF, with the same characterization (of first order countable theories categorical in aleph_alpha for some (equivalently for every) ordinal alpha>0. Another central result here is, in this context:…

Logic · Mathematics 2008-07-08 Saharon Shelah

In this paper we consider the following conjecture, proposed by Brian Alspach, concerning partial sums in finite cyclic groups: given a subset $A$ of $\mathbb{Z}_n\setminus \{0\}$ of size $k$ such that $\sum_{z\in A} z\not= 0$, it is…

Combinatorics · Mathematics 2020-04-24 Simone Costa , Marco Antonio Pellegrini

Let $E/\mathbb{Q}$ be an elliptic curve of level $N$ and rank equal to $1$. Let $p$ be a prime of ordinary reduction. We experimentally study conjecture $4$ of B. Mazur and J. Tate in his article "Refined Conjectures of the Birch and…

Number Theory · Mathematics 2017-09-06 Francisco X. Portillo-Bobadilla

We prove that the ordered configuration spaces of planar graphs have the highest possible topological complexity generically, as predicted by a conjecture of Farber. Our argument establishes the same generic maximality for all higher…

Algebraic Topology · Mathematics 2021-08-03 Ben Knudsen

We show that the existence of a first-order formula separating two monadic second order formulas over countable ordinal words is decidable. This extends the work of Henckell and Almeida on finite words, and of Place and Zeitoun on…

Logic in Computer Science · Computer Science 2022-01-11 Thomas Colcombet , Sam van Gool , Rémi Morvan

In this paper, we obtained an equivalent proposition of Brennan`s conjecture. And given two lower bound estimation of the conjecture one of them connected with Schwarzian derivative. The present study also verified the correctness of the…

Complex Variables · Mathematics 2015-09-02 Junyi Hu , Shiyu Chen

We consider the fragment F of first order arithmetic in which quantification is restricted to ''for all but finitely many.'' We show that the integers form an F-elementary substructure of the real numbers. Consequently, the F-theory of…

Logic · Mathematics 2007-05-23 David Marker , Theodore A. Slaman

In this work we look at the original fractional calculus of variations problem in a somewhat different way. As a simple consequence, we show that a fractional generalization of a classical problem has a solution without any restrictions on…

Optimization and Control · Mathematics 2019-08-27 Rui A. C. Ferreira

This paper considers overdetermined boundary problems. Firstly, we give a proof to the Payne-Schaefer conjecture about an overdetermined problem of sixth order in the two dimensional case and under an additional condition for the case of…

Analysis of PDEs · Mathematics 2021-10-06 Changyu Xia

In this paper we study the problem of almost periodicity of solutions for dissipative differential equations (Bronshtein's conjecture). We give a positive answer to this conjecture for monotone almost periodic systems of…

Dynamical Systems · Mathematics 2017-12-01 David Cheban

We show that the higher-order matching problem is decidable using a game-theoretic argument.

Logic in Computer Science · Computer Science 2015-07-01 Colin Stirling

Recent investigations on the set of commutators between the elements of a finite group having relatively prime orders have prompt us to propose a variant of the Ore conjecture: For every finite non-abelian simple group and for every $g\in…

Group Theory · Mathematics 2025-04-07 Andrea Lucchini , Pablo Spiga

In this paper, we prove the conjecture that if there is an odd perfect number, then there are infinitely many of them.

Number Theory · Mathematics 2022-02-10 Jose Arnaldo Bebita Dris

The Feferman-Vaught theorem provides a way of evaluating a first order sentence $\varphi$ on a disjoint union of structures by producing a decomposition of $\varphi$ into sentences which can be evaluated on the individual structures and the…

Logic in Computer Science · Computer Science 2022-01-03 Abhisekh Sankaran

We say that a finite almost simple $G$ with socle $S$ is admissible (with respect to the spectrum) if $G$ and $S$ have the same sets of orders of elements. Let $L$ be a finite simple linear or unitary group of dimension at least three over…

Group Theory · Mathematics 2021-09-14 Grechkoseeva Mariya

We report the results of our empirical investigations on the Bateman-Horn conjecture. This conjecture, in its commonly known form, produces rather large deviations when the polynomials involved are not monic. We propose a modified version…

Number Theory · Mathematics 2019-06-11 Weixiong Li
‹ Prev 1 4 5 6 7 8 10 Next ›