Related papers: SPM Bulletin 10
In addition to research announcements, this issue features a call for papers to a Topology and its Applications special issue, and an intriguing open problem.
This is the 34th issue of this bulletin, dedicated to selection principles in mathematics. Announcements include, among other things, a call for papers for the Topology and its Applications special issue on selection principles, and the…
This is the first issue of a semi-formal bulletin dealing with Selection Principles in Mathematics (SPM) -- this field deals with all sorts of studies of diagonalization arguments, especially in topology (covering properties, sequences of…
Contents: 1. Editor's note; 2. gamma-sets from a weak hypothesis; 3. Research announcements; 3.1. Ultrafilters with property (s); 3.2. On a converse to Banach's Fixed Point Theorem; 3.3. Analytic groups and pushing small sets apart 3.4.…
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…
Contents: 2. Invited contribution: Ultrafilters and small sets 3. Research announcements 3.1. Inverse Systems and I-Favorable Spaces 3.2. Combinatorial and hybrid principles for sigma-directed families of countable sets modulo finite 3.3. A…
CONTENTS: New reals: Can live with them, can live without them; Uniform almost everywhere domination; Heredity of tau-pseudocompactness; Understanding preservation theorems: omega^omega-bounding; Classification problems in continuum theory;…
Let $\pi(x;\gamma_1,\gamma_2)$ denote the number of primes $p$ with $p\leqslant x$ and $p=\lfloor n^{1/\gamma_1}_1\rfloor=\lfloor n^{1/\gamma_2}_2\rfloor$, where $\lfloor t\rfloor$ denotes the integer part of $t\in\mathbb{R}$ and…
With the approaching TOPOSYM'16 (http://www.toposym.cz/programme.php), it is a pleasure to see selection principles gain increasing attention and becoming a standard part of topology and set theory. At least eight of the 28 speakers, and a…
We define a class of algebras, the semilattices of Mal'cev blocks (for short, SMB algebras). In a nutshell, these algebras are semilattices in which each element gets blown up into a Mal'cev algebra. We publish for the first time our old…
The present issue of the series <<Modern Problems in Mathematical Physics>> represents the Proceedings of the Students Training Contest Olympiad in Mathematical and Theoretical Physics and includes the statements and the solutions of the…
Linear and semidefinite programming (LP, SDP), regularisation through basis pursuit (BP) and Lasso have seen great success in mathematics, statistics, data science, computer-assisted proofs and learning. The success of LP is traditionally…
Satisfiability-based verification techniques, leveraging modern Boolean satisfiability (SAT) and Satisfiability Modulo Theories (SMT) solvers, have demonstrated efficacy in addressing practical problem instances within program analysis.…
CONTENTS: A surprising covering of the real line Unions of chains in dyadic compact spaces and topological groups On the Pytkeev property in spaces of continuous functions Selection principles related to alpha_i-properties On the Kocinac…
In his book "250 Problems in Elementary Number Theory", W.Sierpinski shows that the numbers 1+2^(2^n)+2^(2^n+1) are divisible by 21; for n=1,2,.... In this paper, we prove a similar but more general result.Consider the natural numbers of…
Boolean Satisfiability (SAT) and Satisfiability Modulo Theories (SMT) are widely used in automated verification, but there is a lack of interactive tools designed for educational purposes in this field. To address this gap, we present…
Let $Q(x,y)$ be a quadratic form with discriminant $D\neq 0$. We obtain non trivial upper bound estimates for the number of solutions of the congruence $Q(x,y)\equiv\lambda \pmod{p}$, where $p$ is a prime and $x,y$ lie in certain intervals…
Contents of this issue: Workshops on SPM themes; Second workshop on Coverings, Selections and Games in Topology (SPM05); Analysis and Descriptive Set Theory Workshop; Descriptive set theory: Effective methods, equivalence relations;…
In this short paper we present a survey of some results concerning the random SAT problems. To elaborate, the Boolean Satisfiability (SAT) Problem refers to the problem of determining whether a given set of $m$ Boolean constraints over $n$…
Contents: 1. Combinatorial and model-theoretical principles related to regularity of ultrafilters and compactness of topological spaces, I; 2. Frechet-Urysohn fans in free topological groups; 3. Packing index of subsets in Polish groups; 4.…