Related papers: Hardinian Arrays
Link prediction, or the inference of future or missing connections between entities, is a well-studied problem in network analysis. A multitude of heuristics exist for link prediction in ordinary networks with a single type of connection.…
This short note answers a question raised by Nathanson \cite{Nath25} about "races" between iterated sumsets. We prove that for any integer $n$, there are finite sets of integers $A$ and $B$ with same diameter such that the signs of the…
In this paper, we generalize the embedded homology groups of hypergraphs initially given in [S. Bressan, J. Li, S. Ren, and J. Wu, The embedded homology of hypergraphs and applications, Asian J. Math. 23(3)(2019) 479-500] and study the…
We introduce the notions of $\tau$-exceptional and signed $\tau$-exceptional sequences for any finite dimensional algebra. We prove that for a fixed algebra of rank $n$, and for any positive integer $t \leq n$, there is a bijection between…
The celebrated K\H{o}v\'ari-S\'os-Tur\'an theorem states that any $n$-vertex graph containing no copy of the complete bipartite graph $K_{s,s}$ has at most $O_s(n^{2-1/s})$ edges. In the past two decades, motivated by the applications in…
Canonical orderings [STOC'88, FOCS'92] have been used as a key tool in graph drawing, graph encoding and visibility representations for the last decades. We study a far-reaching generalization of canonical orderings to non-planar graphs…
We prove a recent conjecture of Sean A. Irvine about a nonlinear recurrence, using mechanized guessing and verification. The theorem-prover Walnut plays a large role in the proof.
We present a new proof of the existence of Morley sequences in simple theories. We avoid using the Erd\H{o}s-Rado theorem and instead use only Ramsey's theorem and compactness. The proof shows that the basic theory of forking in simple…
Nous d\'ecrivons quelques r\'esultats r\'ecents sur la suite de Thue-Morse, ainsi que des questions ou conjectures, dont l'une, due \`a Shevelev, est r\'esolue dans cet article. We describe some recent results on the Thue-Morse sequence. We…
We introduce the concept of an infinite cochain sequence and initiate a theory of homological algebra for them. We show how these sequences simplify and improve the construction of infinite coclass families (as introduced by Eick and…
Inspired by a recent preprint of N. Curien, we provided what may be a new and elementary proof of the Law of Large Numbers.
An ordered graph is a graph together with a linear order on its vertices. A hereditary property of ordered graphs is a collection of ordered graphs closed under taking induced ordered subgraphs. If P is a property of ordered graphs, then…
Ideas of Kn\"odel and B\"ohm-Hornik about walks in certain graphs, resembling the classical symmetric random walk on the integers, are combined. All the relevant generating functions (although occasionally quite involved) are made fully…
The starting point is the known fact that some much-studied random walks on permutations, such as the Tsetlin library, arise from walks on real hyperplane arrangements. This paper explores similar walks on complex hyperplane arrangements.…
We introduce a new family of hyperplane arrangements inspired by the homogenized Linial arrangement (which was recently introduced by Hetyei), and show that the intersection lattices of these arrangements are isomorphic to the bond lattices…
In this article we apply an L-system to prove a recurrence formula for the length of the boundary of iterands of the well known Harter-Heighway dragon curve, a space filling curve with fractal boundary. This leads to finding formulas for…
We study random walks on the integers mod $G_n$ that are determined by an integer sequence $\{ G_n \}_{n \geq 1}$ generated by a linear recurrence relation. Fourier analysis provides explicit formulas to compute the eigenvalues of the…
In the context of a random walk on an undirected graph, Kemeny's constant can measure the average travel time for a random walk between two randomly chosen vertices. We are interested in graphs that behave counter-intuitively in regard to…
For odd n, the alternating group on n elements is generated by the permutations that jump an element from any odd position to position 1. We prove Hamiltonicity of the associated directed Cayley graph for all odd n not equal to 5. (A result…
A famous conjecture of P\'osa from 1962 asserts that every graph on $n$ vertices and with minimum degree at least $2n/3$ contains the square of a Hamilton cycle. The conjecture was proven for large graphs in 1996 by Koml\'os, S\'ark\"ozy…