Related papers: On the arithmetic of power monoids

A variety of algebras is called limit if it is non-finitely based but all its proper subvarieties are finitely based. A monoid is aperiodic if all its subgroups are trivial. We classify all limit varieties of aperiodic monoids with…

We introduce a new approach to an enumerative problem closely linked with the geometry of branched coverings; that is, we study the number of ways a permutation can be decomposed into a product of a given number of 2-cycles, 3-cycles, etc.…

Using the notion of multivariate lower set interpolation, we construct nodal basis functions for the serendipity family of finite elements, of any order and any dimension. For the purpose of computation, we also show how to express these…

An integral domain $D$ is called a finite factorization domain (FFD) if every nonzero nonunit element of $D$ has only finitely many non-associate divisors. In 1998, for an integral domain $D$ and a cancellative torsion-free monoid $S$ such…

We show that several monoids of non-negative integer matrices enjoy a Pisot property: each matrix in that monoid has only one eigenvalue with absolute value larger than one. These monoids come from multidimensional continued fractions,…

Using the cyclotomic identity we compute sums over d-tuples of monic polynomials in F_q[x] weighted by the multiplicity of their irreducible factors. As consequences we determine explicit expressions for the number of d-tuples of…

Solvability of the rational quantum integrable systems related to exceptional root spaces $G_2, F_4$ is re-examined and for $E_{6,7,8}$ is established in the framework of a unified approach. It is shown the Hamiltonians take algebraic form…

We provide an irreducibility test and factoring algorithm (with some qualifications) for formal power series in the unique factorization domain $R[[X]]$, where $R$ is any principal ideal domain. We also classify all integral domains arising…

The algebraic variety defined by the idempotents of an incidence monoid is investigated. Its irreducible components are determined. The intersection with an antichain submonoid is shown to be the union of these irreducible components. The…

We give a weak factorization proof of the Hardy space $H^{p}(\mathbb{R}^{n})$ in the multilinear setting, for $\frac{n}{n+1} < p <1$. As a consequence, we obtain a characterization of the boundedness of the commutator $[b,T]$ from…

In this paper we continue studying of matrix $n\times n$ linear differential intertwining operators. The problems of minimization and of reducibility of matrix intertwining operators are considered and criterions of weak minimizability and…

We study the polynomials $x^n + (1-x)^n + a^n, a \in\mathbb{Q}$, whose rational roots would yield counterexamples to Fermat's Last Theorem. We investigate their factorization over $\mathbb{Q}$. In the case $a \notin \{0, \pm 1\}$, we ask…

We establish necessary and sufficient conditions for a quadratic polynomial to be irreducible in the ring $Z[[x]]$ of formal power series with integer coefficients. For $n,m\ge 1$ and $p$ prime, we show that $p^n+p^m\beta x+\alpha x^2$ is…

Let G be a connected reductive group defined over a finite field F_q. We give a parametrization of the irreducible representations of G(F_q) in terms of (twisted) categorical centres of various monoidal categories associated to G. (Results…

The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…

Let $P$ and $Q$ be idempotents on a Hilbert space $\mathcal{H}.$ The minus order $P\preceq Q$ is defined by the equation $PQ=QP=P.$ In this note, we first present some necessary and sufficient conditions for which the supremum and infimum…

We show that the algebra of the coloured rook monoid $R_n^{(r)}$, {\em i.e.} the monoid of $n \times n$ matrices with at most one non-zero entry (an $r$-th root of unity) in each column and row, is the algebra of a finite groupoid, thus is…

We give a criterion of the semisimplicity of a p-adic unitary representation of a topological monoid by the reduction of the associated operator algebra.

A monoid presentation is called special if the right-hand side of each defining relation is equal to 1. We prove results which relate the two-sided homological finiteness properties of a monoid defined by a special presentation with those…

Let $H$ be a transfer Krull monoid over a finite ablian group $G$ (for example, rings of integers, holomorphy rings in algebraic function fields, and regular congruence monoids in these domains). Then each nonunit $a \in H$ can be written…