Related papers: Improving the Space-Bounded Version of Muchnik's C…

Many randomized algorithms can be derandomized efficiently using either the method of conditional expectations or probability spaces with low (almost-) independence. A series of papers, beginning with Luby (1993) and continuing with Berger…

An alternative treatment is proposed for the calculations carried out within the frame of Nikiforov-Uvarov method, which removes a drawback in the original theory and by pass some difficulties in solving the Schrodinger equation. The…

This paper presents an algorithm, Voted Kernel Regularization , that provides the flexibility of using potentially very complex kernel functions such as predictors based on much higher-degree polynomial kernels, while benefitting from…

We consider a class of optimization problems that involve determining the maximum value that a function in a particular class can attain subject to a collection of difference constraints. We show that a particular linear programming…

This work proposes an adaptive structure-preserving model order reduction method for finite-dimensional parametrized Hamiltonian systems modeling non-dissipative phenomena. To overcome the slowly decaying Kolmogorov width typical of…

In this paper, we address the problem of constructing a uniform probability measure on $\mathbb{N}$. Of course, this is not possible within the bounds of the Kolmogorov axioms and we have to violate at least one axiom. We define a…

We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.

We prove multiplier theorems on rank one noncompact symmetric spaces which improve aspects of existing results. A common theme of our main results is that we partially drop specific assumptions on the multiplier function such as a…

In a recent paper Lima, Panario and Wang have provided a new method to multiply polynomials in Chebyshev basis which aims at reducing the total number of multiplication when polynomials have small degree. Their idea is to use Karatsuba's…

We study weighted Chebyshev polynomials on compact subsets of the complex plane with respect to a bounded weight function. We establish existence and uniqueness of weighted Chebyshev polynomials and derive weighted analogs of Kolmogorov's…

Geometry of sparse systems of polynomial equations (i.e. the ones with prescribed monomials and generic coefficients) is well studied in terms of their Newton polytopes. The results of this study are colloquially known as the…

The orthocomplemented modular lattice of subspaces L[H(d)], of a quantum system with d- dimensional Hilbert space H(d), is considered. A generalized additivity relation which holds for Kolmogorov probabilities, is violated by quantum…

The underlying probabilistic theory for quantum mechanics is non-Kolmogorovian. The order in which physical observables will be important if they are incompatible (non-commuting). In particular, the notion of conditioning needs to be…

For a broad class of input-output maps, arguments based on the coding theorem from algorithmic information theory (AIT) predict that simple (low Kolmogorov complexity) outputs are exponentially more likely to occur upon uniform random…

We show the existence of rigid combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, $t$-designs, and $t$-wise…

Parameterized complexity allows us to analyze the time complexity of problems with respect to a natural parameter depending on the problem. Reoptimization looks for solutions or approximations for problem instances when given solutions to…

In this paper, the improvement about the generalized Kolmogorov-type three series theorem, in the case of NQD random variables, is obtained by different method. Furthermore, the generalized Kolmogorov-type three series theorem is…

The aim of this article is to promote the use of probabilistic methods in the study of problems in mathematical general relativity. Two new and simple singularity theorems, whose features are different from the classical singularity…

This paper proposes new notions of polynomial depth (called monotone poly depth), based on a polynomial version of monotone Kolmogorov complexity. We show that monotone poly depth satisfies all desirable properties of depth notions i.e.,…

We obtain a generalization of the ABC Theorem on locally nilpotent derivations to the case of the polynomials with m monomials such that each variable is included just in one monomial. As applications of this result we provide some…