English
Related papers

Related papers: Subsets of free groups with distinct differences

200 papers

For a family $\mathcal F$, let $\mathcal D(\mathcal F)$ stand for the family of all sets that can be expressed as $F\setminus G$, where $F,G\in \mathcal F$. A family $\mathcal F$ is intersecting if any two sets from the family have…

Combinatorics · Mathematics 2022-08-12 Peter Frankl , Sergei Kiselev , Andrey Kupavskii

Classification of differential-difference equation of the form $\ddot{u}_{nm}=F_{nm}\big(t, \{u_{pq}\}|_{(p,q)\in \Gamma}\big)$ are considered according to their Lie point symmetry groups. The set $\Gamma$ represents the point $(n,m)$ and…

Mathematical Physics · Physics 2013-07-03 Isabelle Ste-Marie , Sébastien Tremblay

Hanna Neumann asked whether it was possible for two non-isomorphic residually nilpotent finitely generated (fg) groups, one of them free, to share the lower central sequence. Gilbert Baumslag answered the question in the affirmative and…

Group Theory · Mathematics 2007-05-23 S. Liriano

Whiston proved that the maximum size of an irredundant generating set in the symmetric group $S_n$ is $n-1$, and Cameron and Cara characterized all irredundant generating sets of $S_n$ that achieve this size. Our goal is to extend their…

Group Theory · Mathematics 2017-12-15 Minh Nguyen

Bridging the work of Cameron, Harary, and others, we examine the base size set B(G) and determining set D(G) of several families of groups. The base size set is the set of base sizes of all faithful actions of the group G on finite sets.…

Group Theory · Mathematics 2014-07-24 Joshua D. Laison , Erin M. McNicholas , Nicole S. Seaders

If V is a representation of a linear algebraic group G, a set S of G-invariant regular functions on V is called separating if the following holds: If two elements v,v' from V can be separated by an invariant function, then there is an f…

Commutative Algebra · Mathematics 2014-06-25 Martin Kohls , Hanspeter Kraft

Since ancient times mathematicians consider geometrical objects with integral side lengths. We consider plane integral point sets $\mathcal{P}$, which are sets of $n$ points in the plane with pairwise integral distances where not all the…

Combinatorics · Mathematics 2008-04-09 Sascha Kurz , Alfred Wassermann

For a positive integer $d$, a set of points in $d$-dimensional Euclidean space is called almost-equidistant if for any three points from the set, some two are at unit distance. Let $f(d)$ denote the largest size of an almost-equidistant set…

Metric Geometry · Mathematics 2020-02-25 Martin Balko , Attila Pór , Manfred Scheucher , Konrad Swanepoel , Pavel Valtr

A distinct difference configuration is a set of points in $\mathbb{Z}^2$ with the property that the vectors (\emph{difference vectors}) connecting any two of the points are all distinct. Many specific examples of these configurations have…

Combinatorics · Mathematics 2009-10-08 Simon R. Blackburn , Tuvi Etzion , Keith M. Martin , Maura B. Paterson

Let $p$ be a fixed prime. For a finite group generated by elements of order $p$, the $p$-width is defined to be the minimal $k\in\mathbb{N}$ such that any group element can be written as a product of at most $k$ elements of order $p$. Let…

Group Theory · Mathematics 2017-12-11 Alexander J. Malcolm

A set of $N$ points is chosen randomly in a $D$-dimensional volume $V=a^D$, with periodic boundary conditions. For each point $i$, its distance $d_i$ is found to its nearest neighbour. Then, the maximal value is found, $d_{max}=max(d_i,…

Computational Physics · Physics 2014-08-26 Malgorzata J. Krawczyk , Janusz Malinowski , Krzysztof Kulakowski

We construct finite sets of real numbers that have a small difference set and strong local properties. In particular, we construct a set $A$ of $n$ real numbers such that $|A-A|=n^{\log_2 3}$ and that every subset $A'\subseteq A$ of size…

Combinatorics · Mathematics 2018-12-27 Sara Fish , Ben Lund , Adam Sheffer

For positive integers $d$ and $n$, let $[n]^d$ be the set of all vectors $(a_1,a_2,\dots, a_d)$, where $a_i$ is an integer with $0\leq a_i\leq n-1$. A subset $S$ of $[n]^d$ is called a \emph{Sidon set} if all sums of two (not necessarily…

Combinatorics · Mathematics 2014-10-22 Sang June Lee

The distinguishing number $D(\Gamma)$ of a graph $\Gamma$ is the least size of a partition of the vertices of $\Gamma$ such that no non-trivial automorphism of $\Gamma$ preserves this partition. We show that if the automorphism group of a…

Combinatorics · Mathematics 2020-06-16 Mariusz Grech , Andrzej Kisielewicz

Suppose that $A$ is a finite, nonempty subset of a cyclic group of either infinite or prime order. We show that if the difference set $A-A$ is ``not too large'', then there is a nonzero group element with at least as many as…

Number Theory · Mathematics 2022-10-19 Vsevolod F. Lev , Ilya D. Shkredov

For given graph $H$, the independence number $\alpha(H)$ of $H$, is the size of the maximum independent set of $V(H)$. Finding the maximum independent set in a graph is a NP-hard problem. Another version of the independence number is…

Combinatorics · Mathematics 2022-01-13 Yaser Rowshan

Suppose that $d \geq 2$, and that $A \subset [0,1]$ has sufficiently large dimension, $1 - \epsilon_d < \dim_H(A) < 1$. Then for any polynomial $P$ of degree $d$ with no constant term, there exists a point configuration $\{ x, x-t,x-P(t) \}…

Classical Analysis and ODEs · Mathematics 2019-05-21 Ben Krause

Let $p$ be a prime and let $A$ be a subset of $\mathbb{F}_p$ with $A=-A$ and $|A\setminus\{0\}| \leq 2\log_3(p)$. Then there is an element of $\mathbb{F}_p$ which has a unique representation as a difference of two elements of $A$.

Combinatorics · Mathematics 2019-02-15 Tai Do Duc , Bernhard Schmidt

We prove a strong general-purpose bound for the diameter of a finite group depending only on the diameters of its composition factors and the maximal exponent of a normal abelian section. There are a number of notable applications: (1) if…

Group Theory · Mathematics 2026-04-21 Sean Eberhard , Elena Maini , Luca Sabatini , Gareth Tracey

We consider a problem posed by Erd\H{o}s, Herzog and Piranian on the maximum product of distances of a point set of order $n$ with a given diameter. We prove that it is sufficient to consider convex polygons and obtain results on the…

Combinatorics · Mathematics 2026-03-10 Stijn Cambie , Arne Decadt , Yanni Dong , Tao Hu , Quanyu Tang
‹ Prev 1 3 4 5 6 7 10 Next ›