Related papers: Complexity of natural numbers
Recent studies showed that hardness, a complex property, can be calculated using very simple approaches or even analytical formulae. These form the basis for evaluating controversial experimental results (as we illustrate for…
We discuss some aspects of the extension to continuous systems of a statistical measure of complexity introduced by Lopez-Ruiz, Mancini and Calbet (LMC) [Phys. Lett. A 209 (1995) 321]. In general, the extension of a magnitude from the…
We consider a notion of "numerosity" for sets of tuples of natural numbers, that satisfies the five common notions of Euclid's Elements, so it can agree with cardinality only for finite sets. By suitably axiomatizing such a notion, we show…
The goal of this expository article is to present a proof that is as direct and elementary as possible of the fundamental theorem of complex multiplication (Shimura, Taniyama, Langlands, Tate, Deligne et al.). The article is a revision of…
Using the recently developed framework of [Daniely et al, 2014], we show that under a natural assumption on the complexity of refuting random K-SAT formulas, learning DNF formulas is hard. Furthermore, the same assumption implies the…
Within the framework of generalized combinatorial approach, the complexity is determined for infinite set of self-similar hierarchical ensembles. This complexity is shown to increase with strengthening of the hierarchy coupling to the…
We develop new closed form representations of sums of (n + {\alpha})th shifted harmonic numbers and reciprocal binomial coefficients in terms of {\alpha}th shifted harmonic numbers. Some interesting new consequences and illustrative…
This is a 20-year old review on singularities and singularity theorems. The main reason to submit it now is -apart from increasing its availability- to correct a very strange error that appears in the journal's online version: it contains…
We find an abundance of Cremer Julia sets of an arbitrarily high computational complexity.
We collect here various conjectures on congruences made by the author in a series of papers, some of which involve binary quadratic forms and other advanced theories. Part A consists of 100 unsolved conjectures of the author while…
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: randomness and classification. The survey is divided in two parts…
Possible reasons for the uniqueness of the positive geometric law in the context of stability of random extremes are explored here culminating in a conjecture characterizing the geometric law. Our reasoning comes closer in justifying the…
We provide a context around a conjectured closed form for the Hankel transform of linear combinations of consecutive pairs of Catalan numbers. This generalizes the formula for the Hankel transforms of the shifted Catalan numbers and the…
We provide direct elementary proofs of several explicit expressions for Bernoulli numbers and Bernoulli polynomials. As a byproduct of our method of proof, we provide natural definitions for generalized Bernoulli numbers and polynomials of…
The relational complexity, introduced by G. Cherlin, G. Martin, and D. Saracino, is a measure of ultrahomogeneity of a relational structure. It provides an information on minimal arity of additional invariant relations needed to turn given…
We will review some of the theoretical progresses that have been in the study of complex systems in physics and of their applications to biology.
Numerous definitions for complexity have been proposed over the last half century, with little consensus achieved on how to use the term. A definition of complexity is supplied here that is closely related to the Kolmogorov Complexity and…
We explore various combinatorial problems mostly borrowed from physics, that share the property of being continuously or discretely integrable, a feature that guarantees the existence of conservation laws that often make the problems…
The multiplicative theory of a set of numbers (which could be natural, integer, rational, real or complex numbers) is the first-order theory of the structure of that set with (solely) the multiplication operation (that set is taken to be…
In this paper, we prove the conjecture that if there is an odd perfect number, then there are infinitely many of them.