Related papers: The Landau's problems. I-II

The Oberwolfach problem, posed by Ringel in 1967, asks for a decomposition of $K_{2n+1}$ into edge-disjoint copies of a given $2$-factor. We show that this can be achieved for all large $n$. We actually prove a significantly more general…

Work of Lev Landau had a profound impact on the physics in 20th century. Landau had created the paradigms that had framed the conversations on the outstanding problems in physics for decades. He has laid the foundations for our…

In 1975, Goldfeld gave an effective solution to Gauss's conjecture on the class numbers of imaginary quadratic fields. In this paper, we generalize Goldfeld's theorem to the setting of totally real number fields.

One presents many Concatenated and Operation Sequences, P-Q Relationships, Digital Sequences, Magic Squares, Prime Conjectures, k-Divisibility and Strong Divisibility Sequences, Geometric Conjectures, Proposed problems.

In this short note we present a class of conjectures on partitions of integers as summations of primes, which are extensions of Goldbach conjecture.

In this paper we will propose a strategy to prove Goldbach's conjecture: every even integer greater than 2 can be written as the sum of two primes.

Landau examined the partial sums of the M\"obius function and the Liouville function for a number field $K$. First we shall try again the same problem by using a new Perron's formula due to Liu and Ye. Next we consider the equivalent…

The paper has a form of a talk on the given topic. It consists of three parts. The first part of the paper contains main notions, the second one is devoted to logical geometry, the third part describes types and isotypeness. The problems…

The idea of generating prime numbers through sequence of sets of co-primes was the starting point of this paper that ends up by proving two conjectures, the existence of infinitely many twin primes and the Goldbach conjecture. The main idea…

The well-known problem of classical mechanics considered by Bertrand (1857) and Darboux (1901) is reviewed in the context of Cartan's geometry.

Brief account of results on the Cauchy problem for the Einstein equations starting with early the works of Darmois and Lichnerowicz and going up to the proofs of the existence and uniqueness of solutions global in space and local in time,…

One of Darboux's seminal results is archived here

This is an introduction into John Conway's beautiful Combinatorial Game Theory, providing precise statements and detailed proofs for the fundamental parts of his theory. (1) Combinatorial game theory, (2) the GROUP of games, (3) the FIELD…

In the Handbook of Mathematical Logic, the Paris-Harrington variant of Ramsey's theorem is celebrated as the first result of a long 'search' for a purely mathematical incompleteness result in first-order arithmetic. This paper questions the…

We collect here various conjectures on congruences made by the author in a series of papers, some of which involve binary quadratic forms and other advanced theories. Part A consists of 100 unsolved conjectures of the author while…

This book is a continuation of the book n-linear algebra of type I and its applications. Most of the properties that could not be derived or defined for n-linear algebra of type I is made possible in this new structure: n-linear algebra of…

This document is built around a list of thirty-two problems in enumeration of matchings, the first twenty of which were presented in a lecture at MSRI in the fall of 1996. I begin with a capsule history of the topic of enumeration of…

The current work revisits the results of L.F. Meyers and R. See in [3], and presents the census-taker problem as a motivation to introduce the beautiful theory of numbers.

We prove that, for almost all $r \leq N^{1/2}/\log^{O(1)}N$, for any given $b_1 \mod r$ with $(b_1, r) = 1$, and for almost all $b_2 \mod r$ with $(b_2, r) = 1$, we have that almost all natural numbers $2n \leq N$ with $2n \equiv b_1 + b_2…

In this paper, we introduce and develop the circle embedding method. This method hinges essentially on a combinatorial-geometric structure which we choose to call circles of partition. We provide applications in the context of problems that…