English
Related papers

Related papers: Kaleidoscopical Configurations in G-spaces

200 papers

For a finite group $G$, we define the inclusion graph of subgroups of $G$, denoted by $\mathcal I(G)$, is a graph having all the proper subgroups of $G$ as its vertices and two distinct vertices $H$ and $K$ in $\mathcal I(G)$ are adjacent…

Group Theory · Mathematics 2016-04-29 P. Devi , R. Rajkumar

The Cartan scheme $\cal X$ of a finite group $G$ with a $(B,N)$-pair is defined to be the coherent configuration associated with the action of $G$ on the right cosets of the Cartan subgroup $B\cap N$ by the right multiplications. It is…

Combinatorics · Mathematics 2019-02-01 Ilia Ponomarenko , Andrey Vasil'ev

Let $G$ be a group and let $X$ be a transitive $G$-space. We classify the subsets of $X$ with respect to a translation invariant ideal $\mathcal{J}$ in the Boolean algebra of all subsets of $X$, introduce and apply the relative…

Group Theory · Mathematics 2014-09-26 Igor Protasov , Sergii Slobodianiuk

A cyclic subgroup $N$ of a finite group $G$ is called a uni-width subgroup of $G$ if $N$ is the unique cyclic subgroup of $G$ of order $|N|$. In this article, we prove that a finite group $G$ admits a unique largest uni-width subgroup…

Group Theory · Mathematics 2026-01-23 Siddhartha Sarkar

We define for a topological group G and a family of subgroups F two versions for the classifying space for the family F, the G-CW-version E_F(G) and the numerable G-space version J_F(G). They agree if G is discrete, or if G is a Lie group…

Geometric Topology · Mathematics 2007-05-23 Wolfgang Lueck

Colouring problems arising from group-based constructions provide a natural link between combinatorics and algebra, particularly in the study of Cayley graphs and Latin squares. We introduce the notion of colouring bijections of finite…

Combinatorics · Mathematics 2026-03-25 Piotr Grzeszczuk

Let $G$ be a group, $X$ be an infinite transitive $G$-space. A free ultrafilter $\UU$ on $X$ is called $G$-selective if, for any $G$-invariant partition $\PP$ of $X$, either one cell of $\PP$ is a member of $\UU$, or there is a member of…

Combinatorics · Mathematics 2017-10-18 O. V. Petrenko , I. V. Protasov

We study the intersection lattice of the arrangement $\mathcal{A}^G$ of subspaces fixed by subgroups of a finite linear group $G$. When $G$ is a reflection group, this arrangement is precisely the hyperplane reflection arrangement of $G$.…

Combinatorics · Mathematics 2022-03-29 Ivan Martino , Rahul Singh

Let $G$ be a finite group acting on $\mathbb{C}^N$. We study the problem of identifyng the class in $\mathbb{C}^N / G$ of a given signal: this encompasses several types of problems in signal processing. Some instances include certain…

Functional Analysis · Mathematics 2019-11-15 Jameson Cahill , Andres Contreras , Andres Contreras Hip

Let $\{G_i :i\in\N\}$ be a family of finite Abelian groups. We say that a subgroup $G\leq \prod\limits_{i\in \N}G_i$ is \emph{order controllable} if for every $i\in \mathbb{N}$ there is $n_i\in \mathbb{N}$ such that for each $c\in G$, there…

Group Theory · Mathematics 2021-12-02 María V. Ferrer , Salvador Hernández

Let G be an affine algebraic group and let X be an affine algebraic variety. An action $G\times X \to X$ is called observable if for any G-invariant, proper, closed subset Y of X there is a nonzero invariant $f\in K[X]^G$ such that f(Y) =0.…

Algebraic Geometry · Mathematics 2009-02-05 Lex Renner , Alvaro Rittatore

Let $\{G_i :i\in\N\}$ be a family of finite Abelian groups. We say that a subgroup $G\leq \prod\limits_{i\in \N}G_i$ is \emph{order controllable} if for every $i\in \mathbb{N}$ there is $n_i\in \mathbb{N}$ such that for each $c\in G$, there…

General Topology · Mathematics 2021-12-01 María V. Ferrer , Salvador Hernández

Let G be a finite subgroup of GL_n(C). G-constellations are a scheme-theoretic generalization of orbits of G in C^n. We study flat families of G-constellations parametrised by an arbitrary resolution of the quotient space C^n/G. We develop…

Algebraic Geometry · Mathematics 2008-12-30 Timothy Logvinenko

Let $G$ be an algebraic group, $X$ a generically free $G$-variety, and $K=k(X)^G$. A field extension $L$ of $K$ is called a splitting field of $X$ if the image of the class of $X$ under the natural map $H^1(K, G) \mapsto H^1(L, G)$ is…

Algebraic Geometry · Mathematics 2007-05-23 Zinovy Reichstein , Boris Youssin

For an ascending HNN-extension $G*_{\psi}$ of a finitely generated abelian group $G$, we study how a synchronization between the geometry of the group and weak periodicity of a configuration in $\mathcal{A}^{G*_{\psi}}$ forces global…

Dynamical Systems · Mathematics 2023-02-17 Eduardo Silva

This thesis concerns the study of the Bredon cohomological and geometric dimensions of a discrete group $G$ with respect to a family $\mathfrak{F}$ of subgroups of $G$. With that purpose, we focus on building finite-dimensional models for…

Group Theory · Mathematics 2019-11-06 Víctor Moreno

A set $S$ of vertices in a graph $G$ is a dominating set if every vertex of $V(G) \setminus S$ is adjacent to a vertex in $S$. A coalition in $G$ consists of two disjoint sets of vertices $X$ and $Y$ of $G$, neither of which is a dominating…

Combinatorics · Mathematics 2023-07-06 Davood Bakhshesh , Michael A. Henning

In this paper we initiate the study of racks from the combined perspective of combinatorics and finite group theory. A rack R is a set with a self-distributive binary operation. We study the combinatorics of the partially ordered set {\cal…

Combinatorics · Mathematics 2015-12-07 Istvan Heckenberger , John Shareshian , Volkmar Welker

Let $G$, $H$ be groups and $\kappa$ be a cardinal. A bijection $f:G\to H$ is caled on asymorphism if, for any $X\in[G]^{<\kappa}$, $Y\in[H]^{<\kappa}$, there exist $X'\in[G]^{<\kappa}$, $Y'\in[H]^{<\kappa}$ such that for all $x\in G$ and…

Group Theory · Mathematics 2016-03-01 Igor Protasov , Serhii Slobodianiuk

Let the vertices of a Cartesian product graph $G\Box H$ be ordered by an ordering $\sigma$. By the First-Fit coloring of $(G\Box H, \sigma)$ we mean the vertex coloring procedure which scans the vertices according to the ordering $\sigma$…

Combinatorics · Mathematics 2024-03-06 Manouchehr Zaker