Related papers: There are no Coincidences
Although 10^230 terms of Recaman's sequence have been computed, it remains a mystery. Here three distant cousins of that sequence are described, one of which is also mysterious. (i) {A(n), n >= 3} is defined as follows. Start with n, and…
In this paper we study the sequences defined by the last and the last non-zero digits of $n^n$ in base $b$. For the sequence given by the last digits of $n^n$ in base $b$, we prove its periodicity using different techniques than those used…
We prove some symmetric $q$-congruences.
In this paper, we pose many challenging conjectures on congruences involving binomial coefficients and Ap\'ery-like numbers.
We propose a natural, bivariate, generalization of the nonsingular similarity relations considered by T. Fine. We also provide an enumeration formulae and a generating tree for those relations. The latter allow us to give a new bijection…
We give an analogy between non-reversible Markov chains and electric networks much in the flavour of the classical reversible results originating from Kakutani, and later Kem\'eny-Snell-Knapp and Kelly. Non-reversibility is made possible by…
We introduce GSimCNN (Graph Similarity Computation via Convolutional Neural Networks) for predicting the similarity score between two graphs. As the core operation of graph similarity search, pairwise graph similarity computation is a…
New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…
We give recurrence relations for the enumeration of symmetric elements within four classes of arc diagrams corresponding to certain involutions and set partitions whose blocks contain no consecutive integers. These arc diagrams are…
We present a set of generators for the symplectic group which is different from the well-known set of transvections, from which the chain equivalence for quadratic forms in characteristic 2 is an immediate result. Based on the chain…
The purpose of this memoir is to discuss two very interesting properties of integer sequences. One is the law of apparition and the other is the law of repetition. Both have been extensively studied by mathematicians such as Ward, Lucas,…
In a celebrated work by Hoeffding [J. Amer. Statist. Assoc. 58 (1963) 13-30], several inequalities for tail probabilities of sums M_n=X_1+... +X_n of bounded independent random variables X_j were proved. These inequalities had a…
An arrangement of pseudocircles $\mathcal{A}$ is a collection of Jordan curves in the plane that pairwise intersect (transversally) at exactly two points. How many non-equivalent links have $\mathcal{A}$ as their shadow? Motivated by this…
F-ABC is introduced, using universal sufficient statistics, unlike previous ABC papers, e.g. Bernton et al. (2019), and avoiding in the approximate posterior artifacts due to a Kernel. The nature of matching tolerance is examined and…
Measuring quantum states provides means to generate genuine random numbers. It has been shown that genuine randomness can be obtained even with an uncharacterized quantum source. In this work, we propose a framework that formalizes the idea…
In this paper, we extend recent results about the distribution of even and odd gaps of a numerical semigroup. We find that, for any numerical semigroup, the distribution can be computed in terms of the numbers of or the sums of odd and even…
Contextuality is one way of capturing the non-classicality of quantum theory. The contextual nature of a theory is often witnessed via the violation of non-contextuality inequalities---certain linear inequalities involving probabilities of…
Following a paper in which the fundamental aspects of probabilistic inference were introduced by means of a toy experiment, details of the analysis of simulated long sequences of extractions are shown here. In fact, the striking performance…
This is survey of some recent results connecting random matrices, non-colliding processes and queues.
While it is trivial to multiply two C-finite sequences (just like integers), it is not quite so trivial to "factorize" them, or to decide whether they are "prime". The former is plain linear algebra, while the latter is heavy-duty…