e-ISSN: Pending

Browse the failure-mode index

19,875 real negative results, null findings, and replication failures · Negative / Null Result Report. Search the index →

WASTE indexes published research — it does not host or republish full papers. Each entry is a metadata record compiled from open scholarly databases; the abstract is shown in full only where the paper is openly licensed, otherwise a short excerpt under fair use. Classifications are automated and approximate.

Negative / Null Result ReportOpen accessMathematics

Graph decomposition and parity

Bobby DeMarco, Amanda Redlich · 2012 · arXiv

Motivated by a recent extension of the zero-one law by Kolaitis and Kopparty, we study the distribution of the number of copies of a fixed disconnected graph in the random graph $G(n,p)$. We use an idea of graph decompositions to give a sufficient condition for this distribution to tend to uniform modulo $q$. We determine the asymptotic distribution of all fixed two-component graphs in $G(n,p)$ for all $q$, and we give infinite families of many-component graphs with a uniform asymptotic distribution for all $q$. We also prove a negative result, that no simple proof of uniform asymptotic distri

View details →
Negative / Null Result ReportOpen accessComputer Science

Inferring Symbolic Automata

Dana Fisman, Hadar Frenkel, Sandra Zilles · 2021 · arXiv

We study the learnability of symbolic finite state automata (SFA), a model shown useful in many applications in software verification. The state-of-the-art literature on this topic follows the query learning paradigm, and so far all obtained results are positive. We provide a necessary condition for efficient learnability of SFAs in this paradigm, from which we obtain the first negative result. The main focus of our work lies in the learnability of SFAs under the paradigm of identification in the limit using polynomial time and data, and its strengthening efficient identifiability, which are c

View details →
Negative / Null Result ReportOpen accessComputer Science

Maximizing utility in multi-agent environments by anticipating the behavior of other learners

Angelos Assos, Yuval Dagan, Constantinos Daskalakis · 2024 · arXiv

Learning algorithms are often used to make decisions in sequential decision-making environments. In multi-agent settings, the decisions of each agent can affect the utilities/losses of the other agents. Therefore, if an agent is good at anticipating the behavior of the other agents, in particular how they will make decisions in each round as a function of their experience that far, it could try to judiciously make its own decisions over the rounds of the interaction so as to influence the other agents to behave in a way that ultimately benefits its own utility. In this paper, we study repeated

View details →
Negative / Null Result ReportOpen accessComputer Science

A Comment on the Measurement of Neutrino Masses in Beta-Decay Experiments

S. M. Bilenky, M. D. Mateev, S. T. Petcov · 2006 · arXiv

We discuss the physics potential of future tritium beta-decay experiments having a sensitivity to a neutrino mass ~\sqrt{|Δm^{2}_{23}|}~5x10^{-2} eV. The case of three-neutrino mixing is analised. A negative result of such an experiment would imply that the neutrino mass spectrum is of normal hierarchical type. The interpretation of a positive result would depend on the value of the lightest neutrino mass; if the lightest neutrino mass satisfies the inequality min(m_j) << \sqrt{|Δm^{2}_{23}|}, it would imply that the neutrino mass spectrum is of the inverted hierarchical type.

View details →
Negative / Null Result ReportOpen accessMathematics

Conjugate-symplecticity properties of Euler--Maclaurin methods and their implementation on the Infinity Computer

F. Iavernaro, F. Mazzia, M. S. Mukhametzhanov et al. · 2018 · arXiv

Multi-derivative one-step methods based upon Euler-Maclaurin integration formulae are considered for the solution of canonical Hamiltonian dynamical systems. Despite the negative result that simplecticity may not be attained by any multi-derivative Runge--Kutta methods, we show that the Euler-MacLaurin method of order p is conjugate-symplectic up to order p+2. This feature entitles them to play a role in the context of geometric integration and, to make their implementation competitive with the existing integrators, we explore the possibility of computing the underlying higher order derivative

View details →
Negative / Null Result ReportOpen accessMathematics

