Number of A+B≠C solutions in abelian groups and application to counting independent sets in hypergraphs

2022 ◽  
Vol 100 ◽  
pp. 103453
Author(s):  
Aliaksei Semchankau ◽  
Dmitry Shabanov ◽  
Ilya Shkredov
Keyword(s):  
Abelian Groups ◽  
Independent Sets

scholarly journals Independent sets and lacunarity for hypergroups

1991 ◽  
Vol 50 (2) ◽  
pp. 171-188 ◽  
Author(s):  
Richard C. Vrem
Keyword(s):  
Abelian Groups ◽  
Independent Sets ◽  
Infinite Subset ◽  
Necessary Condition ◽  
Compact Groups ◽  
Sidon Set ◽  
Dual Object ◽  
Riesz Products

AbstractSets of independence are studied for compact abelian hypergroups and they are used, along with Riesz products, to investigate lacunarity questions on the dual object. It is shown that bounded Stechkin sets are always Sidon and that every bounded infinite subset of the dual contains an infinite Sidon set which is also a Λ set. Independent sets are shown to always be Sidon and a necessary condition for Sidonicity is provided. A result of Pisier is used to show that for compact non-abelian groups Sidon and central Λ are equivalent. Several applications are provided, primarily to questions regarding lacunarity on compact groups.

Additive bases via Fourier analysis

2021 ◽  
pp. 1-12
Author(s):  
Bodan Arsovski
Keyword(s):  
Abelian Group ◽  
Fourier Analysis ◽  
Vector Space ◽  
Abelian Groups ◽  
Finite Abelian Group ◽  
Probabilistic Method ◽  
Additive Basis ◽  
Generating Sets

Abstract Extending a result by Alon, Linial, and Meshulam to abelian groups, we prove that if G is a finite abelian group of exponent m and S is a sequence of elements of G such that any subsequence of S consisting of at least $$|S| - m\ln |G|$$ elements generates G, then S is an additive basis of G . We also prove that the additive span of any l generating sets of G contains a coset of a subgroup of size at least $$|G{|^{1 - c{ \in ^l}}}$$ for certain c=c(m) and $$ \in = \in (m) < 1$$ ; we use the probabilistic method to give sharper values of c(m) and $$ \in (m)$$ in the case when G is a vector space; and we give new proofs of related known results.

Trees without twin-leaves with smallest number of maximal independent sets

2020 ◽  
Vol 30 (1) ◽  
pp. 53-67 ◽  
Author(s):  
Dmitriy S. Taletskii ◽  
Dmitriy S. Malyshev
Keyword(s):  
Independent Sets ◽  
Adjacent Vertex ◽  
Maximal Independent Sets

AbstractFor any n, in the set of n-vertex trees such that any two leaves have no common adjacent vertex, we describe the trees with the smallest number of maximal independent sets.

scholarly journals Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms

2020 ◽  
Vol 16 (3) ◽  
pp. 1-31
Author(s):  
Daniel Lokshtanov ◽  
Fahad Panolan ◽  
Saket Saurabh ◽  
Roohani Sharma ◽  
Meirav Zehavi
Keyword(s):  
Independent Sets ◽  
Parameterized Algorithms
Sign in / Sign up

Export Citation Format

Share Document