Related papers: On the strict comparison theorem for $G$-expectati…
We give conditions under which the demand function of a strictly convex preference relation can be constructed.
In this paper, we study the strong convergence of an algorithm to solve the variational inequality problem which extends(Thong et al, Numerical Algorithms. 78, 1045-1060 (2018)). We have reduced and refined some of their algorithm's…
We provide a general construction of time-consistent sublinear expectations on the space of continuous paths. It yields the existence of the conditional G-expectation of a Borel-measurable (rather than quasi-continuous) random variable, a…
We review several theoretical aspects of the Equivalence Principle (EP). We emphasize the unsatisfactory fact that the EP maintains the absolute character of the coupling constants of physics while General Relativity, and its…
We obtain a set of necessary and sufficient conditions for $| \bar{N}, p_{n} |_{k} $ to imply $|\bar{N}, q_{n} |_{s}$ for $1 < k \leq s < \infty$. Using this result we establish several inclusion theorems as well as conditions for the…
We draw attention on the procedure, where Standard Model predictions and experimental results are compared and certain new physics scenarios are ruled out, that requires great attention, since there is still a room for new physics,…
The aim of this work is to illustrate a conditional result involving the exponential sums over primes in short intervals under the assumption that both the Generalized Riemann Hypothesis and the Density Hypothesis for Dirichlet…
The fixed-template constraint satisfaction problem (CSP) can be seen as the problem of deciding whether a given primitive positive first-order sentence is true in a fixed structure (also called model). We study a class of problems that…
Some aspects of $Q$-conditional symmetry and of its connections with reduction and compatibility are discussed.
The complete convergence for weighted sums of sequences of independent, identically distributed random variables under sublinear expectations space was studied. By moment inequality and truncation methods, we establish the equivalent…
In this article the issues are discussed with the Bayesian approach, least-square fits, and most-likely fits. Trying to counter these issues, a method, based on weighted confidence, is proposed for estimating probabilities and other…
This article develops a framework for testing general hypothesis in high-dimensional models where the number of variables may far exceed the number of observations. Existing literature has considered less than a handful of hypotheses, such…
Let $\{X_n;n\ge 1\}$ be a sequence of independent random variables on a probability space $(\Omega, \mathcal{F}, P)$ and $S_n=\sum_{k=1}^n X_k$. It is well-known that the almost sure convergence, the convergence in probability and the…
We develop a complexity theory for approximate real computations. We first produce a theory for exact computations but with condition numbers. The input size depends on a condition number, which is not assumed known by the machine. The…
Cooperation through repetition is an important theme in game theory. In this regard, various celebrated ``folk theorems'' have been proposed for repeated games in increasingly more complex environments. There has, however, been insufficient…
We prove that if $A \subseteq [X, 2X]$ and $B \subseteq [Y, 2Y]$ are sets of integers such that $\gcd(a,b) \geq D$ for at least $\delta |A||B|$ pairs $(a,b) \in A \times B$ then $|A||B| \ll_{\varepsilon} \delta^{-2 - \varepsilon} XY/D^2$.…
We consider subsequences with gap constraints, i.e., length-k subsequences p that can be embedded into a string w such that the induced gaps (i.e., the factors of w between the positions to which p is mapped to) satisfy given gap…
Criteria for defining errors of a physical theory are formulated. It is shown that the Special Theory of Relativity (STR) has a solid mathematical basis. An enormous amount of experiments carried out in particle physics use beams of…
This note presents a unified theorem of the alternative that explicitly allows for any combination of equality, componentwise inequality, weak dominance, strict dominance, and nonnegativity relations. The theorem nests 60 special cases,…
We study the complexity of the model checking problem, for fixed model A, over certain fragments L of first-order logic. These are sometimes known as the expression complexities of L. We obtain various complexity classification theorems for…