Related papers: The resolution of Niho's last conjecture concernin…
For a linear Hamming metric code of length n over a finite field, the number of distinct weights of its codewords is at most n. The codes achieving the equality in the above bound were called full weight spectrum codes. In this paper we…
We present a full two-loop O(g^6) perturbative field theoretic calculation of the expectation value of two circular Maldacena-Wilson loops in D=4 N=4 supersymmetric U(N) gauge theory. It is demonstrated that, after taking into account very…
In the neighbourhood of the critical point, the correlation length of the spin-spin correlation function of the two-dimensional Ising model diverges. The correlation function permits a scaling limit in which the separation $N$ between spins…
In rigidly supersymmetric quantum theories, the Nicolai map allows one to turn on a coupling constant (from zero to a finite value) by keeping the (free) functional integration measure but subjecting the fields to a particular nonlocal and…
In this paper, we present an alternative proof showing that the maximal aperiodic autocorrelation of the $m$-th Rudin-Shapiro sequence is of the same order as $\lambda^{m}$, where $\lambda$ is the real root of $x^{3} + x^{2} - 2x - 4$. This…
Connection coefficient formulas for special functions describe change of basis matrices under a parameter change, for bases formed by the special functions. Such formulas are related to branching questions in representation theory. The…
We prove the sufficiency of the Linear Superposition Principle for linear trees, which characterizes the spectra achievable by a real symmetric matrix whose underlying graph is a linear tree. The necessity was previously proven in 2014.…
We prove a formula for the involutive concordance invariants of the cabled knots in terms of that of the companion knot and the pattern knot. As a consequence, we show that any iterated cable of a knot with parameters of the form (odd,1) is…
Using equivalencies between different models we reduce the model of two spin-1/2 Heisenberg chains crossed at one point to the model of free fermions. The spin-spin correlation function is calculated by summing the perturbation series in…
A necklace can be considered as a cyclic list of $n$ red and $n$ blue beads in an arbitrary order, and the goal is to fold it into two and find a large cross-free matching of pairs of beads of different colors. We give a counterexample for…
Bond percolation on infinite heavy-tailed power-law random networks lacks a proper phase transition; or one may say, there is a phase transition at {\em zero percolation probability}. Nevertheless, a finite size percolation threshold…
Using a standard definition of fractional powers on the universal cover $\exp:S\to \mathbb{C}^*$ seen as an infinite helicoid embedded in $\mathbb{R}^3$, we study the statistics of pairs from the countable family $\{n^\alpha \, : \, n \in…
Motivated by the search for an appropriate notion of a cluster superalgebra, incorporating Grassmann variables, Ovsienko and Tabachnikov considered the extension of various recurrence relations with the Laurent phenomenon to the ring of…
Wilson loops with lightlike polygonal contours have been conjectured to be equivalent to MHV scattering amplitudes in N=4 super Yang-Mills. We compute such Wilson loops for special polygonal contours at two loops in perturbation theory.…
We determine the spectrum and correlation functions of Liouville theory with a central charge less than (or equal) one. This completes the definition of Liouville theory for all complex values of the central charge. The spectrum is always…
Newton iteration (NI) is an almost 350 years old recursive formula that approximates a simple root of a polynomial quite rapidly. We generalize it to a matrix recurrence (allRootsNI) that approximates all the roots simultaneously. In this…
We introduce a formula for determining the number of codewords of weight 2 in cyclic codes and provide results related to the count of codewords with weight 3. Additionally, we establish a recursive relationship for binary cyclic codes that…
In this paper we study the phenomenon of nonlinear supratransmission in a semi-infinite discrete chain of coupled oscillators described by modified sine-Gordon equations with constant external and internal damping, and subject to harmonic…
N-Point Correlation Functions, usually with N = 2, 3, and their Fourier-space analogs power spectrum and bispectrum, are major tools used in cosmology to capture the clustering of large-scale structure. We outline how the clustering these…
The Collatz Conjecture can be stated as: using the reduced Collatz function $C(n) = (3n+1)/2^x$ where $2^x$ is the largest power of 2 that divides $3n+1$, any odd integer $n$ will eventually reach 1 in $j$ iterations such that $C^j(n) = 1$.…