Related papers: DeBruijn Strings, Double Helices, and the Ehrenfeu…
Pseudo-Hermitian Hamiltonians have recently become a field of wide investigation. Originally, the Generalized Riesz Systems (GRS) have been introduced as an auxiliary tool in this theory. In contrast, the current paper, GRSs are analysed in…
In this survey we summarize properties of pseudorandomness and non-randomness of some number-theoretic sequences and present results on their behaviour under the following measures of pseudorandomness: balance, linear complexity,…
Methods to apply the spinor helicity technique and string reorganization to multiloop amplitudes using the Feynman- and Schwinger-parameter representations are reviewed and expanded.
In this article, we study random graphs with a given degree sequence $d_1, d_2, \cdots, d_n$ from the configuration model. We show that under mild assumptions of the degree sequence, the spectral distribution of the normalized Laplacian…
Nested (or meta-Fibonacci) recurrences, such as the recurrence used to define Hofstadter's Q-sequence, along with the digit-based recurrences that underlie automatic sequences are of interest from both number-theoretic and combinatorial…
The duality cascade, and its dual description as string theory on the warped deformed conifold, brings together several sophisticated topics, some of which are not widely known. These lectures, which contain a number of previously…
The enhancon mechanism is studied in the heterotic string theory. We consider the N_L=0 winding strings with momentum (NS1-W*) and the Kaluza-Klein dyons (KK5-NS5*). The NS1-W* and KK5-NS5* systems are dualized to the D4-D0* and D6-D2*…
We study the pseudorandomness of automatic sequences in terms of well-distribution and correlation measure of order 2. We detect non-random behavior which can be derived either from the functional equations satisfied by their generating…
Recently Maldacena, Moore, and Seiberg (MMS) have proposed a physical interpretation of the Atiyah-Hirzebruch spectral sequence, which roughly computes the K-homology groups that classify D-branes. We note that in IIB string theory, this…
We introduce the Parikh-de-Bruijn grid, a graph whose vertices are fixed-order Parikh vectors, and whose edges are given by a simple shift operation. This graph gives structural insight into the nature of sets of Parikh vectors as well as…
The focus of this work is to show how to combine Zech's logarithms and each of the cycle joining and cross-join pairing methods to construct binary de Bruijn sequences of any order. A basic implementation is supplied as a proof-of-concept.…
We propose an open/closed string duality in general backgrounds extending previous ideas about open string completeness by Ashoke Sen. Our proposal sets up a general version of holography that works in gravity as a tomographic principle. We…
We develop a new approach to random walks on de Bruijn graphs over the alphabet $A$ through right congruences on $A^k$, defined using the natural right action of $A^+$. A major role is played by special right congruences, which correspond…
We provide a sufficient criterion for the recurrence of spatial random graphs on the real line based on the scarceness of long-edges. In particular, this complements earlier recurrence results obtained by Gracar et al. (Electron. J. Probab.…
The (classical) crosscorrelation is an important measure of pseudorandomness of two binary sequences for applications in communications. The arithmetic crosscorrelation is another figure of merit introduced by Goresky and Klapper…
Let $n$ and $k$ be positive integers, and let $F$ be an alphabet of size $n$. A sequence over $F$ of length $m$ is a \emph{$k$-radius sequence} if any two distinct elements of $F$ occur within distance $k$ of each other somewhere in the…
We investigate the number of permutations that occur in random labellings of trees. This is a generalisation of the number of subpermutations occurring in a random permutation. It also generalises some recent results on the number of…
Advancing the sparse regularity method, we prove one-sided and two-sided regularity inheritance lemmas for subgraphs of bijumbled graphs, improving on results of Conlon, Fox and Zhao [Adv. Math. 256 (2014), 206--290]. These inheritance…
We apply the method of moments to prove a recent conjecture of Haikin, Zamir and Gavish (2017) concerning the distribution of the singular values of random subensembles of Paley equiangular tight frames. Our analysis applies more generally…
The problem of random number generation dates back to von Neumann's work in 1951. Since then, many algorithms have been developed for generating unbiased bits from complex correlated sources as well as for generating arbitrary distributions…