English
Related papers

Related papers: Significant contribution to the Frankl's union-clo…

200 papers

We prove that in every variety of $G$-groups, every $G$-existentially closed element satisfies nullstellensatz for finite consistent systems of equations. This will generalize {\bf Theorem G} of \cite{BMR1}. As a result we see that every…

Group Theory · Mathematics 2021-05-21 Mohammad Shahryari

For any set $A$ of natural numbers with positive upper Banach density and any $k\geq 1$, we show the existence of an infinite set $B\subset{\mathbb N}$ and a shift $t\geq0$ such that $A-t$ contains all sums of $m$ distinct elements from $B$…

Dynamical Systems · Mathematics 2025-09-16 Bryna Kra , Joel Moreira , Florian K. Richter , Donald Robertson

Let $G$ be a finite $2$-generated non-cyclic group. The spread of $G$ is the largest integer $k$ such that for any nontrivial elements $x_1, \ldots, x_k$, there exists $y \in G$ such that $G = \langle x_i, y\rangle$ for all $i$. The more…

Group Theory · Mathematics 2019-09-17 Timothy C. Burness , Scott Harper

Let \mathcal{F}_k denote the family of 2-edge-colored complete graphs on 2k vertices in which one color forms either a clique of order k or two disjoint cliques of order k. Bollob\'as conjectured that for every \epsilon>0 and positive…

Combinatorics · Mathematics 2008-04-06 Jacob Fox , Benny Sudakov

Euler showed that the number of partitions of $n$ into distinct parts equals the number of partitions of $n$ into odd parts. This theorem was generalized by Glaisher and further by Franklin. Recently, Beck made three conjectures on…

Combinatorics · Mathematics 2020-02-20 Jia Huang

Given a group $G$, we write $g^G$ for the conjugacy class of $G$ containing the element $g$. A theorem of B. H. Neumann states that if $G$ is a group in which all conjugacy classes are finite with bounded size, then the commutator subgroup…

Group Theory · Mathematics 2021-02-24 Pavel Shumyatsky

Let G be an additive abelian group whose finite subgroups are all cyclic. Let A_1,...,A_n (n>1) be finite subsets of G with cardinality k>0, and let b_1,...,b_n be pairwise distinct elements of G with odd order. We show that for every…

Combinatorics · Mathematics 2016-09-07 Zhi-Wei Sun

If $\a$ is an irrational number, we let $\{p_n/q_n\}_{n\geq 0}$, be the approximants given by its continued fraction expansion. The Bruno series $B(\a)$ is defined as $$B(\a)=\sum_{n\geq 0} \frac{\log q_{n+1}}{q_n}.$$ The quadratic…

Dynamical Systems · Mathematics 2007-05-23 Xavier Buff , Arnaud Cheritat

Brlek and Reutenauer conjectured that any infinite word u with language closed under reversal satisfies the equality 2D(u) = \sum_{n=0}^{\infty}T_u(n) in which D(u) denotes the defect of u and T_u(n) denotes C_u(n+1)-C_u(n) +2 - P_U(n+1) -…

Combinatorics · Mathematics 2013-02-12 Lubomira Balkova , Edita Pelantova , Stepan Starosta

Let $\mathcal{A}$ be a union-closed family of sets with universe $\bigcup_{A \in \mathcal{A}}A = [n] = \{1,\cdots,n\}$ and length $\ell$. We prove that $|\mathcal{A}| \leq \sum_{i=0}^{\ell} \binom{n}{i}$, with equality if and only if…

Combinatorics · Mathematics 2025-11-14 Christopher Bouchard

We study a conjecture by Deaconescu on the solubility of finite groups with claims that if more than half of the elements in a finite group has the same order $k$, then the group is soluble. We show that the original conjecture fails by…

Group Theory · Mathematics 2026-04-02 Ryan McCulloch , Lee Tae Young

Let $\gamma_n=[x_1,\dots,x_n]$ be the $n$th lower central word. Denote by $X_n$ the set of $\gamma_n$-values in a group $G$ and suppose that there is a number $m$ such that $|g^{X_n}|\leq m$ for each $g\in G$. We prove that…

Group Theory · Mathematics 2019-07-08 Eloisa Detomi , Guram Donadze , Marta Morigi , Pavel Shumyatsky

Let $d\ge 3$ be a fixed integer. Let $y:= y(p)$ be the probability that the root of an infinite $d$-regular tree belongs to an infinite cluster after $p$-bond-percolation. We show that for every constants $b,\alpha>0$ and $1<\lambda< d-1$,…

Combinatorics · Mathematics 2024-09-10 Sahar Diskin , Michael Krivelevich

The Union Closed Sets Conjecture is one of the most renowned problems in combinatorics. Its appeal lies in the simplicity of its statement contrasted with the potential complexity of its resolution. The conjecture posits that, in any union…

Combinatorics · Mathematics 2025-10-02 Nived J M

We provide a proof of the union-closed sets conjecture, by means of a suitable refinement of the breakthrough entropy-approach introduced by Gilmer. The novelty here is to consider a convex combination of $A$ and $A\cup B$, where $A,B$ are…

Combinatorics · Mathematics 2023-02-09 Raffaele Scandone

A group $G$ is said to be $\frac{3}{2}$-generated if every nontrivial element belongs to a generating pair. It is easy to see that if $G$ has this property then every proper quotient of $G$ is cyclic. In this paper we prove that the…

Group Theory · Mathematics 2021-02-02 Timothy C. Burness , Robert M. Guralnick , Scott Harper

Let $t$ be a non-negative integer and $\mbox{$\cal P$}=\{(A_i,B_i)\}_{1\leq i\leq m}$ be a set-pair family satisfying $|A_i \cap B_i|\leq t$ for $1\leq i \leq m$. $\mbox{$\cal P$}$ is called strong Bollob\'as $t$-system, if $|A_i\cap…

Combinatorics · Mathematics 2024-06-11 Gábor Hegedüs

For any positive integer $n$, let $f(n)$ denote the number of solutions to the Diophantine equation $\frac{4}{n} = \frac{1}{x} + \frac{1}{y} + \frac{1}{z}$ with $x,y,z$ positive integers. The \emph{Erd\H{o}s-Straus conjecture} asserts that…

Number Theory · Mathematics 2015-08-04 Christian Elsholtz , Terence Tao

Folkman's Theorem asserts that for each $k \in \mathbb{N}$, there exists a natural number $n = F(k)$ such that whenever the elements of $[n]$ are two-coloured, there exists a set $A \subset [n]$ of size $k$ with the property that all the…

Combinatorics · Mathematics 2017-06-28 József Balogh , Sean Eberhard , Bhargav Narayanan , Andrew Treglown , Adam Zsolt Wagner

It is established that there exists an absolute constant $c>0$ such that for any finite set $A$ of positive real numbers $$|AA+A| \gg |A|^{\frac{3}{2}+c}.$$ On the other hand, we give an explicit construction of a finite set $A \subset…

Combinatorics · Mathematics 2018-10-03 Oliver Roche-Newton , Imre Z. Ruzsa , Chun-Yen Shen , Ilya D. Shkredov