Related papers: SPM Bulletin 12
The POPLMARK Challenge comprises a set of problems intended to measure the strength of reasoning systems in the realm of mechanizing programming language meta-theory at the time the challenge was enunciated. Included in the collection is…
33rd issue of a bulletin dedicated to research on selective properties in mathematics.
The main thrust of our current work is to exploit very specific characteristics of a given problem in order to acquire improved compactness for supercritical problems and to prove existence of new types of solutions. To this end, we shall…
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.
The theory of Total Function NP (TFNP) and its subclasses says that, even if one is promised an efficiently verifiable proof exists for a problem, finding this proof can be intractable. Despite the success of the theory at showing…
We study interactions between Skolem Arithmetic and certain classes of Constraint Satisfaction Problems (CSPs). We revisit results of Glass er et al. in the context of CSPs and settle the major open question from that paper, finding a…
We prove the #P-hardness of the counting problems associated with various satisfiability, graph and combinatorial problems, when restricted to planar instances. These problems include \begin{romannum} \item[{}] {\sc 3Sat, 1-3Sat, 1-Ex3Sat,…
We study transfinite cut-and-choose games on $T_0$ spaces, introducing the {\em point-separating number} $ps(X)$ and the {\em set membership number} ${sm}(X)$ as the ordinal-valued invariants measuring the minimal length of a game in which…
We show that any submodular minimization (SM) problem defined on a linear constraint set with constraints having up to two variables per inequality, are 2-approximable in polynomial time. If the constraints are monotone (the two variables…
We investigate the complement of the discriminant in the projective space PSym^d C^{n+1} of polynomials defining hypersurfaces of degree d in P^n. Following the ideas of Zariski we are able to give a presentation for the fundamental group…
1. Noncommutativity and Topology within Lattice Field Theories 2. The Construction of Quantum Field Operators 3. The Bargmann-Wigner Formalism for Spin 2 Fields 4. New Light on Dark Matter from the LHC 5. Extra Dimensional Metric Reversal…
1. Predictions for Four Generations of Quarks Suggested by the Approach Unifying Spins and Charges (M. Breskvar, J. Mravlje, N.Mankoc Borstnik), 2. No-scale Supergravity and the Multiple Point Principle (C.Froggatt, L.Laperashvili,…
This survey contains a selection of topics unified by the concept of positive semi-definiteness (of matrices or kernels), reflecting natural constraints imposed on discrete data (graphs or networks) or continuous objects (probability or…
These are notes from a multi-year learning seminar on the algebraic approach to Constraint Satisfaction Problems (CSPs). The main topics covered are the theory of algebraic structures with few subpowers, the theory of absorbing subalgebras…
Many problems are known to be solvable in subexponential parameterized time when the input graph is planar. The bidimensionality framework of Demaine, Fomin, Hajiaghay, and Thilikos [JACM'05] and the treewidth-pattern-covering approach by…
We announce two breakthrough results concerning important questions in the Theory of Computational Complexity. In this expository paper, a systematic and comprehensive geometric characterization of the Subset Sum Problem is presented. We…
An important endeavor in computer science is to understand the expressive power of logical formalisms over discrete structures, such as words. Naturally, "understanding" is not a mathematical notion. This investigation requires therefore a…
We report new results on the complexity of the valued constraint satisfaction problem (VCSP). Under the unique games conjecture, the approximability of finite-valued VCSP is fairly well-understood. However, there is yet no characterisation…
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).
Assume that samples of a filtered version of a function in a shift-invariant space are avalaible. This work deals with the existence of a sampling formula involving these samples and having reconstruction functions with compact support.…