Related papers: A Note on the Isomorphism Problem for Monomial Dig…

A monomial algebra B is defined as a quotient of a polynomial ring by a monomial ideal, which is an ideal generated by a finite set of monomials. In this paper, we determine the automorphism group of a monomial algebra B, under the…

We define totally-isotropic polynomials of alternating matrix spaces over finite fields, by analogy with independence polynomials of graphs. Our main result shows that totally-isotropic polynomials of graphical alternating matrix spaces…

Let $G=(V,E)$ be a finite undirected graph. An edge set $E' \subseteq E$ is a {\em dominating induced matching} ({\em d.i.m.}) in $G$ if every edge in $E$ is intersected by exactly one edge of $E'$. The \emph{Dominating Induced Matching}…

Given a digraph $D$, we say that a set of vertices $Q\subseteq V(D)$ is a $q$-kernel if $Q$ is an independent set and if every vertex of $D$ can be reached from $Q$ by a path of length at most $q$. In this paper, we initiate the study of…

Let $k\geq 2$ be a square-free integer. We prove that the number of square-free integers $m\in [1,N]$ such that $(k,m)=1$ and $\mathbb{Q}(\sqrt[3]{k^2m})$ is monogenic is $\gg N^{1/3}$ and $\ll N/(\log N)^{1/3-\epsilon}$ for any…

There is a natural infinite graph whose vertices are the monomial ideals in a polynomial ring. The definition involves Gr\"obner bases or the action of an algebraic torus. We present algorithms for computing the (affine schemes…

In this paper we extend one direction of Fr\"oberg's theorem on a combinatorial classification of quadratic monomial ideals with linear resolutions. We do this by generalizing the notion of a chordal graph to higher dimensions with the…

We consider point sets in the $m$-dimensional affine space $\mathbb{F}_q^m$ where each squared Euclidean distance of two points is a square in $\mathbb{F}_q$. It turns out that the situation in $\mathbb{F}_q^m$ is rather similar to the one…

The present paper mainly considers the representation type of the enveloping algebra of monomial algebra. Let $A$ be a monomial algebra and $A^e= A\otimes_{\mathrm{l}\!\mathrm{k}} A^{\mathrm{op}}$ its enveloping algebra. It is shown that…

This article sets out to understand the categories $\QGr A$ where $A$ is either a monomial algebra or a path algebra of finite Gelfand-Kirillov dimension. The principle questions are: 1) What is the structure of the point modules up to…

To investigate hyperbinary expansions of a nonnegative integer~$n$, an edge-labeled directed graph $A(n)$ has recently been introduced. After pointing out some new simple facts about its cyclomatic number, we give a relatively simple…

The queen's graph $Q_{m \times n}$ has the squares of the $m \times n$ chessboard as its vertices; two squares are adjacent if they are in the same row, column, or diagonal of the board. A set $D$ of squares of $Q_{m \times n}$ is a…

Let $G$ denote a $Q$-polynomial distance-regular graph with diameter $D$ at least 4. Assume that the intersection numbers of $G$ satisfy $a_i=0$ for $0 \leq i \leq D-1$ and $a_D\neq 0$. We show that $G$ is a polygon, a folded cube, or an…

A number field K is a finite extension of rational number field Q. A circulant digraph integral over K means that all its eigenvalues are algebraic integers of K. In this paper we give the sufficient and necessary condition for circulant…

Let $R$ be a finite ring with identity. The clean graph $Cl(R)$ of a ring $R$ is a graph whose vertices are pairs $(e, u)$, where $e$ is an idempotent element and $u$ is a unit of $R$. Two distinct vertices $(e, u)$ and $(f, v)$ are…

This paper is a study of the set of rational numbers of the form 1 < a^q /b^p < a with a and b co-prime integers. The set F (a,b) of these numbers, with an appropriate binary law, is a monoid isomorphic to (N, +, 0). We identify the…

Let $\mathbb{F}$ be a field and let $E$ be the natural representation of $\mathrm{SL}_2(\mathbb{F})$. Given a vector space $V$, let $\Delta^{(2,1^{N-1})}V$ be the kernel of the multiplication map $\bigwedge^N V \otimes V \rightarrow…

Let $D_{n,\gamma}$ be the complex of graphs on $n$ vertices and domination number at least $\gamma$. We prove that $D_{n,n-2}$ has the homotopy type of a finite wedge of 2-spheres. This is done by using discrete Morse theory techniques.…

A finite group $G$ is called monomial if every irreducible character of $G$ is induced from a linear character of some subgroup of $G$. One of the main questions regarding monomial groups is whether or not a normal subgroup $N$ of a…

Let the finite distributive lattice $D$ be isomorphic to the congruence lattice of a finite lattice $L$. Let $Q$ denote those elements of $D$ that correspond to principal congruences under this isomorphism. Then $Q$ contains $0,1 \in D$ and…