arXiv subjects
Publications and source records attributed to Gábor Somlai.
We prove that the direct product of two coprime order elementary abelian groups of rank two, as well as the direct product of a cyclic group of prime order and a cyclic group of square free order are DCI-groups. The latter is a generalization of Muzychuk's result on cyclic groups (J. Combin. Theory Ser. A, 1995).
In this paper we study Fuglede's conjecture on the direct product of two cyclic groups. After collecting the known results we prove that Fuglede's conjecture holds on $\mathbb{Z}_{pq} \times \mathbb{Z}_{pq} \cong \mathbb{Z}_p^2 \times \mathbb{Z}_q^2$.
The tile-spectral direction of the discrete Fuglede-conjecture is well-known for cyclic groups of square-free order, initiated by Laba and Meyerowitz, but the spectral-tile direction is far from being well-understood. The product of at most three primes as the order of the cyclic group was studied intensely in the last couple of years. In this paper we study the case when the order of the cyclic group is the product of four different primes and prove that Fuglede's conjecture holds in this case.
The study of Fuglede's conjecture on the direct product of elementary abelian groups was initiated by Iosevich et al. For the product of two elementary abelian groups the conjecture holds. For $\mathbb{Z}_p^3$ the problem is still open if $p\ge 11$. In connection we prove that Fuglede's conjecture holds on $\mathbb{Z}_{p}^2\times \mathbb{Z}_q$ by developing a method based on ideas from discrete geometry.
We show that every minimum area isosceles triangle containing a given triangle $T$ shares a side and an angle with $T$. This proves a conjecture of Nandakumar motivated by a computational problem. We use our result to deduce that for every triangle $T$, (1) there are at most $3$ minimum area isosceles triangles that contain $T$, and (2) there exists an isosceles triangle containing $T$ whose area is smaller than $\sqrt2$ times the area of $T$. Both bounds are best possible.
For every pair of distinct primes $p$, $q$ we prove that $\mathbb{Z}_p^3 \times \mathbb{Z}_q$ is a CI-group with respect to binary relational structures.
We investigate the discrete Fuglede's conjecture and Pompeiu problem on finite abelian groups and develop a strong connection between the two problems. We give a geometric condition under which a multiset of a finite abelian group has the discrete Pompeiu property. Using this description and the revealed connection we prove that Fuglede's conjecture holds for $\mathbb{Z}_{p^n q^2}$, where $p$ and $q$ are different primes. In particular, we show that every spectral subset of $\mathbb{Z}_{p^n q^2}$ tiles the group. Further, using our combinatorial methods we give a simple proof for the statement that Fuglede's conjecture holds for $\mathbb{Z}_p^2$.
An $n$-ary associative function is called reducible if it can be written as a composition of a binary associative function. We summarize known results when the function is defined on a chain and is nondecreasing. Our main result shows that associative idempotent and nondecreasing functions are uniquely reducible.
We investigate monotone idempotent $n$-ary semigroups. One of the main result of this article is the generalisation of Czogala-Drewniak Theorem, which describes the idempotent monotone associative functions having neutral element. Furthermore we present the full characterisation of idempotent, monotone, $n$-associative functions on an interval which have neutral elements. %{\bl defined}. Our description provides that monotone, idempotent, $n$-ary semigroups are quasitrivial.
In this paper we study finite groups which have Cayley isomorphism property with respect to Cayley maps, CIM-groups for a brief. We show that the structure of the CIM-groups is very restricted. It is described in Theorem~\ref{111015a} where a short list of possible candidates for CIM-groups is given. Theorem~\ref{111015c} provides concrete examples of infinite series of CIM-groups.
We investigate the decomposition problem of balls into finitely many congruent pieces in dimension $d=2k$. In addition, we prove that the $d$ dimensional unit ball $B_d$ can be divided into finitely many congruent pieces if $d=4$ or $d\ge 6$. We show that the minimal number of required pieces is less than $20d$ if $d \ge 10$.
For every prime $p > 3$ and for every prime $q>p^3$ we prove that $\mathbb{Z}_q \times \mathbb{Z}_p^3$ is a DCI-group.