Related papers: Cyclotomic exponent sequences of numerical semigro…

The problem of expressing an element of K_2(F) in a more explicit form gives rise to many works. To avoid a restrictive condition in a work of Tate, Browkin considered cyclotomic elements as the candidate for the element with an explicit…

The cyclotomic matrix is commonly used to arrange cyclotomic numbers in a convenient format. A natural question is whether the structure of the matrix can reflect properties of these numbers. In this article, we examine cyclotomic numbers…

Let $G$ be a group. The intersection graph of cyclic subgroups of $G$, denoted by $\mathscr I_c(G)$, is a graph having all the proper cyclic subgroups of $G$ as its vertices and two distinct vertices in $\mathscr I_c(G)$ are adjacent if and…

We obtain the symplectic group $\SP(V)$ as the universal completion of an amalgam of low rank subgroups akin to Levi components. We let $\SP(V)$ act flag-transitively on the geometry of maximal rank subspaces of $V$. We show that this…

For the elements of a numerical semigroup which are larger than the Frobenius number, we introduce the definition of, seed, by broadening the notion of generator. This new concept allows us to explore the semigroup tree in an alternative…

A numerical semigroup is an additive submonoid of the natural numbers with finite complement. The size of the complement is called the genus of the semigroup. How many numerical semigroups have genus equal to $g$? We outline Zhai's proof of…

Let $p > 155$ be a prime and let $G$ be a cyclic group of order $p$. Let $S$ be a minimal zero-sum sequence with elements over $G$, i.e., the sum of elements in $S$ is zero, but no proper nontrivial subsequence of $S$ has sum zero. We call…

Let $S$ be a set of $n$ points in the plane in general position. Two line segments connecting pairs of points of $S$ cross if they have an interior point in common. Two vertex disjoint geometric graphs with vertices in $S$ cross if there…

We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We…

We introduce a new class of numerical semigroups, which we call the class of {\it acute} semigroups and we prove that they generalize symmetric and pseudo-symmetric numerical semigroups, Arf numerical semigroups and the semigroups generated…

Let $K$ be an abelian extension of the rationals. Let $S(K)$ be the Schur group of $K$ and let $CC(K)$ be the subgroup of $S(K)$ generated by classes containing cyclic cyclotomic algebras. We characterize when $CC(K)$ has finite index in…

We study two families of cyclotomic graphs and perfect codes in them. They are Cayley graphs on the additive group of $\mathbb{Z}[\zeta_m]/A$, with connection sets $\{\pm (\zeta_m^i + A): 0 \le i \le m-1\}$ and $\{\pm (\zeta_m^i + A): 0 \le…

An $S_k$-set in a group $\Gamma$ is a set $A\subseteq\Gamma$ such that $\alpha_1\cdots\alpha_k=\beta_1\cdots\beta_k$ with $\alpha_i,\beta_i\in A$ implies $(\alpha_1,\ldots,\alpha_k)=(\beta_1,\ldots,\beta_k)$. An $S_k'$-set is a set such…

We investigate the set of partial partitions of a finite set, ordered by inclusion. With this ordering the set of partial partitions can be studied as an abstract simplicial complex. We use the theory of shellable nonpure complexes to find…

In this paper we study numerical semigroups generated by three elements. We give a characterization of pseudo-symmetric numerical semigroups. Also, we will give a simple algorithm to get all the pseudo-symmetric numerical semigroups with…

We examine groups whose resonance varieties, characteristic varieties and Sigma-invariants have a natural arithmetic group symmetry, and we explore implications on various finiteness properties of subgroups. We compute resonance varieties,…

In a recent work [Das et al., Bull. Sci. Math. 199 (2025), 103580], the structure of characterized subgroups corresponding to arithmetic-type sequences was investigated. Building upon this work, we further show that a characterized subgroup…

Determining if an input undirected graph is Hamiltonian, i.e., if it has a cycle that visits every vertex exactly once, is one of the most famous NP-complete problems. We consider the following generalization of Hamiltonian cycles: for a…

Let ${\cal M}(S; \Lambda; P)$ denote a Rees $I\times \Lambda$ matrix semigroup without zero over a semigroup $S$, where $I$ is a singleton. If $\theta _S$ denotes the kernel of the right regular representation of a semigroup $S$, then a…

Let $A \subset {\mathbb Z}$ be a finite subset. We denote by $\mathcal{B}(A)$ the set of all integers $n \ge 2$ such that $|nA| > (2n-1)(|A|-1)$, where $nA=A+\cdots+A$ denotes the $n$-fold sumset of $A$. The motivation to consider…