The combinatorial derivation.

DOI10.4995/AGT.2013.1587MaRDI QIDQ2871996zbMATH OpenOpenAlexFDO

Authors Igor V. Protasov

Publication date 14 January 2014

Published in Applied General Topology (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://arxiv.org/abs/1210.0696, http://polipapers.upv.es/index.php/AGT/article/view/1587

zbMATH Keywords

\(\Delta\)-trajectoriescombinatorial conditions on subsetscombinatorial derivationinfinite groupslarge subsets of groupspartitions of groupssmall subsets of groupsStone-Cech compactification of groupssymmetric subsetsthin subsets of groups

Mathematics Subject Classification ID

Stone spaces (Boolean spaces) and related structures (06E15) Axiomatics and elementary properties of groups (20A05) Generators, relations, and presentations of groups (20F05) Special aspects of infinite or finite groups (20F99) Structure of topological semigroups (22A15)

Abstract: Let $G$ be a group, $mathcal{P}_G$ be the family of all subsets of $G$. For a subset $AsubseteqG$, we put $Delta(A)=ginG:|gAcapA|=infty$. The mapping $Delta:mathcal{P}_{G}ightarrowmathcal{P}_G$, $AmapstoDelta(A)$, is called a combinatorial derivation and can be considered as an analogue of the topological derivation $d:mathcal{P}_{X}ightarrowmathcal{P}_X$, $Amapsto{A}^d$, where $X$ is a topological space and $A^d$ is the set of all limit points of $A$. Content: elementary properties, thin and almost thin subsets, partitions, inverse construction and $Delta$-trajectories, $Delta$ and $d$.

Review text

Denote for each group \(G\) by \(2^G\) the family of all subsets of \(G\) and define \(\Delta(A)=\{g\in G:|gA\cap A|\geq\aleph_0\}\) for each subset \(A\) of \(G\). The mapping \(\Delta\colon 2^G\to 2^G\), \(A\mapsto\Delta(A)\) is called the combinatorial derivation. The \(\Delta\)-trajectory of a subset \(A\) of \(G\) is the sequence \(A,\Delta(A),\Delta^2(A),\ldots\).NEWLINENEWLINE The author shows that for any infinite group \(G\) and for each symmetric subset \(A\) containing the identity \(e_G\) of \(G\) there exists a subset \(X\) with \(\Delta(X)=A\). It is proved also that if \(G=A_1\cup\cdots\cup A_n\) is a partition of a group \(G\), then for some \(i\in\{1,\ldots,n\}\) there exists a finite subset \(F\) of \(G\) such that \(G=F\Delta(A_i)\). Let \(G\) be a countable group with the property that for each \(g\neq e_G\) the set \(\{x\in G:x^2=g\}\) is finite. Under these conditions \(\Delta\)-trajectories with special properties are constructed. It is proved, for instance, that for every natural number \(n\) there exists a periodic \(\Delta\)-trajectory of length \(n\).

Recommendations

• The combinatorial derivation and its inverse mapping.
• G-derived sets and G-boundary
• A note on the combinatorial derivation of nonsmall sets
• Recent progress in subset combinatorics of groups
• Around P-small subsets of groups.

Cited in

(6)

• Recent progress in subset combinatorics of groups
• The combinatorial derivation and its inverse mapping.
• On partitions of G-spaces and G-lattices
• Asymptotic structures of cardinals
• Around P-small subsets of groups.
• scientific article; zbMATH DE number 1894751 (Why is no real title available?)

This page was built for publication: The combinatorial derivation.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2871996)