相关论文: Sequence Pairs with Lowest Combined Autocorrelatio…

We derive explicit upper bounds for the number of nondegenerate critical points of a $k$-component Gaussian mixture density in $\mathbb{R}^d$, and the number of modes when the modal set is finite, together with lower bounds. By normalizing…

We present a stable procedure for defining and measuring the two point angular autocorrelation function, w, of faint (25 < V < 29), barely resolved and unresolved sources in the HST GOODS and UDF datasets. We construct catalogs that include…

The use of empirical characteristic functions for inference problems, including estimation in some special parametric settings and testing for goodness of fit, has a long history dating back to the 70s (see for example, Feuerverger and…

Let $A(n,d)$ be the maximum number of $0,1$ words of length $n$, any two having Hamming distance at least $d$. We prove $A(20,8)=256$, which implies that the quadruply shortened Golay code is optimal. Moreover, we show $A(18,6)\leq 673$,…

Abelian codes and complementary dual codes form important classes of linear codes that have been extensively studied due to their rich algebraic structures and wide applications. In this paper, a family of abelian codes with complementary…

Diestel, et al. (see Order 35 (2017), JCT-A 167 (2019), arXiv:1805.01439) introduced the notion of abstract separation systems that satisfy a submodularity property, and they call this structural submodularity. Williamson, Goemans, Mihail,…

This is a review on subgaussian sequences of random variables, prepared for the Mediterranean Institute for the Mathematical Sciences (MIMS). We first describe the main examples of such sequences. Then we focus on examples coming from the…

We construct a new AdS_4 background in Type IIB supergravity by means of a non-Abelian T-duality transformation on the Type IIA dual of ABJM. The analysis of probe and particle-like branes suggests a dual CFT in which each of the gauge…

The critical exponent $E(\mathbf u)$ of an infinite sequence $\mathbf u$ over a finite alphabet expresses the maximal repetition of a factor in $\mathbf u$. By the famous Dejean's theorem, $E(\mathbf u) \geq 1+\frac1{d-1}$ for every $d$-ary…

Golay complementary pairs (GCPs) and complete complementary codes (CCCs) have found a wide range of practical applications in coding, signal processing and wireless communication due to their ideal correlation properties. In fact, binary…

Mubayi and Verstraete conjectured that if $T$ is a tree on $t + 1$ vertices, then any $n$-vertex graph $G$ with average degree $d$ contains at least \[ n d(d - 1) \cdots (d - t + 1) \] labeled copies of $T$ as long as $d$ is sufficiently…

We study the problem of finding zero-sum blocks in bounded-sum sequences, which was introduced by Caro, Hansberg, and Montejano. Caro et al. determine the minimum $\{-1,1\}$-sequence length for when there exist $k$ consecutive terms that…

Spectrally constrained sequences (SCSs) play an important role in modern communication and radar systems operating over non-contiguous spectrum. Despite numerous research attempts over the past years, very few works are known on the…

We present a general approach to the problem of determining tight asymptotic lower bounds for generalized central moments of the optimal alignment score of two independent sequences of i.i.d. random variables. At first, these are obtained…

A monomial curve $C$ is defined by a sequence of coprime integers $0 = a_0 < a_1 < \cdots < a_k =: d$. One gap of this sequence is $a_{i+1} - a_i - 1$. Gruson--Lazarsfeld--Peskine bound (1983) says that $reg (C) \le d - k +2$, which is…

Ahlswede and Katona (1977) posed the following isodiametric problem in Hamming spaces: For every $n$ and $1\le M\le2^{n}$, determine the minimum average Hamming distance of binary codes with length $n$ and size $M$. Fu, Wei, and Yeung…

Let $G$ be a simple graph with $2n$ vertices and a perfect matching. We denote by $f(G)$ and $F(G)$ the minimum and maximum forcing number of $G$, respectively. Hetyei obtained that the maximum number of edges of graphs $G$ with a unique…

Recently, Gilmer proved the first constant lower bound for the union-closed sets conjecture via an information-theoretic argument. The heart of the argument is an entropic inequality involving the OR function of two i.i.d.\ binary vectors,…

A subset $S$ of the vertices $V$ of a connected graph $G$ resolves $G$ if no two vertices of $V$ share the same list of distances (shortest-path metric) with respect to the vertices of $S$ listed in a given order. The choice of such an $S$…

Motivated by iterative decoding techniques for the binary erasure channel Hollmann and Tolhuizen introduced and studied the notion of generic erasure correcting sets for linear codes. A generic $(r,s)$--erasure correcting set generates for…