Related papers: Random Sequences from Primitive Pythagorean Triple…
We compute the auto-correlations functions of order $m\ge 1$ for the characteristic polynomials of random matrices from certain subgroups of the unitary groups $\U(2)$ and $\U(3)$ by applying branching rules. These subgroups can be…
Let $p$ be a prime number, and let $S$ be the numerical semigroup generated by the prime numbers not less than $p$. We compare the orders of magnitude of some invariants of $S$ with each other, e. g., the biggest atom $u$ of $S$ with $p$…
We revisit the method of small subgraph conditioning, used to establish that random regular graphs are Hamiltonian a.a.s. We refine this method using new technical machinery for random $d$-regular graphs on $n$ vertices that hold not just…
Integer sequences where each element is determined by a previous randomly chosen element are investigated analytically. In particular, the random geometric series x_n=2x_p with 0<=p<=n-1 is studied. At large n, the moments grow…
In 2009, Grant, Shallit, and Stoll constructed a large family of pseudorandom sequences, called generalized Rudin--Shapiro sequences, for which they established some results about the average of discrete correlation coefficients of order 2…
The article describes the structural and algorithmic relations between Cartesian trees and Lyndon Trees. This leads to a uniform presentation of the Lyndon table of a word corresponding to the Next Nearest Smaller table of a sequence of…
Given positive integers $p$ and $m$, where $p$ is assumed to be an odd prime, we determine the automorphism groups of $p$-groups $J$, $H$, and $K$ of orders $p^{7m}$, $p^{6m}$, and $p^{5m}$, and nilpotency classes 5, 4, and 3, respectively,…
Let $G$ be a finite group and let $N$ be a normal subgroup of $G$. We attach to $N$ two graphs ${\Gamma}_G(N)$ and ${\Gamma}^{\ast}_G(N)$ related to the conjugacy classes of $G$ contained in $N$ and to the set of primes dividing the sizes…
We introduce several new constructions for perfect periodic autocorrelation sequences and arrays over the unit quaternions. This paper uses both mathematical proofs and com- puter experiments to prove the (bounded) array constructions have…
A linking system of difference sets is a collection of mutually related group difference sets, whose advantageous properties have been used to extend classical constructions of systems of linked symmetric designs. The central problems are…
We identify pairs of positive integers $(t, d)$ with the property that the integer sequence with general term $\lfloor{n^t/d\rfloor}$ contains at most finitely many primes.
In the present work, we exhibit a class of self-descriptive sequences that can be explicitly computed and whose frequencies are known. In particular, as a corollary of our main result, we prove that the sequence introduced in \citeBJM23 has…
Binary sequences with optimal autocorrelation and large linear complexity have important applications in cryptography and communications. Very recently, a class of binary sequences of period $4p$ with optimal autocorrelation was proposed…
We introduce a new class of deterministic networks by associating networks with Diophantine equations, thus relating network topology to algebraic properties. The network is formed by representing integers as vertices and by drawing cliques…
A graph G is an NG-graph if \chi(G) + \chi(G complement) = |V(G)| + 1. We characterize NG-graphs solely from degree sequences leading to a linear-time recognition algorithm. We also explore the connections between NG-graphs and split…
We classify the connected graphs with precisely three distinct eigenvalues and second largest eigenvalue at most 1.
In this article, we study the class of PPT blocks. We introduce several inequalities, related to this class, with an emphasis on comparing the main diagonal and the off-diagonal components of a 2 by 2 PPT block.
Consider the d-dimensional lattice Z^d where each vertex is ``open'' or ``closed'' with probability p or 1-p, respectively. An open vertex v is connected by an edge to the closest open vertex w such that the dth co-ordinates of v and w…
We give a complete classification of torsion pairs in the cluster category of Dynkin type D_n, via a bijection to new combinatorial objects called Ptolemy diagrams of type D. For the latter we give along the way different combinatorial…
In our recent work we described conditions under which a multi-parameter random simplicial complex is connected and simply connected. We showed that the Betti numbers of multi-parameter random simplicial complexes in one specific dimension…