English
Related papers

Related papers: "Minesweeper" and spectrum of discrete Laplacians

200 papers

We study three problems related to the computational complexity of the popular game Minesweeper. The first is consistency: given a set of clues, is there any arrangement of mines that satisfies it? This problem has been known to be…

Computational Complexity · Computer Science 2024-04-24 MIT Hardness Group , Della Hendrickson , Andy Tockman

The spectral theory for operator pencils and operator differential-algebraic equations is studied. Special focus is laid on singular operator pencils and three different concepts of singularity of operator pencils are introduced. The…

Functional Analysis · Mathematics 2025-01-27 Christian Mehl , Volker Mehrmann , Michał Wojtylak

Cyber deception is one of the key approaches used to mislead attackers by hiding or providing inaccurate system information. There are two main factors limiting the real-world application of existing cyber deception approaches. The first…

Cryptography and Security · Computer Science 2020-08-14 Dayong Ye , Tianqing Zhu , Shen Sheng , Wanlei Zhou

We study kernel functions, and associated reproducing kernel Hilbert spaces $\mathscr{H}$ over infinite, discrete and countable sets $V$. Numerical analysis builds discrete models (e.g., finite element) for the purpose of finding…

Functional Analysis · Mathematics 2015-08-17 Palle Jorgensen , Feng Tian

In this paper, under some integrability condition, we prove that an electrical perturbation of the discrete Dirac operator has purely absolutely continuous spectrum for the one dimensional case. We reduce the problem to a non-self-adjoint…

Mathematical Physics · Physics 2014-02-07 Sylvain Golenia , Tristan Haugomat

We study the $p$-independence of spectra of Laplace operators on graphs arising from regular Dirichlet forms on discrete spaces. Here, a sufficient criterion is given solely by a uniform subexponential growth condition. Moreover, under a…

Spectral Theory · Mathematics 2012-11-29 Frank Bauer , Bobo Hua , Matthias Keller

Motivated by tug-of-war games and asymptotic analysis of certain variational problems, we consider a gradient constraint problem involving the infinity Laplace operator. We prove that this problem always has a solution that is unique if a…

Analysis of PDEs · Mathematics 2012-01-26 Petri Juutinen , Mikko Parviainen , Julio D. Rossi

We construct some intrinsically defined discrete model of the magnetic Laplacian. The existence and uniqueness of solutions of the Dirichlet problem for the difference Poisson type equation are proved. We study in detail properties of the…

Mathematical Physics · Physics 2007-05-23 Volodymyr Sushch

We propose simple conditions equivalent to the discreteness of the spectrum of the Laplace-Beltrami operator on a class of Riemannian manifolds close to warped products. For this class of manifolds we establish a relationship between…

Functional Analysis · Mathematics 2009-02-16 M. Harmer

We give a self-contained and elementary proof for boundedness, existence, and uniqueness of solutions to dynamic programming principles (DPP) for biased tug-of-war games with running costs. The domain we work in is very general, and as a…

Analysis of PDEs · Mathematics 2013-07-19 Qing Liu , Armin Schikorra

The aim of the paper is firstly to study domains of definitions in terms of boundary conditions of minimal and maximal operators, as well as selfadjoint extensions of a minimal operator associated with the fourth-order differential operator…

Functional Analysis · Mathematics 2022-03-31 Nigar Aslanova , Kh. Aslanov

Continuous and discrete game-theoretic models of dispersed material drying process are formalized and studied in the paper. The existence of optimal drying strategies is shown through application of results from the theory of differential…

Optimization and Control · Mathematics 2017-06-01 Oleg Malafeyev , Denis Rylow , Irina Zaitseva , Lydia Novozhilova

In this paper, we introduce the notion of a characteristic operator for closable linear operators and explore their connected spectral properties via equivalence. Additionally, we develop an explicit scheme for constructing characteristic…

Dynamical Systems · Mathematics 2026-03-24 Bram Lentjes , Babette A. J. de Wolff

In this work we prove uniqueness result for an implicit discrete system defined on connected graphs. Our discrete system is motivated from a certain class of spatial segregation of reaction-diffusion equations.

Analysis of PDEs · Mathematics 2023-01-04 Avetik Arakelyan , Farid Bozorgnia

We propose a classification of all one-dimensional discrete statistical models with maximum likelihood degree one based on their rational parametrization. We show how all such models can be constructed from members of a smaller class of…

Combinatorics · Mathematics 2025-06-12 Arthur Bik , Orlando Marigliano

We establish the existence and uniqueness of distributed equilibria to possibly nonsymmetric $N$ player differential games with interactions through controls under displacement semimonotonicity assumptions. Surprisingly, the nonseparable…

Analysis of PDEs · Mathematics 2026-04-01 Hei Jie Lam , Alpár R. Mészáros

We provide an alternative approach to the existence of solutions to dynamic programming equations arising in the discrete game-theoretic interpretations for various nonlinear partial differential equations including the infinity Laplacian,…

Analysis of PDEs · Mathematics 2013-07-19 Qing Liu , Armin Schikorra

We construct a singular differential operator attached to a class of singular metrics on the line bundles over the complex projective space, $\mathbb{P}^1$. This operator extends the classical notion of the generalized Laplacian. We prove…

Spectral Theory · Mathematics 2014-03-14 Mounir Hajli

We present a systematic treatment of scattering processes for quantum systems whose time evolution is discrete. We define and show some general properties of the scattering operator, in particular the conservation of quasi-energy which is…

Quantum Physics · Physics 2021-06-28 Alessandro Bisio , Nicola Mosco , Paolo Perinotti

Minesweeper as a puzzle video game and is proved that it is an NPC problem. We use CSP, Logic Inference and Sampling to make a minesweeper solver and we limit us each select in 5 seconds.

Artificial Intelligence · Computer Science 2018-10-09 Yimin Tang , Tian Jiang , Yanpeng Hu
‹ Prev 1 2 3 10 Next ›