Related papers: Semi-cyclic holey group divisible designs with blo…
We introduce supergroup analogues of 3-manifold invariants $\hat{Z}$, also known as homological blocks, which were previously considered for ordinary compact semisimple Lie groups. We focus on superunitary groups, and work out the case of…
Consider a numerical semigroup minimally generated by a subset of the interval $[e,2e-1]$ with multiplicity $e$ and width $e-1$. Such numerical semigroups are called Sally type semigroups. We show that the defining ideals of these semigroup…
A numerical semigroup is called cyclotomic if its corresponding numerical semigroup polynomial $P_S(x)=(1-x)\sum_{s\in S}x^s$ is expressable as the product of cyclotomic polynomials. Ciolan, Garc\'ia-S\'anchez, and Moree conjectured that…
Combinatorial $t$-designs have been an interesting topic in combinatorics for decades. It is a basic fact that the codewords of a fixed weight in a code may hold a $t$-design. Till now only a small amount of work on constructing $t$-designs…
In [Bal18] a new method of constructing simplex designs based on cyclic group on $n$ elements has been proposed. One of the claims put forward therein is existence of 3-point simplex 3-design in dimension $d = 3$. In this manuscript we…
In this paper we study numerical semigroups of Sally type of multiplicity $e$ and embedding dimension $\nu \ge e-2$. We construct the minimal resolutions for these semigroup rings when they are symmetric and compute their Betti numbers. We…
It has been known for a long time that $t$-designs can be employed to construct both linear and nonlinear codes and that the codewords of a fixed weight in a code may hold a $t$-design. While a lot of progress in the direction of…
In this article we see quasi-cyclic codes as block cyclic codes. We generalize some properties of cyclic codes to quasi-cyclic ones such as generator polynomials and ideals. Indeed we show a one-to-one correspondence between l-quasi-cyclic…
In this article, we study the metacyclic p-group codes arising from finite semisimple group algebras. In [CM25], we studied group codes arising from metacyclic groups with order divisible by two distinct odd primes. In the current work, we…
The exactly and quasi-exactly solvable problems for spin one-half in one dimension on the basis of a hidden dynamical symmetry algebra of Hamiltonian are discussed. We take the supergroup, $OSP(2|1)$, as such a symmetry. A number of exactly…
We develop new techniques in order to deal with Riccati-type equations, subject to a further algebraic constraint, on Riemannian manifolds $(M^3,g)$. We find that the obstruction to solve the aforementioned equation has order $4$ in the…
We algorithmically compute integral Eilenberg-MacLane homology of all semigroups of order at most $8$ and present some particular semigroups with notable classifying spaces, refuting conjectures of Nico. Along the way, we give an…
We show that the Nichols algebra of a simple Yetter-Drinfeld module over a projective special linear group over a finite field whose support is a semisimple orbit has infinite dimension, provided that the elements of the orbit are…
The Semialgebraic Orbit Problem is a fundamental reachability question that arises in the analysis of discrete-time linear dynamical systems such as automata, Markov chains, recurrence sequences, and linear while loops. An instance of the…
Every semicomplete multipartite digraph contains a quasi-Hamiltonian path, but the problem of finding a quasi-Hamiltonian path with prescribed start and end vertex is NP-complete even when restricted to semicomplete multipartite digraphs…
The three-particle Hamiltonian obtained by replacing the two-body trigonometric potential of the Sutherland problem by a three-body one of a similar form is shown to be exactly solvable. When written in appropriate variables, its…
We determine the structure of the finite non-solvable groups of order divisible by $3$ all whose maximal subgroups of order divisible by $3$ are supersolvable. Precisely, we demonstrate that if $G$ is a finite non-solvable group satisfying…
A Steiner 2-design of block size k is an ordered pair (V, B) of finite sets such that B is a family of k-subsets of V in which each pair of elements of V appears exactly once. A Steiner 2-design is said to be r-even-free if for every…
One of the toughest problems in Ramsey theory is to determine the existence of monochromatic arithmetic progressions in groups whose elements have been colored. We study the harder problem to not only determine the existence of…
We consider semi-orthogonal decompositions of derived categories for 3-dimensional projective varieties in the case when the varieties have ordinary double points.