相关论文: Generalized perfect difference families and their …
The construction of quantum error-correcting codes (QECCs) with good parameters is a hot topic in the area of quantum information and quantum computing. Quantum maximum distance separable (QMDS) codes are optimal because the minimum…
The NP-hard Metric Dimension problem is to decide for a given graph G and a positive integer k whether there is a vertex subset of size at most k that separates all vertex pairs in G. Herein, a vertex v separates a pair {u,w} if the…
A fundamental notion in group theory, which originates in an article of Ulam and von Neumann from $1947$ is uniform simplicity. A group $G$ is said to be $n$-uniformly simple for $n \in \mathbf{N}$ if for every $f,g\in G\setminus \{id\}$,…
Self-orthogonal codes are an important subclass of linear codes which have nice applications in quantum codes and lattices. It is known that a binary linear code is self-orthogonal if its every codeword has weight divisible by four, and a…
We investigate the problem of assembling general shapes and patterns in a model in which particles move based on uniform external forces until they encounter an obstacle. While previous work within this model of assembly has focused on…
The generalized word length pattern of an orthogonal array allows a ranking of orthogonal arrays in terms of the generalized minimum aberration criterion (Xu and Wu [Ann. Statist. 29 (2001) 1066-1077]). We provide a statistical…
Recently the concept of quasi parton distributions (quasi-PDFs) for hadrons has been proposed. Quasi-PDFs are defined through spatial correlation functions and as such can be computed numerically using quantum chromodynamics on a…
In this paper infinite families of linear binary nested completely regular codes are constructed. They have covering radius $\rho$ equal to $3$ or $4$, and are $1/2^i$-th parts, for $i\in\{1,\ldots,u\}$ of binary (respectively, extended…
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framework for solving these packing problems to optimality, it is…
Beyond leading-order, perturbative QCD requires a choice of factorisation scheme to define the parton distribution functions (PDFs) and hard-process cross-section. The modified minimal-subtraction ($\overline{\mathrm{MS}}$) scheme has long…
Gaussian elimination answers any question about a finitely presented vector space. However, a "uniform family" of such presentations--given as generic relations among an unspecified number of generators--is susceptible to elimination only…
This paper is concerned with structures of general graphs with perfect matchings. We first reveal a partially ordered structure among factor-components of general graphs with perfect matchings. Our second result is a generalization of…
The decision problem of perfect matchings in uniform hypergraphs is famously an NP-complete problem. It has been shown by Keevash--Knox--Mycroft [STOC, 2013] that for every $\varepsilon>0$, such decision problem restricted to $k$-uniform…
This paper presents three new families of fractional Sobolev spaces and their accompanying theory in one-dimension. The new construction and theory are based on a newly developed notion of weak fractional derivatives, which are natural…
The paper suggests the use of Multi-Valued Decision Diagrams (MDDs) as the supporting data structure for a generic global constraint. We give an algorithm for maintaining generalized arc consistency (GAC) on this constraint that amortizes…
We perform a comprehensive global QCD analysis of spin-dependent parton distribution functions (PDFs), combining all available data on inclusive and semi-inclusive deep-inelastic scattering (DIS), as well as inclusive weak boson and jet…
A multifold $1$-perfect code ($1$-perfect code for list decoding) in any graph is a set $C$ of vertices such that every vertex of the graph is at distance not more than $1$ from exactly $\mu$ elements of $C$. In $q$-ary Hamming graphs,…
We prove several theorems characterizing the existence of homological error correction codes both classically and quantumly. Not every classical code is homological, but we find a family of classical homological codes saturating the Hamming…
We study finite-dimensional groups definable in models of the theory of real closed fields with a generic derivation (also known as CODF). We prove that any such group definably embeds in a semialgebraic group. We extend the results to…
Families of objects appear in several contexts, like algebraic topology, theory of deformations, theoretical physics, etc. An unified coordinate-free algebraic framework for families of geometrical quantities is presented here, which allows…