Related papers: A Note on Slice Rank and Matchings in Groups
Let G be an arithmetic Kleinian group, and let O be the associated hyperbolic 3-orbifold or 3-manifold. In this paper, we prove that, in many cases, G is large, which means that some finite index subgroup admits a surjective homomorphism…
A matching $M$ in a graph $G$ is an \emph{acyclic matching} if the subgraph of $G$ induced by the endpoints of the edges of $M$ is a forest. Given a graph $G$ and a positive integer $\ell$, Acyclic Matching asks whether $G$ has an acyclic…
Given a complex simply connected simple algebraic group $G$ of exceptional type and a maximal parabolic subgroup $P \subset G$, we classify all triples $(G,P,H)$ such that $H \subset G$ is a maximal reductive subgroup acting spherically on…
In this article we give a classification of the sub-groups in PSL(2,Z) and of the conjugacy classes of these sub-groups by the mean of an combinatorial invariant: some trivalent diagrams (dotted or not). We give explicit formulae enabling…
A balanced pair in an ordered set $P=(V,\leq)$ is a pair $(x,y)$ of elements of $V$ such that the proportion of linear extensions of $P$ that put $x$ before $y$ is in the real interval $[1/3, 2/3]$. We define the notion of a good pair and…
For simple twisted group algebra over a group $G$, if $G^{\shortmid}$ is Hall subgroup of $G$ then the semi-center is simple. Simple twisted groups algebras correspond to groups of central type. We classify all groups of central type of…
Let $G$ be a non-abelian $p$-group of order $p^n$ and $M(G)$ denote the Schur multiplier of $G$. Niroomand proved that $|M(G)| \leq p^{\frac{1}{2}(n+k-2)(n-k-1)+1}$ for non-abelian $p$-groups $G$ of order $p^n$ with derived subgroup of…
The cyclic matching sequenceability of a simple graph $G$, denoted $\mathrm{cms}(G)$, is the largest integer $s$ for which there exists a cyclic ordering of the edges of $G$ so that every set of $s$ consecutive edges forms a matching. In…
A partition on $[n]$ has a crossing if there exists $i\_1<i\_2<j\_1<j\_2$ such that $i\_1$ and $j\_1$ are in the same block, $i\_2$ and $j\_2$ are in the same block, but $i\_1$ and $i\_2$ are not in the same block. Recently, Chen et al.…
Let G be a simple undirected graph with no isolated vertex. A paired dominating set of G is a dominating set which induces a subgraph that has a perfect matching. The paired domination number of G, denoted by {\gamma}pr(G), is the size of…
For primes $p,e>2$ there are at least $p^{e-3}/e$ groups of order $p^{2e+2}$ that have equal multisets of isomorphism types of proper subgroups and proper quotient groups, isomorphic character tables, and power maps. This obstructs recent…
If $\mathscr{G} = (G, +)$ is an abelian group, $S \subset G$ is said to scatter under addition if for all $a,b \in S$, $a+b \not \in S$. If $\mathscr{U}^{n}_{p}$ is the set of $n$th roots of unity in $\mathbb{Z}/p\mathbb{Z}$, where $n \geq…
We consider a planar graph $G$ in which the edges have nonnegative integer lengths such that the length of every cycle of $G$ is even, and three faces are distinguished, called holes in $G$. It is known that there exists a packing of cuts…
For a given monic polynomial $p(t)$ of degree $n$ over a commutative ring $k$, the splitting algebra is the universal $k$-algebra in which $p(t)$ has $n$ roots, or, more precisely, over which $p(t)$ factors, $p(t)=(t-\xi_1)...(t-\xi_n)$.…
In this paper, we investigate the multiplicative structure of a shifted multiplicative subgroup and its connections with additive combinatorics and the theory of Diophantine equations. Among many new results, we highlight our main…
A decomposition of a graph $G$ is a family of subgraphs of $G$ whose edge sets form a partition of $E(G)$. In this paper, we prove that every triangle-free planar graph $G$ can be decomposed into a $2$-degenerate graph and a matching.…
Any nontrivial homomorphism from the mapping class group of an orientable surface of genus $g\geq 3$ to $\GL(2g,\C)$ is conjugate to the standard symplectic representation. It is also shown that the mapping class group has no faithful…
A matching $M$ in a graph $G$ is uniquely restricted if no other matching in $G$ covers the same set of vertices. We prove that any connected subcubic graph with $n$ vertices and girth at least $5$ contains a uniquely restricted matching of…
Let $T$ be a finite simple group of Lie type in characteristic $p$, and let $S$ be a Sylow subgroup of $T$ with maximal order. It is well known that $S$ is a Sylow $p$-subgroup except in an explicit list of exceptions, and that $S$ is…
Given an integer $k\ge3$ and a group $G$ of odd order, if there exists a $2$-$(v,k,1)$-design and if $v$ is sufficiently large, then there is such a design whose automorphism group has a subgroup isomorphic to $G$. A weaker result is proved…