相关论文: Weighted Zero-Sum Problems Over $C_3^r$

Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems and communication systems as they have efficient encoding and decoding algorithms. In this paper, we settle an open problem…

In this paper, we study non-hyperelliptic curves of genus $3$ with cyclic automorphism group of order $6$. Over an algebraically closed field $K$ of characteristic $\neq 2,3$, such curves are written as plane quartics $C_r: x^3 z + y^4 + r…

Let $G$ be an abelian group. A tri-colored sum-free set in $G^n$ is a collection of triples $({\bf a}_i, {\bf b}_i, {\bf c}_i)$ in $G^n$ such that ${\bf a}_i+{\bf b}_j+{\bf c}_k=0$ if and only if $i=j=k$. Fix a prime $q$ and let $C_q$ be…

Let $(G, 1_G)$ be a finite group and let $S=g_1\bdot \ldots\bdot g_{\ell}$ be a nonempty sequence over $G$. We say $S$ is a tiny product-one sequence if its terms can be ordered such that their product equals $1_G$ and…

Let $\mathcal{A}$ be the group algebra $\mathbf{k}[S_n]$ of the $n$-th symmetric group $S_n$ over a commutative ring $\mathbf{k}$. For any two subsets $A$ and $B$ of $[n]$, we define the elements \[ \nabla_{B,A}:=\sum_{\substack{w\in…

We count the ordered sum-free triplets of subsets in the group $\mathbb{Z}/p\mathbb{Z}$, i.e., the triplets $(A,B,C)$ of sets $A,B,C \subset \mathbb{Z}/p\mathbb{Z}$ for which the equation $a+b=c$ has no solution with $a\in A$, $b \in B$ and…

Akin to the Erd\H{o}s-Rademacher problem, Linial and Morgenstern made the following conjecture in tournaments: for any $d\in (0,1]$, among all $n$-vertex tournaments with $d\binom{n}{3}$ many 3-cycles, the number of 4-cycles is…

We define and study the ternary analogues of Clifford algebras. It is proved that the ternary Clifford algebra with $N$ generators is isomorphic to the subalgebra of the elements of grade zero of the ternary Clifford algebra with $N+1$…

We define a 3-algebra with structure constants being symmetric in the first two indices. We also introduce an invariant anti-symmetric tensor into this 3-algebra and call it a symplectic 3-algebra. The general N=5 superconformal…

All integer solutions $\left(M,a,c\right)$ to the problem of the sums of $M$ consecutive cubed integers $\left(a+i\right)^{3}$ ($a>1$, $0\leq i\leq M-1$) equaling squared integers $c^{2}$ are found by decomposing the product of the…

Three types of Cantor sets are studied.For any integer $m\ge 4$, we show that every real number in $[0,k]$ is the sum of at most $k$ $m$-th powers of elements in the Cantor ternary set $C$ for some positive integer $k$, and the smallest…

To date almost all verifications of Oliver's p-group conjecture have proceeded by verifying a stronger conjecture about weakly closed quadratic subgroups. We construct a group of order 3^n for n = 49 which refutes the weakly closed…

Let $k$ be a positive integer and let $G$ be a graph. The zero-sum Ramsey number $R(G,\mathbb{Z}_k)$ is the least integer $N$ (if it exists) such that for every edge-coloring $\chi \, : \, E(K_N) \, \rightarrow \, \mathbb{Z}_k$ one can find…

Let $\left\{a_1, \dots, a_n\right\} \subset \mathbb{N}$ be a set of positive integers, $a_n$ denoting the largest element, so that for any two of the $2^n$ subsets the sum of all elements is distinct. Erd\H{o}s asked whether this implies…

Let $G$ be an abelian group of finite order $n$, and let $h$ be a positive integer. A subset $A$ of $G$ is called {\em weakly $h$-incomplete}, if not every element of $G$ can be written as the sum of $h$ distinct elements of $A$; in…

Let $\mathscr{M}_{(2,1)}(N)$ be the infimum of the largest sum-free subset of any set of $N$ positive integers. An old conjecture in additive combinatorics asserts that there is a constant $c=c(2,1)$ and a function $\omega(N)\to\infty$ as…

Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. Let $m=2\ell+1$ for an integer $\ell\geq 1$…

Let $G$ be a finite abelian group and $S$ a sequence with elements of $G$. Let $|S|$ denote the length of $S$ and $\mathrm{supp}(S)$ the set of all the distinct terms in $S$. For an integer $k$ with $k\in [1, |S|]$, let $\Sigma_{k}(S)…

For any positive integer $k$, define $f(k)$ (respectively, $f_3(k)$) to be the minimal integer $\ge k$ such that every 3-connected planar graph $G$ (respectively, 3-connected cubic planar graph $G$) of circumference $\ge k$ has a cycle…

For given graphs $G_1,\ldots,G_k$, the size-Ramsey number $\hat{R}(G_1,\ldots,G_k)$ is the smallest integer $m$ for which there exists a graph $H$ on $m$ edges such that in every $k$-edge coloring of $H$ with colors $1,\ldots,k$, $ H $…