相关论文: SPM Bulletin 5 (Special issue)

Contents: 1. Editor's note; 2. Personal impressions from the SPM07 meeting; 3. Research announcements; 3.1. Coloring ordinals by reals; 3.2. Long Borel Hierarchies; 3.3. Rothberger's property in finite powers; 3.4. Special subsets of the…

This is a survey of old and new problems and results in additive number theory.

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;…

Among the many papers announced here, a recent series of papers of Franklin Tall on selective properties (SPM) is noteworthy.

33rd issue of a bulletin dedicated to research on selective properties in mathematics.

In this paper we give a novel solution to a classical completion problem for square matrices. This problem was studied by many authors through time, and it is completely solved in [2, 3]. In this paper we relate this classical problem to a…

We introduce a new combinatorial object called tower diagrams and prove fundamental properties of these objects. We also introduce an algorithm that allows us to slide words to tower diagrams. We show that the algorithm is well-defined only…

SSP reductions are a type of polynomial reductions that also preserve the solutions of the instances. This means there is a mapping from each solution in the original instance to one in the reduced instance, allowing direct deduction of an…

In addition to announcements of several new papers, this issue contains a brief personal memorandum for Misha Matveev. The issue also announces the coming SPM meeting (June 2012).

A kind of fixed-point problem in the area of discrete tomography is proposed and investigated. Our chief concern in this paper is the case of square windows in the plane. Dealing with the arrays which are bounded, of polynomial growth, and…

This paper is a survey of recent advances as well as open problems in the study of face numbers of centrally symmetric simplicial polytopes and spheres. The topics discussed range from neighborliness of centrally symmetric polytopes and the…

The material of the article is devoted to the most complicated and interesting problem -- a problem of P = NP?. This research was presented to mathematical community in Hyderabad during International Congress of Mathematicians. But there it…

The Minimum Enclosing Ball (MEB) problem is one of the most fundamental problems in clustering, with applications in operations research, statistics and computational geometry. In this works, we give the first differentially private (DP)…

Separable nonlinear least squares (SNLS)problem is a special class of nonlinear least squares (NLS)problems, whose objective function is a mixture of linear and nonlinear functions. It has many applications in many different areas,…

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…

This issue surveys some of the activities in the field since the previous issue, and announces a conference fully dedicated to the topic of selection principles.

This paper investigates two issues on identification of switched linear systems: persistence of excitation and numerical algorithms. The main contribution is a much weaker condition on the regressor to be persistently exciting that…

This article, written for undergraduate mathematics students, provides an accessible introduction to a few key problems in tiling theory: Heesch's problem, the isohedral number problem, and the existence of an aperiodic monotile. I…

This paper presents a new combinatorial optimisation task, the Subset Sum Matching Problem (SSMP), which is an abstraction of common financial applications such as trades reconciliation. We present three algorithms, two suboptimal and one…

The Skolem Problem asks, given an integer linear recurrence sequence (LRS), to determine whether the sequence contains a zero term or not. Its decidability is a longstanding open problem in theoretical computer science and automata theory.…