Related papers: The resolution of Niho's last conjecture concernin…

We design the first efficient algorithms and prove new combinatorial bounds for list decoding tensor products of codes and interleaved codes. We show that for {\em every} code, the ratio of its list decoding radius to its minimum distance…

We extend the notion of consecutive pattern avoidance to considering sums over all permutations where each term is a product of weights depending on each consecutive pattern of a fixed length. We study the problem of finding the asymptotics…

We interpret the recently observed excess in diphoton invariant mass as a new spin-0 resonant particle. On the theoretical ground, an interesting question is whether this new scalar resonance belongs to a strongly coupled sector or a…

We prove the existence as well as regularity of a finite range decomposition for the resolvent $G_{\alpha} (x-y,m^2) = ((-\Delta)^{\alpha\over 2} + m^{2})^{-1} (x-y) $, for $0<\alpha<2$ and all real $m$, in the lattice ${\mathbf Z}^{d}$ as…

The classical Weisfeiler-Lehman method WL[2] uses edge colors to produce a powerful graph invariant. It is at least as powerful in its ability to distinguish non-isomorphic graphs as the most prominent algebraic graph invariants. It…

This paper analyzes the structure of the set of nodal solutions of a class of one-dimensional superlinear indefinite boundary values problems with an indefinite weight functions in front of the spectral parameter. Quite astonishingly, the…

For piecewise-smooth differential systems, in this paper we focus on crossing limit cycles and sliding loops bifurcating from a grazing loop connecting one high multiplicity tangent point. For the low multiplicity cases considered in…

We give a first polynomial-time algorithm for (Weighted) Feedback Vertex Set on graphs of bounded maximum induced matching width (mim-width). Explicitly, given a branch decomposition of mim-width $w$, we give an $n^{\mathcal{O}(w)}$-time…

The document tries to put focus on sequences with certain properties and periods leading to the first value smaller than the starting value in the Collatz problem. With the idea that, if all starting numbers lead ultimately to a smaller…

We study the decay of fundamental string loops of arbitrary size L/min(n,m)>>\sqrt{\alpha'}, labelled by (n,m;\lambda_n,\bar{\lambda}_m), where n,m correspond to left- and right-mover harmonics and \lambda_n,\bar{\lambda}_m to polarisation…

We derive bifurcation test equations for A-series singularities of nonlinear functionals and, based on these equations, we propose a numerical method for detecting high codimensional bifurcations in parameter-dependent PDEs such as…

A classical theorem of Wendroff shows that one may reconstructs a sequence of orthogonal polynomials on the real line from two non-constant polynomials of consecutive degrees whose zeros strictly interlace on the real line. In this note we…

Given a permutation w, we look at the range of how often a simple reflection s_k appears in reduced decompositions of w. We compute the minimum and give a sharp upper bound on the maximum. That bound is in terms of 321- and 3412-patterns in…

Supersymmetry and R-symmetry Ward identities relate on-shell amplitudes in a supersymmetric field theory. We solve these Ward identities for (Next-to)^K MHV amplitudes of the maximally supersymmetric N=4 and N=8 theories. The resulting…

We consider recursive decoding techniques for RM codes, their subcodes, and newly designed codes. For moderate lengths up to 512, we obtain near-optimum decoding with feasible complexity.

The size of the Hamming distance spectrum of a code has received great attention in recent research. The main objective of this paper is to extend these significant theories to the $b$-symbol distance spectrum. We examine this question for…

We study $N$-cluster correlation functions in four- and five-dimensional (4D, 5D) bond percolation by extensive Monte Carlo simulation. We reformulate the transfer Monte Carlo algorithm for percolation [Phys. Rev. E {\bf 72}, 016126 (2005)]…

The non-commutative version of the euclidean $g^2\phi^4$ theory is considered. By using Wilsonian flow equations the ultraviolet renormalizability can be proved to all orders in perturbation theory. On the other hand, the infrared sector…

Low correlation (finite length) sequences are used in communications and remote sensing. One seeks codebooks of sequences in which each sequence has low aperiodic autocorrelation at all nonzero shifts, and each pair of distinct sequences…

We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence…