Related papers: Generalized perfect difference families and their …
A perfect matching in an undirected graph $G=(V,E)$ is a set of vertex disjoint edges from $E$ that include all vertices in $V$. The perfect matching problem is to decide if $G$ has such a matching. Recently Rothvo{\ss} proved the striking…
We apply a classical mathematical problem, the moment problem, with its related mathematical achievements, to the study of the parton distribution function (PDF) in hadron physics, and propose a strategy to sieve the moments of the PDF by…
The NNPDF collaboration has recently presented NNPDF3.1, a new determination of the parton distribution functions (PDFs) of the proton including a number of new data, some of which are particularly sensitive to the gluon PDF at large x. In…
The hull of linear codes plays an important role in quantum information and coding theory. In the present paper, by investigating the Galois hulls of generalized Reed-Solomon (GRS) codes and extended GRS codes over the finite field Fq, we…
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-dimensional matching problem asks whether there is a disjoint collection of the hyperedges which…
Parton distribution functions (PDFs) at large $x$ are poorly constrained by high-energy experimental data, but extremely important for probing physics beyond standard model at colliders. We study the calculation of PDFs at large-$x$ through…
In the problem of $\texttt{Generalised Pattern Matching}\ (\texttt{GPM})$ [STOC'94, Muthukrishnan and Palem], we are given a text $T$ of length $n$ over an alphabet $\Sigma_T$, a pattern $P$ of length $m$ over an alphabet $\Sigma_P$, and a…
We complete the procedure of extracting parton distribution functions (PDFs) using large momentum effective theory (LaMET) at leading power accuracy in the hadron momentum. We derive a general factorization formula for the quasi PDFs in the…
Text compression schemes and compact data structures usually combine sophisticated probability models with basic coding methods whose average codeword length closely match the entropy of known distributions. In the frequent case where basic…
The recent significant enrichment of the Order Completion Method for nonlinear Systems of PDEs resulted in the global existence of generalized solutions to a large class of such equations. In this paper we investigate the existence and…
In this paper, we introduce several notions of "dimension" of a finite group, involving sizes of generating sets and certain configurations of maximal subgroups. We focus on the inequality $m(G) \leq \mathrm{MaxDim}(G)$, giving a family of…
Recent work introduced Generalized First Order Decision Diagrams (GFODD) as a knowledge representation that is useful in mechanizing decision theoretic planning in relational domains. GFODDs generalize function-free first order logic and…
In this article we exhibit new explicit families of congruences for the overpartition function, making effective the existence results given previously by Treneer. We give infinite families of congruences modulo $m$ for $m = 5, 7, 11$, and…
Let $M$ be a subset of vector space or projective space. The authors define the \emph{generalized configuration space} of $M$ which is formed by $n$-tuples of elements of $M$ where any $k$ elements of each $n$-tuple are linearly…
Hypertree decompositions (HDs), as well as the more powerful generalized hypertree decompositions (GHDs), and the yet more general fractional hypertree decompositions (FHDs) are hypergraph decomposition methods successfully used for…
We solve the problem of existence of perfect codes in the Doob graph. It is shown that 1-perfect codes in the Doob graph D(m,n) exist if and only if 6m+3n+1 is a power of 2; that is, if the size of a 1-ball divides the number of vertices.…
As an approximate theory that is highly regarded for its computational efficiency, geometrical optics (GO) is widely used for modeling waves in various areas of physics. However, GO fails at caustics, which significantly limits its…
Tang and Ding [IEEE IT 67 (2021) 244-254] studied the class of narrow-sense BCH codes $\mathcal{C}_{(q,q+1,4,1)}$ and their dual codes with $q=2^m$ and established that the codewords of the minimum (or the second minimum) weight in these…
I consider variations in the definition of a General-Mass Variable Flavour Number Scheme (GM-VFNS) for heavy flavour structure functions, both at next-to-leading order (NLO) and at next-to-next-to leading order (NNLO). I also define a new…
The Doob graph $D(m,n)$ is the Cartesian product of $m>0$ copies of the Shrikhande graph and $n$ copies of the complete graph of order $4$. Naturally, $D(m,n)$ can be represented as a Cayley graph on the additive group $(Z_4^2)^m \times…