Related papers: Monomial arrow removal and the finitistic dimensio…
We consider various counting questions for irreducible binomials over finite fields. We use various results from analytic number theory to investigate these questions.
In Commutative Algebra structure results on minimal free resolutions of Gorenstein modules are of classical interest. We define Gorenstein modules of finite length over the weighted polynomial ring via symmetric matrices in divided powers.…
Using linear algebraic methods we show that every (possibly infinite-dimensional) representation of a quiver with underlying graph $A_{\infty, \infty}$ is Krull-Schmidt, as long as the arrows in the quiver eventually point outward.
Factoring ideals in integral domains is a central topic in multiplicative ideal theory. In the present paper we study monoids of ideals and consider factorizations of ideals into multiplicatively irreducible ideals. The focus is on the…
In this paper we further the study of arrow algebras, simple algebraic structures inducing toposes through the tripos-to-topos construction, by defining appropriate notions of morphisms between them which correspond to morphisms of the…
Centraliser algebras of monomial representations of finite groups may be constructed and studied using methods similar to those employed in the study of permutation groups. Guided by results of D. G. Higman and others, we give an explicit…
We study the problem of whether a given finite algebra with finitely many basic operations contains a cube term; we give both structural and algorithmic results. We show that if such an algebra has a cube term then it has a cube term of…
Assume that $X= {x_1,...,x_g}$ is a finite alphabet and $K$ is a field. We study monomial algebras $A= K <X> /(W)$, where $W$ is an antichain of Lyndon words in $X$ of arbitrary cardinality. We find a Poincar\'{e}-Birkhoff-Witt type basis…
The cylindrical algebraic covering method was originally proposed to decide the satisfiability of a set of non-linear real arithmetic constraints. We reformulate and extend the cylindrical algebraic covering method to allow for checking the…
We investigate finite deterministic automata in sets with non-homogeneous atoms: integers with successor. As there are uncount- ably many deterministic finite automata in this setting, we restrict our attention to automata with semilinear…
In this paper, we apply the techniques developed in [5] to present several consequences of studying UMP algebras and the ramifications graph of a monomial bound quiver algebra. Specifically, we prove that every weakly connected component of…
We give a criterion when a polynomial $x^n-g$ is irreducible over a pseudofinite field. As an application we give an explicit description of algebraic closure of some pseudofinite fields of zero characteristic.
An n dimensional monomial dynamical system over a finite field K is a nonlinear deterministic time discrete dynamical system with the property that each of the n component functions is a monic nonzero monomial function in n variables. In…
We extend the maximal unitarity method to amplitude contributions whose cuts define multidimensional algebraic varieties. The technique is valid to all orders and is explicitly demonstrated at three loops in gauge theories with any number…
Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…
The tree-depth problem can be seen as finding an elimination tree of minimum height for a given input graph $G$. We introduce a bicriteria generalization in which additionally the width of the elimination tree needs to be bounded by some…
For the representation-theoretic study of domestic string algebras, Schr\"{o}er introduced a version of hammocks that are bounded discrete linear orders. He introduced a finite combinatorial gadget called the bridge quiver, which we…
We study maximal subalgebras of an arbitrary finite dimensional algebra over a field, and obtain full classification/description results of such algebras. This is done by first obtaining a complete classification in the semisimple case, and…
At the first part of the paper we show how specific umbral extensions of the Stirling numbers of the second kind result in new type of Dobinski-like formulas. In the second part among others one recovers how and why Ward solution of…
Motivated by the Poisson Dixmier-Moeglin equivalence problem, a systematic study of commutative unitary rings equipped with a {\em biderivation}, namely a binary operation that is a derivation in each argument, is here begun, with an eye…