Related papers: Sequence Pairs with Lowest Combined Autocorrelatio…
In this article we study the pair correlation statistic for higher dimensional sequences. We show that for any $d\geq 2$, strictly increasing sequences $(a_n^{(1)}),\ldots, (a_n^{(d)})$ of natural numbers have metric Poissonian pair…
A Barker sequence is a binary sequence for which all nontrivial aperiodic autocorrelations are either 0, 1 or -1. The only known Barker sequences have length 2, 3, 4, 5, 7, 11 or 13. It is an old conjecture that no longer Barker sequences…
Let $(x_n)_{n=1}^{\infty}$ be a sequence on the torus $\mathbb{T}$ (normalized to length 1). A sequence $(x_n)$ is said to have Poissonian pair correlation if, for all $s>0$, $$ \lim_{N \rightarrow \infty}{ \frac{1}{N} \# \left\{ 1 \leq m…
The generalized cyclotomic binary sequences $S=S(a, b, c)$ with period $n=pq$ have good autocorrelation property where $(a, b, c)\in \{0, 1\}^3$ and $p, q$ are distinct odd primes. For some cases, the sequences $S$ have ideal or optimal…
We study boundary non-crossing probabilities $$ P_{f,u} := \mathrm P\big(\forall t\in \mathbb T\ X_t + f(t)\le u(t)\big) $$ for continuous centered Gaussian process $X$ indexed by some arbitrary compact separable metric space $\mathbb T$.…
Let $p$ be an odd prime such that $p \equiv 3\;{\rm mod}\;4$ and $n$ be an odd integer. In this paper, two new families of $p$-ary sequences of period $N = \frac{p^n-1}{2}$ are constructed by two decimated $p$-ary m-sequences $m(2t)$ and…
Via interleaving Ding-Helleseth-Lam sequences, a class of binary sequences of period $4p$ with optimal autocorrelation magnitude was constructed in \cite{W. Su}. Later, Fan showed that the linear complexity of this class of sequences is…
Two families $\mathcal{F}$ and $\mathcal{G}$ are called cross-intersecting if for every $F\in \mathcal{F}$ and $G\in \mathcal{G}$, the intersection $F\cap G$ is non-empty. It is significant to determine the maximum sum of sizes of…
We introduce a two-parameter family of discrepancy measures, termed \emph{$(G,f)$-divergences}, obtained by applying a non-decreasing function $G$ to an $f$-divergence $D_f$. Building on Csisz\'ar's formulation of mutual $f$-information, we…
Spread spectrum multiple access systems demand minimum possible cross-correlation between the sequences within a set of sequences having good auto-correlation properties. Through a connection between generalised Frank sequences and…
We investigate the Hausdorff measure and content on a class of quasi self-similar sets that include, for example, graph-directed and sub self-similar and self-conformal sets. We show that any Hausdorff measurable subset of such a set has…
Baader, J\"org, and Parlier recently established an upper bound for the crossing number of curve systems of size $m\asymp g^{1+\alpha}$ on a genus $g$ surface, obtaining a leading coefficient of $9/4=2.25$. Their construction relies on…
For nonnegative integers $n,d,w$, let $A(n,d,w)$ be the maximum size of a code $C \subseteq \mathbb{F}_2^n$ with constant weight $w$ and minimum distance at least $d$. We consider two semidefinite programs based on quadruples of code words…
We study the $q$-analogue of the average of Montgomery's function $F(\alpha, T)$ over bounded intervals. Assuming the Generalized Riemann Hypothesis for Dirichlet $L$-functions, we obtain upper and lower bounds for this average over an…
In this article, we address the lower bounds for the sums $a_f(p)+a_g(p)$ of the $p$-th Fourier coefficients of two twist-inequivalent, non-CM normalized newforms $f$ and $g$. Our main result shows that for such forms with integer Fourier…
In this paper we present various lower bound results on collective tree spanners and on spanners of bounded treewidth. A graph $G$ is said to admit a system of $\mu$ collective additive tree $c$-spanners if there is a system $\cal{T}$$(G)$…
In the Correlation Clustering problem, we are given a weighted graph $G$ with its edges labeled as "similar" or "dissimilar" by a binary classifier. The goal is to produce a clustering that minimizes the weight of "disagreements": the sum…
Golay sequences are well suited for the use as codewords in orthogonal frequency-division multiplexing (OFDM), since their peak-to-mean envelope power ratio (PMEPR) in q-ary phase-shift keying (PSK) modulation is at most 2. It is known that…
A general construction of binary sequences with low autocorrelation are considered in the paper. Based on recent progresses about this topic and this construction, several classes of binary sequences with optimal autocorrelation and other…
Quantifying the strength of functional dependence between random scalars $X$ and $Y$ is an important statistical problem. While many existing correlation coefficients excel in identifying linear or monotone functional dependence, they fall…