Related papers: Two variants of the Froiduire-Pin Algorithm for fi…
Recently, Lin and Pryadko presented the quantum two-block group algebra codes, a generalization of bicycle codes obtained from Cayley graphs of non-Abelian groups. We notice that their construction is naturally suitable to obtain a quantum…
For a commutative finite $\mathbb{Z}$-algebra, i.e., for a commutative ring $R$ whose additive group is finitely generated, it is known that the group of units of $R$ is finitely generated, as well. Our main results are algorithms to…
Pin fins are imperative in the cooling of turbine blades. The designs of pin fins, therefore, have seen significant research in the past. With the developments in metal additive manufacturing, novel design approaches toward complex…
Path and boundary-path groupoids of finitely aligned higher-rank graphs are often constructed using either filters or graph morphisms. We generalise the graph morphism approach to finitely aligned P-graphs where (Q, P) is a weakly…
Let $\langle A\rangle$ be the numerical semigroup generated by relatively prime positive integers $\{a_1,a_2,...,a_n\}$. The quotient of $\langle A\rangle$ with respect to a positive integer $p$ is defined by $\frac{\langle…
Let $\CaC\subset \Q^p$ be a rational cone. An affine semigroup $S\subset \CaC$ is a $\CaC$-semigroup whenever $(\CaC\setminus S)\cap \N^p$ has only a finite number of elements. In this work, we study the tree of $\CaC$-semigroups, give a…
We give parallel algorithms for string diagrams represented as structured cospans of ACSets. Specifically, we give linear (sequential) and logarithmic (parallel) time algorithms for composition, tensor product, construction of diagrams from…
We survey some aspects of Frobenius algebras, Frobenius structures and their relation to finite Hopf algebras using graphical calculus. We focus on the `yanking' moves coming from a closed structure in a rigid monoidal category, the…
In this paper we study ends of finitely generated semigroups. The ends we are working with are the ends of the undirected graphs of Cayley graphs of finitely generated semigroups. We prove that the number of ends is preserved for…
Let $S$ be a semigroup, $\Lambda$ a non-empty set and $P$ a mapping of $\Lambda$ into $S$. The set $S\times \Lambda$ together with the operation $\circ _P$ defined by $(s, \lambda)\circ _P(t, \mu )=(sP(\lambda)t, \mu )$ form a semigroup…
We examine properties of random numerical semigroups under a probabilistic model inspired by the Erdos-Renyi model for random graphs. We provide a threshold function for cofiniteness, and bound the expected embedding dimension, genus, and…
In this paper, we generalize the formal affine Demazure algebra of Hoffnung-Malag\'on-L\'opez-Savage-Zainoulline to all real finite reflection groups. We begin by generalizing the formal group ring of Calm\`es-Petrov-Zainoulline to all real…
A classic result of Conway and Coxeter on frieze patterns has been generalized to a bijection between $p$-angulations of regular polygons and frieze patterns of type $\Lambda_p$. One of the features of Conway-Coxeter theory is a…
String diagrams are a powerful and intuitive graphical syntax, originated in the study of symmetric monoidal categories. In the last few years, they have found application in the modelling of various computational structures, in fields as…
The aim of this paper is to provide an atlas of identity bases for varieties generated by small semigroups and groups. To help the working mathematician easily find information, we provide a companion website that runs in the background…
In this paper, several two-grid finite element algorithms for solving parabolic integro-differential equations (PIDEs) with nonlinear memory are presented. Analysis of these algorithms is given assuming a fully implicit time discretization.…
The finite element method (FEM) is a cornerstone numerical technique for solving partial differential equations (PDEs). Here, we present $\textbf{Qu-FEM}$, a fault-tolerant era quantum algorithm for the finite element method. In contrast to…
This paper continues the study of Fourier transforms on finite inverse semigroups, with a focus on Fourier inversion theorems and FFTs for new classes of inverse semigroups. We begin by introducing four inverse semigroup generalizations of…
The Stallings construction for finitely generated subgroups of free groups is generalized by introducing the concept of Stallings section, which allows an eficient computation of the core of a Schreier graph based on edge folding. It is…
Based on Schreyer's algorithm (Schreyer, 1980, 1991; Berkesch and Schreyer, 2014), we present two refined algorithms for the computation of syzygies. The two main ideas of the first algorithm, called LiftHybrid, are the following: First, we…