Related papers: Generalized perfect difference families and their …

We introduce a family of symmetric convex bodies called generalized ellipsoids of degree $d$ (GE-$d$s), with ellipsoids corresponding to the case of $d=0$. Generalized ellipsoids (GEs) retain many geometric, algebraic, and algorithmic…

The present paper considers multipartite graphs from the perspective of design theory and coding theory. A one-factor $F$ of the complete multipartite graph $K_{n\times g}$ (with $n$ parts of size $g$) gives rise to a $(g+1)$-ary code…

Unitary designs are essential tools in several quantum information protocols. Similarly to other design concepts, unitary designs are mainly used to facilitate averaging over a relevant space, in this case, the unitary group…

Probability theory has become the predominant framework for quantifying uncertainty across scientific and engineering disciplines, with a particular focus on measurement and control systems. However, the widespread reliance on simple…

Diameter perfect codes form a natural generalization for perfect codes. They are based on the code-anticode bound which generalizes the sphere-packing bound. The code-anticode bound was proved by Delsarte for distance-regular graphs and it…

We present five new infinite families of linear near-MDS codes uniformly packed in the wide sense (UPWS). These codes are also almost perfect multiple coverings of the deep holes or farthest-off points (APMCF), i.e.\ the vectors lying at…

We prove several congruences satisfied by the generalized cubic and generalized overcubic partition functions, recently introduced by Amdeberhan, Sellers, and Singh. We also prove infinite families of congruences modulo powers of $2$ and…

We develop a methodology for the construction of a Hessian representation of Monte Carlo sets of parton distributions, based on the use of a subset of the Monte Carlo PDF replicas as an unbiased linear basis, and of a genetic algorithm for…

We present a new public code, FPPDF, to perform global fits of parton distribution functions (PDFs). The fitting methodology follows that implemented by the MSHT collaboration, namely applying a fixed polynomial parameterisation of the PDFs…

We introduce the physical factorisation scheme, which is necessary to describe observables which are `not completely inclusive'. We derive the formulae for NLO DGLAP evolution in this scheme, and also for the `rotation' of the conventional…

We present a new set of parton distribution functions (PDFs) based on a fully global dataset and machine learning techniques: NNPDF4.0. We expand the NNPDF3.1 determination with 44 new datasets, mostly from the LHC. We derive a novel…

In this paper we study the generalized vertex cover problem (GVC), which is a generalization of various well studied combinatorial optimization problems. GVC is shown to be equivalent to the unconstrained binary quadratic programming…

This paper focuses on constructions for optimal $2$-D $(n\times m,3,2,1)$-optical orthogonal codes with $m\equiv 0\ ({\rm mod}\ 4)$. An upper bound on the size of such codes is established. It relies heavily on the size of optimal…

A generalized strong external difference family (briefly $(v, m; k_1,\dots,k_m; \lambda_1,\dots,\lambda_m)$-GSEDF) was introduced by Paterson and Stinson in 2016. In this paper, we construct some new GSEDFs for $m=2$ and use them to obtain…

We consider the existence problem for a semi-cyclic holey group divisible design of type (n,m^t) with block size 3, which is denoted by a 3-SCHGDD of type (n,m^t). When t is odd and n\neq 8 or t is doubly even and t\neq 8, the existence…

A new approach to group classification problems and more general investigations on transformational properties of classes of differential equations is proposed. It is based on mappings between classes of differential equations, generated by…

We study properties of binary codes with parameters close to the parameters of 1-perfect codes. An arbitrary binary $(n=2^m-3, 2^{n-m-1}, 4)$ code $C$, i.e., a code with parameters of a triply-shortened extended Hamming code, is a cell of…

The study of optical orthogonal codes has been motivated by an application in an optical code-division multiple access system. This paper focuses on optimal two-dimensional optical orthogonal codes with autocorrelation and cross-correlation…

Partial-MDS (PMDS) codes are a family of locally repairable codes, mainly used for distributed storage. They are defined to be able to correct any pattern of $s$ additional erasures, after a given number of erasures per locality group have…

In the In recent times, the research community has explored diverse structures and novel fabrication methods for amorphous solids. This work investigates structural trends among different classes of amorphous materials to identify universal…