English
Related papers

Related papers: Bases for pseudovarieties closed under bidetermini…

200 papers

The category of all idempotent generated semigroups with a prescribed structure $\mathcal{E}$ of their idempotents $E$ (called the biordered set) has an initial object called the free idempotent generated semigroup over $\mathcal{E}$,…

Group Theory · Mathematics 2017-12-14 Igor Dolinka , Robert D. Gray , Nik Ruškuc

In this work one proves that, around each point of a dense open set (regular points), a real analytic or holomorphic bihamiltonian structure decomposes into a product of a Kronecker bihamiltonian structure and a symplectic one if a…

Symplectic Geometry · Mathematics 2011-07-13 Francisco-Javier Turiel

We study the automorphism group of the algebraic closure of a substructure A of a pseudo-finite field F. We show that the behavior of this group, even when A is large, depends essentially on the roots of unity in F. For almost all…

Logic · Mathematics 2012-01-16 Özlem Beyarslan , Ehud Hrushovski

Let $G$ be the fundamental group of a graph of finitely generated virtually free groups with virtually cyclic edge groups. We shaw that $G$ is cohomologically good if $G$ is residually finite. If $G$ is LERF, we prove that G splits…

Group Theory · Mathematics 2026-03-18 Andrei Jaikin-Zapirain , Henrique Souza , Pavel Zalesski

The left regular band structure on a hyperplane arrangement and its representation theory provide an important connection between semigroup theory and algebraic combinatorics. A finite semigroup embeds in a real hyperplane face monoid if…

Group Theory · Mathematics 2013-01-01 Stuart Margolis , Franco Saliola , Benjamin Steinberg

Implicational bases are a well-known representation of closure spaces and their closure lattices. This representation is not unique, though, and a closure space usually admits multiple bases. Among these, the canonical base, the canonical…

Combinatorics · Mathematics 2025-09-03 Kira Adaricheva , Simon Vilmin

We prove that in every finitely generated profinite group, every subgroup of finite index is open; this implies that the topology on such groups is determined by the algebraic structure. This is deduced from the main result about finite…

Group Theory · Mathematics 2007-05-23 Nikolay Nikolov , Dan Segal

The main theorem shows that if M is an irreducible compact connected orientable 3-manifold with non-empty boundary, then the classifying space BDiff(M rel dM) of the space of diffeomorphisms of M which restrict to the identity map on…

Geometric Topology · Mathematics 2014-11-11 Allen Hatcher , Darryl McCullough

We show that for any $i > 0$, it is decidable, given a regular language, whether it is expressible in the $\Sigma_i[<]$ fragment of first-order logic FO[<]. This settles a question open since 1971. Our main technical result relies on the…

Formal Languages and Automata Theory · Computer Science 2025-02-03 Corentin Barloy , Michaël Cadilhac , Charles Paperman , Howard Straubing

If V is a finitely generated variety such that the first-order theory of the finite members of V is decidable, we show that V is residually finite, and in fact has a finite bound on the sizes of subdirectly irreducible algebras. This result…

Logic · Mathematics 2013-11-13 Ralph McKenzie , Matthew Smedberg

A specialization semilattice is a semilattice together with a coarser preorder satisfying a compatibility condition. We show that the category of specialization semilattices is isomorphic to the category of semilattices with a congruence,…

Rings and Algebras · Mathematics 2025-07-14 Paolo Lipparini

We consider the following practical question: given a finite algebra A in a finite language, can we efficiently decide whether the variety generated by A has a difference term? We answer this question (positively) in the idempotent case and…

Logic · Mathematics 2021-01-08 William DeMeo , Ralph Freese , Matthew Valeriote

We establish an Eilenberg-type correspondence for data languages, i.e. languages over an infinite alphabet. More precisely, we prove that there is a bijective correspondence between varieties of languages recognized by orbit-finite nominal…

Formal Languages and Automata Theory · Computer Science 2019-05-02 Henning Urbat , Stefan Milius

We show that V(A(T)) does not have definable principal subcongruences or bounded Maltsev depth. When the Turing machine T halts, V(A(T)) is an example of a finitely generated semilattice based (and hence congruence meet-semidistributive)…

Rings and Algebras · Mathematics 2019-06-07 Matthew Moore

The present paper is a continuation of \cite{jrz} and is devoted to the study of limit varieties of additively idempotent semirings. A limit variety is a nonfinitely based variety whose proper subvarieties are all finitely based. We present…

Group Theory · Mathematics 2022-08-31 Miaomiao Ren , Marcel Jackson , Xianzhong Zhao , Donglin Lei

Let $\mathbf{A}$ be a finite algebra generating a finitely decidable variety and having nontrivial strongly solvable radical $\tau$. We provide an improved bound on the number of variables in which a term can be sensitive to changes within…

Logic · Mathematics 2013-11-13 Matthew Smedberg

Let $\mathcal C$ be the category of finite graphs. Lov\`{a}sz shows that the semi-ring of isomorphism classes of $\mathcal C$ (with coproduct as sum, and product as multiplication) is embedded into the direct product of the semi-ring of…

Category Theory · Mathematics 2022-07-14 Shoma Fujino , Makoto Matsumoto

Let $G$ be a residually finite, good group of finite virtual cohomological dimension. We prove that the natural monomorphism $G\hookrightarrow\hat{G}$ induces a bijective correspondence between conjugacy classes of finite $p$-subgroups of…

Group Theory · Mathematics 2024-10-29 Marco Boggi , Pavel Zalesskii

We characterize the languages in the individual levels of the quantifier alternation hierarchy of first-order logic with two variables by identities. This implies decidability of the individual levels. More generally we show that the…

Logic in Computer Science · Computer Science 2012-05-23 Andreas Krebs , Howard Straubing

A specialization semilattice is a structure which can be embedded into $(\mathcal P(X), \cup, \sqsubseteq )$, where $X$ is a topological space, $ x \sqsubseteq y$ means $x \subseteq Ky$, for $x,y \subseteq X$, and $K$ is closure in $X$.…

Rings and Algebras · Mathematics 2023-09-26 Paolo Lipparini
‹ Prev 1 3 4 5 6 7 10 Next ›