Related papers: Disjointness with all minimal systems under group …

In \cite{1}, a class of gyrogroups $(G,\odot)$ has been associated to certain groups $(G,\cdot)$. We give a necessary and sufficient condition for $(G,\odot)$ to be gyrocommutative. We also prove that under a suitable assumption two finite…

We call a finite undirected graph minimally k-matchable if it has at least k distinct perfect matchings but deleting any edge results in a graph which has not. An odd subdivision of some graph G is any graph obtained by replacing every edge…

This paper is concerned with some stronger forms of transitivity in non-autonomous discrete systems$(f_{ 1,\infty})$ generated by a uniformly convergent sequence of continuous self maps. Firstly, we present two counterexamples to show that…

Let $G$ be a transitive permutation group acting on $\Omega$. In this paper, we introduce and study the parameter ${\bf m}(G)$, which denotes the size of the smallest set of points $A$ such that, for every permutation $g\in G$, $A \cap A^g$…

A subset $D\subseteq V_G$ is a dominating set of $G$ if every vertex in $V_G-D$ has a~neighbor in $D$, while $D$ is a paired-dominating set of $G$ if $D$ is a~dominating set and the subgraph induced by $D$ contains a perfect matching. A…

The main result of this paper (Theorem B) asserts that under natural conditions, any weakly-split Tits system in G(k), G a reductive or quasi-reductive group over an arbitrary field k, is the standard one.

We consider the actions of (semi)groups on a locally compact group by automorphisms. We show the equivalence of distality and pointwise distality for the actions of a certain class of groups. We also show that a compactly generated locally…

In this paper, we consider dominating sets $D$ and $D'$ such that $D$ and $D'$ are disjoint and there exists a perfect matching between them. Let $DD_{\textrm{m}}(G)$ denote the cardinality of smallest such sets $D, D'$ in $G$ (provided…

Let $G$ be a locally compact second countable group equipped with an admissible non-degenerate Borel probability measure $\mu$. We generalize the notion of $\mu$-stationary systems to $\mu$-stationary $G$-factor maps $\pi: (X,\nu)\to…

Social networks transmitting covert or sensitive information cannot use all ties for this purpose. Rather, they can only use a subset of ties that are strong enough to be ``trusted''. In this paper we consider transitivity as evidence of…

A subgroup $H$ of a finite group $G$ is said to be SS-permutable in $G$ if $H$ has a supplement $K$ in $G$ such that $H$ permutes with every Sylow subgroup of $K$. A finite group $G$ is called an SST-group if SS-permutability is a…

We show that the existence of a dense set of periodic points for a topologically transitive non-minimal continuous group action on a Hausdorff uniform space with an infinite acting group does not necessarily imply a sensitive dependence to…

The following problem is considered: if $H$ is a semiregular abelian subgroup of a transitive permutation group $G$ acting on a finite set $X$, find conditions for (non) existence of $G$-invariant partitions of $X$. Conditions presented in…

The Tits core G^+ of a totally disconnected locally compact group G is defined as the abstract subgroup generated by the closures of the contraction groups of all its elements. We show that a dense subgroup is normalised by the Tits core if…

Let $(X,\rho,G)$ be a $G-$action topological system, where $G$ is a countable infinite discrete amenable group and $X$ a compact metric space. We prove a variational principle for topological entropy of saturated sets for systems which have…

The generating graph encodes how generating pairs are spread among the elements of a group. For more than ten years it has been conjectured that this graph is connected for every finite group. In this paper, we give evidence supporting this…

A connected graph $G$ is said to be $k$-connected if it has more than $k$ vertices and remains connected whenever fewer than $k$ vertices are deleted. In this paper, for a connected graph $G$ with sufficiently large order, we present a…

Let $G$ be a finite permutation group on a finite set $\Omega$. The notion of $G$ being quasi-transitive on $\Omega$ was defined by Alan Camina \cite{Camina}; in that paper conditions were established that ensured a quasi-transitive group…

The group configuration in o-minimal structures gives rise, just like in the stable case, to a transitive action of a type-definable group on a partial type. Because $acl=dcl$ the o-minimal proof is significantly simpler than Hrushovski's…

A locating-dominating set in a graph G is a subset of vertices representing "detectors" which can locate an "intruder" given that each detector covers its closed neighborhood and can distinguish its own location from its neighbors. We…