English
Related papers

Related papers: Computation and Bounding of Folkman Numbers

200 papers

We provide two new proofs of the infinitude of prime numbers, using the additive Ramsey-theoretic result known as Folkman's theorem (alternatively, one can think of these proofs as using Hindman's theorem). This adds to the existing…

Number Theory · Mathematics 2026-05-19 David J. Fernández-Bretón

We include here some material that did not make its way into the published version (Bull. Symb. Log 18-2, June 2012, pp. 161-229, arXiv:1007.2376), in particular a proof of Theorem K to the effect that there is an initial segment of the…

Logic · Mathematics 2012-11-13 Peter Hinman

This text is an extended version of the lecture notes for a course on representation theory of finite groups that was given by the authors during several years for graduate and postgraduate students of Novosibirsk State University and…

Group Theory · Mathematics 2021-10-26 D. O. Revin , A. V. Zavarnitsine

In this Phd. thesis, a structural analysis of construction schemes is developed. The importance of this study will be justified by constructing several distinct combinatorial objects which have been of great interest in mathematics. We then…

Logic · Mathematics 2024-06-10 Jorge Antonio Cruz Chapital

This is an extended version of a talk on October 4, 2004 at the research seminar ``Differential geometry and applications'' (headed by Academician A. T. Fomenko) at Moscow State University. The paper contains an overview of available (but…

Metric Geometry · Mathematics 2016-09-07 Victor Alexandrov , Natalia Kopteva , S. S. Kutateladze

In this paper we prove new upper bounds for the sum $\sum_{n=a+1}^{a+N}f(n)$, for a certain class of arithmetic functions $f$. Our results improve the previous results of G. Bachman and L. Rachakonda.

Number Theory · Mathematics 2011-07-05 Dmitriy Frolenkov

This manuscript summarizes the work and showcases the impact of the doctoral thesis by introducing novel, cost-efficient methods for assessing and enhancing the reliability of DNN hardware accelerators. A comprehensive Systematic Literature…

Hardware Architecture · Computer Science 2026-03-11 Mahdi Taheri

The book contains the results obtained by the author in 1975-1982 and presents new constructive methods of the topological analysis of integrable systems having non-linear integrals in involution. The phase topology of the classical…

Exactly Solvable and Integrable Systems · Physics 2015-04-07 Mikhail P. Kharlamov

In 2000, Lukyanov conjectured that a certain ratio of $N$-fold integrals should provide access, in the large-$N$ regime, to the ground state expectation value of the exponential of the Sinh-Gordon quantum field in 1+1 dimensions and finite…

Mathematical Physics · Physics 2025-11-10 Charlie Dworaczek Guera , Karol K. Kozlowski

Motivated by the recent development of noncommutative Novikov algebras and multi-Novikov algebras from the study of regularity structures of stochastic PDEs, this paper gives a general approach to study various multi-Novikov algebras and…

Rings and Algebras · Mathematics 2026-03-18 Xiaoyan Wang , Li Guo , Huhu Zhang

In 1993 E. I. Zelmanov asked the following question in Dniester Notebook: $"$Suppose that $F_{2,m}$ is a $2$-generated associative ring with the identity $x^m=0$. Is it true, that the nilpotency degree of $F_{2,m}$ has exponential…

Combinatorics · Mathematics 2015-11-17 Mikhail Kharitonov

We comment on the recent paper by Balog and Niedermaier [hep-th/9701156].

High Energy Physics - Theory · Physics 2009-10-30 A. Patrascioiu , E. Seiler

Doctoral Thesis, year 2002, about Lie systems and applications in Physics and Control Theory. The text is in English. Advisor: Jos\'e F. Cari\~nena

Mathematical Physics · Physics 2011-06-21 Arturo Ramos

New formulas for the construction of Pythagorean triples and generalizations to equations of higher powers. Application of formulas to some problems, in particular Fermat's equation with n=4.

History and Overview · Mathematics 2023-10-25 Pavlo Deriy

An $\mathcal{O}(N(\log N)^2/\log\!\log N)$ algorithm for computing the discrete Legendre transform and its inverse is described. The algorithm combines a recently developed fast transform for converting between Legendre and Chebyshev…

Numerical Analysis · Mathematics 2015-10-06 Nicholas Hale , Alex Townsend

The following is a Ph.D. thesis. The thesis is submitted in partial fulfillment of the requirements for the degree of Philosophiae Doctor (Ph.D.) at the Norwegian University of Science and Technology.

Complex Variables · Mathematics 2023-05-15 Tai Terje Huu Nguyen

The study of semifeasible algorithms was initiated by Selman's work a quarter of century ago [Sel79,Sel81,Sel82]. Informally put, this research stream studies the power of those sets L for which there is a deterministic (or in some cases,…

Computational Complexity · Computer Science 2007-05-23 Piotr Faliszewski , Lane A. Hemaspaandra

The article examines nonisotropic Nikolskii and Besov spaces with norms defined using $L_p$-averaged moduli of continuity of functions of appropriate orders along the coordinate directions, instead of moduli of continuity of known orders…

Classical Analysis and ODEs · Mathematics 2018-10-30 S. N. Kudryavtsev

Algorithms and underlying mathematics are presented for numerical computation with periodic functions via approximations to machine precision by trigonometric polynomials, including the solution of linear and nonlinear periodic ordinary…

Numerical Analysis · Mathematics 2015-11-03 Grady B. Wright , Mohsin Javed , Hadrien Montanelli , Lloyd N. Trefethen

This work is motivated to study the representation theory of the non-semisimple deformed Fomin-Kirillov algebras $\mathcal{D}_4(\alpha_1, \alpha_2)$. In particular, we consider Gabriel's theorem applications in regard of constructing…

Representation Theory · Mathematics 2020-12-01 A. Alia , I. Heckenberger