English
Related papers

Related papers: A stronger model for peg solitaire, II

200 papers

We show, assuming weak large cardinals, that in the context of games played in a proper class of moves, clopen determinacy is strictly weaker than open determinacy. The proof amounts to an analysis of a certain level of $L$ that exists…

Logic · Mathematics 2016-07-20 Sherwood Hachtman

The stable marriage problem has been introduced in order to describe a complex system where individuals attempt to optimise their own satisfaction, subject to mutually conflicting constraints. Due to the potential large applicability of…

Statistical Mechanics · Physics 2009-10-31 G. Caldarelli , A. Capocci

We consider the problem of deciding, given a sequence of regions, if there is a choice of points, one for each region, such that the induced polyline is simple or weakly simple, meaning that it can touch but not cross itself. Specifically,…

Computational Geometry · Computer Science 2023-04-27 Thijs van der Horst , Tim Ophelders , Bart van der Steenhoven

Software model checking, as an undecidable problem, has three possible outcomes: (1) the program satisfies the specification, (2) the program does not satisfy the specification, and (3) the model checker fails. The third outcome usually…

Software Engineering · Computer Science 2015-03-19 Dirk Beyer , Thomas A. Henzinger , M. Erkan Keremoglu , Philipp Wendler

In this paper, we consider one-to-one matchings between two disjoint groups of agents. Each agent has a preference over a subset of the agents in the other group, and these preferences may contain ties. Strong stability is one of the…

Computer Science and Game Theory · Computer Science 2024-01-08 Naoyuki Kamiyama

We consider the problem of determining the minimum number of moves needed to solve a certain one-dimensional peg puzzle. Let N be a positive integer. The puzzle apparatus consists of a block with a single row of 2N+1 equally spaced holes…

Combinatorics · Mathematics 2007-05-23 David M. Bradley , Hugh Thomas

We analyze the computational complexity of optimally playing the two-player board game Push Fight, generalized to an arbitrary board and number of pieces. We prove that the game is PSPACE-hard to decide who will win from a given position,…

Computational Complexity · Computer Science 2018-03-13 Jeffrey Bosboom , Erik D. Demaine , Mikhail Rudoy

In this paper, we study the well-posedness of Poisson-Nernst-Planck system with no-flux boundary condition and singular permanent charges in two dimension. The main difficulty comes from the lack of integrability of singular permanent…

Analysis of PDEs · Mathematics 2021-10-14 Chia-Yu Hsieh , Yong Yu

We deal with (< kappa)-supported iterated forcing notions which are (E_0,E_1)-complete, have in mind problems on Whitehead groups, uniformizations and the general problem. We deal mainly with the successor of a singular case. This continues…

Logic · Mathematics 2016-09-07 Saharon Shelah

We introduce a generalized version of the famous Stable Marriage problem, now based on multi-modal preference lists. The central twist herein is to allow each agent to rank its potentially matching counterparts based on more than one…

Multiagent Systems · Computer Science 2018-01-10 Jiehua Chen , Rolf Niedermeier , Piotr Skowron

Development of several alternative mathematical models for the biological system in question and discrimination between such models using experimental data is the best way to robust conclusions. Models which challenge existing theories are…

Quantitative Methods · Quantitative Biology 2016-02-01 Vitaly V. Ganusov

The point placement problem is to determine the positions of a set of $n$ distinct points, P = {p1, p2, p3, ..., pn}, on a line uniquely, up to translation and reflection, from the fewest possible distance queries between pairs of points.…

Data Structures and Algorithms · Computer Science 2012-10-16 Md. Shafiul Alam , Asish Mukhopadhyay

We propose a new and rather stringent criterion for testing the goodness of fit between a theory and experiment. It is motivated by the paradox that the criterion on \chi^2 for testing a theory is much weaker than the criterion for finding…

High Energy Physics - Phenomenology · Physics 2007-05-23 J. C. Collins , J. Pumplin

We prove that under a very general setting, a system of ODE passes the Painleve test if and only if there is a good change of variable, such that the pole singularity solutions are converted to regular power series, while the converted ODE…

Classical Analysis and ODEs · Mathematics 2013-05-01 Jishan Hu , Min Yan

We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…

Combinatorics · Mathematics 2025-09-30 Marién Abreu , Martin Funk , Vedran Krčadinac , Domenico Labbate

This paper explores conditions of existence of different types of consistent tests. New links of these types of consistency are also established. The existence of discernible (strong consistent) tests follows from the existence of pointwise…

Statistics Theory · Mathematics 2015-04-22 Mikhail Ermakov

We survey the problem of deciding the stability or stabilizability of uncertain linear systems whose region of uncertainty is a polytope. This natural setting has applications in many fields of applied science, from Control Theory to…

Systems and Control · Computer Science 2014-02-12 Nikos Vlassis , Raphaël Jungers

The presence of an unstable massive spin-2 ghost state in the renormalizable theory of massive conformal gravity leads to a pair of complex poles appearing in the first sheet of the energy plane. Here we show that the positions of these…

General Relativity and Quantum Cosmology · Physics 2022-10-19 F. F. Faria

Model-based mutation testing uses altered test models to derive test cases that are able to reveal whether a modelled fault has been implemented. This requires conformance checking between the original and the mutated model. This paper…

Software Engineering · Computer Science 2012-02-29 Bernhard K. Aichernig , Elisabeth Jöbstl

Electronics has changed greatly during recent decades, and some its basic concepts should be revisited. Starting from the sampling procedure, we consider some mathematical, physical and engineering aspects related to singular, mainly…

Exactly Solvable and Integrable Systems · Physics 2008-01-24 Emanuel Gluskin