中文
相关论文

相关论文: Infinite irredundant equational axiomatisability f…

200 篇论文

In this article it is proven the existence of integration of indefinite integrals as infinite derivative's series expansion. This also opens a new way to integrate a definite integral.

经典分析与常微分方程 · 数学 2012-10-30 Voloshyn Victor

We present a complete finite axiomatization of the unrestricted implication problem for inclusion and conditional independence atoms in the context of dependence logic. For databases, our result implies a finite axiomatization of the…

逻辑 · 数学 2013-09-23 Miika Hannula , Juha Kontinen

We prove that monoids $\mathrm{Mon}\langle a,b,c,d : a^nb=0, ac=1, db=1, dc=1, dab=1, da^2b=1, \ldots, da^{n-1}b=1\rangle$ are congruence-free for all $n\geq 1$. This provides a new countable family of finitely presented congruence-free…

群论 · 数学 2013-04-18 Alan J. Cain , Victor Maltcev , Abdullahi Umar

This work is dedicated to the results were got in the model theory of the regular polygons. We give the characterization of the monoids with axiomatizable and model complete class of regular polygons. We describe the monoids with complete…

It is proven that, in any given base, there are infinitely many palindromic numbers having at most six prime divisors, each relatively large. The work involves equidistribution estimates for the palindromes in residue classes to large…

数论 · 数学 2024-07-24 Aleksandr Tuxanidy , Daniel Panario

We present a method for proving that a semigroup is finitely based and find some new sufficient conditions under which a monoid is finitely based. As an application, we find a class of finite monoids where the finite basis property behaves…

群论 · 数学 2015-10-06 Olga Sapir

We introduce the notion of idempotent variables for studying equations in inverse monoids. It is proved that it is decidable in singly exponential time (DEXPTIME) whether a system of equations in idempotent variables over a free inverse…

计算机科学中的逻辑 · 计算机科学 2015-09-28 Volker Diekert , Florent Martin , Geraud Senizergues , Pedro V. Silva

We prove that an abstract (possibly infinite dimensional) complex irreducible representation of a discrete supersolvable group is monomial if and only if it has finite weight. We also prove a general result that implies converse of Schur's…

表示论 · 数学 2016-08-30 E. K. Narayanan , Pooja Singla

A monoid $M$ is said to be surjunctive if every injective cellular automaton with finite alphabet over $M$ is surjective. We show that monoid algebras of surjunctive monoids are stably finite. In other words, given any field $K$ and any…

环与代数 · 数学 2024-05-29 Tullio Ceccherini-Silberstein , Michel Coornaert , Xuan Kien Phung

We prove that every finite semigroup embeds in a finitely presented congruence-free monoid, and pose some questions around the Boone-Higman Conjecture.

群论 · 数学 2013-01-24 Victor Maltcev

We prove (using grammars) that the free inverse monoid of every finite rank has co-context-free word problem. Equivalently, the co-word problem of the free inverse monoid of every finite rank is context-free.

We prove that the property of an algebra to be finitely presented is Morita invariant.

环与代数 · 数学 2016-12-08 Adel Alahmadi , Hamed Alsulami

We give a complete complexity classification for the problem of finding a solution to a given system of equations over a fixed finite monoid, given that a solution over a more restricted monoid exists. As a corollary, we obtain a complexity…

计算复杂性 · 计算机科学 2025-03-04 Alberto Larrauri , Stanislav Živný

We study orbit-finite systems of linear equations, in the setting of sets with atoms. Our principal contribution is a decision procedure for solvability of such systems. The procedure works for every field (and even commutative ring) under…

计算与语言 · 计算机科学 2024-02-28 Arka Ghosh , Piotr Hofman , Sławomir Lasota

We prove that arithmetic is interpretable in any indecomposable polynomial ring (in any set of variables), and in addition we provide an alternative uniform proof of undecidability for all members in this class of rings.

逻辑 · 数学 2023-09-28 Marco Barone , Nicolás Caro-Montoya , Eudes Naziazeno

Given any polynomial $p$ in $C[X]$, we show that the set of irreducible matrices satisfying $p(A)=0$ is finite. In the specific case $p(X)=X^2-nX$, we count the number of irreducible matrices in this set and analyze the arising sequences…

组合数学 · 数学 2018-05-11 Erik Thörnblad , Jakob Zimmermann

We present a theorem about irreducibility of a polynomial that is the resultant of two others polynomials. The proof of this fact is based on the field theory. We also consider the converse theorem and some examples.

交换代数 · 数学 2018-01-18 Beata Hejmej

The purpose of this note is to study some algebraic properties of irreducible ideals of monoids. We establish relations between irreducible, prime, and semiprime ideals. We explore some properties of irreducible ideals in local, Noetherian,…

环与代数 · 数学 2024-09-17 Amartya Goswami

We present a more general proof that cyclotomic polynomials are irreducible over Q and other number fields that meet certain conditions. The proof provides a new perspective that ties together well-known results, as well as some new…

交换代数 · 数学 2022-05-11 Nicholas Phat Nguyen

We generalize the well-studied notion of a modular pair of a finite matroid to arbitrary families of sets in infinite matroids, and use it to develop the theory of infinite matroids in several as-yet-unexplored areas. Our results include a…

组合数学 · 数学 2026-04-23 Mattias Ehatamm , Peter Nelson , Fernanda Rivera Omana