English
Related papers

Related papers: Generalized perfect difference families and their …

200 papers

We discuss a Bayesian methodology for the solution of the inverse problem underlying the determination of parton distribution functions (PDFs). In our approach, Gaussian Processes (GPs) are used to model the PDF prior, while Bayes theorem…

High Energy Physics - Phenomenology · Physics 2024-07-03 Alessandro Candido , Luigi Del Debbio , Tommaso Giani , Giacomo Petrillo

Multi-output Gaussian processes (MOGPs) leverage the flexibility and interpretability of GPs while capturing structure across outputs, which is desirable, for example, in spatio-temporal modelling. The key problem with MOGPs is their…

Machine Learning · Statistics 2020-07-20 Wessel P. Bruinsma , Eric Perim , Will Tebbutt , J. Scott Hosking , Arno Solin , Richard E. Turner

Quasi parton distribution functions (QPDFs) are defined in terms of QCD fields at spacelike separations evaluated in matrix elements of hadrons moving with velocity $v$. These objects can be studied in lattice QCD. In the limit when $v$…

High Energy Physics - Phenomenology · Physics 2026-05-13 Fatma Aslan , Asli Tandogan , Peter Schweitzer

In [Akbari and Moghaddamfar, Recognizing by order and degree pattern of some projective special linear groups, {\it Internat. J. Algebra Comput.}, 2012] the authors possed the following problem: \\ {\bf Problem.} {\it Is there a simple…

Group Theory · Mathematics 2014-09-30 Ali Mahmoudifar , Behrooz Khosravi

In global QCD fits of parton distribution functions (PDFs), a large part of the estimated uncertainty on the PDFs originates from the choices of parametric functional forms and fitting methodology. We argue that these types of uncertainties…

High Energy Physics - Phenomenology · Physics 2023-02-21 Aurore Courtoy , Joey Huston , Pavel Nadolsky , Keping Xie , Mengshi Yan , C. -P. Yuan

General factors are a generalization of matchings. Given a graph $G$ with a set $\pi(v)$ of feasible degrees, called a degree constraint, for each vertex $v$ of $G$, the general factor problem is to find a (spanning) subgraph $F$ of $G$…

Discrete Mathematics · Computer Science 2024-05-24 Shuai Shao , Stanislav Živný

A family of codes with a natural two-dimensional structure is presented, inspired by an application of RAID type of architectures whose units are solid state drives (SSDs). Arrays of SSDs behave differently to arrays of hard disk drives…

Information Theory · Computer Science 2014-09-12 Mario Blaum , James Lee Hafner , Steven Hetzler

This work considers a generalization of Grover's search problem, viz., to find any one element in a set of acceptable choices which constitute a fraction f of the total number of choices in an unsorted data base. An infinite family of…

Quantum Physics · Physics 2009-11-07 Chia-Ren Hu

We show that the perfect matching problem in general graphs is in Quasi-NC. That is, we give a deterministic parallel algorithm which runs in $O(\log^3 n)$ time on $n^{O(\log^2 n)}$ processors. The result is obtained by a derandomization of…

Computational Complexity · Computer Science 2018-09-14 Ola Svensson , Jakub Tarnawski

This paper investigates probability density functions (PDFs) that are continuous everywhere, nearly uniform around the mode of distribution, and adaptable to a variety of distribution shapes ranging from bell-shaped to rectangular. From the…

Machine Learning · Computer Science 2022-04-01 Osamu Fujita

Recently, new combinatorial structures called disjoint partial difference families (DPDFs) and external partial difference families (EPDFs) were introduced, which simultaneously generalize partial difference sets, disjoint difference…

Combinatorics · Mathematics 2023-05-12 S. Huczynska , L. M. Johnson

Motivated by the wide-ranging applications of Hamiltonian decompositions in distributed computing, coded caching, routing, resource allocation, load balancing, and fault tolerance, our work presents a comprehensive design for Hamiltonian…

Information Theory · Computer Science 2025-04-28 Javad Maheri , Petros Elia

Within the theory of Quantum Chromodynamics (QCD), the rich structure of hadrons can be quantitatively characterized, among others, using a basis of universal non-perturbative functions: parton distribution functions (PDFs), generalized…

High Energy Physics - Lattice · Physics 2019-06-14 Krzysztof Cichy , Martha Constantinou

We prove new upper bounds on the size of families of vectors in $\Z_m^n$ with restricted modular inner products, when $m$ is a large integer. More formally, if $\vec{u}_1,\ldots,\vec{u}_t \in \Z_m^n$ and $\vec{v}_1,\ldots,\vec{v}_t \in…

Combinatorics · Mathematics 2013-04-19 Zeev Dvir , Guangda Hu

Let $q^k n^2$ be an odd perfect number with special prime $q$. Define the GCDs $$G = \gcd\bigg(\sigma(q^k),\sigma(n^2)\bigg)$$ $$H = \gcd\bigg(n^2,\sigma(n^2)\bigg)$$ and $$I = \gcd\bigg(n,\sigma(n^2)\bigg).$$ We prove that $G \times H =…

Number Theory · Mathematics 2023-03-30 Jose Arnaldo Bebita Dris

The multivariate generalised Gaussian distribution (MGGD) is commonly used to model high-dimensional vectors with non-Gaussian radial behaviour, ranging from sharp-peaked to heavy-tailed profiles. However, because many classical…

Methodology · Statistics 2026-04-22 Mehmet Sıddık Çadırcı , Yener Ünal

Multi-parton distribution functions (mPDFs) are non-perturbative objects that are important in the prediction of multiple scattering rates at hadron colliders. In the case where the scales associated with all partons in the mPDF are the…

High Energy Physics - Phenomenology · Physics 2025-10-07 Oleh Fedkevych , Jonathan R. Gaunt , Seonagh Smith

The current PDF4LHC recommendation to estimate uncertainties due to parton distribution functions (PDFs) in theoretical predictions for LHC processes involves the combination of separate predictions computed using PDF sets from different…

High Energy Physics - Phenomenology · Physics 2015-09-30 Stefano Carrazza , Jose I. Latorre , Juan Rojo , Graeme Watt

Frame difference families, which can be obtained via a careful use of cyclotomic conditions attached to strong difference families, play an important role in direct constructions for resolvable balanced incomplete block designs. We…

Combinatorics · Mathematics 2018-02-06 Simone Costa , Tao Feng , Xiaomiao Wang

In this paper, we analyze $m$-dimensional ($m$D) convolutional codes with finite support, viewed as a natural generalization of one-dimensional (1D) convolutional codes to higher dimensions. An $m$D convolutional code with finite support…

Information Theory · Computer Science 2026-03-26 Z. Abreu , J. Lieb , R. Pinto , R. Simoes