相关论文: Problems in additive number theory, I

Complete residue systems play an integral role in abstract algebra and number theory, and a description is typically found in any number theory textbook. This note provides a concise overview of complete residue systems, including a robust…

A problem list in singularity theory. Most of these problems are related with the algorithmic enumeration of possible topological types of non-discriminant Morsifications of real function singularities, and/or with the Picard--Lefschetz…

Classification theorems for linear differential equations in two real variables, possessing eigenfunctions in the form of the polynomials (the generalized Bochner problem) are given. The main result is based on the consideration of the…

There are numerous ways to represent real numbers. We may use, e.g., Cauchy sequences, Dedekind cuts, numerical base-10 expansions, numerical base-2 expansions and continued fractions. If we work with full Turing computability, all these…

The prime number problem falls within the realm of number theory, specifically elementary number theory. Current research approaches have unnecessarily complicated this matter. In contrast to more advanced mathematical tools, the methods of…

These lecture notes provide an informal introduction to the theory of nonnegative polynomials and sums of squares. We highlight the history and some recent developments, especially the new connections with classical (complex) algebraic…

This book introduces the concept of neutrosophic bilinear algebras and their generalizations to n-linear algebras, n>2. This book has five chapters. The first chapter is introductory in nature and gives a few essential definitions and…

Complexity theory provides a wealth of complexity classes for analyzing the complexity of decision and counting problems. Despite the practical relevance of enumeration problems, the tools provided by complexity theory for this important…

En esta serie de tres articulos, damos una exposicion de varios resultados y problemas abiertos en tres areas de la combinatoria algebraica y geometrica: las matrices totalmente no negativas, las representaciones del grupo simetrico, y los…

\noindent 1. Generalities\hfil\break 2. Lie groups and Lie algebras\hfil\break 3. The unitary groups\hfil\break 4. Representations of the SU(n) groups (and of their algebras)\hfil\break 5. The tensor method for unitary groups, and\hb the…

A new class of integrable mappings and chains is introduced. Corresponding $(1+2)$ integrable systems invariant with respect to such discrete transformations are presented in an explicit form. Their soliton-type solutions are constructed in…

With the uniform positions we prove theorems of Landau and Hardy-Littlwood type for Goldbach, Chen, Lemoine-Levy and other binary partitions of positive integers. We also pose some new conjectures.

In this paper we continue our study, begun in part I, of the exceptional set of integers, not restricted by elementary congruence conditions, which cannot be represented as sums of three or four squares of primes. We correct a serious…

Number of results in number theory have been developed using a new method. The Goldbach binary conjecture in strengthened formulation have been among them.

We survey classical and recent developments in numerical linear algebra, focusing on two issues: computational complexity, or arithmetic costs, and numerical stability, or performance under roundoff error. We present a brief account of the…

In this paper, we present several explicit formulas of the sums and hyper-sums of the powers of the first (n+1)-terms of a general arithmetic sequence in terms of Stirling numbers and generalized Bernoulli polynomials.

Every natural number greater than two may be written as the sum of a prime and a square-free number. We establish several generalisations of this, by placing divisibility conditions on the square-free number.

Sumterms are introduced as syntactic entities, and sumtuples are introduced as semantic entities. Equipped with these concepts a new description is obtained of the notion of a sum as (the name for) a role which can be played by a number.…

Given an integer array A, the prefix-sum problem is to answer sum(i) queries that return the sum of the elements in A[0..i], knowing that the integers in A can be changed. It is a classic problem in data structure design with a wide range…

We prove that suitable asymptotic formulae in short intervals hold for the problems of representing an integer as a sum of a prime square and a square, or a prime square. Such results are obtained both assuming the Riemann Hypothesis and in…