Related papers: Consequences of APSP, triangle detection, and 3SUM…
The full algebra of relativistic quantum mechanics (Lorentz plus Heisenberg) is unstable. Stabilization by deformation leads to a new deformation parameter $\epsilon \ell ^{2}$, $\ell $ being a length and $\epsilon$ a $\pm$ sign. The…
If one modifies the laws of Quantum Mechanics to allow nonlinear evolution of quantum states, this paper shows that NP-complete problems would be efficiently solvable in polynomial time with bounded probability (NP in BQP). With that…
We establish a connection between non-deterministic communication complexity and instance complexity, a measure of information based on algorithmic entropy. Let $\overline{x}$, $\overline{y}$ and $Y_1(\overline{x})$ be respectively the…
The probabilistic predictions of quantum theory are conventionally obtained from a special probabilistic axiom. But that is unnecessary because all the practical consequences of such predictions follow from the remaining, non-probabilistic,…
The consequences of adopting other definitions of the concepts of sum and convergence of a series are discussed in the light of historical and epistemological contexts. We show that some divergent series appearing in the context of…
In an attempt to resolve a folklore conjecture of Erd\H{o}s regarding the non-vanishing at $s=1$ of the $L$-series attached to a periodic arithmetical function with period $q$ and values in $\{-1, 1 \}$, Livingston conjectured the…
At least two, different approaches to define and solve statistical models for the analysis of economic systems exist: the typical, econometric one, interpreting the Gravity Model specification as the expected link weight of an arbitrary…
We study both classical and quantum algorithms to solve a hard optimization problem, namely 3-XORSAT on 3-regular random graphs. By introducing a new quasi-greedy algorithm that is not allowed to jump over large energy barriers, we show…
Jaeger, Vertigan, and Welsh [15] proved a dichotomy for the complexity of evaluating the Tutte polynomial at fixed points: The evaluation is #P-hard almost everywhere, and the remaining points admit polynomial-time algorithms. Dell,…
The topological analysis of chaos based on a knot-theoretic characterization of unstable periodic orbits has proved a powerful method, however knot theory can only be applied to three-dimensional systems. Still, the core principles upon…
We exhibit an approximate equivalence between the Lasso estimator and Dantzig selector. For both methods we derive parallel oracle inequalities for the prediction risk in the general nonparametric regression model, as well as bounds on the…
A partially linear probit model for spatially dependent data is considered. A triangular array setting is used to cover various patterns of spatial data. Conditional spatial heteroscedasticity and non-identically distributed observations…
In this article, we study the relationship between the exponential dichotomy properties of a triangular system of linear difference equations and its associated diagonal system on Hilbert spaces. We stress that all previous results in this…
This paper reports on the application to field measurements of time series methods developed on the basis of the theory of deterministic chaos. The major difficulties are pointed out that arise when the data cannot be assumed to be purely…
Grammatical inference consists in learning a language or a grammar from data. In this paper, we consider a number of models for inferring a non-deterministic finite automaton (NFA) with 3 sorts of states, that must accept some words, and…
The aim of this paper is to provide the first application of Theorem 3 of [2] in a case where the dependence of the underlying equation from the real parameter is not of affine type.
Existing models of computation, such as a Turing machine (hereafter, TM), do not consider the agent involved in interpreting the outcome of the computation. We argue that a TM, or any other computation model, has no significance if its…
We explore the consequences of layering a Lambek proof system over an arbitrary (constraint) logic. A simple model-theoretic semantics for our hybrid language is provided for which a particularly simple combination of Lambek's and the proof…
Let gamma be a (not necessarily finite) structure with a finite relational signature. We prove that deciding whether a given existential positive sentence holds in gamma is in Logspace or complete for the class CSP(gamma)_NP under…
Central limit theorems are established for the sum, over a spatial region, of observations from a linear process on a $d$-dimensional lattice. This region need not be rectangular, but can be irregularly-shaped. Separate results are…