A note on quadratic constraints with indicator variables: Convex hull description and perspective relaxation

Andres Gomez, Weijun Xie · 2022 · arXiv

In this paper, we study the mixed-integer nonlinear set given by a separable quadratic constraint on continuous variables, where each continuous variable is controlled by an additional indicator. This set occurs pervasively in optimization problems with uncertainty and in machine learning. We show that optimization over this set is NP-hard. Despite this negative result, we characterize the structure of the convex hull, and show that it can be formally studied using polyhedral theory. Moreover, we show that although perspective relaxation in the literature for this set fails to match the struct

View details →
Negative / Null Result ReportOpen accessMathematics

When does a Gaussian process have its paths in a reproducing kernel Hilbert space?

Ingo Steinwart · 2024 · arXiv

We investigate for which Gaussian processes there do or do not exist reproducing kernel Hilbert spaces (RKHSs) that contain almost all of their paths. In particular, we establish a new result that makes it possible to exclude the existence of such RKHSs in many cases. Moreover, we combine this negative result with some known techniques to establish positive results. Here it turns out that for many classical families of Gaussian processes we can fully characterize for which members of these families there exist RKHSs containing the paths. Similar characterizations are obtained for Gaussian proc

View details →
Negative / Null Result ReportOpen accessMathematics

Controllability of the cubic Schroedinger equation via a low-dimensional source term

Andrey Sarychev · 2011 · arXiv

We study controllability of $d$-dimensional defocusing cubic Schroedinger equation under periodic boundary conditions. The control is applied additively, via a source term, which is a linear combination of few complex exponentials (modes) with time-variant coefficients - controls. We manage to prove that controlling at most $2^d$ modes one can achieve controllability of the equation in any finite-dimensional projection of the evolution space $H^{s}(\mathbb{T}^d), \ s>d/2$, as well as approximate controllability in $H^{s}(\mathbb{T}^d)$. We also present negative result regarding exact controlla

View details →
Negative / Null Result ReportOpen accessMathematics

A theorem of Roe and Strichartz for Riemannian symmetric spaces of noncompact type

Swagato K. Ray, Rudra P. Sarkar · 2012 · arXiv

Generalizing a result of Roe \cite{Roe} Strichartz proved in \cite{Str} that if a doubly-infinite sequence $\{f_k\}$ of functions on $\R^n$ satisfies $f_{k+1}=Δf_k$ and $|f_{k}(x)|\leq M$ for all $k=0,\pm 1,\pm 2,...$ and $x\in \R^n$, then $Δf_0(x)= -f_0$. Strichartz also showed that the result fails for hyperbolic 3-space. This negative result can be indeed extended to any Riemannian symmetric space of noncompact type. Taking this into account we shall prove that for all Riemannian symmetric spaces of noncompact type the theorem actually holds true when uniform boundedness is modified suitabl

View details →
Negative / Null Result ReportOpen accessComputer Science

The KATRIN Experiment

Marcus Beck · 2009 · arXiv

The KArlsruhe TRitium Neutrino mass experiment, KATRIN, aims to search for the mass of the electron neutrino with a sensitivity of 0.2 eV/c^2 (90% C.L.) and a detection limit of 0.35 eV/c^2 (5 sigma). Both a positive or a negative result will have far reaching implications for cosmology and the standard model of particle physics and will give new input for astroparticle physics and cosmology. The major components of KATRIN are being set up at the Karlsruhe Institut of Technology in Karlsruhe, Germany, and test measurements of the individual components have started. Data taking with tritium is

View details →
Negative / Null Result ReportOpen accessComputer Science

Public Signaling in Bayesian Ad Auctions

Francesco Bacchiocchi, Matteo Castiglioni, Alberto Marchesi et al. · 2022 · arXiv

We study signaling in Bayesian ad auctions, in which bidders' valuations depend on a random, unknown state of nature. The auction mechanism has complete knowledge of the actual state of nature, and it can send signals to bidders so as to disclose information about the state and increase revenue. For instance, a state may collectively encode some features of the user that are known to the mechanism only, since the latter has access to data sources unaccessible to the bidders. We study the problem of computing how the mechanism should send signals to bidders in order to maximize revenue. While t

