English
Related papers

Related papers: Enumerating submonoids of finite commutative monoi…

200 papers

A numerical monoid is an additive submonoid of the non-negative integers. Given a numerical monoid $S$, consider the family of "shifted" monoids $M_n$ obtained by adding $n$ to each generator of $S$. In this paper, we characterize the…

Commutative Algebra · Mathematics 2018-08-15 Christopher O'Neill , Roberto Pelayo

Pendry and MacKinnon meaningful discretization of Maxwell's equations was put forward specifically as part of a finite-element numerical algorithm. By contrast with a numerical approach, in the same spirit evoked by the relationships…

Optics · Physics 2023-03-14 Ovidiu-Zeno Lipan , Aldo De Sabata

Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…

General Mathematics · Mathematics 2007-05-23 W. Mueckenheim

We introduce ($\ell$-)bimonoids as ordered algebras consisting of two compatible monoidal structures on a partially ordered (lattice-ordered) set. Bimonoids form an appropriate framework for the study of a general notion of complementation,…

Logic · Mathematics 2023-02-02 Nick Galatos , Adam Přenosil

Answering a question asked by Hsia and Tucker in their paper on the finiteness of greatest common divisors of iterates of polynomials, we prove that if $f, g \in \mathbb{C}(X)$ are compositionally independent rational functions and $c \in…

Dynamical Systems · Mathematics 2026-02-03 Chatchai Noytaptim , Xiao Zhong

In our earlier article~\cite{CanSakran} we initiated a study of the complement-finite submonoids of the group of integer points of a unipotent linear algebraic group. In the present article, we continue to develop tools and techniques for…

Algebraic Geometry · Mathematics 2024-07-10 Mahir Bilen Can , Naufil Sakran

The category of Hilbert modules may be interpreted as a naive quantum field theory over a base space. Open subsets of the base space are recovered as idempotent subunits, which form a meet-semilattice in any firm braided monoidal category.…

Category Theory · Mathematics 2018-03-05 Pau Enrique Moliner , Chris Heunen , Sean Tull

Clonoids are sets of finitary functions from an algebra $\mathbb{A}$ to an algebra $\mathbb{B}$ that are closed under composition with term functions of $\mathbb{A}$ on the domain side and with term functions of $\mathbb{B}$ on the codomain…

Rings and Algebras · Mathematics 2024-04-17 Peter Mayr , Patrick Wynne

Let $\gamma_n=[x_1,\dots,x_n]$ be the $n$th lower central word. Denote by $X_n$ the set of $\gamma_n$-values in a group $G$ and suppose that there is a number $m$ such that $|g^{X_n}|\leq m$ for each $g\in G$. We prove that…

Group Theory · Mathematics 2019-07-08 Eloisa Detomi , Guram Donadze , Marta Morigi , Pavel Shumyatsky

A countable set of quantum superintegrable systems for arbitrary spin is solved explicitly using tools of supersymmetric quantum mechanics. It is shown that these systems (introduced by Pronko, J. Phys. A: Math. Theor. 40 (2007) ) include…

Mathematical Physics · Physics 2015-06-03 A. G. Nikitin

In this paper we derive new sufficient conditions for a linear system matrix $$S(\lambda):=\left[\begin{array}{ccc} T(\lambda) & -U(\lambda) \\ V(\lambda) & W(\lambda) \end{array}\right],$$ where $T(\lambda)$ is assumed regular, to be…

Dynamical Systems · Mathematics 2021-03-10 Froilán M. Dopico , María C. Quintana , Paul Van Dooren

We consider properties of the box polynomials, a one variable polynomial defined over all integer partitions $\lambda$ whose Young diagrams fit in an $m$ by $n$ box. We show that these polynomials can be expressed by the finite difference…

Combinatorics · Mathematics 2017-09-01 Richard Ehrenborg , Alex Happ , Dustin Hedmark , Cyrus Hettle

We show that every commutative idempotent monoid (a.k.a lattice) is the endomorphism monoid of a subcubic graph. This solves a problem of Babai and Pultr [J. Comb.~Theory, Ser.~B, 1980] and the degree bound is best-possible. On the other…

Combinatorics · Mathematics 2025-03-13 Kolja Knauer , Gil Puig i Surroca

We give an efficient algorithm for the enumeration up to isomorphism of the inverse semigroups of order n, and we count the number S(n) of inverse semigroups of order n<=15. This improves considerably on the previous highest-known value…

Combinatorics · Mathematics 2019-12-25 Martin E. Malandro

It came to the attention of myself and the coauthors of (S., Rozowski, Silva, Rot, 2022) that a number of process calculi can be obtained by algebraically presenting the branching structure of the transition systems they specify. Labelled…

Logic · Mathematics 2022-10-25 Todd Schmid

Monads in category theory are algebraic structures that can be used to model computational effects in programming languages. We show how the notion of "centre", and more generally "centrality", i.e. the property for an effect to commute…

Logic in Computer Science · Computer Science 2025-10-31 TItouan Carette , Louis Lemonnier , Vladimir Zamdzhiev

We establish the characterizations of commutators of several versions of maximal functions on spaces of homogeneous type. In addition, with the aid of interpolation theory, we provide weighted version of the commutator theorems by…

Functional Analysis · Mathematics 2019-07-29 Zunwei Fu , Elodie Pozzi , Qingyan Wu

Reversible weighted automata are introduced and considered in a specific setting where the weights are taken from a nontrivial locally finite commutative ring such as a finite field. It is shown that the supports of series realised by such…

Formal Languages and Automata Theory · Computer Science 2026-01-15 Peter Kostolányi , Andrej Ravinger

We study a class of overdetermined algebraic systems of equations. We prove that the number of distinct solutions equals to the maximal possible if and only if certain matrices are commuting and semisimple. This gives a characterization of…

Algebraic Geometry · Mathematics 2025-10-20 H. Hakopian , M. Tonoyan

Suppose L is any finite algebraic extension of either the ordinary rational numbers or the p-adic rational numbers. Also let g_1,...,g_k be polynomials in n variables, with coefficients in L, such that the total number of monomial terms…

Number Theory · Mathematics 2007-05-23 J. Maurice Rojas