scholarly journals On the Number of Sum-Free Triplets of Sets

2021 ◽  
Vol 28 (4) ◽  
Author(s):  
Igor Araujo ◽  
József Balogh ◽  
Ramon I. Garcia

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 $c \in C$. Our main theorem improves on a recent result by Semchankau, Shabanov, and Shkredov using a different and simpler method. Our proof relates previous results on the number of independent sets of regular graphs by Kahn; Perarnau and Perkins; and Csikvári to produce explicit estimates on smaller order terms. We also obtain estimates for the number of sum-free triplets of subsets in a general abelian group. 

1969 ◽  
Vol 21 ◽  
pp. 1238-1244 ◽  
Author(s):  
J. L. Alperin

The concept of an abelian group is central to group theory. For that reason many generalizations have been considered and exploited. One, in particular, is the idea of an n-abelian group (6). If n is an integer and n > 1, then a group G is n-abelian if, and only if,(xy)n = xnynfor all elements x and y of G. Thus, a group is 2-abelian if, and only if, it is abelian, while non-abelian n-abelian groups do exist for every n > 2.Many results pertaining to the way in which groups can be constructed from abelian groups can be generalized to theorems on n-abelian groups (1; 2). Moreover, the case of n = p, a prime, is useful in the study of finite p-groups (3; 4; 5). Moreover, a recent result of Weichsel (9) gives a description of all p-abelian finite p-groups.


2018 ◽  
Vol 341 (3) ◽  
pp. 793-800 ◽  
Author(s):  
Jonathan Cutler ◽  
A.J. Radcliffe

2014 ◽  
Vol 332 ◽  
pp. 40-44 ◽  
Author(s):  
Liying Kang ◽  
Dingguo Wang ◽  
Erfang Shan

2009 ◽  
Vol 116 (7) ◽  
pp. 1219-1227 ◽  
Author(s):  
Teena Carroll ◽  
David Galvin ◽  
Prasad Tetali

1979 ◽  
Vol 27 (4) ◽  
pp. 507-510 ◽  
Author(s):  
David R. Jackett

AbstractIn this paper we generalize a recent result of Freedman (1973) concerning the cardinality of the type set of a rank two torsion-free abelian group. We show that if A is such a group and A supports a non-trivial associative ring then the type set of A contains at most three elements.


2006 ◽  
Vol 27 (7) ◽  
pp. 1206-1210 ◽  
Author(s):  
Alexander A. Sapozhenko

Entropy ◽  
2021 ◽  
Vol 23 (3) ◽  
pp. 270
Author(s):  
Igal Sason

This paper studies the problem of upper bounding the number of independent sets in a graph, expressed in terms of its degree distribution. For bipartite regular graphs, Kahn (2001) established a tight upper bound using an information-theoretic approach, and he also conjectured an upper bound for general graphs. His conjectured bound was recently proved by Sah et al. (2019), using different techniques not involving information theory. The main contribution of this work is the extension of Kahn’s information-theoretic proof technique to handle irregular bipartite graphs. In particular, when the bipartite graph is regular on one side, but may be irregular on the other, the extended entropy-based proof technique yields the same bound as was conjectured by Kahn (2001) and proved by Sah et al. (2019).


Sign in / Sign up

Export Citation Format

Share Document