View details →
Negative / Null Result ReportOpen accessMathematics

On Tangential and Projectively Adjacent Approach Regions

Fausto Di Biase, Haguma Gratien, Olof Svensson · 2025 · arXiv

In 1906 Fatou proved that bounded holomorphic functions on the unit disc converge a.e. on the boundary along nontangential approach regions. In 1927 Littlewood proved a negative result, i.e., that a.e. convergence fails for certain approach regions: More precisely, it fails for the rotationally invariant families of tangential approach regions that end curvilinearly at the boundary. The fact that tangential approach regions which end sequentially at the boundary may instead be very well conducive to a.e. convergence was understood more recently by W. Rudin (in 1979) and A. Nagel and E.M. Stein

View details →
Negative / Null Result ReportOpen accessMathematics

Robustness of Anytime Bandit Policies

Antoine Salomon, Jean-Yves Audibert · 2011 · arXiv

This paper studies the deviations of the regret in a stochastic multi-armed bandit problem. When the total number of plays n is known beforehand by the agent, Audibert et al. (2009) exhibit a policy such that with probability at least 1-1/n, the regret of the policy is of order log(n). They have also shown that such a property is not shared by the popular ucb1 policy of Auer et al. (2002). This work first answers an open question: it extends this negative result to any anytime policy. The second contribution of this paper is to design anytime robust policies for specific multi-armed bandit pro

View details →
Negative / Null Result ReportOpen accessComputer Science

Teaching People LLM's Errors and Getting it Right

Nathan Stringham, Fateme Hashemi Chaleshtori, Xinyuan Yan et al. · 2025 · arXiv

People use large language models (LLMs) when they should not. This is partly because they see LLMs compose poems and answer intricate questions, so they understandably, but incorrectly, assume LLMs won't stumble on basic tasks like simple arithmetic. Prior work has tried to address this by clustering instance embeddings into regions where an LLM is likely to fail and automatically describing patterns in these regions. The found failure patterns are taught to users to mitigate their overreliance. Yet, this approach has not fully succeeded. In this analysis paper, we aim to understand why. We fi

View details →
Negative / Null Result ReportOpen accessComputer Science

On the Existence of Absolutely Maximally Entangled States of Minimal Support

Antonio Bernal · 2016 · arXiv

In this paper we prove that no absolutely maximally entangled, AME, state with minimal support exists with 7 sites and 5 levels. General AME states are pure multipartite states that, when reduced to half or less of the sites, the maximum entropy mixed state is obtained. They have found applications in teleportation and quantum secret sharing, and finding conditions for their existence is a well known open problem. We consider the version of this problem for minimally supported AME states. We single out known both sufficient and necessary conditions in that case. From our negative result, we sh

View details →
Negative / Null Result ReportOpen accessPhysics

On the Properties of Blue Large-Amplitude Pulsators. No BLAPs in the Magellanic Clouds

Pawel Pietrukowicz · 2018 · arXiv

We present the properties of the recently discovered class of variable stars, Blue Large-Amplitude Pulsators (BLAPs). These extremely rare, short-period pulsating objects were detected thanks to regular, high-cadence observations of hundreds of millions of Milky Way stars by the OGLE variability survey. The new variables closely resemble classical pulsators, Cepheids, and RR Lyrae-type stars, but at effective temperatures at which pulsations are due to the presence of iron-group elements. Theory shows that BLAPs are evolved low-mass stars with a giant-like structure, but their origin remains a

View details →
Negative / Null Result ReportOpen accessPhysics

Discovery of X-rays from the composite supernova remnant G0.9+0.1 with the BeppoSAX satellite

S. Mereghetti, L. Sidoli, G. L. Israel · 1997 · arXiv

