中文
相关论文

相关论文: Computable Scott Sentences for Quasi-Hopfian Finit…

200 篇论文

Finite topological spaces are in bijective correspondence with preorders on finite sets. We undertake their study using combinatorial tools that have been developed to investigate general discrete structures. A particular emphasis will be…

代数拓扑 · 数学 2015-09-04 Loïc Foissy , Claudia Malvenuto , Frédéric Patras

We study the non-semisimple terms in the geometric side of the Arthur trace formula for the split symplectic similitude group or the split symplectic group of rank 2 over any algebraic number field. In particular, we show that the…

数论 · 数学 2013-10-03 Werner Hoffmann , Satoshi Wakatsuki

This paper is about the recent notion of computably probably approximately correct learning, which lies between the statistical learning theory where there is no computational requirement on the learner and efficient PAC where the learner…

机器学习 · 计算机科学 2024-07-31 Matthew Harrison-Trainor , Syed Akbari

We prove that the ordered configuration space of 4 or more points in the plane has a non-formal singular cochain algebra in characteristic two. This is proved by constructing an explicit non trivial obstruction class in the Hochschild…

代数拓扑 · 数学 2017-10-26 Paolo Salvatore

It is shown that every $2$-shifted Poisson structure on a finitely generated semi-free commutative differential graded algebra $A$ defines a very explicit infinitesimal $2$-braiding on the homotopy $2$-category of the symmetric monoidal…

量子代数 · 数学 2025-03-19 Cameron Kemp , Robert Laugwitz , Alexander Schenkel

A deductive system is structurally complete if its admissible inference rules are derivable. For several important systems, like modal logic S5, failure of structural completeness is caused only by the underivability of passive rules, i.e.…

逻辑 · 数学 2014-08-26 Wojciech Dzik , Michal M. Stronkowski

We prove an accessibility theorem for finite-index splittings of groups. Given a finitely presented group G there is a number n(G) such that, for every reduced locally finite G-tree T with finitely generated stabilizers, T/G has at most…

群论 · 数学 2024-04-17 Max Forester , Anthony Martino

Let $\Gamma$ be a countable abelian group. An (abstract) $\Gamma$-system $\mathrm{X}$ - that is, an (abstract) probability space equipped with an (abstract) probability-preserving action of $\Gamma$ - is said to be a Conze-Lesigne system if…

动力系统 · 数学 2024-02-20 Asgar Jamneshan , Or Shalom , Terence Tao

Let H_T=C[T,T^{-1}] be the Hopf algebra of symmetries of a lattice of rank 1, or equivalently, H_T is the group algebra of a free Abelian group with one generator T. We construct conformal algebras, vertex Poisson algebras and vertex…

量子代数 · 数学 2007-05-23 Maarten Bergvelt

Given a separated and locally finitely-presented Deligne-Mumford stack $\cX$ over an algebraic space $S$, and a locally finitely-presented $\OO_{\cX}$-module $\cF$, we prove that the Quot functor $\text{Quot}(\cF/\cX/S)$ is represented by a…

代数几何 · 数学 2008-09-18 Martin Olsson , Jason Starr

The Kochen-Specker theorem states that a 3-dimensional complex Euclidean space admits a finite configuration of projective lines such that the corresponding quantum observables (the orthogonal projectors) cannot be assigned with 0 and 1…

量子物理 · 物理学 2015-05-13 Artur Ruuge

We study the computational and structural aspects of countable two-dimensional SFTs and other subshifts. Our main focus is on the topological derivatives and subpattern posets of these objects, and our main results are constructions of…

计算复杂性 · 计算机科学 2012-08-15 Ville Salo , Ilkka Törmä

Under a mild condition, we prove that the action of the group of self-quasi-isogenies on the set of irreducible components of a Rapoport-Zink space has finite orbits. Our method allows both ramified and non-basic cases. As a consequence, we…

代数几何 · 数学 2018-04-18 Yoichi Mieda

We exhibit a sound and complete implicit-complexity formalism for functions feasibly computable by structural recursions over inductively defined data structures. Feasibly computable here means that the structural-recursive definition runs…

计算复杂性 · 计算机科学 2022-05-23 Norman Danner , James S. Royer

Quantified propositional intuitionistic logic is obtained from propositional intuitionistic logic by adding quantifiers \forall p, \exists p over propositions. In the context of Kripke semantics, a proposition is a subset of the worlds in a…

逻辑 · 数学 2015-04-21 Richard Zach

ASD (Abstract Stone Duality) is a re-axiomatisation of general topology in which the topology on a space is treated, not as an infinitary lattice, but as an exponential object of the same category as the original space, with an associated…

一般拓扑 · 数学 2019-03-14 Paul Taylor

In this paper, we consider an equivalence relation within the class of finitely presented discrete groups attending to their asymptotic topology rather than their asymptotic geometry. More precisely, we say that two finitely presented…

几何拓扑 · 数学 2020-02-05 M. Cárdenas , F. F. Lasheras , A. Quintero , R. Roy

In this paper we give a self-contained treatment of finite group quotients of admissible (formal) schemes and adic spaces that are locally topologically finite type over a locally strongly noetherian adic space.

代数几何 · 数学 2024-02-21 Bogdan Zavyalov

We introduce a non-wellfounded proof system for intuitionistic logic extended with inductive and co-inductive definitions, based on a syntax in which fixpoint formulas are annotated with explicit variables for ordinals. We explore the…

计算机科学中的逻辑 · 计算机科学 2026-05-13 Sebastian Enqvist

We define constructive truth for arithmetic and for intuitionistic analysis, and investigate its properties. We also prove that the set of constructively true (first order) arithmetical statements is Pi-1-2 and Sigma-1-2 hard, and we…

逻辑 · 数学 2007-05-23 Dmytro Taranovsky