English
Related papers

Related papers: Solitaire: Recent Developments

200 papers

We find new explicit solutions describing closed strings spinning with equal angular momentum in two independent planes in AdS(5). These are 2N-folded strings in the radial direction and also winding M times around an angular direction.…

High Energy Physics - Theory · Physics 2009-11-10 A. L. Larsen , A. Khan

We provide an alternative Fourier analysis for multigrid applied to the Poisson problem in 1D, based on explicit derivation of spectra of the iteration matrix. The new Fourier analysis has advantages over the existing one. It is easy to…

General Mathematics · Mathematics 2021-01-29 Adem Kaya

Paralogarithms constitute a family of special functions, which are some generalizations of hyperlogarithms. They have been introduced by Jean Ecalle in the context of the classification of complex analytic dynamical systems with irregular…

Mathematical Physics · Physics 2020-07-21 Frederic Fauvet

This paper presents an in-depth analysis of the performance of seven different Large Language Models (LLMs) in solving a diverse set of math advanced calculus problems. The study aims to evaluate these models' accuracy, reliability, and…

Computation and Language · Computer Science 2025-03-07 In Hak Moon

We address the six vertex model on a random lattice, which in combinatorial terms corresponds to the enumeration of weighted 4-valent planar maps equipped with an Eulerian orientation. This problem was exactly, albeit non-rigorously solved…

Combinatorics · Mathematics 2020-07-17 Andrew Elvey Price , Paul Zinn-Justin

The classic Rock-Paper-Scissors game of size 3 and its extension, Rock-Paper-Scissors-Lizard-Spock, are modeled by directed graphs called tournaments. They can be further extended to any odd size. The extended games are regular tournaments…

Dynamical Systems · Mathematics 2020-08-25 Ethan Akin

This paper describes the design process for the cybersecurity serious game 'PeriHack'. Publicly released under a CC (BY-NC-SA) license, PeriHack is a board and card game for two players or teams that simulates the struggle between a red…

Cryptography and Security · Computer Science 2022-08-02 Roberto Dillon , Arushi

The Bulgarian solitaire is a mathematical card game played by one person. A pack of n cards is divided into several decks (or "piles"). Each move consists of the removing of one card from each deck and collecting the removed cards to form a…

Combinatorics · Mathematics 2015-03-04 Vesselin Drensky

This document collects the lecture notes from my mini-course "Complexity Theory, Game Theory, and Economics," taught at the Bellairs Research Institute of McGill University, Holetown, Barbados, February 19--23, 2017, as the 29th McGill…

Computational Complexity · Computer Science 2020-02-11 Tim Roughgarden

This paper is concerned with developing some new identities of generalized Fibonacci numbers and generalized Pell numbers. A new class of generalized numbers is introduced for this purpose. The two well-known identities of Sury and Marques…

Number Theory · Mathematics 2015-11-25 W. M. Abd-Elhameed , N. A. Zeyada

The long code is a central tool in hardness of approximation, especially in questions related to the unique games conjecture. We construct a new code that is exponentially more efficient, but can still be used in many of these applications.…

Computational Complexity · Computer Science 2016-11-25 Boaz Barak , Parikshit Gopalan , Johan Hastad , Raghu Meka , Prasad Raghavendra , David Steurer

In this work we provide a self-contained and modern introduction to some of the tools, obstacles and open questions arising in string compactifications. Techniques and current progress are illustrated in the context of smooth heterotic…

High Energy Physics - Theory · Physics 2018-04-25 Lara B. Anderson , Mohsen Karkheiran

In this paper, we study some cards shuffles which are used by magicians. We focus ourselves on the possibility to hit eventually the initial state after several shuffles. This is a classical problem arising in discrete dynamical systems.…

History and Overview · Mathematics 2011-08-15 Aimé Lachal

This is an overview of our series of papers on the modular generalized Springer correspondence. It is an expansion of a lecture given by the second author in the Fifth Conference of the Tsinghua Sanya International Mathematics Forum, Sanya,…

Representation Theory · Mathematics 2019-09-04 Pramod N. Achar , Anthony Henderson , Daniel Juteau , Simon Riche

The cage problem concerns finding $(k,g)$-graphs, which are $k$-regular graphs with girth $g$, of the smallest possible number of vertices. The central goal is to determine $n(k,g)$, the minimum order of such a graph, and to identify…

Combinatorics · Mathematics 2025-11-11 Geoffrey Exoo , Jan Goedgebeur , Jorik Jooken , Louis Stubbe , Tibo Van den Eede

This project investigates the potential of computers to solve complex tasks such as games. The paper proves that the complexity of a generalized version of spider solitaire is NP-Complete and uses much of structure of the proof that…

Computational Complexity · Computer Science 2011-10-06 Jesse Stern

We study the following variant of the 15 puzzle. Given a graph and two token placements on the vertices, we want to find a walk of the minimum length (if any exists) such that the sequence of token swappings along the walk obtains one of…

Data Structures and Algorithms · Computer Science 2025-07-30 Hironori Kiya , Yuto Okada , Hirotaka Ono , Yota Otachi

These are lecture notes focusing on recent progress towards Bourgain's slicing problem and the isoperimetric conjecture proposed by Kannan, Lovasz and Simonovits (KLS).

Functional Analysis · Mathematics 2024-12-02 Bo'az Klartag , Joseph Lehec

We give a rigorous proof of existence for solitary waves of a peridynamics model in one space dimension recently investigated by Silling (J. Mech. Phys. Solids 96:121--132, 2016). We adapt the variational framework developed by Friesecke…

Analysis of PDEs · Mathematics 2018-12-10 Robert L. Pego , Truong-Son Van

We address the classical knapsack problem and a variant in which an upper bound is imposed on the number of items that can be selected. We show that appropriate combinations of rounding techniques yield novel and powerful ways of rounding.…

Computational Complexity · Computer Science 2007-05-23 Monaldo Mastrolilli , Marcus Hutter
‹ Prev 1 8 9 10 Next ›