Using the BeppoSAX satellite we have obtained the first secure X-ray detection of the supernova remnant G0.9+0.1. The 1-10 keV spectrum can be described with an absorbed power law with photon index 3 and N_H = 3 times 10^{23} cm^2. The high column density supports a distance similar to that of the Galactic Center. The X-ray emission, with a luminosity L_x = 10^{35} d_{10kpc}^{2} erg/s, coincides with the central radio core, confirming the composite nature of this remnant. Though a search for periodic pulsations gave a negative result, the observed X-rays are probably related to the presence of

View details →
Negative / Null Result ReportOpen accessMathematics

Finite Sample Properties of Tests Based on Prewhitened Nonparametric Covariance Estimators

David Preinerstorfer · 2014 · arXiv

We analytically investigate size and power properties of a popular family of procedures for testing linear restrictions on the coefficient vector in a linear regression model with temporally dependent errors. The tests considered are autocorrelation-corrected F-type tests based on prewhitened nonparametric covariance estimators that possibly incorporate a data-dependent bandwidth parameter, e.g., estimators as considered in Andrews and Monahan (1992), Newey and West (1994), or Rho and Shao (2013). For design matrices that are generic in a measure theoretic sense we prove that these tests eithe

View details →
Negative / Null Result ReportOpen accessComputer Science

On a Geometric Structure of Pure Multi-qubit Quantum States and Its Applicability to a Numerical Computation

Kimikazu Kato, Mayumi Oto, Hiroshi Imai et al. · 2006 · arXiv

For one-qubit pure quantum states, it is already proved that the Voronoi diagrams with respect to two distances -- Euclidean distance and the quantum divergence -- coincide. This fact is a support for a known method to calculate the Holevo capacity. To consider an applicability of this method to quantum states of a higher level system, it is essential to check if the coincidence of the Voronoi diagrams also occurs. In this paper, we show a negative result for that expectation. In other words, we mathematically prove that those diagrams no longer coincide in a higher dimension. That indicates t

View details →
Negative / Null Result ReportOpen accessComputer Science

Linear functional classes over cellular automata

Anaël Grandjean, Gaétan Richard, Véronique Terrier · 2012 · arXiv

Cellular automata are a discrete dynamical system which models massively parallel computation. Much attention is devoted to computations with small time complexity for which the parallelism may provide further possibilities. In this paper, we investigate the ability of cellular automata related to functional computation. We introduce several functional classes of low time complexity which contain "natural" problems. We examine their inclusion relationships and emphasize that several questions arising from this functional framework are related to current ones coming from the recognition context

View details →
Negative / Null Result ReportOpen accessComputer Science

Addressing Bias in Active Learning with Depth Uncertainty Networks... or Not

Chelsea Murray, James U. Allingham, Javier Antorán et al. · 2021 · arXiv

Farquhar et al. [2021] show that correcting for active learning bias with underparameterised models leads to improved downstream performance. For overparameterised models such as NNs, however, correction leads either to decreased or unchanged performance. They suggest that this is due to an "overfitting bias" which offsets the active learning bias. We show that depth uncertainty networks operate in a low overfitting regime, much like underparameterised models. They should therefore see an increase in performance with bias correction. Surprisingly, they do not. We propose that this negative res

View details →
Negative / Null Result ReportOpen accessPhysics

Spectral and timing properties of the X-ray emission from the millisecond pulsar PSR B1821-24

T. Mineo, G. Cusumano, E. Massaro et al. · 2004 · arXiv

We report results on the timing and spectral analysis of observations of the millisecond pulsar PSR B1821-24 with RXTE, BeppoSAX and Chandra. The X-ray light curve is characterized by two narrow peaks at a phase distance of 0.452+/-0.002. The average pulsed emission, over the range 1.6-20 keV, is well represented by a single power law with a photon index alpha=1.30 +0.05 -0.02 and unabsorbed (2-10 keV) pulsed X-ray flux of 3.9x10^(-13) erg cm^(-2) s^(-1). We searched for a possible bunching of X-ray photons to verify if the X ray emission has a time structure similar to that of giant pulses an

View details →
Negative / Null Result ReportOpen accessMathematics

