共找到 20 条结果
Strong gravitational lensing is a key probe to trace dark matter. It assumes that mass curves spacetime so that light from a background source is deflected on its way to the observer. If dark matter contributes the major part to a massive cosmic structure, reconstructing the latter from strong-lensing observables allows us to infer characteristics of dark matter. Standard reconstructions fit a pre-defined mass-density model to the data. In this essay, I show how these mass models over-estimate the dark-matter contents of light-deflecting masses. Eliminating these models from the reconstruction reveals that observations directly constrain local properties of light-deflecting masses. How much dark matter is really needed in strong-gravitational-lensing effects and how much do we make up by our model choices?
Claim-level Uncertainty Quantification (UQ) is a promising approach to mitigate the lack of reliability in Large Language Models (LLMs). We introduce MUCH, the first claim-level UQ benchmark designed for fair and reproducible evaluation of future methods under realistic conditions. It includes 4,873 samples across four European languages (English, French, Spanish, and German) and four instruction-tuned open-weight LLMs. Unlike prior claim-level benchmarks, we release 24 generation logits per token, facilitating the development of future white-box methods without re-generating data. Moreover, in contrast to previous benchmarks that rely on manual or LLM-based segmentation, we propose a new deterministic algorithm capable of segmenting claims using as little as 0.2% of the LLM generation time. This makes our segmentation approach suitable for real-time monitoring of LLM outputs, ensuring that MUCH evaluates UQ methods under realistic deployment constraints. Finally, our evaluations show that current methods still have substantial room for improvement in both performance and efficiency.
How much cryptographically-secure randomness can be extracted from a quantum state? This fundamental question probes the absolute limits of quantum random number generation (QRNG) and yet, despite the technological maturity of QRNGs, it remains unsolved. In this work we consider a general adversarial model that allows for an adversary who has quantum side-information about both the source and the measurement device. Using links between randomness extraction rates and sandwiched Rényi entropies, we provide compact, easy to compute, achievable rates of secure randomness extraction from quantum states. In turn, this provides a simple to evaluate benchmarking tool for the randomness generation rates of QRNG protocols.
A residue design is an artistic geometric construction in which we have $n$ equally-spaced points on a circle numbered 0 through $n-1$ and we join with a line segment each point $k$ to $ak$ modulo $n$ for some fixed $a\ge 2.$ The envelopes of these lines are epicycloids, like cardioids. In this note, we prove that the sum of the lengths of these line segments has a surprisingly simple closed form. In particular, if one wants to make one of these designs with string, it is easy to calculate how much string is required.
The concept of continuous-aperture multiple-input multiple-output (CAP-MIMO) technology has been proposed recently, which aims at achieving high spectrum efficiency by deploying extremely dense antennas or even continuous antennas in a given aperture. The fundamental question of CAP-MIMO is whether it can achieve much better performance than the traditional discrete MIMO system. In this paper, to model the CAP-MIMO, we use self-adjoint operators to depict the structural characteristics of the continuous random electromagnetic fields from physical laws. Then, we propose a non-asymptotic performance comparison scheme between continuous and discrete MIMO systems based on the analysis of mutual information. We show the consistency of the proposed scheme by proving that the mutual information between discretized transceivers converges to that between continuous transceivers. Numerical analysis verifies the theoretical results, and suggests that the mutual information obtained from the discrete MIMO with widely adopted half-wavelength spaced antennas almost achieves the mutual information obtained from CAP-MIMO.
This paper presents a multilingual study on, per single post of microblog text, (a) how much can be said, (b) how much is written in terms of characters and bytes, and (c) how much is said in terms of information content in posts by different organizations in different languages. Focusing on three different languages (English, Chinese, and Japanese), this research analyses Weibo and Twitter accounts of major embassies and news agencies. We first establish our criterion for quantifying "how much can be said" in a digital text based on the openly available Universal Declaration of Human Rights and the translated subtitles from TED talks. These parallel corpora allow us to determine the number of characters and bits needed to represent the same content in different languages and character encodings. We then derive the amount of information that is actually contained in microblog posts authored by selected accounts on Weibo and Twitter. Our results confirm that languages with larger character sets such as Chinese and Japanese contain more information per character than English, but the actual information content contained within a microblog text varies depending on both the type of org
Godelian sentences of a sufficiently strong and recursively enumerable theory, constructed in Godel's 1931 groundbreaking paper on the incompleteness theorems, are unprovable if the theory is consistent; however, they could be refutable. These sentences are independent when the theory is so-called omega-consistent; a notion introduced by Godel, which is stronger than (simple) consistency, but ``much weaker'' than soundness. Godel goes to great lengths to show in detail that omega-consistency is stronger than consistency, but never shows, or seems to forget to say, why it is much weaker than soundness. In this paper, we study this proof-theoretic notion and compare some of its properties with those of consistency and (variants of) soundness.
In 1952 Bing astonished the mathematical world with his wild involution on $S^3$. It has been among the most seminal examples in topology. The example depends on finding shrinking homeomorphisms of Bing's decomposition of $S^3$ into points and arcs. If Bing's original homeomorphisms are varied, Bing's original wild involution changes by conjugation, which preserves some analytic properties \cite{fs22} while altering others. In 1988, Bing published a second paper "Shrinking Without Lengthening," answering a question that one of the present authors posed to him in an effort to understand the geometry of the entire conjugacy class. In this paper we produce a counterintuitive construction, namely, a method to shrink the Bing decomposition doing almost nothing at all--neither lengthening much nor rotating much.
"How much c.e. sets could cover a given set?" in this paper we are going to answer this question. Also, in this approach some old concepts come into a new arrangement. The major goal of this article is to introduce an appropriate definition for this purpose. Introduction In Computability Theory (Recursion Theory) in the first step we wish to recognize the sets which could be enumerated by Turing machines (equivalently, algorithms) and in the next step we will compare these sets by some reasonable order (Like Turing degree). Also sometimes with some extra information (Oracles) a class of non c.e. sets show the same behavior as c.e. sets (Post hierarchy and related theorems). Here we try another approach: "Let A be an arbitrary set and we wish to recognize how much this set might be covered by a c.e. set?" Although in some sense this approach could be seen in some definitions of Recursion Theory, but at the best of our knowledge it didn't considered as an approach yet, even though it is able to shed a light on some subjects of Computability of sets. Defining this approach is not quite straightforward and there are some obstacles to define them. To overcome these difficulties we modif
Bayesian inference systems should be able to explain their reasoning to users, translating from numerical to natural language. Previous empirical work has investigated the correspondence between absolute probabilities and linguistic phrases. This study extends that work to the correspondence between changes in probabilities (updates) and relative probability phrases, such as "much more likely" or "a little less likely." Subjects selected such phrases to best describe numerical probability updates. We examined three hypotheses about the correspondence, and found the most descriptively accurate of these three to be that each such phrase corresponds to a fixed difference in probability (rather than fixed ratio of probabilities or of odds). The empirically derived phrase selection function uses eight phrases and achieved a 72% accuracy in correspondence with the subjects' actual usage.
In algorithmic randomness, when one wants to define a randomness notion with respect to some non-computable measure $λ$, a choice needs to be made. One approach is to allow randomness tests to access the measure $λ$ as an oracle (which we call the "classical approach"). The other approach is the opposite one, where the randomness tests are completely effective and do not have access to the information contained in $λ$ (we call this approach "Hippocratic"). While the Hippocratic approach is in general much more restrictive, there are cases where the two coincide. The first author showed in 2010 that in the particular case where the notion of randomness considered is Martin-Löf randomness and the measure $λ$ is a Bernoulli measure, classical randomness and Hippocratic randomness coincide. In this paper, we prove that this result no longer holds for other notions of randomness, namely computable randomness and stochasticity.
In this paper we explore the following question: how weak can a logic be for Rosser's essential undecidability result to be provable for a weak arithmetical theory? It is well known that Robinson's Q is essentially undecidable in intuitionistic logic, and P. Hajek proved it in the fuzzy logic BL for Grzegorczyk's variant of Q which interprets the arithmetic operations as non-total non-functional relations. We present a proof of essential undecidability in a much weaker substructural logic and for a much weaker arithmetic theory, a version of Robinson's R (with arithmetic operations also interpreted as mere relations). Our result is based on a structural version of the undecidability argument introduced by Kleene and we show that it goes well beyond the scope of the Boolean, intuitionistic, or fuzzy logic.
Multiuser diversity (MUDiv) is one of the central concepts in multiuser (MU) systems. In particular, MUDiv allows for scheduling among users in order to eliminate the negative effects of unfavorable channel fading conditions of some users on the system performance. Scheduling, however, consumes energy (e.g., for making users' channel state information available to the scheduler). This extra usage of energy, which could potentially be used for data transmission, can be very wasteful, especially if the number of users is large. In this paper, we answer the question of how much MUDiv is required for energy limited MU systems. Focusing on uplink MU wireless systems, we develop MU scheduling algorithms which aim at maximizing the MUDiv gain. Toward this end, we introduce a new realistic energy model which accounts for scheduling energy and describes the distribution of the total energy between scheduling and data transmission stages. Using the fact that such energy distribution can be controlled by varying the number of active users, we optimize this number by either (i) minimizing the overall system bit error rate (BER) for a fixed total energy of all users in the system or (ii) minimi
Although the Internet Archive's Wayback Machine is the largest and most well-known web archive, there have been a number of public web archives that have emerged in the last several years. With varying resources, audiences and collection development policies, these archives have varying levels of overlap with each other. While individual archives can be measured in terms of number of URIs, number of copies per URI, and intersection with other archives, to date there has been no answer to the question "How much of the Web is archived?" We study the question by approximating the Web using sample URIs from DMOZ, Delicious, Bitly, and search engine indexes; and, counting the number of copies of the sample URIs exist in various public web archives. Each sample set provides its own bias. The results from our sample sets indicate that range from 35%-90% of the Web has at least one archived copy, 17%-49% has between 2-5 copies, 1%-8% has 6-10 copies, and 8%-63% has more than 10 copies in public web archives. The number of URI copies varies as a function of time, but no more than 31.3% of URIs are archived more than once per month.
We construct a deformed algebraic quantum field theory on bifurcate Killing horizons in stationary axisymmetric spacetimes. The deformation is generated by the commuting actions of affine dilations along the null generators of the horizon and rotations about the axis of symmetry, analogously to the Moyal-Rieffel deformation. Physically, this effectively implements a noncommutative geometric structure of the horizon. Moreover, we compute the relative entropy between coherent states in the deformed horizon theory, which remains strictly positive and exhibits a novel second-order correction in the deformation parameter, which becomes particularly significant for black holes whose horizon area is sufficiently small for Planck-scale effects to become non-negligible.
We investigate the quantum structure of spacetime at fundamental scales via a novel, Lorentz-invariant noncommutative coordinate framework. Building on insights from noncommutative geometry, spectral theory, and algebraic quantum field theory, we systematically construct a quantum spacetime algebra whose geometric and causal properties are derived from first principles. Using the Weyl algebra formalism and the Gelfand--Naimark--Segal (GNS) construction, we rigorously define operator-valued coordinates that respect Lorentz symmetry and encode quantum gravitational effects through nontrivial commutation relations. We show how the emergent quantum spacetime exhibits minimal length effects, which deliver both classical Minkowski distances and quantum corrections proportional to the Planck length squared. Furthermore, we establish that noncommutativity respects a fuzzy form of causality, where the quantum causal structure gives back the light cone in the classical limit, vanishing for spacelike separations and encoding a time orientation for timelike intervals.
Quantum models of spacetime have been conjectured to hypothetically allow for the formation of Planck scale wormholes. Building on the proposal of Morris, Thorne, and Yurtsever that such microscopic spacetime structures might be enlarged to macroscopic size, we revisit Roman's analysis of a wormhole in an inflationary de Sitter background. In this context, we introduce a refined quasi-local toy mechanism, which we call the local inflation bubble. This construction inflates a compact region of spacetime and thereby magnifies the underlying microstructure. Using the Einstein equations we determine the required stress-energy to sustain the bubble and obtain intrinsic lower bounds for the corresponding energy density, while acknowledging the continued reliance on exotic matter.
The fermionic relative entropy in two-dimensional Rindler spacetime is studied using both modular theory and the reduced one-particle density operators. The methods and results are compared. A formula for the relative entropy for general Gaussian states is derived. As an application, the relative entropy is computed for a class of non-unitary excitations.
We present a quantum energy inequality (QEI) for quantum field theories formulated in non-commutative spacetimes, extending fundamental energy constraints to this generalized geometric framework. By leveraging operator-theoretic methods inspired by the positivity map of Waldmann et al. \cite{waldmannpos}, we construct linear combinations of deformed operators that generalize the commutative spacetime techniques of Fewster et al., \cite{Few98}. These non-commutative analogs enable us the derivation of a lower bound on the deformed averaged energy density, ensuring the stability of the underlying quantum field theory. Our result establishes rigorous constraints on the expectation values of the deformed (non-commutative) energy density, reinforcing the physical consistency of non-commutative models while preserving core principles of quantum field theory.
We provide arguments indicating that the semiclassical Einstein equations follow from quantum relative entropy and its proportionality to an area variation. Using modular theory, we establish that the relative entropy between the vacuum state and coherent excitations of a scalar quantum field on a bifurcate Killing horizon is given by the energy flux across the horizon. Under the assumption of the Bekenstein-Hawking entropy-area formula, this energy flux is proportional to a variation in the surface area of the horizon cross section. The semiclassical Einstein equations follow automatically from this identification. Our approach provides a quantum field theoretic generalization of Jacobson's thermodynamic derivation of the Einstein equations, replacing classical thermodynamic entropy with the well-defined quantum relative (Araki-Uhlmann) entropy. This suggests that quantum information plays a central role in what is often seen as a zeroth order approximation of a theory of quantum gravity, namely quantum field theory in curved spacetimes.