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

We prove that every $n$ vertex linear triple system with $m$ edges has at least $m^6/n^7$ copies of a pentagon, provided $m>100 \, n^{3/2}$. This provides the first nontrivial bound for a question posed by Jiang and Yepremyan. More…

Let $\ell>0$ be a square-free integer congruent to 3 mod 4 and $\O_K$ the ring of integers of the imaginary quadratic field $K=Q(\sqrt{-\ell})$. Codes $C$ over rings $\O_K / p \O_K$ determine lattices $\Lambda_\ell (C) $ over $K$. If $ p…

We prove that the sumset or the productset of any finite set of real numbers, $A,$ is at least $|A|^{4/3-\epsilon},$ improving earlier bounds. Our main tool is a new upper bound on the multiplicative energy, $E(A,A).$

In this paper, we construct two ternary linear codes $C(SO(3,q))$ and $C(O(3,q))$, respectively associated with the orthogonal groups $SO(3,q)$ and $O(3,q)$. Here $q$ is a power of three. Then we obtain two recursive formulas for the power…

B. D. Acharya has conjectured that if $\bigl(A_i: i=1, 2, ..., 2^{|X|}-1\bigr)$ is a permutation of all nonempty subsets of a set $X$ with at least two elements such that for each even positive integer $j<2^{|X|}-1$, $A_{j-1}\triangle…

We introduce the notion of a C*-valued weight between two C*-algebras as a generalization of an ordinary weight on a C*-algebra and as a C*-version of operator valued weights on von Neumann algebras. Also, some form of lower semi-continuity…

We describe a pair of constructions of Eisenstein lattices from ternary codes, and a corresponding pair of constructions of conformal field theories from lattices which turn out to have a string theoretic interpretation. These are found to…

We show that Morley's theorem on the number of countable models of a countable first-order theory becomes an undecidable statement when extended to second-order logic. More generally, we calculate the number of equivalence classes of…

Composite vector resonances in the triplet of the SM SU$(2)_{L}$ gauge group are a universal prediction of "natural" new physics models involving a new strongly-interacting sector and are therefore among the most plausible new particles…

We define E-theory for separable C*-algebras over second countable topological spaces and establish its basic properties. This includes an approximation theorem that relates the E-theory over a general space to the E-theories over finite…

A weaker form of the multiplicity conjecture of Herzog, Huneke, and Srinivasan is proven for two classes of monomial ideals: quadratic monomial ideals and squarefree monomial ideals with sufficiently many variables relative to the Krull…

Thomassen in 1994 published a famous proof of the fact that the choosability of a planar graph is at most 5. Zhu in 2019 generalized this result by showing that the same bound holds for Alon-Tarsi numbers of planar graphs. We present an…

We establish the following quantitative form of the Green--Tao theorem: if a set $\mathcal{A}$ of relative density $\delta$ within the primes up to $N$ contains no nontrivial arithmetic progressions of length $k\geq 4$, then $\delta\ll…

One of the most remarkable theorems in coding theory is Gleason's 1970 theorem about the weight enumerators of self-dual codes. In the past 36 years there have been hundreds of papers written about generalizations and applications of this…

In this paper, we obtain upper bounds for the geometric Ramsey numbers of trees. We prove that $R_c(T_n,H_m)=(n-1)(m-1)+1$ if $T_n$ is a caterpillar and $H_m$ is a Hamiltonian outerplanar graph on $m$ vertices. Moreover, if $T_n$ has at…

For every finite $p$-group $G_p$ that is non-cyclic and non-quaternion and every positive integer $\ell\neq p$ that is greater than $2$, we prove the first non-trivial bound on $\ell$-torsion in class group of every $G_p$-extension. More…

For a finite group $G$, let $N(G)$ denote the set of conjugacy class sizes of $G$. We show that if every finite group $G$ with trivial center such that $N(G)$ equals to $N(Alt_n)$, where $n>1361$ and at least one of numbers $n$ or $n-1$ are…

We determine the border subrank of higher order structure tensors of several families of algebras, and in particular obtain the following results. (1) We determine tight bounds on the border subrank of $k$-fold matrix multiplication and…

The computational cost of counting the number of solutions satisfying a Boolean formula, which is a problem instance of #SAT, has proven subtle to quantify. Even when finding individual satisfying solutions is computationally easy (e.g.…

We prove a compactness theorem for full Boolean-valued models. As an application, we show that if $T$ is a complete countable theory and $\mathcal{B}$ is a complete Boolean algebra, then $\lambda^+$-saturated $\mathcal{B}$-valued models of…