相关论文: Hardinian Arrays
The Online Encyclopedia of Integer Sequences (OEIS) is made up of thousands of numerical sequences considered particularly interesting by some mathematicians. The graphic representation of the frequency with which a number n as a function…
We study the correspondence between Bayesian Networks and graphical representation of proofs in linear logic. The goal of this paper is threefold: to develop a proof-theoretical account of Bayesian inference (in the spirit of the…
We present progress on three old conjectures about longest paths and cycles in graphs. The first pair of conjectures, due to Lov\'{a}sz from 1969 and Thomassen from 1978, respectively, states that all connected vertex-transitive graphs…
For integers $k\geq 1$ and $n\geq 2k+1$, the Kneser graph $K(n,k)$ has as vertices all $k$-element subsets of an $n$-element ground set, and an edge between any two disjoint sets. It has been conjectured since the 1970s that all Kneser…
We give an alternative proof of a recent result by T.D. Browning and A. Haynes (arXiv:1204.6374v1) on multiplicative inverses in sequences of intervals and improve this result under additional conditions on the spacing of these intervals.
Considering homogeneous and oscillating random walks on the integers, we simplify classical works on recurrence of Spitzer and Kemperman, respectively. Some links with renewal theory are discussed.
A de Bruijn sequence of order $k$ over a finite alphabet is a cyclic sequence with the property that it contains every possible $k$-sequence as a substring exactly once. Orthogonal de Bruijn sequences are collections of de Bruijn sequences…
Erd\H{o}s and Szekeres showed that given a permutation $p$ of $[n]$, and the sequence defined by \newline $(p(1), p(2), \ldots, p(n))$, there exists either a decreasing or increasing subsequence, not necessarily contiguous, of length at…
We introduce the notion of recurrence and transience for graphs over non-Archimedean ordered field. To do so we relate these graphs to random walks of directed graphs over the reals. In particular, we give a characterization of the real…
De novo DNA assembly is a fundamental task in Bioinformatics, and finding Eulerian paths on de Bruijn graphs is one of the dominant approaches to it. In most of the cases, there may be no one order for the de Bruijn graph that works well…
The sequence A000975 in OEIS can be defined by $A_1=1$, $A_{n+1}=2A_n$ if $n$ is odd, and $A_{n+1}=2A_n+1$ if $n$ is even. This sequence satisfies other recurrence relations, admits some closed formulas, and is known to enumerate several…
For the OEIS sequence A176677, defined by the quadratic convolution recurrence $a(0) = a(1) = 1$ and $a(n+1) = \sum_{p=0}^n a(p) a(n-p) - 1$ for $n \ge 1$, R.~J.~Mathar contributed in March 2016 the conjectured order-4 P-recursive…
Let $E$ be an elliptic curve over $\mathbf{Q}$. We conjecture asymptotic estimates for the number of vanishings of $L(E,1,\chi)$ as $\chi$ varies over all primitive Dirichlet characters of orders 4 and 6, subject to a mild hypothesis on…
We report a rigorous theory to show the origin of the unexpected periodic behavior seen in the consecutive differences between prime numbers. We also check numerically our findings to ensure that they hold for finite sequences of primes,…
A honeycomb array is an analogue of a Costas array in the hexagonal grid; they were first studied by Golomb and Taylor in 1984. A recent result of Blackburn, Etzion, Martin and Paterson has shown that (in contrast to the situation for…
Recently Kauers, Koutschan and Spahn announced a significant increase in the length of the so-called {\em gerrymander sequence}, given as A348456 in the OEIS, extending the sequence from 3 terms to 7 terms. We give a further extension to 11…
In this article, we give a particular recreational application of the sequence A000533 and A261544 in "The On-line Encyclopedia of Integer Sequences" (OEIS). The recreational application provides a direct extension to "The Repetitious…
We survey some recent results on long-standing conjectures regarding Hamilton cycles in directed graphs, oriented graphs and tournaments. We also combine some of these to prove the following approximate result towards Kelly's conjecture on…
We study two families of sequences, listed in the On-Line Encyclopedia of Integer Sequences (OEIS), which are associated to invariant theory of Lie algebras. For the first family, we prove combinatorially that the sequences A059710 and…
We establish a case of the surprising correlation phenomenon observed in the recent works of He, Lee, Oliver, Pozdnyakov, and Sutherland between Fourier coefficients of families of modular forms and their root numbers.