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

Let A be a zero-sum free subset of Z_n with |A|=k. We compute for k\le 7 the least possible size of the set of all subset-sums of A.

We present a collection of new results on problems related to 3SUM, including: 1. The first truly subquadratic algorithm for $\ \ \ \ \ $ 1a. computing the (min,+) convolution for monotone increasing sequences with integer values bounded by…

Let $G$ be a group and let $\mathcal{F}$ be a family of subgroups of $G$ closed under conjugation. For a positive integer $n$, let $C_n$ denote a cyclic group of order $n$. We show that if there exists an integer $n$ such that every group…

Let $A, B$ be finite subsets of a torsion-free group $G$. We prove that for every positive integer $k$ there is a $c(k)$ such that if $|B|\ge c(k)$ then the inequality $|AB|\ge |A|+|B|+k$ holds unless a left translate of $A$ is contained in…

Let $G$ be a finite abelian group, and let $m>0$ with $\exp(G)\mid m$. Let $s_{m}(G)$ be the generalized Erd\H{o}s-Ginzburg-Ziv invariant which denotes the smallest positive integer $d$ such that any sequence of elements in $G$ of length…

Let $\Gamma$ be an abelian group and $g \geq h \geq 2$ be integers. A set $A \subset \Gamma$ is a $C_h[g]$-set if given any set $X \subset \Gamma$ with $|X| = k$, and any set $\{ k_1 , \dots , k_g \} \subset \Gamma$, at least one of the…

Let $G$ be a finite abelian group, and $r$ be a multiple of its exponent. The generalized Erd\H{o}s-Ginzburg-Ziv constant $s_r(G)$ is the smallest integer $s$ such that every sequence of length $s$ over $G$ has a zero-sum subsequence of…

Let $C_{n}$ be a cycle of length $n$. As an application of Szemer\'{e}di's regularity lemma, {\L}uczak ($R(C_n,C_n,C_n)\leq (4+o(1))n$, J. Combin. Theory Ser. B, 75 (1999), 174--187) in fact established that…

Given a positive integer $n\ge 2$, let $D(n)$ denote the smallest positive integer $m$ such that $a^3+a(1\le a\le n)$ are pairwise distinct modulo $m^2$. A conjecture of Z.-W. Sun states that $D(n)=3^k$, where $3^k$ is the least power of…

Our work explores the hardness of $3$SUM instances without certain additive structures, and its applications. As our main technical result, we show that solving $3$SUM on a size-$n$ integer set that avoids solutions to $a+b=c+d$ for $\{a,…

It is proved that c = 689347 = 31*37*601 is the smallest conductor of a cyclic cubic number field K whose maximal unramified pro-3-extension E = F(3,infinity,K) possesses an automorphism group G = Gal(E/K) of order 6561 with coinciding…

The Kruskal Katona theorem was proved in the 1960s. In the theorem, we are given an integer $r$ and families of sets $\mathcal{A}\subset \mathbb{N}^{(r)}$ and $\mathcal{B}\subset\mathbb{N}^{(r-1)}$ such that for every $A\in\mathcal{A}$,…

Erd\"os conjectured the existence of an infinite Sidon sequence of positive integers which is also an asymptotic basis of order 3. We make progress towards this conjecture in several directions. First we prove the conjecture for all cyclic…

We prove that any subset $A \subseteq [3]^n$ with $3^{-n}|A| \ge (\log\log\log\log n)^{-c}$ contains a combinatorial line of length $3$, i.e., $x, y, z \in A$, not all equal, with $x_i=y_i=z_i$ or $(x_i,y_i,z_i)=(0,1,2)$ for all $i = 1, 2,…

Let $G$ be a finite abeilian group. A sequence $S$ with terms from $G$ is zero-sum if the sum of terms in $S$ equals zero. It is a minimal zero-sum sequence if no proper, nontrivial subsequence is zero-sum. The maximal length of a minimal…

Let $C_n$ be the cyclic group of order $n$. In this paper, we provide the exact values of some zero-sum constants over $C_n \rtimes_s C_2$ where $s \not\equiv \pm1 \pmod n$, namely $\eta$-constant, Gao constant, and Erd\H{o}s-Ginzburg-Ziv…

In this paper we show that for an almost finite minimal ample groupoid $G$, its reduced $\mathrm{C}^*$-algebra $C_r^*(G)$ has real rank zero and strict comparison even though $C_r^*(G)$ may not be nuclear in general. Moreover, if we further…

Let $G\cong \mathbb Z/m_1\mathbb Z\times\ldots\times \mathbb Z/m_r\mathbb Z$ be a finite abelian group with $m_1\mid\ldots\mid m_r=\exp(G)$. The $n$-term subsums version of Kneser's Theorem, obtained either via the DeVos-Goddyn-Mohar…

The Ramsey number $R(s, t)$ is the smallest positive integer $n$ such that every graph on $n$ vertices contains either a clique of size $s$ or an independent set of size $t$. An $R(s,t)$-critical graph is a graph on $R(s,t)-1$ vertices that…

For any integer $r\ge2$, define a sequence of numbers $\{c_k^{(r)}\}_{k=0}^\infty$, independent of the parameter $n$, by $$ \sum_{k=0}^n{\binom nk}^r{\binom{n+k}k}^r =\sum_{k=0}^n\binom nk\binom{n+k}kc_k^{(r)}, \qquad n=0,1,2,...c. $$ We…