Related papers: Simple Laws about Nonprominent Properties of Binar…
Many relationships requiring mutual agreement between pairs of actors produce observable networks that are symmetric and undirected. Nevertheless the unobserved, asymmetric network is often of primary scientific interest. We propose a…
We suggest an optical method which tests a nonclassical feature with a coherent state input. The test is designed with a multiplexer of on/off detectors and post-selection, adopting sub-binomiality as a nonclassical feature, replacing…
We introduce an elementary congruence-based procedure to look for q-th power multiples in arbitrary binary recurrence sequences (q>2). The procedure allows to prove that no such multiples exist in many instances.
Relational data are usually highly incomplete in practice, which inspires us to leverage side information to improve the performance of community detection and link prediction. This paper presents a Bayesian probabilistic approach that…
Suppose that M is countable, binary, primitive, homogeneous, and simple, and hence 1-based. We prove that the SU-rank of the complete theory of M is~1. It follows that M is a random structure. The conclusion that M is a random structure…
Natural numbers satisfying an unusual property are mentioned by the author in [5], in which their infinitude is also proved. In this paper, we start with an arbitrary natural number which is not a multiple of 10 and non-palindromic, form…
The theory of quasirandomness has greatly expanded from its inaugural graph theoretical setting to several different combinatorial objects such as hypergraphs, tournaments, permutations, etc. However, these quasirandomness variants have…
A binary string representation of prime occurrences is a sequence of bits, where $1$ entries encode positions of prime numbers. This is a convenient representation for analysis of prime distribution, since it allows for application of a…
We apply recent ideas about complexity and randomness to the philosophy of laws and chances. We develop two ways to use algorithmic randomness to characterize probabilistic laws of nature. The first, a generative chance* law, employs a…
We study properties of semi-elementary imsets and elementary imsets introduced by Studeny (2005). The rules of the semi-graphoid axiom (decomposition, weak union and contraction) for conditional independence statements can be translated…
These lecture notes provide an introduction to combinatorics on words and its interactions with dynamics, algebra, and arithmetic. The central theme is the notion of low factor complexity for infinite words. We investigate the following…
We investigate properties of families $F$ of subsets of a finite set in a situation where subsets are incomparable by the binary inclusion relation and a) for any $A\notin F$, there is such set $A'\in F$ that either $A\subset A'$ or…
This paper's central theme is to prove the existence of an n-algebra whose multiplication cannot be expressed employing any binary operation. Furthermore, to prove if two algebras are not isomorphic, this property does not hold for…
A unified conceptual foundation of classical and quantum physics is given, free of undefined terms. Ensembles are defined by extending the `probability via expectation' approach of Whittle to noncommuting quantities. This approach carries…
In this paper we show that in systems where the probability distribution of the the overlap is non trivial in the infinity volume limit, the property of ultrametricity can be proved in general starting from two very simple and natural…
Physical laws are strikingly simple, yet there is no a priori reason for them to be so. I propose that nomic realists -- Humeans and non-Humeans -- should recognize simplicity as a fundamental epistemic guide for discovering and evaluating…
The primes or prime polynomials (over finite fields) are supposed to be distributed `irregularly' , despite nice asymptotic or average behavior. We provide some conjectures/guesses/hypotheses with `evidence' of surprising symmetries in…
The classical McKay correspondence for finite subgroups $G$ of $\SL(2,\C)$ gives a bijection between isomorphism classes of nontrivial irreducible representations of $G$ and irreducible components of the exceptional divisor in the minimal…
The unitary $N = 2$ superconformal minimal models have a long history in string theory and mathematical physics, while their non-unitary (and logarithmic) cousins have recently attracted interest from mathematicians. Here, we give an…
We show that it is possible to algorithmically verify if a given pattern sequence is noncorrelated. As an application, we compute that there are exactly $2272$ noncorrelated binary pattern sequences of length $\leq 4$. If we restrict our…