Related papers: Random Sequences from Primitive Pythagorean Triple…

The paper considers the problem of finding the largest possible set P(n), a subset of the set N of the natural numbers, with the property that a number is in P(n) if and only if it is a sum of n distinct naturals all in P(n) or none in…

We comment on old and new results related to the destruction of a random recursive tree (RRT), in which its edges are cut one after the other in a uniform random order. In particular, we study the number of steps needed to isolate or…

If P is a point inside triangle ABC, then the cevians through P divide triangle ABC into six smaller triangles. We give theorems about the relationship between the radii of the circles inscribed in these triangles.

Given a prime number $p$, the study of divisibility properties of a sequence $c(n)$ has two contending approaches: $p$-adic valuations and superconcongruences. The former searches for the highest power of $p$ dividing $c(n)$, for each $n$;…

We consider some natural sets of real numbers arising in ergodic theory and show that they are, respectively, complete in the classes $\mathcal D_2 (\mathbf\Pi^0_3)$ and $\mathcal D_\omega (\mathbf \Pi^0_3)$, that is, the class of sets…

We studied two probabilistic models of the distribution of primes in the natural number [1].The paper considers the third probabilistic model of the distribution of primes in the natural number. The author proved that the results obtained…

We give a complete list of all the 70 class two groups of exponent p (p>2) and order p^k for k<9. For each of these groups the number of conjugacy classes is a polynomial in p, and the order of the automorphism group is a polynomial in p.…

Sequences with low auto-correlation property have been applied in code-division multiple access communication systems, radar and cryptography. Using the inverse Gray mapping, a quaternary sequence of even length $N$ can be obtained from two…

We investigate the possibility to separate the bisimulation-invariant fragment of P from that of NP, resp. PSPACE. We build on Otto's Theorem stating that the bisimulation-invariant queries in P are exactly those that are definable in the…

Let us call a simple graph on $n\geq 2$ vertices a prime gap graph if its vertex degrees are $1$ and the first $n-1$ prime gaps. We show that such a graph exists for every large $n$, and in fact for every $n\geq 2$ if we assume the Riemann…

The correlation measure is a testimony of the pseudorandomness of a sequence $\infw{s}$ and provides information about the independence of some parts of $\infw{s}$ and their shifts. Combined with the well-distribution measure, a sequence…

Binary $m$-sequences are ones with the largest period $n=2^m-1$ among the binary sequences produced by linear shift registers with length $m$. They have a wide range of applications in communication since they have several desirable…

We describe how the reversion of a series is related to convolutional recurrence relations for the series, and we place this relationship in the context of Riordan arrays. As an example of the approach, we give new recurrence relations for…

The Probability Ranking Principle states that the document set with the highest values of probability of relevance optimizes information retrieval effectiveness given the probabilities are estimated as accurately as possible. The key point…

Probabilities in the multiverse can be calculated by assuming that we are typical representatives in a given reference class. But is this class well defined? What should be included in the ensemble in which we are supposed to be typical?…

We prove that in a random tournament the events $\{s\rightarrow a\}$ and $\{t\rightarrow b\}$ are positively correlated, for distinct vertices $a,s,b,t \in K_n.$ It is also proven that the correlation between the events $\{s\rightarrow a\}$…

Statistical properties of random cross-correlated sequences constructed by the convolution method (likewise referred to as the Rice's or the inverse Fourier transformation) are examined. Algorithms for their generation are discussed. They…

We show that the largest character degree of an alternating group $A_n$ with $n\geq 5$ can be bounded in terms of smaller degrees in the sense that \[ b(A_n)^2<\sum_{\psi\in\textrm{Irr}(A_n),\,\psi(1)< b(A_n)}\psi(1)^2, \] where…

Since their appearance in the 1950s, computational models capable of performing probabilistic choices have received wide attention and are nowadays pervasive in almost every areas of computer science. Their development was also inextricably…

We introduce a novel class of rotation invariants of two dimensional curves based on iterated integrals. The invariants we present are in some sense complete and we describe an algorithm to calculate them, giving explicit computations up to…