English
Related papers

Related papers: The Join Levels of the Trotter-Weil Hierarchy are …

200 papers

Jackson and Lee proved that certain six-element monoid generates a hereditarily finitely based variety $\mathbb E^1$ whose lattice of subvarieties contains an infinite ascending chain. We identify syntactic monoids which generate finitely…

Group Theory · Mathematics 2023-06-19 Olga B. Sapir

A limit variety is a variety that is minimal with respect to being non-finitely based. We present a new limit variety of aperiodic monoid. We also show that if there exists any other limit variety of aperiodic monoids, then it is contained…

Group Theory · Mathematics 2026-04-01 Sergey V. Gusev , Olga B. Sapir

Let $X$ be a complete intersection inside a variety $M$ with finite dimensional motive and for which the Lefschetz-type conjecture $B(M)$ holds. We show how conditions on the niveau filtration on the homology of $X$ influence directly the…

Algebraic Geometry · Mathematics 2017-10-02 Robert Laterveer , Jan Nagel , Chris Peters

It is shown that order-invariance of two-variable first-logic is decidable in the finite. This is an immediate consequence of a decision procedure obtained for the finite satisfiability problem for existential second-order logic with two…

Logic in Computer Science · Computer Science 2016-04-21 Thomas Zeume , Frederik Harwath

This paper addresses the problem of constructing a cycle-level intersection theory for toric varieties. We show that by making one global choice, we can determine a cycle representative for the intersection of an equivariant Cartier divisor…

Algebraic Geometry · Mathematics 2007-05-23 Hugh Thomas

In 1950, B.A. Trakhtenbrot showed that the set of first-order tautologies associated to finite models is not recursively enumerable. In 1999, P. H\'ajek generalized this result to the first-order versions of \L ukasiewicz, G\"odel and…

Logic · Mathematics 2014-07-10 Matteo Bianchi

In this paper we show that membership in finitely generated submonoids is undecidable for the free metabelian group of rank 2 and for the wreath product $\mathbb Z\wr (\mathbb Z\times \mathbb Z)$. We also show that subsemimodule membership…

Group Theory · Mathematics 2009-03-05 Markus Lohrey , Benjamin Steinberg

The Hecke algebras for all symmetric groups taken together form a braided monoidal category that controls all quantum link invariants of type A and, by extension, the standard canon of topological quantum field theories in dimension 3 and…

Quantum Algebra · Mathematics 2024-02-07 Yu Leon Liu , Aaron Mazel-Gee , David Reutter , Catharina Stroppel , Paul Wedrich

Let $\cal A$ be a maximal (or more generally a hereditary) order in a central simple algebra over a global field $F$ of positive characteristic. We study the reduction of the modular scheme of $\cal A$-elliptic sheaves at all places of $F$.…

Algebraic Geometry · Mathematics 2007-05-23 Michael Spiess

In this article we study a theory of support varieties over a skew complete intersection $R$, i.e. a skew polynomial ring modulo an ideal generated by a sequence of regular normal elements. We compute the derived braided Hochschild…

Rings and Algebras · Mathematics 2021-02-01 Luigi Ferraro , W. Frank Moore , Josh Pollitz

We show that descriptive complexity's result extends in High Order Logic to capture the expressivity of Turing Machine which have a finite number of alternation and whose time or space is bounded by a finite tower of exponential. Hence we…

Logic in Computer Science · Computer Science 2014-07-16 Arthur Milchior

Transition metal dichalcogenide homobilayers unite two frontiers of quantum materials research: sliding ferroelectricity, arising from rhombohedral (R) stacking, and moir\'e quantum matter, emerging from small-angle twisting. The…

We give in this paper a survey of results obtained in our earlier papers, and state explicitly some problems of further research, for example: are the analytic ranks bounded, or not? Twists of Carlitz modules are parametrized by polynomials…

Number Theory · Mathematics 2025-09-22 A. Grishkov , D. Logachev

A conjecture in algorithmic model theory predicts that the model-checking problem for first-order logic is fixed-parameter tractable on a hereditary graph class if and only if the class is monadically dependent. Originating in model theory,…

Combinatorics · Mathematics 2024-03-28 Jan Dreier , Nikolas Mählmann , Szymon Toruńczyk

We show that equivalence of deterministic top-down tree-to-string transducers is decidable, thus solving a long standing open problem in formal language theory. We also present efficient algorithms for subclasses: polynomial time for total…

Formal Languages and Automata Theory · Computer Science 2017-01-30 Helmut Seidl , Sebastian Maneth , Gregor Kemper

In this paper, we propose a conjectural formula for the order of the poles of intertwining operators in the context of the representation theory of general linear groups over $p$-adic fields. More specifically, we conjecturally relate the…

Representation Theory · Mathematics 2025-08-20 Johannes Droschl

Consider a linear ordering equipped with a finite sequence of monadic predicates. If the ordering contains an interval of order type \omega or -\omega, and the monadic second-order theory of the combined structure is decidable, there exists…

Logic in Computer Science · Computer Science 2015-07-01 Alexis Bes , Alexander Rabinovich

A twisting of a monoid $S$ is a map $\Phi:S\times S\to\mathbb{N}$ satisfying the identity $\Phi(a,b) + \Phi(ab,c) = \Phi(a,bc) + \Phi(b,c)$. Together with an additive commutative monoid $M$, and a fixed $q\in M$, this gives rise a so-called…

Group Theory · Mathematics 2025-10-24 James East , Robert D. Gray , P. A. Azeef Muhammed , Nik Ruškuc

In this short note, we classify linear categorified open topological field theories in dimension two by pivotal Grothendieck-Verdier categories, a type of monoidal category equipped with a weak, not necessarily rigid duality. In combination…

Quantum Algebra · Mathematics 2025-08-01 Lukas Müller , Lukas Woike

We propose a generic framework for establishing the decidability of a wide range of logical entailment problems (briefly called querying), based on the existence of countermodels that are structurally simple, gauged by certain types of…

Logic in Computer Science · Computer Science 2025-04-30 Thomas Feller , Tim S. Lyon , Piotr Ostropolski-Nalewaja , Sebastian Rudolph