Related papers: Black Boxes
Black holes in matrix theory may consist of interacting clusters (correlated domains) which saturate the uncertainty principle. We show that this assumption qualitatively accounts for the thermodynamic properties of both charged and neutral…
We consider a class of zero-sum search games in which a Hider hides one or more target among a set of $n$ boxes. The boxes may require differing amount of time to search, and detection may be imperfect, so that there is a certain…
We consider the covering of a ball in certain normed spaces by its congruent subsets and show that if the finite number of sets is not greater than the dimensionality of the space, then the centre of the ball either belongs to the interior…
We study the physical properties of four-dimensional, string-theoretical, horizonless "fuzzball" geometries by imaging their shadows. Their microstructure traps light rays straying near the would-be horizon on long-lived, highly redshifted…
There are many combinatorial games in which a move can terminate the game, such as a checkmate in chess. These moves give rise to diverse situations that fall outside the scope of the classical normal play structure. To analyze these games,…
We prove under ZFC that in each extremally disconnected compact space there exists a non-limit point of any countable discrete subset.
Full binary trees naturally represent commutative non-associative products. There are many important examples of these products: finite-precision floating-point addition and NAND gates, among others. Balance in such a tree is highly…
This thesis investigates two main topics concerning black holes in extensions of general relativity inspired by string theory. First, the structure of the equations of motion underlying black hole solutions is considered, in theories of…
In real-world applications, users often favor structurally diverse design choices over one high-quality solution. It is hence important to consider more solutions that decision makers can compare and further explore based on additional…
Every left-invariant ordering of a group is either discrete, meaning there is a least element greater than the identity, or dense. Corresponding to this dichotomy, the spaces of left, Conradian, and bi-orderings of a group are naturally…
In clustering problems, a central decision-maker is given a complete metric graph over vertices and must provide a clustering of vertices that minimizes some objective function. In fair clustering problems, vertices are endowed with a color…
We initiate the study of simple games from the point of view of combinatorial topology. The starting premise is that the losing coalitions of a simple game can be identified with a simplicial complex. Various topological constructions and…
An integer part I of a real closed field K is a discretely ordered subring with minimal element 1 such that, for every x in K, I contains some i such that x is between i and i+1 in the ordering of K. Mourgues and Ressayre showed that every…
We discuss basic structural properties of finite black box groups. A special emphasis is made on the use of centralisers of involutions in probabilistic recognition of black box groups. In particular, we suggest an algorithm for finding the…
I consider the natural infinitary variations of the games Wordle and Mastermind, as well as their game-theoretic variations Absurdle and Madstermind, considering these games with infinitely long words and infinite color sequences and…
We define a notion of substitution on colored binary trees that we call substreetution. We show that a fixed point by a substreetution may be (or not) almost periodic, thus the closure of the orbit under $\mathbb{F}_2^+$-action may (or not)…
In machine learning algorithm design, there exists a trade-off between the interpretability and performance of the algorithm. In general, algorithms which are simpler and easier for humans to comprehend tend to show worse performance than…
We study lower bounds on the query complexity of determining correlated equilibrium. In particular, we consider a query model in which an n-player game is specified via a black box that returns players' utilities at pure action profiles. In…
We discuss how under certain conditions the black hole information puzzle and the (related) arguments that firewalls are a typical feature of black holes can break down. We first review the arguments of AMPS favoring firewalls, focusing on…
The idea of holography in gravity arose from the fact that the entropy of black holes is given by their surface area. The holography encountered in gauge/gravity duality has no such relation however; the boundary surface can be placed at an…