Related papers: Generating sets, presentations, and growth of trop…

The complete growth series of a finitely generated group is given by $\sum_{n\ge 0} A_ns^n$, where $A_n$ is the sum of elements of length $n$ in the group semiring. We study the $\mathbb NG$-rationality and $\mathbb NG$-algebraicity of such…

We prove that for genus $g=3,4$, the extended mapping class group $\text{Mod}^{\pm}(S_g)$ can be generated by two elements of finite orders. But for $g=1$, $\text{Mod}^{\pm}(S_1)$ cannot be generated by two elements of finite orders.

Let $(\mathsf{baxt}_n,~^\sharp)$ be the Baxter monoid of finite rank $n$ with Sch\"{u}tzenberger's involution $^{\sharp}$. In this paper, it is shown that $(\mathsf{baxt}_n,~^\sharp)$ admits a faithful representation by an involution monoid…

Motivated by recent advances in inverse semigroup theory, we investigate the growth of and identities satisfied by free left and free two-sided adequate monoids. We explicitly compute the growth of the monogenic free left adequate monoid…

The dominant theme of this thesis is the construction of matrix representations of finite solvable groups using a suitable system of generators. For a finite solvable group $G$ of order $N = p_{1}p_{2}\dots p_{n}$, where $p_{i}$'s are…

We show that a topologically generating set $S$ of a connected compact Lie group $G$ of size larger than a fixed polynomial in the rank of $G$ must be redundant (i.e., some proper subset of $S$ still topologically generates $G$). Similar…

We present two algorithms to list certain classes of monomino-domino coverings which conform to the \emph{tatami} restriction; no four tiles meet. Our methods exploit structural features of tatami coverings in order to create the lists in…

Let $\mathbb{K}=\mathbb{R}$ or $\mathbb{C}$, and $T_n(\mathbb{K})$ be the set of $n\times n$ lower triangular matrices with entries in $\mathbb{K}$. We show that $T_n(\mathbb{K})$ has dense subsemigroups that are generated by $n+1$…

We prove that the number of monomer-dimer tilings of an $n\times n$ square grid, with $m<n$ monomers in which no four tiles meet at any point is $m2^m+(m+1)2^{m+1}$, when $m$ and $n$ have the same parity. In addition, we present a new proof…

We enumerate a certain class of monomino-domino coverings of square grids, which conform to the \emph{tatami} restriction; no four tiles meet. Let $\mathbf T_{n}$ be the set of monomino-domino tatami coverings of the $n\times n$ grid with…

Let $S$ be a submonoid of a free Abelian group of finite rank. We show that if $k$ is a field of prime characteristic such that the monoid $k$-algebra $k[S]$ is split $F$-regular, then $k[S]$ is a finitely generated $k$-algebra, or…

Proving a conjecture of Dennis Johnson, we show that the Torelli subgroup of the mapping class group has a finite generating set whose size grows cubically with respect to the genus of the surface. Our main tool is a new space called the…

The goal of this paper is to study the possible monoids appearing as the associated monoids of the initial algebra of a finitely generated homogeneous $\Bbbk$-subalgebra of a polynomial ring $\Bbbk[x_1,\ldots,x_n]$. Clearly, any affine…

There are two main examples where a version of the Minimal Model Program can, at least conjecturally, be performed successfully: the first is the classical MMP associated to the canonical divisor, and the other is Mori Dream Spaces. In this…

A prefix monoid is a finitely generated submonoid of a finitely presented group generated by the prefixes of its defining relators. Important results of Guba (1997), and of Ivanov, Margolis and Meakin (2001), show how the word problem for…

We prove that there exist uniform $(+,\times,/)$-circuits of size $O(n^3)$ to compute the basis generating polynomial of regular matroids on $n$ elements. By tropicalization, this implies that there exist uniform $(\max,+,-)$-circuits and…

We show that lower bounds on the border rank of matrix multiplication can be used to non-trivially derandomize polynomial identity testing for small algebraic circuits. Letting $\underline{R}(n)$ denote the border rank of $n \times n \times…

We consider the periods of the linear congruential and the power generators modulo $n$ and, for fixed choices of initial parameters, give lower bounds that hold for ``most'' $n$ when $n$ ranges over three different sets: the set of primes,…

A poset is said to be (2+2)-free if it does not contain an induced subposet that is isomorphic to 2+2, the union of two disjoint 2-element chains. Two elements in a poset are indistinguishable if they have the same strict up-set and the…

We show that the rank r component of the free idempotent generated semigroup of the biordered set of the full linear monoid of n x n matrices over a division ring Q has maximal subgroup isomorphic to the general linear group GL_r(Q), where…