?
О канонической рамсеевской теореме Эрдёша и Радо и рамсеевских ультрафильтрах
Доклады Российской академии наук. Математика, информатика, процессы управления (ранее - Доклады Академии Наук. Математика). 2023. Т. 513. С. 76–87.
We give a characterization of Ramsey ultrafilters on \omega in terms of functions f:\omega^n\to\omega and their ultrafilter extensions. To do this, we prove that for any partition P of [\omega]^n there is a finite partition Q of [\omega]^{2n} such that any set X\subseteq \omega that is homogeneous for Q is a finite union of sets that are canonical for P.
Panov V., Ryabchenko A., / Series arXiv "stat.ME". 2026. No. 2607.05048.
This paper investigates the problem of statistical inference for a mixture distribution consisting of a discrete and a continuous component, with a particular focus on the class of rational-infinitely divisible distributions. We consider non-parametric estimation of both components of the mixture as well as the quasi-L{é}vy measure, assuming that the mixture belongs to the class ...
Added: July 9, 2026
Springer, 2027.
The series Lecture Notes in Computer Science (LNCS), including its subseries Lecture Notes in Artificial Intelligence (LNAI) and Lecture Notes in Bioinformatics (LNBI), has established itself as a medium for the publication of new developments in computer science and information technology research, teaching, and education. LNCS enjoys close cooperation with the computer science R & ...
Added: July 8, 2026
Маликов М. А., Монахова Э. А., Rzaev E. et al., Ученые записки Казанского университета. Серия: Физико-математические науки 2026 Т. 168 № 2 С. 269–286
This article examines series of families of two-dimensional circulant networks with rectangular
L -shapes, optimal in diameter, as network-on-chip topologies with a minimal number of crossings
between the links and a bounded length of the maximum link that does not depend on the network
size. New network-on-chip routing algorithms, which use the coordinates of three adjacent zeros in
the ...
Added: July 8, 2026
Pilé I., Shchur L., Deng Y., Physical Review B: Condensed Matter and Materials Physics 2026 Vol. 114 Article 014101
We investigate the spatial overlap of successive spin configurations in Markov chain Monte Carlo simulations using the local Metropolis algorithm and the Swendsen-Wang and Wolff cluster algorithms. We examine the dynamics of these algorithms for models in different universality classes: Ising model, Potts model with three components, and four-state Potts model. The overlap of two ...
Added: July 6, 2026
Irkutsk: ISDCT SB RAS, 2026.
We study a model problem on the filtration of a conducting fluid through a
porous layer. A porous medium is presented as an assemblage of identical spherical
cells. Each cell consists of a porous core and liquid shell. We derive apriori estimates
for flow characteristics which show the specific behavior of the fluid. Our estimates
are validated numerically. ...
Added: July 5, 2026
М.: Наука и технологии, 2026.
«Телекоммуникации» ежемесячный рецензируемый производственный, информационно-аналитический и учебно-методический журнал выходит в свет с июля 2000 г.
Для руководителей и работников промышленности, научно-исследовательских и проектно-конструкторских институтов, высших учебных заведений, аспирантов и студентов, а также для специалистов, разрабатывающих, выпускающих и эксплуатирующих средства телекоммуникаций.
Новости разработок и производства, прогнозы развития, защита информации, Нормативные, справочные, аналитические и учебно-методические материалы.
Переход к глобальному информационному ...
Added: July 4, 2026
МФТИ, 2025.
абота редакции научного журнала «Труды Московского физико-технического института» (кратко «Труды МФТИ»), редакционной коллегии и редакционного совета осуществляется в соответствии с Положением, утвержденным ректором института. В состав редакционной коллегии входят руководители института, факультетов, институтских и факультетских кафедр. Главный редактор журнала —президент МФТИ, член-корр. РАН Кудрявцев Н.Н.
Журнал «Труды МФТИ» входит в базу данных РИНЦ (Российский Индекс Научного Цитирования) и доступен в электронной ...
Added: July 4, 2026
Springer, 2026.
This book presents established and new research on the close connections between graph games and systems of logic, particularly existing and newly designed modal logics. The volume utilizes two graph games – the sabotage game and the hide-and-seek game – to demonstrate the natural interplay between designing new graph games and exploring new kinds of ...
Added: June 30, 2026
Pochinka O., Barinova M., Journal of Geometry and Physics 2026 Vol. 228 P. 1–8
In the present paper we consider an Ω-stable 3-diffeomorphism with a solid or thickened surfaced non-trivial basic set. Such basic sets include, for instance, all one-dimensional expanding attractors and those two-dimensional basic sets that are not expanding. We prove that the chain recurrent set of every such a diffeomorphism necessarily contains at least two non-trivial ...
Added: June 30, 2026
German O., Illarionov A., Известия РАН. Серия математическая 2026 Т. 90 № 3 С. 3–18
Пусть симплекс с целочисленными вершинами - содержащий ровно одну целочисленную точку, отличную от своих вершин. В работе доказывается, что если точка находится во внутренности симплекса или в относительной внутренности некоторой гиперграни симплекса, то объем симплекса ограничен величиной, зависящей только от размерности, в противном случае объем симплекса может быть сколь угодно большим. Этот результат применяется для вывода асимптотической формулы для среднего числа вершин полиэдров ...
Added: June 29, 2026
Polyakov N. L., Saveliev D. I., Russian Mathematical Surveys 2026 Vol. 81 No. 1 P. 205–206
We solve Problem 61 from Hart and van Mill’s list on whether every finite partial order is embeddable in the Rudin–Keisler order on (types of) ultrafilters over $\omega$. ...
Added: January 31, 2026
Polyakov N. L., Saveliev D., Working papers by Cornell University. Series math "arxiv.org" 2025 P. 1–13
A natural question, which appeared as Problem 61 in Hart and van Mill's list of open problems on (2024), asks whether every finite partial order is embeddable in the Rudin--Keisler order on (types of) ultrafilters over a countable set. Although the positive answer, even for all countable partial orders, was proved under CH in Blass' thesis ...
Added: November 25, 2025
Polyakov N. L., В кн.: Algebra and model theory 2025. Volume 16.: ., 2025. С. 134–139.
In [1], the concept of a skew limit ultrapower of ordinal rank of an arbitrary model $\mathfrak M$ with respect to an ultrafilter $\mathfrak u$ was introduced for a model-theoretic characterization of some natural preorders on the set of ultrafilters on the set $\beta\omega$. We will show that this concept admits broad generalizations that can ...
Added: November 24, 2025
N. L. Poliakov, Saveliev D., Bulletin of L.N. Gumilyov Eurasian National University. Mathematics, computer science, mechanics series 2025 Vol. 151 No. 2 P. 6–11
Generalizing of the Rudin--Keisler preorder, we introduce relations $R_\alpha$ (and $R_{<\alpha}$) on the set $\scc\omega$ of ultrafilters on~$\omega$. They form an ordinal sequence of length~$\omega_1$ which is strictly increasing by inclusion and lies between the Rudin--Keisler preorder and the Comfort preorder. We show that the composition of these relations is expressed ...
Added: July 16, 2025
Polyakov N. L., Доклады Российской академии наук. Математика, информатика, процессы управления (ранее - Доклады Академии Наук. Математика) 2025 Т. 522 № 1 С. 40–49
The paper describes a new method for constructing graphs without triangles and with an arbitrarily large chromatic number. The properties of various types of ultrafilter extensions of functions and predicates are used to justify the method. ...
Added: June 3, 2025
Polyakov N. L., В кн.: Международная конференция МАЛЬЦЕВСКИЕ ЧТЕНИЯ 13–17 ноября 2023 г. Тезисы докладов.: [б.и.], 2023. С. 104–104.
Added: November 30, 2024
N. L. Polyakov, , in: Model Theory and Algebra 2024.: -, 2024. P. 87–92.
We describe the Rudin-Keisler preorder on lower cones with respect to the Comfort preorder of Ramsey ultrafilters ...
Added: November 18, 2024