English
Related papers

Related papers: Base Size Sets and Determining Sets

200 papers

Let G be a torsion-free abelian group of finite rank. The orbits of the action of Aut(G) on the set of maximal independent subsets of G determine the indecomposable decompositions of G. G contains a direct sum of pure strongly…

Group Theory · Mathematics 2020-04-13 Phill Schultz

We characterize finite $p$-groups $G$ of order up to $p^7$ for which the group of central automorphisms fixing the center element-wise is of minimum possibe order.

Group Theory · Mathematics 2015-03-17 Deepak Gumber , Mahak Sharma

We complete the study of finite and profinite groups admitting an action by an elementary abelian group under which the centralizers of automorphisms consist of Engel elements. In particular, we prove the following theorems. Let $q$ be a…

Group Theory · Mathematics 2017-02-10 Cristina Acciarri , Pavel Shumyatsky , Danilo Sanção da Silveira

This paper compares the divisorial gonality of a finite graph $G$ to the divisorial gonality of the associated metric graph $\Gamma(G,\mathbb{1})$ with unit lengths. We show that $\text{dgon}(\Gamma(G,\mathbb{1}))$ is equal to the minimal…

Combinatorics · Mathematics 2021-07-07 Josse van Dobben de Bruyn , Harry Smit , Marieke van der Wegen

An irredundant base of a group $G$ acting faithfully on a finite set $\Gamma$ is a sequence of points in $\Gamma$ that produces a strictly descending chain of pointwise stabiliser subgroups in $G$, terminating at the trivial subgroup.…

Group Theory · Mathematics 2024-03-21 Colva M. Roney-Dougal , Peiran Wu

We prove that if $d \ge 2$ is an integer, $G$ is a finite abelian group, $Z_0$ is a subset of $G$ not contained in any strict coset in $G$, and $E_1,\dots,E_d$ are dense subsets of $G^n$ such that the sumset $E_1+\dots+E_d$ avoids $Z_0^n$…

Combinatorics · Mathematics 2024-11-22 Thomas Karam , Peter Keevash

Let $T$ be a (first order complete) dependent theory, ${\mathfrak{C}}$ a $\bar\kappa$-saturated model of $T$ and $G$ a definable subgroup which is abelian. Among subgroups of bounded index which are the union of $<\bar\kappa$ type definable…

Logic · Mathematics 2021-09-15 Saharon Shelah

Let $G$ be a finite group and let $S$ be an inverse-closed subset of $G$ not containing the identity. The Cayley graph $\mathrm{Cay}(G,S)$ has vertex set $G$, where two vertices $x$ and $y$ are adjacent if and only if $x^{-1}y \in S$.…

Combinatorics · Mathematics 2026-01-06 Amitayu Banerjee

Tarnauceanu [Archiv der Mathematik, 102 (1), (2014), 11--14] gave a characterisation of elementary abelian $2$-groups in terms of their maximal sum-free sets. His theorem states that a finite group $G$ is an elementary abelian $2$-group if…

Combinatorics · Mathematics 2016-11-22 Chimere Anabanti

A set of vertices $S$ is a \emph{determining set} of a graph $G$ if every automorphism of $G$ is uniquely determined by its action on $S$. The \emph{determining number} of $G$ is the minimum cardinality of a determining set of $G$. This…

Combinatorics · Mathematics 2011-11-15 J. Cáceres , D. Garijo , A. González , A. Márquez , M. L. Puertas

The set $\mathcal{R}_{G}(h,k)$ consists of all possible sizes for the $h$-fold sumset of sets containing $k$ elements from an additive abelian group $G$. The exact makeup of this set is still unknown, but there has been progress towards…

Combinatorics · Mathematics 2025-07-02 Vincent Schinina

A graph G is distinguished if its vertices are labelled by a map \phi: V(G) \longrightarrow {1,2,...,k} so that no graph automorphism preserves \phi. The distinguishing number of G is the minimum number k necessary for \phi to distinguish…

Combinatorics · Mathematics 2007-05-23 Julianna S. Tymoczko

A finite group $G$ is called a Schur group, if any Schur ring over $G$ is the transitivity module of a point stabilizer in a subgroup of $\sym(G)$ that contains all right translations. We complete a classification of abelian $2$-groups by…

Combinatorics · Mathematics 2017-06-21 Mikhail Muzychuk , Ilya Ponomarenko

Given two positive integers $n$ and $k$, we obtain a formula for the base size of the symmetric group of degree $n$ in its action on $k$-subsets. Then, we use this formula to compute explicitly the base size for each $n$ and for each $k\le…

Combinatorics · Mathematics 2023-08-10 Giovanni Mecenero , Pablo Spiga

Difference sets are subsets of a group satisfying certain combinatorial property with respect to the group operation. They can be characterized using an equality in the group ring of the corresponding group. In this paper, we exploit the…

Combinatorics · Mathematics 2018-12-24 Pradipkumar H. Keskar , Priyanka Kumari

Let S be a generating set of a group G. We say that G has FINITE WIDTH relative to S if G=(S\cup S^{-1})^k for a suitable natural number k. We say that a group G is a group of FINITE C-WIDTH if G has finite width with respect to all…

Group Theory · Mathematics 2011-05-31 Valery Bardakov , Vladimir Tolstykh , Vladimir Vershinin

A graph $G$ is said to be $d$-distinguishable if there is a labeling of the vertices with $d$ labels so that only the trivial automorphism preserves the labels. The smallest such $d$ is the distinguishing number, Dist($G$). A subset of…

Combinatorics · Mathematics 2024-06-13 Debra Boutin , Sally Cockburn

We show that every finitely generated group G with an element of order at least $(5rank(G))^{12}$ admits a locally finite directed Cayley graph with automorphism group equal to G. If moreover G is not generalized dihedral, then the above…

Combinatorics · Mathematics 2025-04-02 Paul-Henry Leemann , Mikael de la Salle

We prove that any finite abelian group $G$ contains a collection of not too many subsets with a special structure, so that for every subset $A$ of $G$ with a small doubling, there is a member $F$ of the collection that is fully contained in…

Combinatorics · Mathematics 2025-09-03 Noga Alon , Huy Tuan Pham

We give a new proof of quantifier elimination in the theory of all ordered abelian groups in a suitable language. More precisely, this is only "quantifier elimination relative to ordered sets" in the following sense. Each definable set in…

Logic · Mathematics 2012-01-24 Raf Cluckers , Immanuel Halupczok