{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T14:55:41Z","timestamp":1781794541928,"version":"3.54.5"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Let $A_1,\\ldots,A_n$ be finite subsets of an additive abelian group $G$ with $|A_1|=\\cdots=|A_n|\\ge2$. Concerning the two new kinds of restricted sumsets$$L(A_1,\\ldots,A_n)=\\{a_1+\\cdots+a_n:\\ a_1\\in A_1,\\ldots,a_n\\in A_n,\\ \\text{and}\\ a_i\\not=a_{i+1}\\ \\text{for}\\ 1\\le i&lt;n\\}$$and$$C(A_1,\\ldots,A_n)=\\{a_1+\\cdots+a_n:\\ a_i\\in A_i\\ (1\\le i\\le n),\\ a_1\\not=a_2\\not=\\cdots\\not=a_n\\not=a_1\\},$$when $G$ is the additive group of a field we obtain lower bounds for $|L(A_1,\\ldots,A_n)|$ and $|C(A_1,\\ldots,A_n)|$ via the polynomial method in a quite nontrivial way. Moreover,\u00a0 when $G$ is torsion-free and $A_1=\\cdots=A_n$, we determine completely when $|L(A_1,\\ldots,A_n)|$ or $|C(A_1,\\ldots,A_n)|$ attains its lower bound.<\/jats:p>","DOI":"10.37236\/13831","type":"journal-article","created":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T14:30:23Z","timestamp":1781793023000},"source":"Crossref","is-referenced-by-count":0,"title":["On Two New Kinds of Restricted Sumsets"],"prefix":"10.37236","volume":"33","author":[{"given":"Han","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhi-Wei","family":"Sun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"23455","published-online":{"date-parts":[[2026,6,19]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v33i2p64\/9581","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v33i2p64\/9581","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T14:30:23Z","timestamp":1781793023000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v33i2p64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,19]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2026,4,14]]}},"URL":"https:\/\/doi.org\/10.37236\/13831","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,19]]},"article-number":"P2.64"}}