相关论文: 4-Adic Complexity of Interleaved Quaternary Sequen…

A $q$-ary code $C$ of length $n$ is a set of $n$-dimensional vectors (code words) with entries in $\{0, \ldots, q-1\}$. We say $C$ has constant weight $w$ if each code word has exactly $w$ nonzero entries. We say $C$ has minimum distance…

We obtain a characterization on self-orthogonality for a given binary linear code in terms of the number of column vectors in its generator matrix, which extends the result of Bouyukliev et al. (2006). As an application, we give an…

We study the extremal Forrelation problem, where, provided with oracle access to Boolean functions $f$ and $g$ promised to satisfy either $\textrm{forr}(f,g)=1$ or $\textrm{forr}(f,g)=-1$, one must determine (with high probability) which of…

For nonnegative integers $q,n,d$, let $A_q(n,d)$ denote the maximum cardinality of a code of length $n$ over an alphabet $[q]$ with $q$ letters and with minimum distance at least $d$. We consider the following upper bound on $A_q(n,d)$. For…

We propose a $D$-dimensional generalization of $4D$ bi-scalar conformal quantum field theory recently introduced by G\"{u}rdogan and one of the authors as a strong-twist double scaling limit of $\gamma$-deformed $\mathcal{N}=4$ SYM theory.…

We study perturbative aspects of recently proposed integrated four-point correlators in $\mathcal{N}=4$ supersymmetric Yang-Mills with all classical gauge groups using standard Feynman diagram computations. We argue that perturbative…

We compare ordinary and symmetric variants of two classical measures of pseudorandomness for binary sequences, the $2$-adic complexity and the linear complexity. In the periodic setting, we show that for binary periodic sequences…

Many problems in computer science and applied mathematics require rounding a vector $\mathbf{w}$ of fractional values lying in the interval $[0,1]$ to a binary vector $\mathbf{x}$ so that, for a given matrix $\mathbf{A}$,…

We study the constraints imposed by superconformal symmetry, crossing symmetry, and unitarity for theories with four supercharges in spacetime dimension $2\leq d\leq 4$. We show how superconformal algebras with four Poincar\'{e}…

An additive quaternary $[n,k,d]$-code (length $n,$ quaternary dimension $k,$ minimum distance $d$) is a $2k$-dimensional F_2-vector space of $n$-tuples with entries in $Z_2\times Z_2$ (the $2$-dimensional vector space over F_2) with minimum…

Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems and communication systems as they have efficient encoding and decoding algorithms. In this paper, we settle an open problem…

W-algebras are constructed via quantum Hamiltonian reduction associated with a Lie algebra $\mathfrak{g}$ and an $\mathfrak{sl}(2)$-embedding into $\mathfrak{g}$. We derive correspondences among correlation functions of theories having…

The autocorrelation function and the run structure are two basic notions for binary sequences, and have been used as two independent postulates to test randomness of binary sequences ever since Golomb 1955. In this paper, we prove for…

In this paper we study a wide class of planar single-trace four point correlators in the chiral conformal field theory ($\chi$CFT$_4$) arising as a double scaling limit of the $\gamma$-deformed $\mathcal{N}=4$ SYM theory. In the planar…

Let $n_k(s)$ be the maximal length $n$ such that a quaternary additive $[n,k,n-s]_4$-code exists. We solve a natural asymptotic problem by determining the lim sup $\lambda_k$ of $n_k(s)/s,$ and the smallest value of $s$ such that…

Many problems in static program analysis can be modeled as the context-free language (CFL) reachability problem on directed labeled graphs. The CFL reachability problem can be generally solved in time $O(n^3)$, where $n$ is the number of…

The correlation measure is a testimony of the pseudorandomness of a sequence $\infw{s}$ and provides information about the independence of some parts of $\infw{s}$ and their shifts. Combined with the well-distribution measure, a sequence…

We continue our study of the defect CFT on a Maldacena-Wilson line in N=4 Super-Yang-Mills theory using Bootstrability -- the conformal bootstrap supplemented with exact integrability data. In this paper, we extend this program to charged…

The dynamic optimality conjecture, postulating the existence of an $O(1)$-competitive online algorithm for binary search trees (BSTs), is among the most fundamental open problems in dynamic data structures. Despite extensive work and some…

Let $A(n,d)$ (respectively $A(n,d,w)$) be the maximum possible number of codewords in a binary code (respectively binary constant-weight $w$ code) of length $n$ and minimum Hamming distance at least $d$. By adding new linear constraints to…