Related papers: Abelian groups yield many large families for the d…

We study a family of affine varieties arising from a version of an old problem due to Birkhoff asking for the classification of embeddings of finite abelian p-groups. We show that all of these varieties are irreducible and have a dense…

We are interested in maximizing the number of pairwise unrelated copies of a poset $P$ in the family of all subsets of $[n]$. We prove that for any $P$ the maximum number of unrelated copies of $P$ is asymptotic to a constant times the…

Each Abelian subgroup of the fundamental group of a compact and locally simply connected $d$-dimensional length space with no conjugate points is isomorphic to $\mathbb{Z}^k$ for some $0 \leq k \leq d$. It follows from this and previously…

We introduce two polynomials (in $q$) associated with a finite poset $P$ that encode some information on the covering relation in $P$. If $P$ is a distributive lattice, and hence $P$ is isomorphic to the poset of dual order ideals in a…

Let A, B and S be three subsets of a finite Abelian group G. The restricted sumset of A and B with respect to S is defined as A\wedge^{S} B= {a+b: a in A, b in B and a-b not in S}. Let L_S=max_{z in G}| {(x,y): x,y in G, x+y=z and x-y in…

An $\mathcal{F}$-essential subgroup is called a pearl if it is either elementary abelian of order $p^2$ or non-abelian of order $p^3$. In this paper we start the investigation of fusion systems containing pearls: we determine a bound for…

Let G be a group. The intersection graph G(G) of G is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper nontrivial subgroups of G; and there is an edge between two distinct…

The conjugacy problem belongs to algorithmic group theory. It is the following question: given two words x, y over generators of a fixed group G, decide whether x and y are conjugated, i.e., whether there exists some z such that zxz^{-1} =…

Given a finite group $G$ and a prime $p$, let $\mathcal{A}_p(G)$ be the poset of nontrivial elementary abelian $p$-subgroups of $G$. The group $G$ satisfies the Quillen dimension property at $p$ if $\mathcal{A}_p(G)$ has non-zero homology…

We study the problem of finding a subgroup of a given order in a finite group, where the group is represented by its Cayley table. We analyze the complexity of the problem in the special case of abelian groups and present an optimal…

Let $E_\lambda$ be the Legendre elliptic curve of equation $Y^2=X(X-1)(X-\lambda)$. We recently proved that, given $n$ linearly independent points $P_1(\lambda), \dots,P_n(\lambda)$ on $E_\lambda$ with coordinates in…

We prove new complexity results for computational problems in certain wreath products of groups and (as an application) for free solvable group. For a finitely generated group we study the so-called power word problem (does a given…

We generalize the classical Post correspondence problem ($\mathbf{PCP}_n$) and its non-homogeneous variation ($\mathbf{GPCP}_n$) to non-commutative groups and study the computational complexity of these new problems. We observe that…

The question to enumerate all inclusion-minimal connected dominating sets in a graph of order $n$ in time significantly less than $2^n$ is an open question that was asked in many places. We answer this question affirmatively, by providing…

This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann…

The maximality of Abelian subgroups play a role in various parts of group theory. For example, Mycielski has extended a classical result of Lie groups and shown that a maximal Abelian subgroup of a compact connected group is connected and,…

An almost Abelian Lie group is a non-Abelian Lie group with a codimension 1 Abelian normal subgroup. The majority of 3-dimensional real Lie groups are almost Abelian, and they appear in all parts of physics that deal with anisotropic media…

We define a family of random sets of points, the Diamond ensemble, on the sphere $\mathbb{S}^{2}$ depending on several parameters. Its most important property is that, for some of these parameters, the asymptotic expected value of the…

Classifying symmetry groups which can be implemented in the scalar sector of a model with $N$ Higgs doublets is a difficult and an unsolved task for $N>2$. Here, we make the first step towards this goal by classifying the Abelian symmetry…

Hard instances of natural computational problems are often elusive. In this note we present an example of a natural decision problem, the word problem for a certain finitely presented group, whose hard instances are easy to find. More…