On $L^2$ extension from singular hypersurfaces

Dano Kim, Hoseob Seo · 2021 · arXiv

In $L^2$ extension theorems from a singular hypersurface in a complex manifold, important roles are played by certain measures such as the Ohsawa measure which determine when a given function can be extended. We show that the singularity of the Ohsawa measure can be identified in terms of singularity of pairs from algebraic geometry. Using this, we give an analytic proof of the inversion of adjunction in this setting. Then these considerations enable us to compare various positive and negative results on $L^2$ extension from singular hypersurfaces. In particular, we generalize a recent negativ

View details →
Negative / Null Result ReportOpen accessComputer Science

Higgs potential bounds on extra quark-lepton generations

H. B. Nielsen, A. V. Novikov, V. A. Novikov et al. · 1995 · arXiv

We consider the bounds for the values of higgs mass $M_H$ and of the mass of the extra quarks and leptons $M_{extra}$ derived from the stability of vacuum and from the absence of Landau pole in Higgs potential. We find that in the case of the absence of new physics up to the GUT scale the bounds for the mass of the 4th generation are so restrictive that the negative result of CDF search for extra quarks closes the window for fourth generation. In the case of the absence of new physics up to $10^5$ GeV we get weaker but still nontrivial bounds on $M_H$ and $M_{extra}$ as well.

View details →
Negative / Null Result ReportOpen accessComputer Science

Non-renormalizability of the classical statistical approximation

Thomas Epelbaum, Francois Gelis, Bin Wu · 2014 · arXiv

In this paper, we discuss questions related to the renormalizability of the classical statistical approximation, an approximation scheme that has been used recently in several studies of out-of-equilibrium problems in Quantum Field Theory. Although the ultraviolet power counting in this approximation scheme is identical to that of the unapproximated quantum field theory, this approximation is not renormalizable. The leading cause of this non-renormalizability is the breakdown of Weinberg's theorem in this approximation. We also discuss some practical implications of this negative result for si

View details →
Negative / Null Result ReportOpen accessComputer Science

Local Regularizers Are Not Transductive Learners

Sky Jafar, Julian Asilis, Shaddin Dughmi · 2025 · arXiv

We partly resolve an open question raised by Asilis et al. (COLT 2024): whether the algorithmic template of local regularization -- an intriguing generalization of explicit regularization, a.k.a. structural risk minimization -- suffices to learn all learnable multiclass problems. Specifically, we provide a negative answer to this question in the transductive model of learning. We exhibit a multiclass classification problem which is learnable in both the transductive and PAC models, yet cannot be learned transductively by any local regularizer. The corresponding hypothesis class, and our proof,

View details →
Negative / Null Result ReportOpen accessEconomics, Econometrics and Finance

Obstacles to Redistribution Through Markets and One Solution

Roy Allen, John Rehbeck · 2021 · arXiv

Dworczak et al. (2021) study when certain market structures are optimal in the presence of heterogeneous preferences. A key assumption is that the social planner knows the joint distribution of the value of the good and marginal value of money. This paper studies whether relevant features of this distribution are identified from choice data. We show that the features of the distribution needed to characterize optimal market structure cannot be identified when demand is known for all prices. While this is a negative result, we show that the distribution of good value and marginal utility of mon

View details →
Negative / Null Result ReportOpen accessComputer Science

Distinction of atmospheric neutrino-mu - neutrino-tau and neutrino-mu - neutrino-sterile oscillations using short or intermediate baseline experiments

Achim Geiser · 1998 · arXiv

The current case for atmospheric $ν_μ$ oscillations into active or sterile neutrinos is reviewed. It is argued that neither the study of neutral current events at Super-Kamiokande, nor the information obtained from future long baseline experiments might be sufficient to unambigously decide between these two scenarios. However, a combination of these results with the results from future short or intermediate baseline $τ$ appearance experiments would clearly resolve most of the remaining ambiguities. This conclusion does not strongly depend on whether the results from LSND will be confirmed or n

View details →