Related papers: SPM Bulletin 12
Alternating sign matrices (ASMs) are square matrices with entries 0, 1, or -1 whose rows and columns sum to 1 and whose nonzero entries alternate in sign. We present a unifying perspective on ASMs and other combinatorial objects by studying…
We construct planar bi-Sobolev mappings whose local volume distortion is bounded from below by a given function $f\in L^p$ with $p>1$, i.e. bi-Sobolev solutions for the prescribed Jacobian inequality in the plane for right-hand sides $f\in…
We study geometric variations of the discriminating code problem. In the \emph{discrete version} of the problem, a finite set of points $P$ and a finite set of objects $S$ are given in $\mathbb{R}^d$. The objective is to choose a subset…
The cardinal invariants $ \mathfrak h, \mathfrak b, \mathfrak s$ of $\mathcal P (\omega)$ are known to satisfy that $\omega_1 \leq \mathfrak h \leq\min\{\mathfrak b, \mathfrak s\}$. We prove that all inequalities can be strict. We also…
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…
The Satisfiability Modulo Theories (SMT) issue concerns the satisfiability of formulae from multiple background theories, usually expressed in the language of first-order predicate logic with equality. SMT solvers are often based on…
We study the double obstacle problem for p-harmonic functions on arbitrary bounded nonopen sets E in quite general metric spaces. The Dirichlet and single obstacle problems are included as special cases. We obtain Adams' criterion for the…
The "exact subgraph" approach was recently introduced as a hierarchical scheme to get increasingly tight semidefinite programming relaxations of several NP-hard graph optimization problems. Solving these relaxations is a computational…
Declarative spatial reasoning denotes the ability to (declaratively) specify and solve real-world problems related to geometric and qualitative spatial representation and reasoning within standard knowledge representation and reasoning (KR)…
This letter aims at resolving the issues raised in the recent short communication [1] and answered by [2] by proposing a systematic approximation scheme based on non-mapped shape functions, which both allows to fully exploit the unique…
The thesis studies linear and semilinear Dirichlet problems driven by different fractional Laplacians. The boundary data can be smooth functions or also Radon measures. The goal is to classify the solutions which have a singularity on the…
Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…
Symmetries occur naturally in CSP or SAT problems and are not very difficult to discover, but using them to prune the search space tends to be very challenging. Indeed, this usually requires finding specific elements in a group of…
We develop an analytical framework for Boolean Promise Constraint Satisfaction Problems (PCSPs) that studies polymorphisms through the notion of influence from Fourier analysis of Boolean functions. Extending the work of Brakensiek,…
In this note we will discuss a new reflection principle which follows from the Proper Forcing Axiom. The immediate purpose will be to prove that the bounded form of the Proper Forcing Axiom implies both that 2^omega = omega_2 and that…
Literature on Constraint Satisfaction exhibits the definition of several structural properties that can be possessed by CSPs, like (in)consistency, substitutability or interchangeability. Current tools for constraint solving typically…
We develop an intrinsic, heat-kernel based fractional Sobolev framework on closed Riemannian manifolds and study the critical fractional Sobolev embedding. We determine the optimal coefficient of the lower-order $L^{p}$ term and prove that…
Keeping N=1 supersymmetry in 4-dimension and in the leading order, we disuss the various orbifold compactifications of M-theory suggested by Horava and Witten on $T^6/Z_3$, $T^6/Z_6$, $T^6/Z_{12}$, and the compactification by keeping…
In this paper we provide proofs of two new theorems that provide a broad class of partition inequalities and that illustrate a na\"ive version of Andrews' anti-telescoping technique quite well. These new theorems also put to rest any notion…
This is the second issue of the SPM Bulletin (SPM stands for "Selection Principles in Mathematics"). The first issue is math.GN/0301011 and contains some background and details.