English
Related papers

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

200 papers

We establish a central limit theorem for counting large continued fraction digits $(a_n)$, i.e. we count occurrences $\{a_n>b_n\}$, where $(b_n)$ is a sequence of positive integers. Our result improves a similar result by Philipp which…

Probability · Mathematics 2021-12-02 Marc Kesseböhmer , Tanja Schindler

A sequence $s_1,s_2,\ldots, s_k$ of elements of a group $G$ is called a valid ordering if the partial products $s_1, s_1 s_2, \ldots, s_1\cdots s_k$ are all distinct. A long-standing problem in combinatorial group theory asks whether, for a…

Combinatorics · Mathematics 2025-08-26 Benjamin Bedert , Matija Bucić , Noah Kravitz , Richard Montgomery , Alp Müyesser

In this paper we are shown the following facts: The probability of increased $ A_{k}=P(T^{k} (x_{0})>T^{k-1} (x_{0})) $, and the probability of decrease $B_{k}=P(T^{k} (x_{0})<T^{k-1} (x_{0}))$ in step $ k $ of a Collataz procedure…

Number Theory · Mathematics 2017-07-04 Denis Martínez Tápanes , Jose E. Martínez Serra

If (B_x: x in N) is a Borel family of sets, indexed by the Baire space N = omega^omega, all B_x have measure zero, and the family is increasing, then the union of all B_x also has measure zero. We give two proofs of this theorem: one in the…

Logic · Mathematics 2008-02-03 Martin Goldstern

An Engel sink of an element $g$ of a group $G$ is a set ${\mathscr E}(g)$ such that for every $x\in G$ all sufficiently long commutators $[...[[x,g],g],\dots ,g]$ belong to ${\mathscr E}(g)$. (Thus, $g$ is an Engel element precisely when we…

Group Theory · Mathematics 2020-04-15 E. I. Khukhro , P. Shumyatsky

Let $G$ be a finite group and $\psi(G)=\sum_{g\in{G}}{o(g)}$. There are some results about the relation between $\psi(G)$ and the structure of $G$. For instance, it is proved that if $G$ is a group of order $n$ and…

Group Theory · Mathematics 2019-04-02 Afsaneh Bahri , Behrooz Khosravi , Zeinab Akhlaghi

We say the sets of nonnegative integers A and B are additive complements if their sum contains all sufficiently large integers. In this paper we prove a conjecture of Chen and Fang about additive complement of a finite set.

Number Theory · Mathematics 2013-04-26 Sándor Z. Kiss , Eszter Rozgonyi , Csaba Sándor

Let $\mathbb N_0$ be the set of non-negative integers, and let $P(n,l)$ denote the set of all weak compositions of $n$ with $l$ parts, i.e., $P(n,l)=\{ (x_1,x_2,\dots, x_l)\in\mathbb N_0^l\ :\ x_1+x_2+\cdots+x_l=n\}$. For any element…

Combinatorics · Mathematics 2013-11-08 Kok Bin Wong , Cheng Yeaw Ku

B. D. Acharya has conjectured that if $\bigl(A_i: i=1, 2, ..., 2^{|X|}-1\bigr)$ is a permutation of all nonempty subsets of a set $X$ with at least two elements such that for each even positive integer $j<2^{|X|}-1$, $A_{j-1}\triangle…

Combinatorics · Mathematics 2008-04-05 A. R. Mehta , G. R. Vijayakumar

The general fluctuation theory is reviewed with special attention to the role played by different ensembles, and is extended to incorporate stationary metastable states obtained in the long time limit. The fluctuation in a quantity depends…

Statistical Mechanics · Physics 2007-05-23 P. D. Gujrati

A set $B$ is said to be \emph{sum-free} if there are no $x,y,z\in B$ with $x+y=z$. We show that there exists a constant $c>0$ such that any set $A$ of $n$ integers contains a sum-free subset $A'$ of size $|A'|\geqslant n/3+c\log \log n$.…

Number Theory · Mathematics 2025-02-13 Benjamin Bedert

For a graph $G=(V,E)$, let $bc(G)$ denote the minimum number of pairwise edge disjoint complete bipartite subgraphs of $G$ so that each edge of $G$ belongs to exactly one of them. It is easy to see that for every graph $G$, $bc(G) \leq n…

Combinatorics · Mathematics 2014-09-23 Noga Alon , Tom Bohman , Hao Huang

We say that an element $g$ of a group $G$ is almost right Engel if there is a finite set ${\mathscr R}(g)$ such that for every $x\in G$ all sufficiently long commutators $[...[[g,x],x],\dots ,x]$ belong to ${\mathscr R}(g)$, that is, for…

Group Theory · Mathematics 2018-07-18 E. I. Khukhro , P. Shumyatsky

Let $k$ be any positive integer and $G$ a compact (Hausdorff) group. Let $\mf{np}_k(G)$ denote the probability that $k+1$ randomly chosen elements $x_1,\dots,x_{k+1}$ satisfy $[x_1,x_2,\dots,x_{k+1}]=1$. We study the following problem: If…

Group Theory · Mathematics 2022-08-10 Alireza Abdollahi , Meisam Soleimani Malekan

In 1910 Einstein published a crucial aspect of his understanding of Boltzmann entropy. He essentially argued that the likelihood function of any system composed by two probabilistically independent subsystems {\it ought} to be factorizable…

Statistical Mechanics · Physics 2015-05-22 Constantino Tsallis , Hans J. Haubold

We show that if $X$ is a complete metric space with uniform relative normal structure and $G$ is a subgroup of the isometry group of $X$ with bounded orbits, then there is a point in $X$ fixed by every isometry in $G$. As a corollary, we…

Functional Analysis · Mathematics 2023-06-08 Andrzej Wiśnicki

We prove that there exists a positive constant \epsilon such that if \log n / n \le p \le n^{-1+\epsilon}, then asymptotically almost surely the random graph G ~ G(n,p) contains a collection of \lfloor \delta(G)/2 \rfloor edge-disjoint…

Combinatorics · Mathematics 2011-09-27 Michael Krivelevich , Wojciech Samotij

In 1971 Cusick proved that every real number $x\in[0,1]$ can be expressed as a sum of two continued fractions with no partial quotients equal to $1$. In other words, if we define a set $$ S(k):= \{ x\in[0,1] : a_n(x) \geq k \text{ for all }…

Number Theory · Mathematics 2025-06-09 Nikita Shulga

Let $G$ be a finite abelian group and $A$ a subset of $G$. The spectrum of $A$ is the set of its large Fourier coefficients. Known combinatorial results on the structure of spectrum, such as Chang's theorem, become trivial in the regime…

Combinatorics · Mathematics 2015-04-07 Kaave Hosseini , Shachar Lovett

We prove an old conjecture of Erd{\H o}s and Graham on sums of unit fractions: There exists a constant $b>0$ such that if we $r$-color the integers in $2,b^r]$, then there exists a monochromatic set $S$ such that $\sum_{n \in S} 1/n=1$.

Number Theory · Mathematics 2007-05-23 Ernest S. Croot
‹ Prev 1 8 9 10 Next ›