Related papers: A Note on Slice Rank and Matchings in Groups

We investigate the multiplication group of a special class of quasigroup called AG-group. We prove some interesting results such as: the multiplication group of an AG-group of order n is non-abelian group of order 2n and its left section is…

A matching in a group G is a bijection f from a subset A to a subset B in G such that af(a) does not belong to A for all a in A. The group G is said to have the matching property if, for any finite subsets A,B in G of same cardinality with…

A perfect matching in a 3-uniform hypergraph on $n=3k$ vertices is a subset of $\frac{n}{3}$ disjoint edges. We prove that if $H$ is a 3-uniform hypergraph on $n=3k$ vertices such that every vertex belongs to at least ${n-1\choose 2} -…

A generalized triangle group is a group that can be presented in the form $G = < x,y | x^p=y^q=w(x,y)^r=1>$, where $p,q,r\geq 2$ and $w(x,y)$ is a cyclically reduced word of length at least 2 in the free product $\Z_p*\Z_q=< x,y |…

We give a sharp bound on the number of triangles in a graph with fixed number of edges. We also characterize graphs that achieve the maximum number of triangles. Using the upper bound on number of triangles, we prove that if $G$ is a…

We study the parity of rank of $2$-${\rm Selmer}$ groups associated to $\pi/3$ and $2\pi/3$-congruent numbers. Our second result gives some positive densities about $\pi/3$ and $2\pi/3$ non-congruent numbers which can support the even part…

Let $K$ be a field of characteristic $p$ and $G$ a nonabelian metacyclic finite $p$-group. We give an explicit list of all metacyclic $p$-groups $G$, such that the group algebra $KG$ over a field of characteristic $p$ has a filtered…

For a graph $G$ let $L(G)$ and $l(G)$ denote the size of the largest and smallest maximum matching of a graph obtained from $G$ by removing a maximum matching of $G$. We show that $L(G)\leq 2l(G),$ and $L(G)\leq (3/2)l(G)$ provided that $G$…

For a simple algebraic group G in characteristic p, a triple (a,b,c) of positive integers is said to be rigid for G if the dimensions of the subvarieties of G of elements of order dividing a,b,c sum to 2dim G. In this paper we complete the…

Suppose that all groups of order $n$ are defined on the same set $G$ of cardinality $n$, and let the \emph{distance} of two groups of order $n$ be the number of pairs $(a,b)\in G\times G$ where the two group operations differ. Given a group…

Approximation theorems for algebraic stacks over a number field $k$ are studied in this article. For G a connected linear algebraic group over a number field we prove strong approximation with Brauer-Manin obstruction for the classifying…

The author in $($On the order of Schur multiplier of non-abelian $p$-groups. J. Algebra (2009).322: 4479--4482$)$ showed that for any $p$-group $G$ of order $p^n$ there exists a nonnegative integer $s(G)$ such that the order of Schur…

A 2-covering for a finite group $G$ is a set of proper subgroups of $G$ such that every pair of elements of $G$ is contained in at least one subgroup in the set. The minimal number of subgroups needed to 2-cover a group $G$ is called the…

It is well-known that every $n$-vertex planar graph with minimum degree 3 has a matching of size at least $\frac{n}{3}$. But all proofs of this use the Tutte-Berge-formula for the size of a maximum matching. Hence these proofs are not…

The tree spanner problem for a graph $G$ is as follows: For a given integer $k$, is there a spanning tree $T$ of $G$ (called a tree $k$-spanner) such that the distance in $T$ between every pair of vertices is at most $k$ times their…

A spectral characterization of the matching number (the size of a maximum matching) of a graph is given. More precisely, it is shown that the graphs G of order n whose matching number is k are precisely those graphs with the maximum skew…

If G is a group with a presentation of the form < x,y|x^3=y^3=W(x,y)^2=1 >, then either G is virtually soluble or G contains a free subgroup of rank 2. This provides additional evidence in favour of a conjecture of Rosenberger.

A set of proper subgroups is a covering for a group if its union is the whole group. The minimal number of subgroups needed to cover $G$ is called the covering number of $G$, denoted by $\sigma(G)$. Determining $\sigma(G)$ is an open…

Let $X=G/K$ be a higher rank symmetric space of non-compact type, where $G$ is the connected component of the isometry group of $X$. We define the splitting rank of $X$, denoted by $\text{srk}(X)$, to be the maximal dimension of a totally…

Let G be an exceptional algebraic group defined over an algebraically closed field k of characteristic p>0 and let H be a subgroup of G. Then following Serre we say H is G-completely reducible or G-cr if, whenever H is contained in a…