Related papers: The resolution of Niho's last conjecture concernin…
In this paper, we proposed an interesting problem that might be classified into enumerative combinatorics. Featuring a distinctive two-fold dependence upon the sequences' terms, our problem can be really difficult, which calls for novel…
In an effort to understand the physical implications of the newly discovered non-trivial directions in scalar field theory, we compute lowest order scattering amplitudes, cross sections, and the 1-loop effective potential. To lowest order,…
A block decomposition method is proposed for minimizing a (possibly non-convex) continuously differentiable function subject to one linear equality constraint and simple bounds on the variables. The proposed method iteratively selects a…
Large-N multi-matrix loop equations are formulated as quadratic difference equations in concatenation of gluon correlations. Though non-linear, they involve highest rank correlations linearly. They are underdetermined in many cases.…
We introduce a class of multiplicative functions in which each function satisfies some statistic conditions, and then prove that above functions are not correlated with finite degree polynomial nilsequences. Besides, we give two…
In this paper, we study different cryptographically significant spectra of Boolean functions, including the Walsh-Hadamard, cross-correlation, and autocorrelation. The $2^k$-variation by Stanica [IEEE-IT 2016] is considered here with the…
The LHC inverse problem refers to the difficulties in determining the parameters of an underlying theory from data (to be) taken by the LHC experiments: if they find signals of new physics, and an underlying theory is assumed, could its…
We obtain some new upper bounds on the maximum number $f(n)$ of edges in $n$-vertex graphs without containing cycles of length four. This leads to an asymptotically optimal bound on $f(n)$ for a broad range of integers $n$ as well as a…
We characterize bifurcation values of polynomial functions by using the theory of perverse sheaves and their vanishing cycles. In particular, by introducing a method to compute the jumps of the Euler characteristics with compact support of…
Several powerful techniques for evaluating massless scalar Feynman diagrams are developed, viz: the solution of recurrence relations to evaluate diagrams with arbitrary numbers of loops in $n=4-2\omega$ dimensions; the discovery and use of…
We propose a semiclassical approach to calculate multiparticle cross sections in scalar theories, which have been strongly argued to have the exponential form $\exp(\lambda^{-1}F(\lambda n,\epsilon))$ in the regime $\lambda\to0$, $\lambda…
We study the structure of multiple correlation sequences defined by measure preserving actions of commuting transformations. When the iterates of the transformations are integer polynomials we prove that any such correlation sequence is the…
Recursive decoding techniques are considered for Reed-Muller (RM) codes of growing length $n$ and fixed order $r.$ An algorithm is designed that has complexity of order $n\log n$ and corrects most error patterns of weight up to…
Let $q=2^n$, $0\leq k\leq n-1$ and $k\neq n/2$. In this paper we determine the value distribution of following exponential sums \[\sum\limits_{x\in \bF_q}(-1)^{\Tra_1^n(\alpha x^{2^{3k}+1}+\beta x^{2^k+1})}\quad(\alpha,\beta\in \bF_{q})\]…
We introduce \emph{Term Coding}, a novel framework for analysing extremal problems in discrete mathematics by encoding them as finite systems of \emph{term equations} (and, optionally, \emph{non-equality constraints}). In its basic form,…
In this paper, an interesting and new bifurcation phenomenon that limit cycles could be bifurcated from nilpotent node (focus) by changing its stability was investigated. It is different from lowing its multiplicity in order to get limit…
The calculation of exclusive cross sections at next-to-next-to-leading order (NNLO) in QCD requires an analytic understanding of the infrared singular structure with up to two unresolved partons. This has so far only been achieved for…
Recent progress in two different fronts is reported. First, the concept of bisection of a harmonic oscillator (HO) or hydrogen atom (HA), used in the past in establishing the connection between U(3) and O(4), is generalized into…
In 1999, Jacobson and Lehel conjectured that for $k \geq 3$, every $k$-regular Hamiltonian graph has cycles of at least linearly many different lengths. This was further strengthened by Verstra\"{e}te, who asked whether the regularity can…
We focus on the second part of Hilbert's 16th problem and provide an upper bound on the number of limit cycles that a polynomial, differential, planar system may have, depending exclusively on the degree $n$ of the system. Such a bound…