English
Related papers

Related papers: Full satisfaction classes, definability, and autom…

200 papers

This paper investigates the class of finitely presented monoids defined by homogeneous (length-preserving) relations from a computational perspective. The properties of admitting a finite complete rewriting system, having finite derivation…

Group Theory · Mathematics 2017-05-16 Alan J. Cain , Robert Gray , António Malheiro

The idea of this paper is to explore the existence of canonical countably saturated models for different classes of structures. It is well-known that, under CH, there exists a unique countably saturated linear order of cardinality…

Logic · Mathematics 2020-04-17 Ziemowit Kostana

The back-and-forth relations $M\leq_\alpha N$ are central to computable structure theory and countable model theory. It is well-known that the relation $\{(M,N) : M \leq_\alpha N\}$ is (lightface) $\Pi^0_{2\alpha}$. We show that this is…

Logic · Mathematics 2025-12-08 Ruiyuan Chen , David Gonzalez , Matthew Harrison-Trainor

Given an extended real-valued submeasure $\nu$ defined on a field of subsets $\Sigma$ of a given set, we provide necessary and sufficient conditions for which the pseudometric $d_\nu$ defined by $d_{\nu}(A,B):=\min\{1,\nu(A\bigtriangleup…

Functional Analysis · Mathematics 2026-03-24 Jonathan M. Keith , Paolo Leonetti

Let $S$ be a semigroup (written multiplicatively). Endowed with the operation of setwise multiplication induced by $S$ on its parts, the non-empty subsets of $S$ form themselves a semigroup, denoted by $\mathcal P(S)$. Accordingly, we say…

Rings and Algebras · Mathematics 2025-10-02 Lingxi Li , Salvatore Tringali

We prove a necessary and sufficient condition for the graded algebra of automorphic forms on a symmetric domain of type IV to be free. From the necessary condition, we derive a classification result. Let $M$ be an even lattice of signature…

Number Theory · Mathematics 2023-06-22 Haowu Wang

Given a closed smooth manifold $M$ of even dimension $2n\ge6$ with finite fundamental group, we show that the classifying space ${\rm BDiff}(M)$ of the diffeomorphism group of $M$ is of finite type and has finitely generated homotopy groups…

Algebraic Topology · Mathematics 2023-02-20 Mauricio Bustamante , Manuel Krannich , Alexander Kupers

The distinguishing result of this paper is a $\mathbf{P}$-time enumerable partition of all the potential perfect matchings in a bipartite graph. This partition is a set of equivalence classes induced by the missing edges in the potential…

Computational Complexity · Computer Science 2017-10-31 Javaid Aslam

Let $\mathbb C$ be the set of complex numbers, and let $\mathcal P$ be a collection of complex polynomial maps in several variables. Assuming at least one $P\in\mathcal P$ depends on at least two variables, we classify all possibilities for…

Logic · Mathematics 2023-08-04 Benjamin Castle , Chieu-Minh Tran

We answer an implicit question of Ian Hodkinson's. We show that atomic Pinters algebras may not be completely representable, however the class of completely representable Pinters algebras is elementary and finitely axiomatizable. We obtain…

K-Theory and Homology · Mathematics 2013-04-03 Tarek Sayed Ahmed

We show that if $M$ is a full factor and $N \subset M$ is a co-amenable subfactor with expectation, then $N$ is also full. This answers a question of Popa from 1986. We also generalize a theorem of Tomatsu by showing that if $M$ is a full…

Operator Algebras · Mathematics 2020-08-26 Jon Bannon , Amine Marrakchi , Narutaka Ozawa

We investigate the class of models of a general dependent theory. We continue math.LO/0702292 in particular investigating so called "decomposition of types"; thesis is that what holds for stable theory and for Th(Q,<) hold for dependent…

Logic · Mathematics 2012-02-28 Saharon Shelah

We give sufficient conditions for when groups generated by automata in a class $\mathcal{C}$ of transducers, which contains the class of reset automata transducers, have infinite order. As a consequence we also demonstrate that if a group…

Group Theory · Mathematics 2020-04-01 Feyishayo Olukoya

Let $A\subset B$ be an extension of commutative reduced rings and $M\subset N$ an extension of positive commutative cancellative torsion-free monoids. We prove that $A$ is subintegrally closed in $B$ and $M$ is subintegrally closed in $N$…

Commutative Algebra · Mathematics 2015-05-21 Husney Parvez Sarwar

When a non-singular complex projective surface $X$ satisfies that $K_X\sim 0$, we shall show that there are only finitely many isomorphic classes as abstract schemes in the set of moduli scheme of $H$-semistable sheaves with fixed Chern…

Algebraic Geometry · Mathematics 2010-01-18 Kimiko Yamada

In this paper, we prove that for every $\rho\in \mathbb{U}_{\infty}$, the space of weighted pseudo almost automorphic functions is complete under the supremum norm. This gives an affirmative answer to a key and fundamental problem for…

Functional Analysis · Mathematics 2015-04-13 Zhe-Ming Zheng , Hui-Sheng Ding

It is known that every finite group can be represented as the full group of automorphisms of a suitable compact dessin d'enfant. In this paper, we give a constructive and easy proof that the same holds for any countable group by considering…

Group Theory · Mathematics 2022-06-09 Alejandro Cañas , Ruben A. Hidalgo , Francisco Javier Turiel , Antonio Viruel

Let $X$ and $Y$ be finite complexes. When $Y$ is a nilpotent space, it has a rationalization $Y \to Y_{(0)}$ which is well-understood. Early on it was found that the induced map $[X,Y] \to [X,Y_{(0)}]$ on sets of mapping classes is…

Algebraic Topology · Mathematics 2020-12-16 Fedor Manin , Shmuel Weinberger

We construct a perfect version of Morel--Voevodsky's motivic homotopy category over a perfect base scheme in positive characteristic. By checking the axioms of a coefficient system, we establish a six-functor formalism. We show that…

Algebraic Geometry · Mathematics 2025-10-03 Christian Dahlhausen , Jeroen Hekking , Storm Wolters

Maslov's class $\overline{\text{K}}$ is an expressive fragment of First-Order Logic known to have decidable satisfiability problem, whose exact complexity, however, has not been established so far. We show that $\overline{\text{K}}$ has the…

Logic in Computer Science · Computer Science 2024-07-19 Oskar Fiuk , Emanuel Kieronski , Vincent Michielini
‹ Prev 1 4 5 6 7 8 10 Next ›