相关论文: New problems on old solitaire boards

The long standing issue known as the hot QCD collinear singularity problem has been proven to rely on an incorrect sequence of two mathematical operations. Here, the original derivation of this problem is entirely revisited within the…

Boggle logic puzzles are based on the popular word game Boggle, where you are given list of words, and your goal is to recreate a Boggle board. In this paper we give an overview of known results and then propose a number of problems related…

We give a brief discussion of some of the issues which have arisen in the course of formalizing some classical set-theoretical mathematics in the Coq system. This sprouts from, expands and replaces a chapter of math.HO/0311260 which will be…

Pebble games are used to study space/time trade-offs. Recently, spooky pebble games were introduced to study classical space / quantum space / time trade-offs for simulation of classical circuits on quantum computers. In this paper, the…

Recently were introduced physical billiards where a moving particle is a hard sphere rather than a point as in standard mathematical billiards. It has been shown that in the same billiard tables the physical billiards may have totally…

This paper is withdrawn due to a mistake. The revised version with a new tiltle can be found in hep-ph/0502199.

We highlight an intrinsic connection between classical quadrature domains and the well-studied theme of removable singularities of analytic sets in several complex variables. Exploiting this connection provides a new framework to recover…

We describe various errors in the mathematical literature, and consider how some of them might have been avoided, or at least detected at an earlier stage, using tools such as Maple or Sage. Our examples are drawn from three broad…

This paper investigates why and when the edge-based districting problem becomes computationally intractable. The overall problem is represented as an exact mathematical programming formulation consisting of an objective function and several…

We propose several open problems on GKK tau-matrices raised by examples showing that some such matrices are unstable

In this article, we give an account of some recent irreducibility testing criteria for polynomials having integer coefficients over the field of rational numbers.

See hep-th/9903228.

We give some new characterizations of almost weak Dunford-Pettis operators and we investigate their relationship with weak Dunford-Pettis operators.

We consider theories with one gauge group (SU, SO or Sp) and one scalar in a two-index representation. The renormalizable action often has accidental symmetries (such as global U(1) or unusual group parities) that lead to one or more stable…

Graphic statics is undergoing a renaissance, with computerized visual representation becoming both easier and more spectacular as time passes. While methods of the past are revived and tweaked, little emphasis has been placed on studying…

Jigsaw puzzle solving is an intriguing problem which has been explored in computer vision for decades. This paper focuses on a specific variant of the problem - solving puzzles with eroded boundaries. Such erosion makes the problem…

This article contains a short and entertaining list of unsolved problems in Plane Geometry. Their statement may seem naive and can be understood at an elementary level. But their solutions have refused to appear for forty years in the best…

In this paper, we will present some results on the counterfeit coins problem in the case of multi-sets.

We study additively graceful labelings of signed graphs on stars and double stars. While the case of signed stars is straightforward, the problem becomes significantly more intricate for signed double stars. We obtain a characterization of…

In this paper, we propose a new method to bound the capacity of checkerboard codes on the hexagonal lattice. This produces rigorous bounds that are tighter than those commonly known.