English
Related papers

Related papers: A determinacy approach to Borel combinatorics

200 papers

In this paper, we introduce a new method for applying the implicit function theorem to find nontrivial solutions to overdetermined problems with a fixed boundary (given) and a free boundary (to be determined). The novelty of this method…

Analysis of PDEs · Mathematics 2021-04-06 Lorenzo Cavallina

We use a combinatorial approach to compute the number of non-isomorphic choices on four elements that can be explained by models of bounded rationality.

Theoretical Economics · Economics 2024-03-25 Alfio Giarlotta , Angelo Petralia , Stephen Watson

Robot game is a two-player vector addition game played on the integer lattice $\mathbb{Z}^n$. Both players have sets of vectors and in each turn the vector chosen by a player is added to the current configuration vector of the game. One of…

Computer Science and Game Theory · Computer Science 2016-05-02 Reino Niskanen , Igor Potapov , Julien Reichert

We survey new results on finite groups of birational transformations of algebraic varieties.

Algebraic Geometry · Mathematics 2021-12-28 Yuri Prokhorov

By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In…

Rings and Algebras · Mathematics 2007-05-23 Edward S. Letzter

We describe an inductive approach most appropriate for abelian varieties with an action of an imaginary quadratic field.

Algebraic Geometry · Mathematics 2007-05-23 E. Izadi

In this paper, we introduce an iterative numerical method to solve systems of nonlinear equations. The third-order convergence of this method is analyzed. Several examples are given to illustrate the efficiency of the proposed method.

Dynamical Systems · Mathematics 2009-04-23 M. Eshaghi Gordji , A. Ebadian , M. B. Ghaemi , J. Shokri

We characterize countable dimensionality and strong countable dimensionality by means of an infinite game.

General Topology · Mathematics 2007-09-19 Liljana Babinkostova , Marion Scheepers

We illustrate how one can use basic combinatorial theory and computer programming technique (Python) to analyze the combinatorial game: Mahjong. The results confirm some folklore concerning the game, and expose some unexpected results.…

History and Overview · Mathematics 2019-01-24 Yuan Cheng , Chi-Kwong Li , Sharon H. Li

The analysis of decision making under uncertainty is closely related to the analysis of probabilistic inference. Indeed, much of the research into efficient methods for probabilistic inference in expert systems has been motivated by the…

Artificial Intelligence · Computer Science 2013-03-25 Ross D. Shachter , Mark Alan Peot

In this paper, we will be proving mathematically that scoring play combinatorial game theory covers all combinatorial games. That is, there is a sub-set of scoring play games that are identical to the set of normal play games, and a…

Combinatorics · Mathematics 2013-03-19 Fraser Stewart

Estimating discrete games of complete information is often computationally difficult due to partial identification and the absence of closed-form moment characterizations. This paper proposes computationally tractable approaches to…

Econometrics · Economics 2025-10-02 Paul S. Koh

In this note, we present a new numerical method for solving backward stochastic differential equations. Our method can be viewed as an analogue of the classical finite element method solving deterministic partial differential equations.

Probability · Mathematics 2011-06-07 Penghui Wang , Xu Zhang

We introduce games with probabilistic uncertainty, a natural model for controller synthesis in which the controller observes the state of the system through imprecise sensors that provide correct information about the current state with a…

Computer Science and Game Theory · Computer Science 2012-07-03 Krishnendu Chatterjee , Martin Chmelik , Rupak Majumdar

We study multi-player games with perfect information and general payoff function, where the set of stages is the set of non-positive integers $\{\ldots,-2,-1,0\}$. We define two related equilibrium concepts: one considering only deviations…

Optimization and Control · Mathematics 2025-12-02 Galit Ashkenazi-Golan , János Flesch , Eilon Solan

We provide a decision-theoretic framework for dealing with uncertainty in quantum mechanics. This uncertainty is two-fold: on the one hand there may be uncertainty about the state the quantum system is in, and on the other hand, as is…

Quantum Physics · Physics 2026-05-01 Keano De Vos , Gert de Cooman , Alexander Erreygers , Jasper De Bock

We find the winning strategy for a class of truncation games played on words. As a consequence of the present author's recent results on some of these games we obtain new formulas for Bernoulli numbers and polynomials of the second kind and…

Combinatorics · Mathematics 2014-06-10 Gábor Hetyei

We propose a new deterministic symmetric recursive algorithm for solving mean-payoff games.

Computer Science and Game Theory · Computer Science 2026-03-10 Pierre Ohlmann

We present a method to prove the decidability of provability in several well-known inference systems. This method generalizes both cut-elimination and the construction of an automaton recognizing the provable propositions.

Logic in Computer Science · Computer Science 2016-01-08 Gilles Dowek , Ying Jiang

This review is focused on the borderline region of theoretical physics and mathematics. First, we describe numerical methods for the acceleration of the convergence of series. These provide a useful toolbox for theoretical physics which has…

Computational Physics · Physics 2013-09-10 E. Caliceti , M. Meyer-Hermann , P. Ribeca , A. Surzhykov , U. D. Jentschura