English
Related papers

Related papers: Small doubling implies small tripling for balls of…

200 papers

A certain inequality conjectured by Vershynin is studied. It is proved that for any $n$-dimensional symmetric convex body $K$ with inradius $w$ and $\gamma_{n}(K) \leq 1/2$ there is $\gamma_{n}(sK) \leq (2s)^{w^{2}/4}\gamma_{n}(K)$ for any…

Probability · Mathematics 2014-09-19 Rafał Latała , Krzysztof Oleszkiewicz

We show that if G is a group and A is a finite subset of G with |A^2| < K|A|, then for all k there is a symmetric neighbourhood of the identity S with S^k a subset of A^2A^{-2} and |S| > exp(-K^{O(k)})|A|.

Combinatorics · Mathematics 2010-10-15 Tom Sanders

For any graph $G$ of order $n$ with degree sequence $d_{1}\geq\cdots\geq d_{n}$, we define the double Slater number $s\ell_{\times2}(G)$ as the smallest integer $t$ such that $t+d_{1}+\cdots+d_{t-e}\geq2n-p$ in which $e$ and $p$ are the…

Combinatorics · Mathematics 2022-03-29 Babak Samadi , Nasrin Soltankhah , Doost Ali Mojdeh

In the paper the foundation of the $k$-orbit theory is developed. The theory opens a new simple way to the investigation of groups and multidimensional symmetries. The relations between combinatorial symmetry properties of a $k$-orbit and…

General Mathematics · Mathematics 2007-05-23 Aleksandr Golubchik

We show that any self-complementary graph with $n$ vertices contains a $K_{\lfloor \frac{n+1}{2}\rfloor}$ minor. We derive topological properties of self-complementary graphs.

Combinatorics · Mathematics 2018-09-27 Andrei Pavelescu , Elena Pavelescu

For each $n\leq 6$, we characterize all the groups which can occur as either the orientation preserving topological symmetry group or the topological symmetry group of some embedding of $K_n$ in $S^3$.

Geometric Topology · Mathematics 2014-02-17 Dwayne Chambers , Erica Flapan

Let G be an arbitrary Abelian group and let A be a finite subset of G. A has small additive doubling if |A+A| < K|A| for some K>0. These sets were studied in papers of G.A. Freiman, Y. Bilu, I. Ruzsa, M.C.--Chang, B. Green and T.Tao. In the…

Number Theory · Mathematics 2007-05-23 I. D. Shkredov

We study how many copies of a graph $F$ that another graph $G$ with a given number of cliques is guaranteed to have. For example, one of our main results states that for all $t\ge 2$, if $G$ is an $n$ vertex graph with $kn^{3/2}$ triangles…

Combinatorics · Mathematics 2023-12-14 Quentin Dubroff , Benjamin Gunby , Bhargav Narayanan , Sam Spiro

The aim of this paper is to present a complete description of the structure of subsets S of an orderable group G satisfying |S^2| = 3|S|-2 and <S> is non-abelian.

Group Theory · Mathematics 2015-11-11 G. A. Freiman , M. Herzog , P. Longobardi , M. Maj , A. Plagne , D. J. S. Robinson , Y. V. Stanchescu

Let $K \subset {\mathbb R}^n$ be a compact definable set in an o-minimal structure over $\mathbb R$, e.g., a semi-algebraic or a subanalytic set. A definable family $\{ S_\delta|\> 0< \delta \in {\mathbb R} \}$ of compact subsets of $K$, is…

Algebraic Geometry · Mathematics 2017-05-17 Saugata Basu , Andrei Gabrielov , Nicolai Vorobjov

Consider the geometric graph on $n$ independent uniform random points in a connected compact region $A$ of ${\bf R}^d, d \geq 2$, with $C^2$ boundary, or in the unit square, with distance parameter $r_n$. Let $K_n$ be the number of…

Probability · Mathematics 2026-04-09 Mathew D. Penrose , Xiaochuan Yang

We prove several new results on the structure of the subgroup generated by a small doubling subset of an ordered group, abelian or not. We obtain precise results generalizing Freiman's 3k-3 and 3k-2 theorems in the integers and several…

This paper considers multiple domination on Kneser graphs. We focus on $k$-tuple dominating sets, $2$-packings and the associated graph parameters $k$-tuple domination number and $2$-packing number. In particular, we compute the $2$-packing…

Combinatorics · Mathematics 2024-04-09 María Gracia Cornet , Pablo Torres

We initiate a study of the vertex clique covering numbers of Johnson graphs $J(N, k)$, the smallest numbers of cliques necessary to cover the vertices of those graphs. We prove identities for the values of these numbers when $k \leq 3$, and…

Combinatorics · Mathematics 2025-06-17 Søren Fuglede Jørgensen

Let $n,k,s$ be three integers and $\beta$ be a sufficiently small positive number such that $k\geq 3$, $0<1/n\ll \beta\ll 1/k$ and $ks+k\leq n\leq (1+\beta)ks+k-2$. A $k$-graph is called non-trivial if it has no isolated vertex. In this…

Combinatorics · Mathematics 2024-04-16 Mingyang Guo , Hongliang Lu

For a number field K, we show that any S-arithmetic subgroup of SL_2(K) contains a subgroup of finite index generated by three elements if card(S)> 1.

Group Theory · Mathematics 2007-05-23 Ritumoni Sarma

Let $G$ be a finite nilpotent group and $n\in \{3,4, 5\}$. Consider $S_n\times G$ as a subgroup of $S_n\times S_{|G|}\subset S_{n|G|}$, where $G$ embeds into the second factor of $S_n\times S_{|G|}$ via the regular representation. Over any…

Number Theory · Mathematics 2025-10-01 Hrishabh Mishra , Anwesh Ray

We determine the structure of a finite subset $A$ of an abelian group given that $|2A|<3(1-\epsilon)|A|$, $\epsilon>0$; namely, we show that $A$ is contained either in a "small" one-dimensional coset progression, or in a union of fewer than…

Number Theory · Mathematics 2020-10-27 Vsevolod F. Lev

We prove a conjecture of Helfgott on the structure of sets of bounded tripling in bounded rank, which states the following. Let $A$ be a finite symmetric subset of $\mathrm{GL}_n(\mathbf{F})$ for any field $\mathbf{F}$ such that $|A^3| \leq…

Group Theory · Mathematics 2025-08-04 Sean Eberhard , Brendan Murphy , László Pyber , Endre Szabó

For a fixed graph $F$, a graph $G$ is said to be $F$-saturated if $G$ does not contain a subgraph isomorphic to $F$ but does contain $F$ after the addition of any new edge. Let $M_k$ be a matching consisting of $k$ edges and $S_{n,k}$ be…

Combinatorics · Mathematics 2022-11-08 Jiejing Feng , Doudou Hei , Xinmin Hou
‹ Prev 1 2 3 10 Next ›