相关论文: A note on the Assmus--Mattson theorem for some ter…

We analyze the structure of the set of limiting Carleman weights in all conformally flat manifolds, 3-manifolds, and 4-manifolds. In particular we give a new proof of the classification of Euclidean limiting Carleman weights, and show that…

In this paper, several classes of three-weight ternary linear codes from non-weakly regular dual-bent functions are constructed based on a generic construction method. Instead of the whole space, we use the subspaces $B_+(f)$ or $B_-(f)$…

All extremal ternary codes of length 48 that have some automorphism of prime order $p\geq 5$ are equivalent to one of the two known codes, the Pless code or the extended quadratic residue code.

The sizes of optimal constant-composition codes of weight three have been determined by Chee, Ge and Ling with four cases in doubt. Group divisible codes played an important role in their constructions. In this paper, we study the problem…

We clarify the mathematical structure underlying unitary $t$-designs. These are sets of unitary matrices, evenly distributed in the sense that the average of any $t$-th order polynomial over the design equals the average over the entire…

We provide a nontrivial bound on the rank of any tensor $T$ over the quaternions $\mathbb{H}$ in the $n_1\times n_2\times n_3$ cases where $2\leq n_i\leq 3$. We describe a decomposition of $T$ into $3$ simple tensors in the $2\times 2\times…

We restate Thomassen's theorem of 3-extendability, an extension of the famous planar 5-choosability theorem, in terms of graph polynomials. This yields an Alon--Tarsi equivalent of 3-extendability.

Let $G$ be a non-trivial torsion free group and $t$ be an unknown. In this paper we consider three equations (over $G$) of arbitrary length and show that they have a solution (over $G$) provided two relations among their coefficients hold.…

Let $r,s,t$ be three positive integers and $\mathcal{C}$ be a binary linear code of lenght $r+s+t$. We say that $\mathcal{C}$ is a triple cyclic code of lenght $(r,s,t)$ over $\mathbb{Z}_2$ if the set of coordinates can be partitioned into…

We show that the triple-crossing number of any knot is greater or equal to twice its (canonical) genus and we show an even stronger bound in the case of links. As an application we show that this bound is strong enough to obtain the…

We give a complete classification of self-dual completely regular codes with covering radius $\rho \leq 3$. For $\rho=1$ the results are almost trivial. For $\rho=2$, by using properties of the more general class of uniformly packed codes…

We prove new conditional bounds on the the $m$-torsion of class groups of number fields of any fixed degree, for $m=2$, $3$, $4$, and $5$. Our methods first recast the problem in the language of class groups of Galois modules, which allows…

The main theorem in this paper is a far-reaching generalization of Gleason's theorem on the weight enumerators of codes which applies to arbitrary-genus weight enumerators of self-dual codes defined over a large class of finite rings and…

In this paper we consider further applications of $(n,m)$-functions for the construction of 2-designs. For instance, we provide a new application of the extended Assmus-Mattson theorem, by showing that linear codes of APN functions with the…

Let D be the support design of the minimum weight of an extremal binary doubly even self-dual [24m,12m,4m+4] code. In this note, we consider the case when D becomes a t-design with t \geq 6.

Recently, Shen (2016) and Alanazi et al. (2016) studied the arithmetic properties of the $\ell$-regular overpartition function $\overline{A}_\ell (n)$, which counts the number of overpartitions of $n$ into parts not divisible by $\ell$. In…

We introduce the list colouring extension of classical Ramsey numbers. We investigate when the two Ramsey numbers are equal, and in general, how far apart they can be from each other. We find graph sequences where the two are equal and…

We prove that for $\delta$ small, $n$ large, and any three conjugacy classes $C_{1},C_{2},C_{3}$ of $G=\mathrm{Alt}(n)$ of size at least $|G|^{1-\delta}$ we have $C_{1}C_{2}C_{3}=G$. The result provides a positive answer to Problem 20.23 of…

In this paper we propose a general ternary construction of lattices from three rows and ternary codes. Most laminated lattices and Kappa lattices in ${\bf R}^n$, $n\leq 24$ can be recovered from our tenary construction naturally. This…

We study classes of atomic models At_T of a countable, complete first-order theory T . We prove that if At_T is not pcl-small, i.e., there is an atomic model N that realizes uncountably many types over pcl(a) for some finite tuple a from N,…