相关论文: Regular Cyclic $(q+1)$-Arcs in $\PG(3,2^m)$: Spect…

The singleton defect of an $[n,k,d]$ linear code ${\cal C}$ is defined as $s({\cal C})=n-k+1-d$. Codes with $S({\cal C})=0$ are called maximum distance separable (MDS) codes, and codes with $S(\cal C)=S(\cal C ^{\bot})=1$ are called near…

The conventional approach to fixed-order perturbative QCD predictions is based on an arbitrary choice of the renormalization scale, together with an arbitrary range. This {\it ad hoc} assignment of the renormalization scale causes the…

Let F_q be a finite field of order q with characteristic p. An arc is an ordered family of at least k vectors in (F_q)^k in which every subfamily of size k is a basis of (F_q)^k. The MDS conjecture, which was posed by Segre in 1955, states…

Let $C$ be a $(n,q^{2k},n-k+1)_{q^2}$ additive MDS code which is linear over ${\mathbb F}_q$. We prove that if $n \geqslant q+k$ and $k+1$ of the projections of $C$ are linear over ${\mathbb F}_{q^2}$ then $C$ is linear over ${\mathbb…

A subset $\mathcal{S}$ of a conic $\mathcal{C}$ in the projective plane $\mathrm{PG}(2,q)$ is called almost complete (AC-subset for short) if it can be extended to a larger arc in $\mathrm{PG}(2,q)$ only by the points of…

Given a subgroup $H$ of a group $(G,+)$, a $(G,H,k,1)$ difference family (DF) is a set $\mathcal F$ of $k$-subsets of $G$ such that $\{f-f':f,f'\in F, f\neq f',F\in \mathcal F\}=G\setminus H$. Let $g\mathbb Z_{gh}$ is the subgroup of order…

We study close-to-constants quasiperiodic cocycles in $\mathbb{T} ^{d} \times G$, where $d \in \mathbb{N} ^{*} $ and $G$ is a compact Lie group, under the assumption that the rotation in the basis satisfies a Diophantine condition. We prove…

We summarize recent results obtained in [1] on the running m_{c,b}(m_{c,b}) in the MS scheme and f_{D_(s), B_(s)} using QCD spectral sum rules (QSSR) known to N2LO PT series, including all dimension-six NP condensate contributions in the…

A linear code with parameters $[n, k, n-k+1]$ is called a maximum distance separable (MDS for short) code. A linear code with parameters $[n, k, n-k]$ is said to be almost maximum distance separable (AMDS for short). A linear code is said…

An $(n,r)$-arc in $PG(2,q)$ is a set $B$ of points in $PG(2,q)$ such that each line in $PG(2,q)$ contains at most $r$ elements of $B$ and such that there is at least one line containing exactly $r$ elements of $B$. The value $m_r(2,q)$…

In this paper, we study KM-arcs in $PG(2, q)$, the Desarguesian projective plane of order $q$. A KM-arc A of type $t$ is a natural generalisation of a hyperoval: it is a set of $q + t$ points in $PG(2, q)$ such that every line of $PG(2,q)$…

A key issue in making precise predictions in QCD is the uncertainty in setting the renormalization scale $\mu_R$ and thus determining the correct values of the QCD running coupling $\alpha_s(\mu_R^2)$ at each order in the perturbative…

In this paper, the sufficient and necessary condition for the minimum distance of the BCH codes over $\mathbb{F}_q$ with length $q+1$ and designed distance 3 to be 3 and 4 are provided. Let $d$ be the minimum distance of the BCH code…

The determination of the maximal length of maximum distance separable (MDS) codes arising from elliptic curves is a central problem in coding theory. For an elliptic curve $E$ over $\mathbb{F}_q$, let $\operatorname{MEC}(k,q)$ denote the…

We introduce a method of finding large non-positively curved subcomplexes in certain spherical Deligne complexes, which is effective for studying fillings of certain 6-cycles in spherical Deligne complexes. As applications, we show the…

A primary problem for perturbative QCD analyses is how to set the renormalization scale of the QCD running coupling in order to achieve maximally precise fixed-order predictions for physical observables. The Principle of Maximum…

A family of closed manifolds is called cohomologically rigid if a cohomology ring isomorphism implies a diffeomorphism for any two manifolds in the family. We establish cohomological rigidity for large families of 3-dimensional and…

A $q$-ary maximum distance separable (MDS) code $C$ with length $n$, dimension $k$ over an alphabet $\mathcal{A}$ of size $q$ is a set of $q^k$ codewords that are elements of $\mathcal{A}^n$, such that the Hamming distance between two…

In this paper, we compute explicitly the $q$-dimensions of highest weight crystals modulo $q^n-1$ for a quantum group of arbitrary finite type under certain assumption, and interpret the modulo computations in terms of the cyclic sieving…

We consider local CR-immersions of a strictly pseudoconvex real hypersurface $M\subset\bC^{n+1}$, near a point $p\in M$, into the unit sphere $\mathbb S\subset\bC^{n+d+1}$ with $d>0$. Our main result is that if there is such an immersion…