Related papers: 4-Adic Complexity of Interleaved Quaternary Sequen…
The classical Fibonacci sequence is known to exhibit many fascinating properties. In this paper, we explore the Fibonacci sequence and integer sequences generated by second order linear recurrence relations with positive integer…
We establish decidability for the infinitely many axiomatic extensions of the commutative Full Lambek logic with weakening FLew (i.e. IMALLW) that have a cut-free hypersequent proof calculus (specifically: every analytic structural rule…
We study an abstract optimization problem arising from biomolecular sequence analysis. For a sequence A of pairs (a_i,w_i) for i = 1,..,n and w_i>0, a segment A(i,j) is a consecutive subsequence of A starting with index i and ending with…
The identification of binary sequences with large merit factor (small mean-squared aperiodic autocorrelation) is an old problem of complex analysis and combinatorial optimization, with practical importance in digital communications…
Recent advancements have established self-intercalation as a powerful technique for manipulating quantum material properties, with precisely controllable intercalation concentrations. Given the inherently rich phase diagrams of transition…
The sizes of optimal constant-composition codes of weight three have been determined by Chee, Ge and Ling with four cases in doubt. Group divisible codes played an important role in their constructions. In this paper, we study the problem…
We propose a six-dimensional regularization of four dimensional chiral gauge theories. We consider a massive Dirac fermion in six dimensions with two different operators having domain-wall profiles in the fifth and the sixth directions,…
We continue to investigate binary sequence $(f_u)$ over $\{0,1\}$ defined by $(-1)^{f_u}=\left(\frac{(u^w-u^{wp})/p}{p}\right)$ for integers $u\ge 0$, where $\left(\frac{\cdot}{p}\right)$ is the Legendre symbol and we restrict…
Kayal, Saha and Tavenas [Theory of Computing, 2018] showed that for all large enough integers $n$ and $d$ such that $d\geq \omega(\log{n})$, any syntactic depth four circuit of bounded individual degree $\delta = o(d)$ that computes the…
Mimicking pristine 2D graphene, we revisit the BBTW model for 4D lattice QCD given in ref.[5] by using the hidden SU(5) symmetry of the 4D hyperdiamond lattice H_4. We first study the link between the H_4 and SU(5); then we refine the BBTW…
We provide a randomized linear time approximation scheme for a generic problem about clustering of binary vectors subject to additional constrains. The new constrained clustering problem encompasses a number of problems and by solving it,…
We compute $1/\lambda$ corrections to the four-point functions of half-BPS operators in $SU(N)$ $\mathcal{N}=4$ super-Yang-Mills theory at large $N$ and large 't Hooft coupling $\lambda=g_\text{YM}^2 N$ using two methods. Firstly, we relate…
We present a new fast Chase decoding algorithm for binary BCH codes. The new algorithm reduces the complexity in comparison to a recent fast Chase decoding algorithm for Reed--Solomon (RS) codes by the authors (IEEE Trans. IT, 2022), by…
A matching is a set of edges in a graph with no common endpoint. A matching M is called acyclic if the induced subgraph on the endpoints of the edges in M is acyclic. Given a graph G and an integer k, Acyclic Matching Problem seeks for an…
We show that a number of conditions on oriented graphs, all of which are satisfied with high probability by randomly oriented graphs, are equivalent. These equivalences are similar to those given by Chung, Graham and Wilson in the case of…
Conformal field theory (CFT) plays a key role in modern theoretical physics. Through CFT we describe real physical systems at criticality and fixed points of the renormalization group flow. It is also central in the study of quantum…
We derive refined entropy upper bounds for $q$-ary $B_2$ codes by exploiting the Fourier structure of the i.i.d. difference distribution $D=X-Y$. Since the pmf of $D$ is an autocorrelation, its Fourier series is a nonnegative trigonometric…
To every automorphism w of an infinite rooted regular binary tree we associate a two variable generating function \Phi_w that encodes information on the orbit structure of w. We prove that this is a rational function if w can be described…
For a family $\mathcal{F}$ of graphs, let $ex(n,\mathcal{F})$ denote the maximum number of edges in an $n$-vertex graph which contains none of the members of $\mathcal{F}$ as a subgraph. A longstanding problem in extremal graph theory asks…
When the $SU(N)$ ${\cal N} = 4$ super-Yang-Mills (SYM) theory with complexified gauge coupling $\tau$ is placed on a round four-sphere and deformed by an ${\cal N} = 2$-preserving mass parameter $m$, its free energy $F(m, \tau, \bar \tau)$…