Related papers: Solitaire: Recent Developments
Contents: Community news: Message from the Chair, by Jim Isenberg We hear that..., by Jorge Pullin THE TGG WYP Speakers Program, by Richard Price Research Briefs: Gravity Probe B is launched, by Bill Hamilton Questions and progress in…
Edge-matching problems, also called edge matching puzzles, are abstractions of placement problems with neighborhood conditions. Pieces with colored edges have to be placed on a board such that adjacent edges have the same color. The problem…
This is a survey article on the theory of lattice points in large planar domains and bodies of dimensions 3 and higher, with an emphasis on recent developments and new methods, including a lot of results established only during the last few…
This issue contains announcements of articles on: The Pytkeev property; Partial order embeddings; Resolvability; Singular density; P(w)/fin and the Calkin algebra; Everywhere meagre and everywhere null sets; almost disjoint families;…
We prove PSPACE-completeness of two classic types of Chess problems when generalized to n-by-n boards. A "retrograde" problem asks whether it is possible for a position to be reached from a natural starting position, i.e., whether the…
These notes record and expand the lectures for the `Journ\'ees \'Equations aux D\'eriv\'ees Partielles 2018' held by the author during the week of June 11-15, 2018. The aim is to give a overview of the classical theory for the obstacle…
This is a survey article, to appear in the Proceedings of the 2018 International Congress of Mathematicians. (Revised, with added and updated references.)
We prove two identities of Hall-Littlewood polynomials, which appeared recently in a paper by two of the authors. We also conjecture, and in some cases prove, new identities which relate infinite sums of symmetric polynomials and partition…
This paper formulates and evaluates a series of multi-unit measures of directional association, building on the pairwise {\Delta}P measure, that are able to quantify association in sequences of varying length and type of representation.…
This is the text of a talk to the study week on \emph{Modular forms and Galois representations} held in Luminy, 1997. We give a survey of $p$-adic modular forms, as developped by Serre, Katz, Hida, Wiles, Coleman and others...
The second edition of the book "Roos, Stynes, Tobiska -- Robust Numerical Methods for Singularly Perturbed Differential Equations" appeared many years ago and was for many years a reliable guide into the world of numerical methods for…
These notes, associated with a topics course, are concerned with some general methods related to norms and linear transformations.
At the end, the house always wins! This simple truth holds for all public games of chance. Nevertheless, since lotteries have existed, people have tried everything to give luck a helping hand. This article compares objective scientific…
Brizolis asked the question: does every prime p have a pair (g,h) such that h is a fixed point for the discrete logarithm with base g? The first author previously extended this question to ask about not only fixed points but also…
We introduce a very simple solitaire game, named Stanley Solitaire, in honor of Richard Stanley, and prove an explicit closed-form formula for the number of ways of playing it. Alas, the only proof that we know is via a deep theorem of…
Table of contents: Editorial 1 Correspondents 3 Some recent work in general relativistic Astrophysics 4 Two dimensional black holes 6 Resonant-mass gravitational wave detectors: an update 8 Universality and scaling in gravitational collapse…
Extremal Combinatorics is among the most active topics in Discrete Mathematics, dealing with problems that are often motivated by questions in other areas, including Theoretical Computer Science and Information Theory. This paper contains a…
This guide is intended to knit together, and extend, the existing PP and C documentation on PDL internals. It draws heavily from prior work by the authors of the code. Special thanks go to Christian Soeller, and Tuomas Lukka, who together…
We study the Minimum Shared Edges problem introduced by Omran et al. [Journal of Combinatorial Optimization, 2015] on planar graphs: Planar MSE asks, given a planar graph G = (V,E), two distinct vertices s,t in V , and two integers p, k,…
Automated techniques for rigorous floating-point round-off error analysis are important in areas including formal verification of correctness and precision tuning. Existing tools and techniques, while providing tight bounds, fail to analyze…