English
Related papers

Related papers: Black Boxes

200 papers

In this article, we prove some subsets of the set of natural numbers $\mathbb{N}$ and any non-zero ideals of an order of imaginary quadratic fields are fractionally dense in $\mathbb{R}_{>0}$ and $\mathbb{C}$ respectively.

Number Theory · Mathematics 2018-10-02 Jaitra Chattopadhyay , Bidisha Roy , Subha Sarkar

The properties of composite black holes in the background of electric or magnetic flux tubes are analyzed, both when the black holes remain in static equilibrium and when they accelerate under a net external force. To this effect, we…

High Energy Physics - Theory · Physics 2009-10-30 R. Emparan

In Random Forests, proximity distances are a metric representation of data into decision space. By observing how changes in input map to the movement of instances in this space we are able to determine the independent contribution of each…

Machine Learning · Statistics 2018-07-18 Leanne S. Whitmore , Anthe George , Corey M. Hudson

The black hole information paradox is one of the most important issues in theoretical physics. We review some recent progress using string theory in understanding the nature of black hole microstates. For all cases where these microstates…

High Energy Physics - Theory · Physics 2008-10-27 Samir D. Mathur

Inferential models (IMs) represent a novel possibilistic approach for achieving provably valid statistical inference. This paper introduces a general framework for fusing independent IMs in a "black-box" manner, requiring no knowledge of…

Statistics Theory · Mathematics 2024-05-14 Leonardo Cella

The core of a cooperative game on a set of players $N$ is one of the most popular concept of solution. When cooperation is restricted (feasible coalitions form a subcollection $\cF$ of $2^N$), the core may become unbounded, which makes it…

Computer Science and Game Theory · Computer Science 2011-02-08 Michel Grabisch

We mainly investigate model of set theory with restricted choice, e.g., ZF + DC + "the family of countable subsets of lambda is well ordered for every lambda" (really local version for a given lambda). In this frame much of pcf theory can…

Logic · Mathematics 2019-01-29 Saharon Shelah

Consider a high-dimensional data set, in which for every data-point there is incomplete information. Each object in the data set represents a real entity, which is described by a point in high-dimensional space. We model the lack of…

Other Computer Science · Computer Science 2016-05-10 Hadassa Daltrophe , Shlomi Dolev , Zvi Lotker

In this survey we describe a recently-developed technique for bounding the number (and controlling the typical structure) of finite objects with forbidden substructures. This technique exploits a subtle clustering phenomenon exhibited by…

Combinatorics · Mathematics 2018-01-16 József Balogh , Robert Morris , Wojciech Samotij

Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…

Combinatorics · Mathematics 2025-05-16 Jay Lilian Kneip

We present a new variant of the potential game and show that certain compact subsets of $\R^n$, including a large class of self-affine sets, are winning in our game. We prove that sets with sufficiently strong winning conditions are…

Dynamical Systems · Mathematics 2025-08-18 Richard A. Howat , Andrew Mitchell , Tony Samuel

We provide a necessary and sufficient condition under which a convex set is approachable in a game with partial monitoring, i.e.\ where players do not observe their opponents' moves but receive random signals. This condition is an extension…

Computer Science and Game Theory · Computer Science 2011-02-23 Vianney Perchet

We deal with some pcf investigations mostly motivated by abelian group theory problems and deal their applications to test problems (we expect reasonably wide applications). We prove almost always the existence of aleph_omega-free abelian…

Logic · Mathematics 2017-08-08 Saharon Shelah

Physics is facing contingency. Not only in facts but also in laws (the frontier becoming extremely narrow). Cosmic natural selection is a tantalizing idea to explain the apparently highly improbable structure of our Universe. In this brief…

General Relativity and Quantum Cosmology · Physics 2018-12-19 A. Barrau

We show that, within the AdS/CFT correspondence, recent formulations of the information paradox can be reduced to a question about the existence of certain kinds of operators in the CFT. We describe a remarkably simple construction of these…

High Energy Physics - Theory · Physics 2014-02-12 Kyriakos Papadodimas , Suvrat Raju

Birch and Tverberg partitions are closely related concepts from discrete geometry. We show two properties for the number of Birch partitions: Evenness, and a lower bound. This implies the first non-trivial lower bound for the number of…

Combinatorics · Mathematics 2008-04-17 Stephan Hell

We further study sets of labeled dice in which the relation "is a better die than" is non-transitive. Focusing on sets with an additional symmetry we call "balance," we prove that sets of $n$ such $m$-sided dice exist for all $n,m \geq 3$.…

Combinatorics · Mathematics 2017-06-29 Alex Schaefer

In this chapter I focus on asking and answering the following questions: (1) What is a black hole? Answer: There are three types of black holes, namely mathematical black holes, physical black holes and astrophysical black holes. An…

High Energy Astrophysical Phenomena · Physics 2011-09-19 Shuang-Nan Zhang

A brief reference to the two Schwarzschild solutions and what Petrov had to say about them is given. Comments on how the Schwarzschild vacuum solution describes a black hole are also provided. Then we compare the properties, differences and…

General Relativity and Quantum Cosmology · Physics 2012-11-09 José P. S. Lemos

Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview of the area to encourage further research. In particular, we…

Computational Complexity · Computer Science 2009-09-25 Erik D. Demaine , Robert A. Hearn
‹ Prev 1 3 4 5 6 7 10 Next ›